Exam Details
| Subject | Data Structures And Files | |
| Paper | ||
| Exam / Course | DIPLOMA - VIEP - COMPUTER SCIENCE AND ENGINEERING (DCSVI) | |
| 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: 4
IOICS.OO11
DIPLOMA -VIEP -COMPUTER SCIENCE AND
ENGINEERING (DCSVI) I ADVANCED
LEVEL CERTIFICATE COURSE IN COMPUTER
SCIENCE AND ENGINEERING (ACCSVI)
Term-End Examination 00286 June, 2016
OICS-001 DATA STRUCTURES AND FILES
Time: 2 hours Maximum Marks: 70
Note: Question no. 1 is compulsory. Attempt any four questions from the remaining.
1. Choose the correct answer. 7x2=14
How many elements will be there in A
50
100
17
None of the above
Which of the following gives the memory address of integer variable a
Va;
Address(a);
The order followed by Queue Data structure is
FIFO
LIFO
Random
None of the above
One can convert an infix expression to postfix expression using a
Stack
Queue
Array
None of the above
Pointer Arithmetic is permitted on any type of pointers.
True
False
A linear search is always used in a sorted array.
True
False
An array element need not occupy contiguous memory location.
True
False
2. What is an array? Write a program in C to sum two matrices. 7
What is a function? Differentiate between call by value and call by reference with examples. 7
3. What is a pointer How can a pointer be used in a multidimensional array? 7
Explain different file operations. Differentiate between sequential and random access files. 7
4. Sort the following elements using bubble sort: 7
10, 20, 30, 25, 45, 60, 2
Write a program to sort an array's elements using selection sort. 7
5. Write an algorithm for binary search and explain it with the help of a suitable example. 7
Write a C program to pop an element from a stack. 7
6. Write the algorithm for evaluating a postfix expression. 7
Explain Linear Queue and compare it with Circular Queue. 7
7. Define the binary tree representation. Explain primitive operations on a binary tree. 7
Write an algorithm for creating a minimum spanning tree. 7
8. Write short notes on any four of the following: 4x3 1/2=14
Recursion
Priority Queue
Circular Linked List
Hashing Function
Abstract Data Types
Structure and Union
IOICS.OO11
DIPLOMA -VIEP -COMPUTER SCIENCE AND
ENGINEERING (DCSVI) I ADVANCED
LEVEL CERTIFICATE COURSE IN COMPUTER
SCIENCE AND ENGINEERING (ACCSVI)
Term-End Examination 00286 June, 2016
OICS-001 DATA STRUCTURES AND FILES
Time: 2 hours Maximum Marks: 70
Note: Question no. 1 is compulsory. Attempt any four questions from the remaining.
1. Choose the correct answer. 7x2=14
How many elements will be there in A
50
100
17
None of the above
Which of the following gives the memory address of integer variable a
Va;
Address(a);
The order followed by Queue Data structure is
FIFO
LIFO
Random
None of the above
One can convert an infix expression to postfix expression using a
Stack
Queue
Array
None of the above
Pointer Arithmetic is permitted on any type of pointers.
True
False
A linear search is always used in a sorted array.
True
False
An array element need not occupy contiguous memory location.
True
False
2. What is an array? Write a program in C to sum two matrices. 7
What is a function? Differentiate between call by value and call by reference with examples. 7
3. What is a pointer How can a pointer be used in a multidimensional array? 7
Explain different file operations. Differentiate between sequential and random access files. 7
4. Sort the following elements using bubble sort: 7
10, 20, 30, 25, 45, 60, 2
Write a program to sort an array's elements using selection sort. 7
5. Write an algorithm for binary search and explain it with the help of a suitable example. 7
Write a C program to pop an element from a stack. 7
6. Write the algorithm for evaluating a postfix expression. 7
Explain Linear Queue and compare it with Circular Queue. 7
7. Define the binary tree representation. Explain primitive operations on a binary tree. 7
Write an algorithm for creating a minimum spanning tree. 7
8. Write short notes on any four of the following: 4x3 1/2=14
Recursion
Priority Queue
Circular Linked List
Hashing Function
Abstract Data Types
Structure and Union
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
- Data Structures And Files