Exam Details
| Subject | data structures with c | |
| Paper | ||
| Exam / Course | pg diploma in information technology (pgdit) | |
| Department | ||
| Organization | acharya nagarjuna university-distance education | |
| Position | ||
| Exam Date | May, 2018 | |
| City, State | new delhi, new delhi |
Question Paper
Total No. of Questions 10] [Total No. of Pages 02
P.G. DIPLOMA DEGREE EXAMINATION, MAY 2018
INFORMATION TECHNOLOGY
Data Structure with C
Time 3 Hours Maximum Marks 70
Answer any FIVE questions
All questions carry equal marks
Q1) Discuss about classification of data structures in detail.
Q2) Describe the characteristics of algorithm and also write about linear search algorithm.
Q3) Explain about fixed length storage and variable length storage of strings with suitable
example.
Q4) How to represents records in computer memory? Illustrate with suitable example.
Q5) What is circular linked list? Discuss various operation on circular lined lists.
Q6) Write a pseudo-code for PUSH and POP operations of stack and also explain various
applications of stack.
Q7) Briefly explain about AVL trees, -trees and red-back trees.
Q8) What is binary search tree? Explain about searching and insertion operation in binary search
trees.
Q9) Sort the following numbers using
Selection sort.
Shell sort
42, 29, 74, 11, 65, 58
Q10) What is hashing? Explain various Hash collision resolution techniques with examples.
P.G. DIPLOMA DEGREE EXAMINATION, MAY 2018
INFORMATION TECHNOLOGY
Data Structure with C
Time 3 Hours Maximum Marks 70
Answer any FIVE questions
All questions carry equal marks
Q1) Discuss about classification of data structures in detail.
Q2) Describe the characteristics of algorithm and also write about linear search algorithm.
Q3) Explain about fixed length storage and variable length storage of strings with suitable
example.
Q4) How to represents records in computer memory? Illustrate with suitable example.
Q5) What is circular linked list? Discuss various operation on circular lined lists.
Q6) Write a pseudo-code for PUSH and POP operations of stack and also explain various
applications of stack.
Q7) Briefly explain about AVL trees, -trees and red-back trees.
Q8) What is binary search tree? Explain about searching and insertion operation in binary search
trees.
Q9) Sort the following numbers using
Selection sort.
Shell sort
42, 29, 74, 11, 65, 58
Q10) What is hashing? Explain various Hash collision resolution techniques with examples.