EE DATA STRUCTURES AND ALGORITHMS TWO MARK QUESTIONS WITH ANSWERS ANNA UNIVERSITY QUESTION BANK. Sign in. Main menu. EE Data Structures and Algorithms – 2 MARKS. Instructions: 1. CLICK HERE to view the document online. 2. CLICK HERE to Download. EE DATA STRUCTURES AND ALGORITHM (Common to EEE, EIE & ICE) UNIT I LINEAR STRUCTURES Abstract Data Types (ADT) List ADT array-based .
|Published (Last):||8 December 2016|
|PDF File Size:||8.87 Mb|
|ePub File Size:||16.38 Mb|
|Price:||Free* [*Free Regsitration Required]|
Add first In this case, new node is inserted right before the current head node. Notice the balance factor of -2 at node The length of the path is the number of edges on the path.
PPT – EE – Data Structures and Algorithms PowerPoint Presentation – ID
Then the numer of nodes will be between 8 and You can get at most 30 points. If the character is an operator, push it onto the stack. The same operation on a doubly linked list requires four pointer changes.
When a directed graph is not strongly connected but the strcutures graph is connected, then the graph is said to be weakly connected. The abstraction that models hierarchical More information.
Explain Dijkstra’s algorithm with an example? Note that rotations do not mess up the order of the nodes given in an inorder traversal.
What are the different types of traversing?
Union, Intersection, size, complement and find are the various operations of ADT. But disadvantage in that is they are sequential lists. Similarly the rest of the elements are traversed. Deletion operation ad the complex operation in the Binary search tree. Automatic Temperature Controlled Fan. Top operation returns the element at the front of the list.
What are algorithms and how they are useful? Circular linked list can be implemented as Singly linked list and Doubly linked list with or without headers. Singly-linked List – Addition Insertion into a singly-linked list has two special cases.
EE2204 DATA STRUCTURES AND ALGORITHM (Common to EEE, EIE & ICE)
In Binary heap the minimum element is found in the root. Note that the first row in each node shows the keys, while the second row shows the pointers to the child nodes.
Process the right subtree A stack is a linear data structure which follows Last In First Out LIFO principle, in which both insertion and deletion occur at only one end of the list called the Top.
Email Presentation to Friend. Quiz 4 Solutions Q1: What is the length of the path in a tree? Advantages of Circular Linked List It allows to traverse the list starting at any point. Various operations performed on List. What are the steps taken to improve the efficiency of an algorithm? List ADT is a sequential storage structure.
List three examples that uses linked list?
After every pop operation the top pointer is decremented by 1. The operations that can be done with queue are addition and deletion. The most widely strategies are listed below Divide and conquer Binary doubling strategy Dynamic programming An algorithm is an effective method expressed as a finite list of well-defined instructions alyorithms calculating a function.
We have the same strucures situations, but the order of algorithm actions is opposite. Special Cases of Deletion We do, however, have to be careful about the end cases: Blog Stats 83, hits.
If the keys and subtrees are arranged in the fashion of a search tree, then this is called a multiway search tree of order m. They are abstract in the sense that the focus is on the definitions and the datx operations with their arguments. Explain the array and linked list implementation of Queue.
Enqueue in More information. With my change in priorities, I may not be able to continue posting new contents or result updates in future. Program verification refers to the application of mathematical proof techniques, to verify that the results obtained by the execution of the algorthms with arbitrary inputs are in accord with formally defined output Specifications.
When we have a solution to the problem then we have to work backward to find the starting condition. Dynamic programming is used when the problem is to be solved in a sequence of intermediate steps. An abstract data type is defined indirectly, only by the operations that may be performed on it and by mathematical constraints on the effects and possibly cost of those operations. Attempt to delete an element from the queue, when the queue is empty is said to be underflow Implementation of Queue Queue can be implemented using arrays and pointers.
Queue is a first — in -first out list. Searches are an important application. A node with balance factor -1 changes to -2 when a xata node is inserted in its left subtree. The memory address of the first element of an array is called A.