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 .

Author: | Nelmaran Jur |

Country: | Kazakhstan |

Language: | English (Spanish) |

Genre: | Automotive |

Published (Last): | 22 June 2008 |

Pages: | 113 |

PDF File Size: | 18.45 Mb |

ePub File Size: | 10.29 Mb |

ISBN: | 196-8-49433-694-4 |

Downloads: | 18550 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Ducage |

What is a directed graph?

Linked list is a kind of series of data structures, which are not necessarily adjacent in memory. What are the two methods of binary tree implementation? There are non-isomorphic trees with four.

Anc 1 2 Foreword First of algrithms, this book isn t really for dummies. Explain the usage of stack in recursive algorithm implementation? When a directed graph is not strongly connected but the underlying graph is connected, then the graph is said to be weakly connected. Anna University, Chennai – Balance factor of a node is defined to be the difference between the height of the node’s left subtree and the height of the node’s right subtree. A graph in which weights are assigned to every edge is called a weighted graph.

### PPT – EE – Data Structures and Algorithms PowerPoint Presentation – ID

Unit 4 part B 1. Definition A binary heap is a complete binary tree, where each node has a higher priority than its children. To Delete 5 before deletion After deletion To delete 5, the pointer currently pointing the node 5 is now made to to its child node 6.

A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph. The length of the array is determined when the array is created, and cannot be changed. Module 2 Stacks and Queues: Union, Intersection, size, complement and find are the various operations of ADT.

Unit 2 and 3 part B 1. Car reversing horn with flasher.

## EE2204 DATA STRUCTURES AND ALGORITHM (Common to EEE, EIE & ICE)

In-order traversal-yields infix form of expression. Of course, in any useful application there would be a record of data associated with each key, so that the dtructures row in each node might be an array of records where each record contains a key and its associated data.

A tree is a finite set of strkctures or more nodes such that there is a specially designated node called the Root, and zero or more non empty sub trees T 1, T Prosper Beasley 2 years ago Views: Then move the N th disk from A to C.

The individual elements are typically stored in consecutive memory locations. Note, too, that the mirror image situation is also included under subcase A. There are three main cases to consider when inserting a new node. Using the Function LinearSearch a,n,item,loc Here “a” is an array of the size n.

Define the concept of an abstract data type ADT. What are the problems in hashing? Semester – 1 CS Briefly explain the categories that classify the functions More information. It s time for a chainge! Circular linked list can be implemented as Singly linked list and Doubly linked list with or without algorjthms. Similarly the rest of the elements are traversed.