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

MCA212 – ADVANCED DATA STRUCTURE BK ID B1476

ASSIGNMENT   DRIVE SPRING- 2018 PROGRAM MASTER OF COMPUTER APPLICATION SEMESTER II SUBJECT CODE & NAME MCA212 – ADVANCED DATA STRUCTURE BK ID B1476 NUMBER OF ASSIGNMNETS, CREDITS & MARKS 2, 4 Credits, and 30 marks each    ASSIGNMENT SET -1 Q.1. List and explain any Five types of graph.                                      10 Answer: - There are various types of graphs depending upon the number of vertices, number of edges, interconnectivity, and their overall structure. We will discuss only a certain few important types of graphs in this chapter. Null Graph A graph having no edges is called a Null Graph. Example (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
Post a Comment
Read more
should be approximately of 400 words. Each question is followed by evaluation scheme. Q.No Assignment Set -1 Questions Marks Total Marks 1 List and explain any Five types of graph. [5*2] 10 2 Explain 1. Fixed block storage allocation. 2. Variable block storage allocation [5+5] 10 3 What is the use of external Storage Devices? Explain any two external storage devices [4+3+3] 10 Q.No Assignment Set -2 Questions Marks Total Marks 1 Define algorithm and write a note on Complexity and Time- Space Tradeoff with example [2+4+4] 10 2 Define Queue and explain a. Array implementation of queue b. Linked list implementation of queue [2+4+4] 10 3 List the Advantages and Disadvantages of Linear and linked representation of tree. [5+5] 10
Post a Comment
Read more

MCA315- Advanced Computer Networks

  For Assignment Solution Contact Niraj kumar Call and whatsapp  (9899682018) Mail:-Nirajkumar294@gmail.com   ASSIGNMENT Drive Spring 2019 PROGRAM Master of Computer Application SEMESTER III SUBJECT CODE & NAME MCA315- Advanced Computer Networks BK ID B1650 NUMBER OF ASSIGNMNETS, CREDITS & MARKS 2, 4 Credits, 30 marks Each Note – The Assignment is divided into 2 sets. You have to answer all questions in both sets. Average of both assignments score scored by you will be considered as your IA score. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme. Q.No Assignment Set -1 Questions Marks Total Marks 1 Describe OSI Model. List and explain its seven layers. 3+7 10 2 Describe about DWDM. Explain the components of a basi...
Post a Comment
Read more