Data Structures and Algorithms Quiz

Arrays = Representation of arrays (multidimensional) Linked Lists = Application (Sparse Matrix, Associative Array, Functional Programming) Stack = Application (Tower of Hanoi, Function Call and return, Parentheses Matching, Back-tracking, Expression Evaluation) Tree = Application: Arithmetic Expressions Evaluation

Pruning, Grafting = Tree Address calculation using column and row major ordering = Arrays Doubly linked list, Circular linked list, unrolled linked list, skip-lists, Splices, Sentinel nodes = Linked Lists de-queue, en-queue, priority queue, bounded queue = Queue

Complexity Measures and Notations = Analysis of algorithm Threaded Binary Tree, AVL = Variations: Indexed Binary Tree Definition, Implementation, Operation, Application, Algorithm writing and convention = Data Structure Traversal (Pre, In, Post &Levelorder) = Binary trees

<p>Arithmetic Expressions Evaluation = Tree Sparse matrix, Associative Array, Functional Programming = Linked Lists Tower of Hanoi, Function Call and return, Parentheses Matching, Back-tracking, Expression Evaluation = Stack Variations: Indexed Binary Tree, Threaded Binary Tree, AVL = Tree</p> Signup and view all the answers

<p>Full, Complete, Almost complete = Binary trees Binary Search Tree = Tree Indexed Binary Tree = Tree Threaded Binary Tree, AVL = Variations: Indexed Binary Tree</p> Signup and view all the answers