Dfs analysis
- 1. Second Year Engineering Sem 3 By Mukesh N Tekwani Computer Engineering 9869 488 356 University of Mumbai Mumbai ANALYSIS OF QUESTIONS ASKED FROM DEC 2008 TO MAY 2011 mukeshnt@yahoo.com Subject: DATA STRUCTURES AND FILES INTRODUCTION TO DATA STRUCTURES Dec-08 May-09 Dec-09 May-10 Dec-10 May-11 1 ADT - explain 10 2 5 2 Algo strategies 3 Algorith - defn 4 Algorithm Analysis - factors: time, space 5 All string handling and array programs 6 Array structure - full topic 7 Arrays - uneven (or jagged arrays) 8 Big O notation and other notations 9 Derived types in Java 10 Iteration and recursion - compare 6 6 11 Linear & non-linear data struc with exampls 4 12 Linear and non-linear data structures & applns 10 5 13 Order of magnitude 14 Program - count all occurrences of a word 10 15 Program-Read txt file & count occur on a word 10 16 Recursion, explain- Towers of Hanoi program 10 10 10 10 17 Reordering complexity: 1-89 18 Strings and representation in Java 19 Types of data structures with examples 5 FILE HANDLING Dec-08 May-09 Dec-09 May-10 Dec-10 May-11 1 Compare sequential & random access files 2 Compare text file and binary file 3 Distinguish between byte & char streams 4 Factors involved in selecting file organisation 5 Progarm - Read file 10 6 Program - Concatenating files 7 Program - copy bytes from 1 file to another 10 8 Program - create Merit List 10 9 Program - reading and writing bytes 10 Program - reading and writing characters 11 Types of file organizations Prof Mukesh N Tekwani 9869 488 356 Mumbai mukeshnt@yahoo.com November 2011 Page 1 of 4
- 2. Second Year Engineering Sem 3 By Mukesh N Tekwani Computer Engineering 9869 488 356 University of Mumbai Mumbai ANALYSIS OF QUESTIONS ASKED FROM DEC 2008 TO MAY 2011 mukeshnt@yahoo.com Subject: DATA STRUCTURES AND FILES SORTING AND SEARCHING Dec-08 May-09 Dec-09 May-10 Dec-10 May-11 1 Binary Search - Program 10 10 10 2 Binary Tree Sort 3 Bubble Sort - programa and analysis 4 Hashing - defn, example 10 12 10 10 10 5 Hashing - search and insertion algo 3 6 Heap Sort - Program 10 10 10 7 Heapify property of Heap Sort 8 Importance of sorting 9 Indexed Sequential Search - code, ad/dis-vntgs 10 Insertion Sort 10 11 Internal and External sorting 12 Merge Sort 13 Partition Exchange Sort (Quick Sort) 14 Quick Sort - Program, with example 10 10 10 10 10 15 Selection and Tree Sort 16 Shell Sort STACK Dec-08 May-09 Dec-09 May-10 Dec-10 May-11 1 Applications of stack 2 Classify consonants and vowels-stack-program 10 3 Dec to binary - using stack 10 4 Infix to Postfix - program 10 10 5 Infix, Prefix, Postfix - note 5 6 Progarm - 2 stacks in an array 10 7 Stack - defn, operations with Java code QUEUES Dec-08 May-09 Dec-09 May-10 Dec-10 May-11 1 Applications of queue 2 Array representaion of linked list 5 3 Circular Q - explain 5 5 4 Circular q - using linked list - progarm 10 5 Deque operation 6 Operations on Qs 7 Priority Q and types of priority q 3 5 10 8 Priority q program - using linked list - ins/del 7 9 Priority queue - explain 5 10 Representing Q in Java - implementaion Prof Mukesh N Tekwani 9869 488 356 Mumbai mukeshnt@yahoo.com November 2011 Page 2 of 4
- 3. Second Year Engineering Sem 3 By Mukesh N Tekwani Computer Engineering 9869 488 356 University of Mumbai Mumbai ANALYSIS OF QUESTIONS ASKED FROM DEC 2008 TO MAY 2011 mukeshnt@yahoo.com Subject: DATA STRUCTURES AND FILES LINKED LIST Dec-08 May-09 Dec-09 May-10 Dec-10 May-11 1 ADT for linked list 2 Array representation of linked list 5 5 5 3 Circular Linked List - program & operations 4 Circular Queue using linked list - program 10 10 5 Doubly Linked list - program 10 10 10 6 Implementation of linked list - dynamic 7 Implementation of linked list - static (arrays) 8 Josephus Problem 9 Linked implementation of queue 10 Linked implementation of stack 11 Linked List - attaching, deleting nodes - algo 12 Operations on linked list - with algorithms 13 Reverse a circular linked list - program 10 14 Single Linked List - program 10 TREES Dec-08 May-09 Dec-09 May-10 Dec-10 May-11 1 Advantages of B+ trees 2 Array (implicit) repres. of binary tree 3 AVL tree analysis 4 AVL tree formation steps 10 5 10 5 AVL Tree note 5 5 5 6 B Tree 5 5 5 7 B+ trees - note 5 5 5 8 Binary Tree - defn 2 9 BST - delete node 10 10 10 10 BST - find element 11 BST - find max, min 12 BST - insert node 13 Definitions of all terms 14 Difference between B tree and B+ tree 15 Dynamic representation of binary tree 16 Expression Trees - note 5 17 Finding kth element of tree 18 Given:pre, post. Draw a tree 10 19 Huffman Encoding 10 4 10 14 10 20 Implement BST - Java code 10 21 Infix, prefix, postfix 5 22 Inserting element in AVL tree - algo Prof Mukesh N Tekwani 9869 488 356 Mumbai mukeshnt@yahoo.com November 2011 Page 3 of 4
- 4. Second Year Engineering Sem 3 By Mukesh N Tekwani Computer Engineering 9869 488 356 University of Mumbai Mumbai ANALYSIS OF QUESTIONS ASKED FROM DEC 2008 TO MAY 2011 mukeshnt@yahoo.com Subject: DATA STRUCTURES AND FILES 23 Multiway search tree 24 Practical Applications of trees 5 4 25 Pre, post, inorder note (Tree traversal) 5 10 26 Print leaf ndes of binry tree - 3 traversals 27 Priority queue as BST - implement 28 Representing list as a binary Tree 29 Searching element in AVL tree - algo 30 Threaded binary Tree 10 10 10 10 GRAPHS Dec-08 May-09 Dec-09 May-10 Dec-10 May-11 1 Connected graph 2 DFS and BFS program - DFS and BFS 10 10 10 10 3 Directed Acyclic graphs 4 Directed graph 5 Efficiency of DFS 6 Find BFS spanning tree 7 Find DFS spanning tree 8 Find the adjacency matrix of a given graph 9 Finding degree of nodes 10 Graph - application 2 11 Graph - definition 2 12 Graph representation - Adjacency Matrix 3 3 3 3 13 Linked representation - adjacency 3 3 3 3 14 Recursion - explain 5 15 Weighted graph Prof Mukesh N Tekwani 9869 488 356 Mumbai mukeshnt@yahoo.com November 2011 Page 4 of 4