![]() Second, a statement for the operation that can be performed on elements of abstract data type must have to be specified.First, there should be a particular way in which components are related to each other.The meaning of an abstract data type clearly says that for a data structure to be abstract, it should have the below-mentioned characteristics: So basically queue is used within a single program where there are multiple programs kept in the queue or one task may create other tasks which must have to be executed in turn by keeping them in the queue. Other examples can also be noted within a computer system where the queue of tasks arranged in the list to perform for the line printer, for accessing the disk storage, or even in the time-sharing system for the use of CPU. A real-life scenario in the form of example for queue will be the queue of people waiting to accomplish a particular task where the first person in the queue is the first person to be served first. So Queue is said to follow the FIFO (First In First Out) structure. 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. In this chapter, you will deal with the queue as arrays. The term front and rear are frequently used while describing queues in a linked list. What is a Queue?Ī queue is a linear list of elements in which deletion of an element can take place only at one end called the front and insertion can take place on the other end which is termed as the rear. In this chapter, you will be given an introduction to the basic concepts of queues along with the various types of queues which will be discussed simulating the real world situation. It allows insertion of an element to be done at one end and deletion of an element to be performed at the other end. The queue is a linear data structure used to represent a linear list. ![]() ![]() Basic Concepts of Data Structures Data Structure Introduction Data Structures Environment Setup Fundamental Elements of Data Structure Arrays, Iteration, Invariants Data Structures and Arrays Lists, Recursion, Stacks, Queues Linked List Polynomials Using Linked List and Arrays Concepts of Stack in Data Structure Concepts of Queue in Data Structure Algorithms Principles of Program Analysis Big-O Notation and Algorithm Analysis Searching Techniques Sorting Techniques Bubble Sort Algorithm Selection Sort Algorithm Merge Sort Algorithm Quick Sort Algorithm Insertion Sort Algorithm Greedy Algorithm Trees Binary Trees AVL Trees Forests and Orchards ![]()
0 Comments
Leave a Reply. |