Skip to main content

Q.2.Define Queue and explain a. Array implementation of queue b. Linked list implementation of queue


Q.2.Define Queue and explain
a. Array implementation of queue
b. Linked list implementation of queue
Answer: - Like Stack, Queue is a linear structure which follows a particular order in which the operations are performed. The order is First in First out (FIFO).  A good example of queue is any queue of consumers for a resource where the consumer that came first is served first.
The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we remove the item the least recently added.
Operations on Queue:
Mainly the following four basic operations are performed on queue:
Enqueue: Adds an item to the queue. If the queue is full, then it is said to be an Overflow condition.
Dequeue: Removes an item from the queue. The items are popped in the same order in which they are pushed. If the queue is empty, then it is said to be an Underflow condition.
Front: Get the front item from queue.
Rear: Get the last item from queue.

(9899682018 What’s App and call)

YOU CAN CONTACT US 10 A.M TO 8 P.M

CHARGES – ASSIGNMENTS PER SEM 600, PER PAPER 150

Comments

Post a Comment

Popular posts from this blog

SQL Server interview questions along with their answers

1.     What is SQL Server? SQL Server is a relational database management system (RDBMS) developed by Microsoft. It is used to store, retrieve, and manage data efficiently. What is the difference between SQL and SQL Server? SQL (Structured Query Language) is a standard language used to communicate with and manipulate databases. SQL Server is a relational database management system that implements the SQL language.  What are the different types of backups available in SQL Server? SQL Server supports several types of backups, including Full Backup, Differential Backup, Transaction Log Backup, and File or Filegroup Backup. What is normalization in SQL Server? Normalization is the process of organizing data in a database to reduce redundancy and dependency. It helps in improving data integrity and performance.  What is a clustered index? A clustered index determines the physical order of data in a table. A table can have only one clustered index, and it...
Post a Comment
Read more

Define algorithm and write a note on Complexity and Time- Space Tradeoff with example.

ASSIGNMENT SET -2 Q.1.Define algorithm and write a note on Complexity and Time- Space Tradeoff with example. Answer:- Algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output. Algorithms are generally created independent of underlying languages, i.e. an algorithm can be implemented in more than one programming language. From the data structure point of view, following are some important categories of algorithms − Search − Algorithm to search an item in a data structure. Sort − Algorithm to sort items in a certain order. Insert − Algorithm to insert item in a data structure. Update − Algorithm to update an existing item in a data structure. Delete − Algorithm to delete an existing item from a data structure. Characteristics of an Algorithm Not all procedures can be called an algorithm. An algorithm should have the following characteristics − Unambiguous − Algorithm should be clear a...
Post a Comment
Read more

NMIMS Global Access Assignment _2019

Business_Statistics_Assignment_June_2019 Business_Law_Assignment_June_2019 Essentials_of_HRM_Assignment_June_2019 Financial_Accounting_and_Analysis_Assignment_June_2019 Marketing_Management_Assignment_June_2019 Strategic_Management_Assignment_June_2019 For Assignment Solution Contact Niraj kumar Call and whatsapp (9899682018) Mail:-Nirajkumar294@gmail.com
Post a Comment
Read more