LOADING

Questions

BE - SEMESTER - III (NEW) EXAMINATION - SUMMER 2015-Summer-June-2015

Q-1(a)

Write a ‘C’ program for insertion sort and discuss its efficiency.

(7)
Q-1(b)

Briefly explain various linear and non-linear data structures along with their applications.

(7)
Q-2(a)

Write ‘C’ functions to: (1) insert a node at the end (2) delete a node from the beginning of a doubly linked list.

(7)
Q-2(b)

Write an algorithm to reverse a string of characters using stack.

(7)
ORQ-2(b)

Compare: (1) Linked-list and Array (2) Circular queue and Simple Queue

(7)
Q-3(a)

Convert (A+B) *C–D^ E^(F*G) infix expression into prefix format  showing stack status after every step in tabular form.

 

(7)

Describe: (1) Recursion (2) Priority Queue (3) Tower of Hanoi

Q-3(b)

Write a ‘C’ functions to: (1) insert a node at beginning in singly linked list (2) insert an element in circular queue.

(7)
ORQ-3(b)

Write an algorithm to implement insert and delete operations in a simple queue.

(7)
Q-4(a)

With figure, explain the following terms: (1) Depth of a tree (2) Sibling nodes (3)Strictly binary tree (4) Ancestor nodes (5) Graph (6) Minimum spanning tree (7)Degree of a vertex.

(7)
Q-4(b)

Generate a binary search tree for following numbers and perform in-order andpost-order traversals: 50, 40, 80, 20, 0, 30, 10, 90, 60, 70

(7)
OR
Q-4(b)

Explain Right-in-threaded, left- in - threaded and full -in-threaded binary trees.

(7)

Write Kruskal’s algorithm for minimum spanning tree and explain with an example.

Q-5(a)

Describe various collision resolution techniques in hashing.

(7)
Q-5(b)

Write an algorithm for binary search method and discuss its efficiency

(7)
OR
Q-5(a)

Write recursive ‘C’ functions for (1) in-order (2) pre-order and (3) post-ordertraversals of binary search tree.

(7)
Q-5(b)

Explain Sequential, Indexed Sequential and Random file organizations.

(7)