2021년 2월 17일 (수) 08:46에 Pythagoras0님의 편집

2021-02-17T08:46:31Z

Pythagoras0: /* 메타데이터 */ 새 문단

2020-12-26T13:03:14Z

메타데이터: 새 문단

Pythagoras0: /* 노트 */ 새 문단

2020-12-16T16:52:29Z

노트: 새 문단

새 문서

== 노트 ==

* However, if there is a data structure that isn’t available natively but heavily used in different implementation is the queue.<ref name="ref_5ff0">[https://benoitpasquier.com/data-structure-implement-queue-swift/ Data Structure - How to implement a Queue in Swift]</ref>
* A Queue is renown data structure in computer science to execute operation in a linear order.<ref name="ref_5ff0" />
* The first inserted element would be the first treated, therefor the first one to be removed from the queue.<ref name="ref_5ff0" />
* In Swift, a Queue would be represented as a wrapper around an array.<ref name="ref_5ff0" />
* Linear list of elements in which deletion is done at front side and insertion at rear side is called Queue.<ref name="ref_47b3">[https://www.sanfoundry.com/data-structure-questions-answers-queue-operations/ Queues Questions and Answers]</ref>
* Queue follows FIFO approach.<ref name="ref_47b3" />
* In queue, we will follow first in first out principle for insertion and deletion of elements.<ref name="ref_47b3" />
* When Rear = MAX_SIZE – 1, there will be no space left for the elements to be added in queue.<ref name="ref_47b3" />
* This means in the queue, one end (REAR) is always used to enqueue and the other end (FRONT) is used to dequeue.<ref name="ref_64b5">[https://www.educba.com/queue-in-data-structure/ Queue in Data Structure]</ref>
* The queue can be created using below 2 data structures.<ref name="ref_64b5" />
* Sometimes the number of elements in the queue is not specified in the start thus a linked list is used to represent a queue of elements.<ref name="ref_64b5" />
* Insertion in a queue occurs at the REAR end of the queue.<ref name="ref_64b5" />
* In the world of algorithms you won’t make it far without a clear understanding of how the queue data structure works.<ref name="ref_52bf">[https://www.crondose.com/2016/09/understanding-queue-data-structure/ Understanding the Queue Data Structure – a Guide for Developers]</ref>
* Even though a number of languages, including Ruby and Scala, have a Queue class, typically queues are considered abstract data structures.<ref name="ref_52bf" />
* Running the program returns Springer because he was the first one we added to the batting_order queue.<ref name="ref_52bf" />
* We can use the same functions to implement a Queue.<ref name="ref_a968">[https://stackabuse.com/stacks-and-queues-in-python/ Stacks and Queues in Python]</ref>
* Stacks and queues are simple data structures that allow us to store and retrieve data sequentially.<ref name="ref_a968" />
* In Python, we can implement stacks and queues just by using the built-in List data structure.<ref name="ref_a968" />
* Python also has the deque library which can efficiently provide stack and queue operations in one object.<ref name="ref_a968" />
* A queue is a collection of objects that supports fast first-in, first-out (FIFO) semantics for inserts and deletes.<ref name="ref_0d68">[https://dbader.org/blog/queues-in-python Queues in Python – dbader.org]</ref>
* New additions to the line are made to the back of the queue as new people enter the conference venue and “queue up” to receive their badges.<ref name="ref_0d68" />
* While the items are in the queue, a solid metal pipe, you can’t get at them.<ref name="ref_0d68" />
* Performance-wise, a proper queue implementation is expected to take O(1) time for insert and delete operations.<ref name="ref_0d68" />
* Queue is also known as first in first out (FIFO) data structure.<ref name="ref_a8e6">[https://www.ques10.com/p/34997/what-are-different-types-of-queues/ What are different types of queues?]</ref>
* In a normal Queue, we can insert elements until queue becomes full.<ref name="ref_a8e6" />
* But once queue becomes full, we cannot insert the next element even if there is a space in front of queue.<ref name="ref_a8e6" />
* Enqueue means inserting an element in the queue.<ref name="ref_50f8">[https://afteracademy.com/blog/queue-and-its-basic-operations Queue and its basic operations]</ref>
* In a normal queue at a ticket counter, where does a new person go and stand to become a part of the queue?<ref name="ref_50f8" />
* Dequeue means removing an element from the queue.<ref name="ref_50f8" />
* Since queue follows the FIFO principle we need to remove the element of the queue which was inserted at first.<ref name="ref_50f8" />
* The queue data structure ensures that you come out in the order in which you joined the line/queue.<ref name="ref_411c">[https://www.thecodingdelight.com/queue-data-structure-array-implementation/ Introduction to the Queue Data Structure – Array Implementation]</ref>
* FIFO just means that the items are popped off the queue in the order that it goes in.<ref name="ref_411c" />
* Conversely, the latest element that was added to the queue is the last element to leave the queue.<ref name="ref_411c" />
* Items in the queue are dequeued in the order that they enter the queue.<ref name="ref_411c" />
* queues provides a number of efficient FIFO Queue data structures for usage in your libraries.<ref name="ref_0108">[https://docs.rs/queues/1.0.1 queues]</ref>
* add : Also called queue or push , this adds elements to the queue.<ref name="ref_0108" />
* , this removes the oldest element from the queue.<ref name="ref_0108" />
* is the maximum number of elements expected in the queue.<ref name="ref_d985">[https://www.edureka.co/blog/queue-data-structure-in-python/ What is Queue Data Structure In Python?]</ref>
* As of now, you have already understood the basics of queue.<ref name="ref_d985" />
* Print Queue in Windows uses a queue to store all the active and pending print jobs.<ref name="ref_d985" />
* Based on the print commands, the documents will get lined up in the print queue.<ref name="ref_d985" />
* To understand a queue, think of a cafeteria line: the person at the front is served first, and people are added to the line at the back.<ref name="ref_8d7e">[https://www.cprogramming.com/tutorial/computersciencetheory/queue.html Cprogramming.com]</ref>
* Although the concept may be simple, programming a queue is not as simple as programming a stack.<ref name="ref_8d7e" />
* There are a couple of basic ways to implement a queue.<ref name="ref_8d7e" />
* Queue is a linear data structure in which the insertion and deletion operations are performed at two different ends.<ref name="ref_b892">[http://www.btechsmartclass.com/data_structures/queue-adt.html Data Structures Tutorials]</ref>
* Queue data structure can be implemented in two ways.<ref name="ref_b892" />
* When a queue is implemented using an array, that queue can organize an only limited number of elements.<ref name="ref_b892" />
* When a queue is implemented using a linked list, that queue can organize an unlimited number of elements.<ref name="ref_b892" />
* The string can be considered as a queue.<ref name="ref_5b76">[https://www.hackerearth.com/practice/data-structures/queues/basics-of-queues/tutorial/ Basics of Queues Tutorials & Notes]</ref>
* In a standard queue, a character is inserted at the back and deleted in the front.<ref name="ref_5b76" />
* In a standard queue, when an element is deleted, the vacant space is not reutilized.<ref name="ref_5b76" />
* The name queue comes from the analogy to a queue of customers at a bank.<ref name="ref_3801">[https://www.javascripttutorial.net/javascript-queue/ JavaScript Queue: How to Implement a Queue Using a JavaScript Array]</ref>
* The enqueue() method adds an element at the end of the queue.<ref name="ref_3801" />
* The dequeue() method removes an element from the front of the queue.<ref name="ref_3801" />
* A Double Ended Queue lets you add and remove elements at both ends of the queue.<ref name="ref_00d8">[https://www.journaldev.com/21355/swift-queue-data-structure Swift Queue Data Structure Implementation]</ref>
* The most recently added item in the queue must wait at the end of the collection.<ref name="ref_58da">[https://bradfieldcs.com/algos/queues/introduction/ Introduction to Queues]</ref>
* The simplest example of a queue is the typical line that we all participate in from time to time.<ref name="ref_58da" />
* Well-behaved lines, or queues, are very restrictive in that they have only one way in and only one way out.<ref name="ref_58da" />
* Operating systems also use a number of different queues to control processes within a computer.<ref name="ref_58da" />
* Queue is an important structure for storing and retrieving data and hence is used extensively among all the data structures.<ref name="ref_a746">[https://www.thecrazyprogrammer.com/2019/01/types-of-queues-in-data-structure.html Types of Queues in Data Structure]</ref>
* As is clear from the name itself, simple queue lets us perform the operations simply.<ref name="ref_a746" />
* The most well-known operations of queues: FIFO.<ref name="ref_f92b">[https://www.cpp.edu/~ftang/courses/CS240/lectures/queue.htm CS240: Data Structures & Algorithms I]</ref>
* There are also non-FIFO queue data structures, like a priority queue, where an element is added or removed based on its priority.<ref name="ref_f92b" />
* In operating systems, queues can be used in many places to handle multiple jobs.<ref name="ref_f92b" />
* A queue follows FIFO (First-in, First out) policy.<ref name="ref_e506">[https://www.codesdope.com/course/data-structures-queue/ Queue Data Structure Using Array and Linked List]</ref>
* Similar to the stack, we will implement the queue using a linked list as well as with an array.<ref name="ref_e506" />
* Enqueue → Enqueue is an operation which adds an element to the queue.<ref name="ref_e506" />
* We will maintain two pointers - tail and head to represent a queue.<ref name="ref_e506" />
* The most common data structure for implementing queues are cyclic dynamic arrays and singly linked lists.<ref name="ref_86b7">[https://ece.uwaterloo.ca/~dwharder/aads/Abstract_data_types/Linear_ordering/Queue/ Abstract Queue / Queue ADT]</ref>
* Queue data structures consist of ordered elements of the same data type.<ref name="ref_a446">[https://dev.to/kauresss/queue-data-structure-in-c-and-operations-256n Queue data structure in C++ and operations]</ref>
* Now let's add an element into the array implementation of a queue, i.e. enqueue/push/insert an element into index 0 of an array.<ref name="ref_a446" />
* In the 2nd method, the element is removed from the front/head of the queue as required.<ref name="ref_a446" />
* Because of moving the head one position forward, the length of the queue reduces by 1.<ref name="ref_a446" />
* In this article, we’ll learn four types of queues with their applications.<ref name="ref_6039">[https://www.baeldung.com/cs/types-of-queues Types of Queues]</ref>
* In this queue, the last node points to the first node and creates a circular connection.<ref name="ref_6039" />
* A priority queue is a special kind of queue in which each item has a predefined priority of service.<ref name="ref_6039" />
* In this queue, the enqueue and dequeue operations take place at both front and rear.<ref name="ref_6039" />
* The queue is a linear data structure used to represent a linear list.<ref name="ref_5ecc">[https://www.w3schools.in/data-structures-tutorial/queue/ Concepts of Queue in Data Structure]</ref>
* The term front and rear are frequently used while describing queues in a linked list.<ref name="ref_5ecc" />
* In the concept of a queue, the first element to be inserted in the queue will be the first element to be deleted or removed from the list.<ref name="ref_5ecc" />
* So Queue is said to follow the FIFO (First In First Out) structure.<ref name="ref_5ecc" />
* In contrast to stack that uses the LIFO approach, queue uses the FIFO (first in, first out) approach.<ref name="ref_2904">[https://www.softwaretestinghelp.com/queue-in-cpp/ Queue Data Structure In C++ With Illustration]</ref>
* With this approach, the first item that is added to the queue is the first item to be removed from the queue.<ref name="ref_2904" />
* In a real-world analogy, we can imagine a bus queue where the passengers wait for the bus in a queue or a line.<ref name="ref_2904" />
* In software terms, the queue can be viewed as a set or collection of elements as shown below.<ref name="ref_2904" />
* A queue supports the insert and remove operations using a first-in first-out (FIFO) discipline.<ref name="ref_cd29">[https://introcs.cs.princeton.edu/java/43stack/ Stacks and Queues]</ref>
* Linked-list implementation of a queue.<ref name="ref_cd29" />
* Queue.java implements a FIFO queue of strings using a linked list.<ref name="ref_cd29" />
* Like Stack , we maintain a reference first to the least-recently added Node on the queue.<ref name="ref_cd29" />
* A queue is a first-in first-out (FIFO) abstract data type that is heavily used in computing.<ref name="ref_9751">[https://en.wikibooks.org/wiki/A-level_Computing/AQA/Paper_1/Fundamentals_of_data_structures/Queues Programming Concepts: Queues]</ref>
* In this queue form, elements are able to join the queue at one end and can exit from the queue at the other end.<ref name="ref_9751" />
* The first person into the queue is the first person to be served.<ref name="ref_9751" />
* The most basic implementation of a linear queue would work its way through its allotted memory, without reusing memory.<ref name="ref_9751" />
* The Queue and Stack are similar but they follow different principles when comes to the how the inserts and removes are manipulated.<ref name="ref_799d">[https://medium.com/@lucasmagnum/sidenotes-queue-abstract-data-type-and-data-structure-f634f3be9e85 #SideNotes — Queue — Abstract Data Type and Data Structure]</ref>
* The Queue is a known principle in our daily lives when we go shopping we need to be in a queue to the cashier.<ref name="ref_799d" />
* Priority queues are a kind of abstract data type that generalizes the queue.<ref name="ref_799d" />
* Their principles are exactly the same except that they also include a priority for every value in the queue.<ref name="ref_799d" />
* Queues are pretty much what their name implies: think of queues as a line of people.<ref name="ref_d3f3">[https://medium.com/@angeloacebedo/data-structures-stacks-and-queues-7cc8790b9ce8 Abstract Data Types: Stacks and Queues]</ref>
* The 2 most important functions in a queue are dequeue() and enqueue().<ref name="ref_d3f3" />
* The function dequeue() removes the first element of a queue, and enqueue() “pushes” an element to the end of the queue.<ref name="ref_d3f3" />
* A common implementation of a queue is with Doubly Linked Lists, so we will use that data structure to analyze the handling of pointers.<ref name="ref_d3f3" />
* A real-world example of queue can be a single-lane one-way road, where the vehicle enters first, exits first.<ref name="ref_cea9">[https://www.tutorialspoint.com/data_structures_algorithms/dsa_queue.htm Data Structure and Algorithms]</ref>
* As we now understand that in queue, we access both ends for different reasons.<ref name="ref_cea9" />
* As in stacks, a queue can also be implemented using Arrays, Linked-lists, Pointers and Structures.<ref name="ref_cea9" />
* Queue operations may involve initializing or defining the queue, utilizing it, and then completely erasing it from the memory.<ref name="ref_cea9" />
* If you go to a ticket counter to buy movie tickets, and are first in the queue, then you will be the first one to get the tickets.<ref name="ref_78d8">[https://www.studytonight.com/data-structures/queue-data-structure Queue Data Structure]</ref>
* Like stack, queue is also an ordered list of elements of similar data types.<ref name="ref_78d8" />
* Queue can be implemented using an Array, Stack or Linked List.<ref name="ref_78d8" />
* Initially the head(FRONT) and the tail(REAR) of the queue points at the first index of the array (starting the index of array from 0 ).<ref name="ref_78d8" />
* Queues maintain a FIFO ordering property.<ref name="ref_8e2e">[https://runestone.academy/runestone/books/published/pythonds/BasicDS/TheQueueAbstractDataType.html 4.11. The Queue Abstract Data Type — Problem Solving with Algorithms and Data Structures]</ref>
* Queue() creates a new queue that is empty.<ref name="ref_8e2e" />
* dequeue() removes the front item from the queue.<ref name="ref_8e2e" />
* Inserting in the Queue in the rear end is known as Enqueue and Deleting from the Queue from the front end is called Deque.<ref name="ref_5eb7">[https://www.codingninjas.com/blog/2020/10/10/queue-data-structure-and-its-applications/ Queue Data Structure and its applications]</ref>
* Queue supports access of the elements in the queue from both the ends of the structure.<ref name="ref_5eb7" />
* A Queue is a linear structure which follows a particular order in which the operations are performed.<ref name="ref_ecb3">[https://www.geeksforgeeks.org/queue-data-structure/ Queue Data Structure]</ref>
* A good example of a queue is any queue of consumers for a resource where the consumer that came first is served first.<ref name="ref_ecb3" />
* The difference between stacks and queues is in removing.<ref name="ref_ecb3" />
* In the above image, since 1 was kept in the queue before 2, it was the first to be removed from the queue as well.<ref name="ref_424a">[https://www.programiz.com/dsa/queue Queue Data Structure]</ref>
* Q has only one element, so we reset the queue after deleting it.<ref name="ref_424a" />
* The queue is used for synchronization.<ref name="ref_424a" />
* The operations of a queue make it a first-in-first-out (FIFO) data structure.<ref name="ref_e0a1">[https://en.wikipedia.org/wiki/Queue_(abstract_data_type) Queue (abstract data type)]</ref>
* In a FIFO data structure, the first element added to the queue will be the first one to be removed.<ref name="ref_e0a1" />
* In these contexts, the queue performs the function of a buffer.<ref name="ref_e0a1" />
* Fixed-length arrays are limited in capacity, but it is not true that items need to be copied towards the head of the queue.<ref name="ref_e0a1" />
* In a simple queue, insertion takes place at the rear and removal occurs at the front.<ref name="ref_c0c5">[https://www.programiz.com/dsa/types-of-queue Types of Queue]</ref>
* A priority queue is a special type of queue in which each element is associated with a priority and is served according to its priority.<ref name="ref_c0c5" />
* Double Ended Queue is a type of queue in which insertion and removal of elements can be performed from either from the front or rear.<ref name="ref_c0c5" />
* A Queue is a linear data structure in which data is stored in a First In, First Out manner.<ref name="ref_4ce9">[https://www.section.io/engineering-education/queue-data-structure-python/ Using the Queue Data Structure in Python]</ref>
* In a queue, the item that was added the earliest is removed first.<ref name="ref_4ce9" />
* - often maintain queues while implementing various low-level operations such as CPU Scheduling, Disk Scheduling, etc.<ref name="ref_4ce9" />
* - hardware interrupts are handled using queues.<ref name="ref_4ce9" />
===소스===
<references />

@@ 135번째 줄: / 135번째 줄: @@
   <references />
-== 메타데이터 ==
+==메타데이터==
 ===위키데이터===
 * ID :  [https://www.wikidata.org/wiki/Q220543 Q220543]

← 이전 판		2020년 12월 26일 (토) 13:03 판
134번째 줄:		134번째 줄:
	===소스===		===소스===
	<references />		<references />
		+
		+	== 메타데이터 ==
		+
		+	===위키데이터===
		+	* ID : [https://www.wikidata.org/wiki/Q220543 Q220543]

큐 - 편집 역사

2021년 2월 17일 (수) 08:46에 Pythagoras0님의 편집

Pythagoras0: /* 메타데이터 */ 새 문단

Pythagoras0: /* 노트 */ 새 문단