Exam Details
| Subject | Data Structure | |
| Paper | ||
| Exam / Course | B.Tech In Computer Science And Engineering (BTCSVI) | |
| Department | School of Engineering & Technology (SOET) | |
| Organization | indira gandhi national open university | |
| Position | ||
| Exam Date | December, 2016 | |
| City, State | new delhi, |
Question Paper
No. of Printed Pages 3 IBIC8-007(S) I
B.Tech. -VIEP -COMPUTER SCIENCE AND
ENGINEERING (BTCSVI)
Term-End Examjnation
December, 2016
BICS-007(S) DATA STRUCTURES
Time: 3 hours Maximum Marks: 70
Note: Attempt any five questions. All questions carry equal marks.
1. Write a program to merge two sorted arrays of dissimilar sizes. 7
What is sparse matrix Why do we need it Explain with the help of an example. 7
2. Define a spanning tree. Write an algorithm to determine maximum spanning tree of a weighted graph. Also, argue for the correctness of your algorithm. Also determine the time complexity of the algorithm. Will an edge of highest cost always be in the solution obtained? 14
3. Convert the following infix arithmetic expression into post-fix form and show the status after every step 7
D EF G
What do you mean by linked list? Write down the algorithm for insertion at the beginning of a singly linked list. 7
4. Write a short note on Garbage Collection and
Compaction. 7
Write a program to delete a node in a double linked list. 7
5. Write a program to sort an array of elements using quick sort algorithm. 7
What are the applications of the stack? 7
6. Define time complexity. Explain Big Oh notation. 7
Write an algorithm to sort an array of elements using insertion sort. 7
7. Explain Warshall's algorithm. 7
What is a Hash function Explain the different kinds of Hash functions.7
8. Write short notes on any two of the following: 2x7=14
Hamiltonian Path and Circuit
Huffman's Algorithm
Tower of Hanoi Problem
B.Tech. -VIEP -COMPUTER SCIENCE AND
ENGINEERING (BTCSVI)
Term-End Examjnation
December, 2016
BICS-007(S) DATA STRUCTURES
Time: 3 hours Maximum Marks: 70
Note: Attempt any five questions. All questions carry equal marks.
1. Write a program to merge two sorted arrays of dissimilar sizes. 7
What is sparse matrix Why do we need it Explain with the help of an example. 7
2. Define a spanning tree. Write an algorithm to determine maximum spanning tree of a weighted graph. Also, argue for the correctness of your algorithm. Also determine the time complexity of the algorithm. Will an edge of highest cost always be in the solution obtained? 14
3. Convert the following infix arithmetic expression into post-fix form and show the status after every step 7
D EF G
What do you mean by linked list? Write down the algorithm for insertion at the beginning of a singly linked list. 7
4. Write a short note on Garbage Collection and
Compaction. 7
Write a program to delete a node in a double linked list. 7
5. Write a program to sort an array of elements using quick sort algorithm. 7
What are the applications of the stack? 7
6. Define time complexity. Explain Big Oh notation. 7
Write an algorithm to sort an array of elements using insertion sort. 7
7. Explain Warshall's algorithm. 7
What is a Hash function Explain the different kinds of Hash functions.7
8. Write short notes on any two of the following: 2x7=14
Hamiltonian Path and Circuit
Huffman's Algorithm
Tower of Hanoi Problem
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
- Advanced Computer Architecture
- Artificial Intelligence
- Computer Architecture
- Computer Networks
- Computer Organisations
- Cryptography And Network Security
- Data Structure
- Data Warehousing And Mining
- Database Management System
- Design and Analysis of Algorithm
- Digital Image Processing
- Discrete Maths Structure
- E-Business
- Formal Language And Automata
- Logic Design
- Microprocessor
- Mobile Computing
- Object Oriented Programming
- Operating Systems
- Parallel Algorithms
- Pattern Recognition
- Principles of Programming Lang.
- Real Time Systems
- Software Engineering
- Software Quality Engineering
- Software Reusability
- System Programming And Compiler Design
- Theory Of Computation
- Unix Internals And Shell Programming
- Web Technology