Exam Details
| Subject | data and file structures | |
| Paper | paper 16 | |
| Exam / Course | m.c.a | |
| Department | ||
| Organization | Nalanda Open University | |
| Position | ||
| Exam Date | 2016 | |
| City, State | bihar, patna |
Question Paper
N A L A N D A O P E N U N I V E R S I T Y
Master of Computer Application Part-II
PAPER-XVI
(Data and File Structures)
Annual Examination, 2016
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. Design algorithms for various operations performed on circularly linked list.
2. Explain the depth first search algorithm with example.
3. Write a procedure to find minimum cost spanning tree for a graph using Prim's algorithm.
4. Explain the process of creating a Splay Tree using an example. Explain the operations of Red-
Black Trees.
5. Write an algorithm for implementing insertion and deletion operations in a singly linked list
using arrays.
6. Write a procedure to create, insert and delete an element in queue.
7. Compare and contrast different sorting algorithms with examples of each type.
8. Write a procedure to sort the following sequence using heap sort
25, 57, 48, 37, 12, 92, 86, 33.
9. Write the algorithms for each of the following for binary trees
Inorder traversal
Preorder traversal
Postorder traversal
10. Write a detailed note on sequential file organization. Discuss about the linear search in detail.
Master of Computer Application Part-II
PAPER-XVI
(Data and File Structures)
Annual Examination, 2016
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. Design algorithms for various operations performed on circularly linked list.
2. Explain the depth first search algorithm with example.
3. Write a procedure to find minimum cost spanning tree for a graph using Prim's algorithm.
4. Explain the process of creating a Splay Tree using an example. Explain the operations of Red-
Black Trees.
5. Write an algorithm for implementing insertion and deletion operations in a singly linked list
using arrays.
6. Write a procedure to create, insert and delete an element in queue.
7. Compare and contrast different sorting algorithms with examples of each type.
8. Write a procedure to sort the following sequence using heap sort
25, 57, 48, 37, 12, 92, 86, 33.
9. Write the algorithms for each of the following for binary trees
Inorder traversal
Preorder traversal
Postorder traversal
10. Write a detailed note on sequential file organization. Discuss about the linear search in detail.
Other Question Papers
Subjects
- (internet concepts and web design
- accounting & financial management
- advanced database design
- advanced discrete mathematics
- advanced internet technologies
- advanced internet technologies and computer graphics set-i
- advanced internet technologies and computer graphics set-ii
- application development with .net framework
- artificial intelligence and knowledge management
- c and assembly language programming
- communication skill
- communication skills
- computer graphics and multimedia
- computer networking
- computer organization
- computer organization and assembly language programming
- data and file structures
- data communication and computer networks
- database management system
- design and analysis of algorithm
- discrete mathematics
- internet concepts and web design
- introduction to database management systems
- lab (for data and file structures, networking and java programming)
- laboratory course
- management and information system
- mcs-041 : operating systems
- numerical and statistical computing
- object oriented analysis and design
- object oriented programming using java
- object oriented technologies and java programming
- operating system
- operating system concepts and networking management
- operating systems
- principles of management and information systems
- problem solving and programming
- problem solving using c
- software engineering
- system analysis and design
- systems analysis and design
- unix and oracle
- unix and oracle set-i
- unix and oracle set-ii