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):||24 December 2004|
|PDF File Size:||10.48 Mb|
|ePub File Size:||18.44 Mb|
|Price:||Free* [*Free Regsitration Required]|
Software Engineering Principles More information. Insert an element in the list More information. The -2 must be fixed. Surah Al-Muzzammil pdf – alkalam. We can represent a tree algoritmhs a list consisting of the root and a list of the subtrees in order.
Differentiate an abstraction from an implementation.
Give any two applications of data structures. Note that the item always goes into a new leaf. Binary Search Trees Lecturer: Notice, that removal algorithm includes the disposal of the deleted node – unnecessary in languages with automatic garbage collection Java.
The fix is to use a single left rotation at P. This is very important since it means that we still have a legitimate binary search tree.
All carry equal marks Section A. Evaluation of Expressions Disadvantages of Using Arrays Need to define a size for array High overestimate waste of space insertion and deletion is very slow need to move elements of the list redundant memory space it is difficult to estimate the size of array Anna University, Chennai – Questions 1 through 25 are worth 2 points each. What other searches have we considered? Pointer is a variable, which stores algorithns address of the next element in the list.
Automatic Temperature Controlled Fan. The stopping point is the smallest element.
List has only one node When list has only one node, that the head points to the same node as the tail, the removal is quite simple. Using the Function LinearSearch a,n,item,loc Here “a” is an array of the size n. No change is needed at this node. Linked Representation The elements are represented using pointers.
What is a minimum spanning tree? This may violate the heap order property, which can be fixed by percolate up. Definitions A multiway tree of order m is an ordered tree where each node has at most m children. Then X is placed in T left. For an E, 15 points are.
To prove that a program accomplishes its stated objective in a finite number of steps algorithjs called program termini nation. Several modules can be implemented and executed simultaneously.
Algorithm algorithmd the node, pointed by head or tail and sets both head and tail to NULL. The exam is closed book, closed notes.
A binary tree is a tree which is either empty, or one in which every node: A path from node n, to n k is defined as a sequence of nodes n 1, n 2,n Note, too, that the mirror image situation is also included under subcase A. Array Implementation of List Array is a collection of specific number of data stored in a consecutive memory locations.
There is exactly only one path from each node to root. Head and tail links are not updated in this case.