Your SlideShare is downloading. ×

Dfs analysis

1,789

Published on

Mumbai University, BE (Sem 3) computer Engineering DFS paper analysis, Data Structures and Files

Mumbai University, BE (Sem 3) computer Engineering DFS paper analysis, Data Structures and Files

Published in: Education, Technology
0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total Views
1,789
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
11
Comments
0
Likes
1
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 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-111 ADT - explain 10 2 52 Algo strategies3 Algorith - defn4 Algorithm Analysis - factors: time, space5 All string handling and array programs6 Array structure - full topic7 Arrays - uneven (or jagged arrays)8 Big O notation and other notations9 Derived types in Java10 Iteration and recursion - compare 6 611 Linear & non-linear data struc with exampls 412 Linear and non-linear data structures & applns 10 513 Order of magnitude14 Program - count all occurrences of a word 1015 Program-Read txt file & count occur on a word 1016 Recursion, explain- Towers of Hanoi program 10 10 10 1017 Reordering complexity: 1-8918 Strings and representation in Java19 Types of data structures with examples 5 FILE HANDLING Dec-08 May-09 Dec-09 May-10 Dec-10 May-111 Compare sequential & random access files2 Compare text file and binary file3 Distinguish between byte & char streams4 Factors involved in selecting file organisation5 Progarm - Read file 106 Program - Concatenating files7 Program - copy bytes from 1 file to another 108 Program - create Merit List 109 Program - reading and writing bytes10 Program - reading and writing characters11 Types of file organizationsProf Mukesh N Tekwani9869 488 356Mumbaimukeshnt@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-111 Binary Search - Program 10 10 102 Binary Tree Sort3 Bubble Sort - programa and analysis4 Hashing - defn, example 10 12 10 10 105 Hashing - search and insertion algo 36 Heap Sort - Program 10 10 107 Heapify property of Heap Sort8 Importance of sorting9 Indexed Sequential Search - code, ad/dis-vntgs10 Insertion Sort 1011 Internal and External sorting12 Merge Sort13 Partition Exchange Sort (Quick Sort)14 Quick Sort - Program, with example 10 10 10 10 1015 Selection and Tree Sort16 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-111 Applications of queue2 Array representaion of linked list 53 Circular Q - explain 5 54 Circular q - using linked list - progarm 105 Deque operation6 Operations on Qs7 Priority Q and types of priority q 3 5 108 Priority q program - using linked list - ins/del 79 Priority queue - explain 510 Representing Q in Java - implementaionProf Mukesh N Tekwani9869 488 356Mumbaimukeshnt@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-111 ADT for linked list2 Array representation of linked list 5 5 53 Circular Linked List - program & operations4 Circular Queue using linked list - program 10 105 Doubly Linked list - program 10 10 106 Implementation of linked list - dynamic7 Implementation of linked list - static (arrays)8 Josephus Problem9 Linked implementation of queue10 Linked implementation of stack11 Linked List - attaching, deleting nodes - algo12 Operations on linked list - with algorithms13 Reverse a circular linked list - program 1014 Single Linked List - program 10 TREES Dec-08 May-09 Dec-09 May-10 Dec-10 May-111 Advantages of B+ trees2 Array (implicit) repres. of binary tree3 AVL tree analysis4 AVL tree formation steps 10 5 105 AVL Tree note 5 5 56 B Tree 5 5 57 B+ trees - note 5 5 58 Binary Tree - defn 29 BST - delete node 10 10 1010 BST - find element11 BST - find max, min12 BST - insert node13 Definitions of all terms14 Difference between B tree and B+ tree15 Dynamic representation of binary tree16 Expression Trees - note 517 Finding kth element of tree18 Given:pre, post. Draw a tree 1019 Huffman Encoding 10 4 10 14 1020 Implement BST - Java code 1021 Infix, prefix, postfix 522 Inserting element in AVL tree - algoProf Mukesh N Tekwani9869 488 356Mumbaimukeshnt@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 FILES23 Multiway search tree24 Practical Applications of trees 5 425 Pre, post, inorder note (Tree traversal) 5 1026 Print leaf ndes of binry tree - 3 traversals27 Priority queue as BST - implement28 Representing list as a binary Tree29 Searching element in AVL tree - algo30 Threaded binary Tree 10 10 10 10 GRAPHS Dec-08 May-09 Dec-09 May-10 Dec-10 May-111 Connected graph2 DFS and BFS program - DFS and BFS 10 10 10 103 Directed Acyclic graphs4 Directed graph5 Efficiency of DFS6 Find BFS spanning tree7 Find DFS spanning tree8 Find the adjacency matrix of a given graph9 Finding degree of nodes10 Graph - application 211 Graph - definition 212 Graph representation - Adjacency Matrix 3 3 3 313 Linked representation - adjacency 3 3 3 314 Recursion - explain 515 Weighted graphProf Mukesh N Tekwani9869 488 356Mumbaimukeshnt@yahoo.com November 2011 Page 4 of 4

×