Rajiv Gandhi Proudyogiki Vishwavidyalaya 2009 Diploma Information Technology Mid-term - Question Paper

KALANIKETAN POLYTECHNIC COLLEGE
JABALPUR

I. OBJECTIVE 10
1. merge sort uses______
a. backtracking
b. heuristic technique
c. divide & conquer
d. greedy approach

2. stack is full if
a. max=top
b. max <= top
c. max >= top
d. max != top

3. queue is a
a. LIFO
b. FILO
c. LILO
d. FIFO

4. which is efficiently implemented by stack
a. postfix
b. prefix
c. infix
d. BFS

5. if there is n nodes in a tree, how many levels are there in tree
a. log(n+1)
b. logn
c. log(n-1)
d. logn+1


II. a. convert into postfix and prefix
i. A+B-D/E*C
ii. (A-B)*(A*A+A*B+B*B)
iii. A+(B*C-(D/E*F)*G)*H
b. discuss stack by giving example.

III. a. Difference ranging from dirtectd and undirected graph.
b. what is an array?
c. discuss garbage collection.

IV. a Sort the provided numbers using selection sort.
55 , two , one , 15 , 10 , 11, 91, 18

b. What do you mean by searching? discuss kinds

V a. What is Doubly linked list?
b. Explain push and pop operation.
c. Explain insertion and delection from quue.

VI. a. discuss the methods to represent graphs.
b. obtain shortest path from A to F.

B one D

two 4
A three two F

two 2

C four E

VII. a. Which are the primitive and non-primitiuve data structures.
b. discuss how do we use two stacks A and B as a queue.
c. discuss sparse matrix.

VIII. Short notes
i. Structured programming
ii. Circular queue
iii. Memory allocation techniques
iv. Binary tre
v. String manipulation

Earning:   Approval pending.