Digital Learner

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 l...

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...

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