smude.edu.in Model Question Paper : Sikkim Manipal University Distance Education

Name of the Organaisation : Sikkim Manipal University Distance Education (smude.edu.in)
Type of Announcement : Model Question Paper Data Structure Using C

Home Page : http://smude.edu.in/

Sikkim Manipal University
Model Question Paper
Subject: Data Structure Using C
Subject code: MC0068
Total Time: 2 hours
Total Marks: 140

Notes:
1. Question paper is divided into three parts i.e. Part A, Part B, and Part C.
2. Part A consist 40 questions of one mark each
3. Part B consist 20 questions of 2 marks each.
4. Part C consist 15 questions of 4 marks each.
5. All questions are compulsory

Part A (One Mark Question)
1) int a[]={5,4,3,2,1} What is the value of a[3]?
a. 2 b. 3 c. 4 d. 1
2) float a[10]; What is the size of the array?
a. 10 b. 20 c. 30 d. 40
3) Array is
a. Primary data type
b. Homogeneous data type
c. Pointer data type
d. Heterogeneous data type
4) Array index can be started from 1?
a. Yes b. No
5) To accept 100 different values into the array we require:
a. Loop b. If condition c. Function d. Structure
6) Pointer holds
a. Value of variable
b. Address of variable
c. Value and address of variable
d. Always null

Part B (Two Mark Question)
1) Which of the following data structure may give overflow error, even though the current number of elements in it is less than its size?
a. Stack
b. circular queue
c. simple queue
d. none of the above
2) The basic problem of space utilization has been removed by
a. Stack
b. Circular Queue
c. Double Ended Queue
d. Queue Size
3) What is the difference between Stack & Queue?
a. Storage Structure
b. Memory Allocation
c. Algorithm
d. All of the Above
4) Queue can be represented by
a. Array
b. Link List
c. Tree
d. Only a) and b) is correct
5) Queue is
a. Linear Data Structure
b. Non Linear Data Structure

11) If an integer occupies 4 bytes and a character occupies 1 byte of memory, each element of the following structure would occupy how many bytes? struct name { int age; char name[30]; }; a. 32 b. 34 c. 30 d. 2 12) A structure brings together a group of
a. items of the same data type
b. related data items and variables
c. integers with user defined names
d. floating points with user defined names
13) To identify a member element of a structure we use :
a. dot (.) operator b. plus(+) operator c. * operator d. & operator
14) When the structure is accessed through pointer then we use to access member elements by
a. Dot (.) operator b. * operator c. ?operator d. & operator
15) We can create array of structure:
a. Yes b. No
16) The data structure has the following components
a. Algorithm, storage structure and function of implementation
b. Algorithm, data type and function of implementation
c. Function, storage structure and program
d. Algorithm, data structure and program
17) In linked list, the successive element
a. Must occupy contiguous locations in memory
b. Need not occupy contiguous space in memory
c. Must not occupy contiguous locations in any situation
d. None of the above
18) Link pointer variable in linked list contain address of the
a. Following node in the list
b. Current node in the list
c. First node in the list
d. None of the above
19) Which of the following liner list structure allow both insertion and deletion at only one end?
a. Queue b. Stack c. Circular queue d. d) None of the above
20) Pick out invalid statement from following : Queues can be used for
a. The line printer b. Access to disk storage c. Function call d. Main Memory Access
21) In Stack we insert data from:
a. Front End b. Rear End c. Both End d. Top End
22) The Stack overflow occurs when
a. When stack contains maximum elements
b. When stack contains minimum elements
c. When stack contains half of the maximum elements
d. When stack is empty
23) Stack maintains the algorithm
a. LIFO b. FIFO c. FILO d. LILO
24) The stack is easy to maintain by
a. Array b. Link List c. Structure d. Union
25) Application of Stack is :
a. Function Call b. Storage data in memory c. Dynamic memory allocation d. Structure definition

See more question get here : https://www.indianjobtalks.in/uploads/6905-MC0068-%20data%20structure%20using%20c.pdf