Exam Details
| Subject | Data and File Structure | |
| Paper | ||
| Exam / Course | Post Graduate Diploma in Computer Application (PGDCA)/ Advance Diploma inComputer Applications (ADCA) / Masters in Computer Applications (MCA) | |
| Department | School of Computer and Information Sciences (SOCIS) | |
| Organization | indira gandhi national open university | |
| Position | ||
| Exam Date | December, 2016 | |
| City, State | new delhi, |
Question Paper
Consider the algorithm given below
scanf("%d", for (int i i n i n 10)
for (int j 1;j
printf
Calculate the complexity (with space and time) of the above code.
Write an algorithm to implement Doubly Linked List.
What is a Circular Queue Write an algorithm for insertion and deletion in a Circular Queue.
What is a Splay Tree How does it differ from a Tree?
Write an algorithm for insertion sort. Write the step-by-step working of the algorithm for the following set of data: 25,86,1,16,95,37,56
Define Sparse Matrix. Write an algorithm that accepts a 6 x 5 sparse matrix and outputs it in 3-tuple representation.
Define Binary Tree. What are the traversals in a binary tree Explain each
Explain Kruskal's algorithm with an example.
Discuss various file organisation methods. Also, list the advantages and disadvantages of each.
What is a Binary Search Tree Explain with an example. What are its limitations?
5. Write an algorithm to implement a stack. traversal with an example.
Write an algorithm that accepts two polynomials as input and prints the resultant polynomial created by the addition of the input polynomials.
scanf("%d", for (int i i n i n 10)
for (int j 1;j
printf
Calculate the complexity (with space and time) of the above code.
Write an algorithm to implement Doubly Linked List.
What is a Circular Queue Write an algorithm for insertion and deletion in a Circular Queue.
What is a Splay Tree How does it differ from a Tree?
Write an algorithm for insertion sort. Write the step-by-step working of the algorithm for the following set of data: 25,86,1,16,95,37,56
Define Sparse Matrix. Write an algorithm that accepts a 6 x 5 sparse matrix and outputs it in 3-tuple representation.
Define Binary Tree. What are the traversals in a binary tree Explain each
Explain Kruskal's algorithm with an example.
Discuss various file organisation methods. Also, list the advantages and disadvantages of each.
What is a Binary Search Tree Explain with an example. What are its limitations?
5. Write an algorithm to implement a stack. traversal with an example.
Write an algorithm that accepts two polynomials as input and prints the resultant polynomial created by the addition of the input polynomials.
Other Question Papers
Departments
- Centre for Corporate Education, Training & Consultancy (CCETC)
- Centre for Corporate Education, Training & Consultancy (CCETC)
- National Centre for Disability Studies (NCDS)
- School of Agriculture (SOA)
- School of Computer and Information Sciences (SOCIS)
- School of Continuing Education (SOCE)
- School of Education (SOE)
- School of Engineering & Technology (SOET)
- School of Extension and Development Studies (SOEDS)
- School of Foreign Languages (SOFL)
- School of Gender Development Studies(SOGDS)
- School of Health Science (SOHS)
- School of Humanities (SOH)
- School of Interdisciplinary and Trans-Disciplinary Studies (SOITDS)
- School of Journalism and New Media Studies (SOJNMS)
- School of Law (SOL)
- School of Management Studies (SOMS)
- School of Performing Arts and Visual Arts (SOPVA)
- School of Performing Arts and Visual Arts(SOPVA)
- School of Sciences (SOS)
- School of Social Sciences (SOSS)
- School of Social Work (SOSW)
- School of Tourism & Hospitality Service Sectoral SOMS (SOTHSM)
- School of Tourism &Hospitality Service Sectoral SOMS (SOTHSSM)
- School of Translation Studies and Training (SOTST)
- School of Vocational Education and Training (SOVET)
- Staff Training & Research in Distance Education (STRIDE)
Subjects
- Accounting and Financial Management
- Advanced Database Design
- Advanced Discrete Mathematics
- Advanced Internet Technologies
- Artificial Intelligence and Knowledge Management
- Communication Skills
- Computer Graphics and Multimedia
- Computer Organisation & Assembly Language Programming
- Data and File Structure
- Data Communication and Computer Networks
- Database Management System
- Database Management Systems
- Design and Analysis of Algorithm
- Discrete Mathematics
- Elements of Systems Analysis & Design
- Numerical and Statistical Computing
- Object Oriented Analysis and Design
- Object Oriented Technologies and Java Programming
- Operating System Concepts and Networking Management
- Operating Systems
- Parallel Computing
- Principles of Management and Information Systems
- Problem Solving and Programming
- Software Engineering
- Systems Analysis and Design