Ask Question / Post resume

Post a reply to the thread: www.smude.edu.in Data Structure Using C Model Question Paper : Sikkim Manipal University

Your Message

Your Username:

Notes:-
1) You can copy and paste your full resume in the box below.
2) Or you can ask your question. We try to answer, as far as possible.

Title:

[QUOTE=ijt.dolora@gmail.com;272784][B][U]Name of the Organaisation [/U][/B]: Sikkim Manipal University (smude.edu.in)
[B][U]Type of Announcement [/U][/B]: Data Structure Using C Model Question Paper
[B][U]Home Page [/U][/B]: [URL]http://smude.edu.in/[/URL]
[B][U]Subject[/U][/B]: Data Structure Using C 
[B][U]Subject code[/U][/B]: MC0068
[B][U]Total Time[/U][/B]: 2 hours 
[B][U]Total Marks[/U][/B]: 140
[B][U]Notes[/U][/B]:
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

[B]Part A (One Mark Question)[/B]
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

[B]Part B (Two Mark Question)[/B]
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

[B]Part C (Four Mark Question)[/B]
1) Which of the following statements is TRUE? A B-Tree of order
a. 24 contains at least 12 key in each non root node
b. 25 contains at least 12 keys in each node
c. 24 contains at least 23 keys in each non root node.
d. None of the above.
2) What is the minimum number of keys contained in each non root node of a B-Tree of order 11?
a. 4
b. 5
c. 3
d. 1
3) If the degree of a node if 0 then the tree is called
a. Trinary Tree
b. Single Edged tree
c. Single node tree
d. Single degree tree
4) Number of all possible binary trees with 2 nodes is
a. 1
b. 2
c. 3
d. 4
5) Binary Tree Traversal is faster in
a. Ordinary Binary Tree
b. Binary Search Tree
c. Threaded Binary Tree
d. AVL Tree
6) In complete binary tree the number of nodes in level 0 is
a. 0
b. 1
c. 2
d. 3

[B][U]See more question get here [/U][/B]: [URL]http://www.smunict.com/samp%20papers/mca/mca%202/MC0068-%20data%20structure%20using%20c.pdf[/URL][/QUOTE]

All times are GMT +5.5. The time now is 12:32 AM.