Unit 5 - Data Structures

1.Explain the various representation of graph with example in detail? 

. Adjacency matrix
• Figure
• Explanation
• Table
. Adjacency list
• Figure
• Explanation
• Table

2. Define topological sort? Explain with an example? 
. Definition
. Explanation
. Example
. Table
. Coding

3. Explain Dijkstra's algorithm with an example? 
. Explanation
. Example
. Graph
. Table
. Coding

4.Explain Prim's algorithm with an example? 
. Explanation
. Example
. Graph
. Table
. Coding

5. Explain Krushal's algorithm with an example? 
. Explanation
. Example
. Graph
. Table
. Coding 

Data Structures - Unit 3

1.Explain the different tree traversals with an application? 
. In order
• Explanation with an example
• Figure
. Preorder
• Explanation with an example
• Figure
.
Postorder
• Explanation with an example
• Figure

2. Define binary search tree? Explain the various operations with an example? 
. Definition
. Figure for binary search tree
. Operations
• Codings
• Explanation
• Example


3. Define AVL trees? Explain the LL, RR, RL, LR case with an example? 
. Definition
. LL, RR, RL, LR case
• Figure
• Example
• Explanation

4. Define priority queue? Explain the basic heap operation with an example? 
. Definition
. Basic operation
• Insert
• Delmin
• Delmax
. Coding
. Explanation
. Example

5. Explain any two techniques to overcome hash collision?
. Separate chaining
• Example
• Explanation
• Coding
. Open addressing
• Linear probing
• Quadratic probing 

Data Structures - Unit 2

1.Explain the linked list implementation of list ADT in Detail? 

. Definition for linked list
. Figure for linked list
. Next pointer
. Header or dummy node
. Various operations
• Explanation
• Example figure
• Coding

2. Explain the cursor implementation of linked list? 
. Definition for linked list
. Figure for linked list
. Next pointer
. Header or dummy node
. Various operations
• Explanation
• Example figure
• Coding


3. Explain the various applications of linked list? 
. Polynomical ADT
• Operations
• Coding
• Figure
. Radix Sort
• Explanation
• Example
. Multilist
• Explanation
• Example figure

4. Explain the linked list implementation of stack ADT in detail?
. Definition for stack
. Stack model
. Figure
. Pointer-Top
. Operations
• Coding
• Example figure

5. Explain the array implementation of queue ADT in detail? 
. Definition for stack
. Stack model
. Figure
. Pointer-FRONT, REAR
. Operations
• Coding
• Example figure 

Data Structures - PROBLEM SOLVING

1.Explain top-down design in detail? 

• Definition
• Breaking a problem in to subproblems
• Choice of a suitable data structure
• Constructions of loops
• Establishing initial conditions for loops
• Finding the iterative construct
• Terminations of loops


2. What are the steps taken to improve the efficiency of an algorithm? 
• Definition
• Redundant computations
• Referencing array elements
• Inefficiency due to late termination
• Early detection of desired output conditions
• Trading storage for efficiency gains

3. Design an algorithm fro sine function computation. Explain it with an example? 
• Algorithm development
• Algorithm description
• Pascal implementation
• Application

4. Design an algorithm for reversing the digit of an integer. Explain it with an example? 
• Algorithm development
• Algorithm description
• Pascal implementation
• Application

5. Design an algorithm for base conversion. Explain it with an example? 
• Algorithm development
• Algorithm description
• Pascal implementation
• Application 

OSTC UNIT 5 QBank

https://drive.google.com/file/d/0BzsuAfabSI9rNlhtNDEwV0NBZm8/edit?usp=sharing

OSTC UNIT 4 QBank

https://drive.google.com/file/d/0BzsuAfabSI9rWVBiMVhlSDJOM2s/edit?usp=sharing

OSTC UNIT 3 QBank

https://drive.google.com/file/d/0BzsuAfabSI9rT1N6R0pOVkdzX0E/edit?usp=sharing

OSTC UNIT 2 QBank

https://drive.google.com/file/d/0BzsuAfabSI9rUkVEZVhRNDJpWWs/edit?usp=sharing

OSTC UNIT 1 Qbank

https://drive.google.com/file/d/0BzsuAfabSI9rR2pQRXp2QkV2dnc/edit?usp=sharing