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 | June, 2016 | |
| City, State | new delhi, |
Question Paper
No. of Printed Pages: 3 IBICS-0071
B.Tech. -VIEP -COMPUTER SCIENCE AND
ENGINEERING (BTCSVI)
Term-End Examination
0087b
June, 2016
BICS-007 DATA STRUCTURES
Time: 3 hours Maximum Marks: 70
Note: Attempt any five questions. All questions carry equal marks.
1. What is an array How are one-dimensional and two-dimensional arrays represented in memory? 7
What is a sparse matrix? How can sparse matrices be represented efficiently in memory? 7
2. Write an efficient algorithm which converts in-fix expressions into post-fix expressions. 7
What is a doubly linked list Explain the various operations on a doubly linked list with suitable algorithm. 7
3. Write a program to implement a Queue using a linked list. 7
Write short notes on the following:
Stack
Circular Queues
4. A binary tree has nine nodes. Its Inorder and Preorder traversals' node sequences are
Inorder E A C K F H D B G
Preorder: F A E K C D H G B
Draw the tree. 5
Explain the properties of a threaded binary tree. 4
Prove that a binary tree with n leaves contains 2(n nodes. 5
5. Discuss the methods of storing a graph in a computer. 7
Explain depth first search techniques for graph traversal using suitable examples. 7
6. Write a program to search a value in a stored array using binary search. 7
Explain Hashing. Discuss the various Hash functions with examples. 7
7. Write a program to sort the elements of an array using selection sort technique. 7
Sort the following data using bubble sort technique: 7
44, 33, 11, 55, 22.
8. Write short notes on any four of the following: 4x3!.-=14
Static and Dynamic Tree Table
Hamiltonian Path
Eulerian Path
Planar Graphs and their application
Time and Space Complexity
Garbage Collection
B.Tech. -VIEP -COMPUTER SCIENCE AND
ENGINEERING (BTCSVI)
Term-End Examination
0087b
June, 2016
BICS-007 DATA STRUCTURES
Time: 3 hours Maximum Marks: 70
Note: Attempt any five questions. All questions carry equal marks.
1. What is an array How are one-dimensional and two-dimensional arrays represented in memory? 7
What is a sparse matrix? How can sparse matrices be represented efficiently in memory? 7
2. Write an efficient algorithm which converts in-fix expressions into post-fix expressions. 7
What is a doubly linked list Explain the various operations on a doubly linked list with suitable algorithm. 7
3. Write a program to implement a Queue using a linked list. 7
Write short notes on the following:
Stack
Circular Queues
4. A binary tree has nine nodes. Its Inorder and Preorder traversals' node sequences are
Inorder E A C K F H D B G
Preorder: F A E K C D H G B
Draw the tree. 5
Explain the properties of a threaded binary tree. 4
Prove that a binary tree with n leaves contains 2(n nodes. 5
5. Discuss the methods of storing a graph in a computer. 7
Explain depth first search techniques for graph traversal using suitable examples. 7
6. Write a program to search a value in a stored array using binary search. 7
Explain Hashing. Discuss the various Hash functions with examples. 7
7. Write a program to sort the elements of an array using selection sort technique. 7
Sort the following data using bubble sort technique: 7
44, 33, 11, 55, 22.
8. Write short notes on any four of the following: 4x3!.-=14
Static and Dynamic Tree Table
Hamiltonian Path
Eulerian Path
Planar Graphs and their application
Time and Space Complexity
Garbage Collection
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