Download Model question papers & previous years question papers
Submit Previous Years University Question Papers
Posted Date: 15 Jan 2010 Posted By:: Vijay Kumar Vishwakarma Member Level: Gold Points: 5 (₹ 1)
2009 Rajiv Gandhi Proudyogiki Vishwavidyalaya(Technical University) Diploma Information Technology Mid-term 2009 Examination Question paper
KALANIKETAN POLYTECHNIC COLLEGE
I. OBJECTIVE 10
1. merge sort uses______
b. heuristic technique
c. divide & conquer
d. greedy approach
2. stack is full if
b. max <= top
c. max >= top
d. max != top
3. queue is a
4. which is efficiently implemented by stack
5. if there is n nodes in a tree, how many levels are there in tree
II. a. convert into postfix and prefix
b. Explain stack by giving example.
III. a. Difference between dirtectd and undirected graph.
b. what is an array?
c. Explain garbage collection.
IV. a Sort the given numbers using selection sort.
55 , 2 , 1 , 15 , 10 , 11, 91, 18
b. What do you mean by searching? Explain types
V a. What is Doubly linked list?
b. Explain push and pop operation.
c. Explain insertion and delection from quue.
VI. a. Explain the methods to represent graphs.
b. find shortest path from A to F.
B 1 D
A 3 2 F
C 4 E
VII. a. Which are the primitive and non-primitiuve data structures.
b. Explain how do we use 2 stacks A and B as a queue.
c. Explain sparse matrix.
VIII. Short notes
i. Structured programming
ii. Circular queue
iii. Memory allocation techniques
iv. Binary tre
v. String manipulation
Return to question paper search
and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.