Exam Details
| Subject | data and file structures | |
| Paper | paper 8 | |
| Exam / Course | m.c.a | |
| Department | ||
| Organization | Nalanda Open University | |
| Position | ||
| Exam Date | April, 2018 | |
| 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-I
PAPER-VIII
(Data and File Structures)
Annual Examination, 2018
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. Define algorithm. Discuss different types of algorithm complexity.
2. What is an array? Write a program in C to find the sum of two matrices. .
3. Describe different types of linked list with an example of each type.
4. What is a circular queue? Write a C program to implement a circular queue. Discuss
applications of a circular queue.
5. Define an AVL tree. What are the properties of an AVL tree? Draw an AVL tree for the
following series
10, 16, 18, 20, 12, 15, 30.
6. Discuss bubble sort and quick sort with an example of each.
7. Define Binary Search Tree. Write a program in C to implement Binary Search Tree.
8. What is the concept of recursion? Write a program in C to explain recursion.
9. Explain the following terms with an example
Binary Tree
Push() and operations in Stack.
10. Explain various types of file organization. Also discuss their advantages and disadvantages.
Master of Computer Application Part-I
PAPER-VIII
(Data and File Structures)
Annual Examination, 2018
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. Define algorithm. Discuss different types of algorithm complexity.
2. What is an array? Write a program in C to find the sum of two matrices. .
3. Describe different types of linked list with an example of each type.
4. What is a circular queue? Write a C program to implement a circular queue. Discuss
applications of a circular queue.
5. Define an AVL tree. What are the properties of an AVL tree? Draw an AVL tree for the
following series
10, 16, 18, 20, 12, 15, 30.
6. Discuss bubble sort and quick sort with an example of each.
7. Define Binary Search Tree. Write a program in C to implement Binary Search Tree.
8. What is the concept of recursion? Write a program in C to explain recursion.
9. Explain the following terms with an example
Binary Tree
Push() and operations in Stack.
10. Explain various types of file organization. Also discuss their advantages and disadvantages.
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