Paper Solution of Engineering Mumbai University

Can you please provide here the sample question paper of the BTECH CSE (computer science and engineering ) course of the Mumbai University ?

[Kiran Chandar]

As you want I am here providing you sample question paper of the BTECH CSE (computer science and engineering ) course of the Mumbai University.

Sample paper :

1. (a) What is Data structure and Abstract Data Type. 2
(b) What is AVL tree? Give example. 3
(c) What is recursion? State its advantages and disadvantages. 3
(d) What is Expression tree? Give example. 3
(e) What is Link List? State the different types of Link List. 3
(f) List out the properties of a symptotic notations 3
(g) What is Data structure for Graphs ? Explain.
3
2. (a) What is Doubly Linked List? Write an algorithm to implement following operations:
(i) Insertion (All cases)
(ii) Traversal (Forward and Backward) 10
(b) Define Binary search tree. Write an algorithm to implement Insertion and Deletion operation
10
3. (a) Write a program to implement queue using array. 10
(b) Explain in brief insetion sort and shell sort.
10
4. (a) Explain in brief:
(i) Directed Graph
(ii) Weighted Graph
(iii) Minimum spanning tree
(iv) Adjacency Matrix representation
(v) Adjacency List representation 10

5. The individual instances of a Data Object are called ___________.
a. class
b. object
c. Primitive
d. Data object
Ans. : c
6. Formulae based representation uses ______________to represent the instances of
object.
a. tree
b. link list
c. Array
d. Graph
Ans. : c
7. An example of a dynamic data structure is:
1. array
2. record
3. list


4. index
a. 1 or 3
b. 2 and 4
c. Only 2
d. Only 4
Ans. : a, Array can also be dynamically allocated using malloc
8. Which Of the following is a collection of heterogeneous elements?
a. Array
b. Structure
c. Stack
d. Queue
Ans)B
9.Which Data Structure is used to manage Printer Buffer?
a. Stack
b. Queue
c. Linked List
d. Tree
Ans)B
10. Which One of the following is a hierarchical data structure?
1. Linked list
2. Stack
3. Tree
4. None
a. 1 or 3
b. 2 or 4
c. Only 2
d. Only 4
Ans) a, Both are hierarchical structure
11. Complexity in terms of machine cycles of a data structure is measured in terms of
a. Time Complexity
b. Space Complexity
c. Mean Complexity
d. A and B
Ans)a

12. Which data structure is used in evaluating mathematical expressions with
parentheses?
a. Stack
b. Queue
c. Tree
d. Graph
Ans)A
13. Which Of the following occupies more 13. Which Of the following occupies more memory with same number of elements?
a. Array
b. Single Linked list
c. Doubly Linked List
d. Queue
Ans) c

14. Recursive function implements which mechanism?
1) Queue
2) Lifo
3) Filo
4) Fifo
a. Only 1
b. 2 or 3
c. 1 or 4
d. All
Ans) b

15. Which of the following abstract data types cannot be used to represent a many to
many relation?
1) Binary Tree
2) Graph
3) Stack
a. 1 and 2
b. 2 and 3
c. 1 and 3
d. All
Ans)C

16. An Example of linear Data structures ?
1) Array
2) Stack
3) Linked List
a. 1 and 2
b. 2 and 3
c. 1 and 3
d. All
Ans)D
17. The logical picture of data type plus the specification of operations required to create
& manipulate objects of this type is known ___
a. Structure
b. Pointer
c. ADT
d. Class
Ans)C

18. In Quick sort & Radix sort except array ________data structure is used?
a. Pointer
b. Link list
c. Double link list
d. Tree
Ans)A

19. In Counter index generation ________ data structure is used
a. Deque
b. Priority Queue
c. Circular Queue
d. Linear Queue
Ans)C

20. Simulations are implemented using _______ data structure.
a. Stack
b. Queue
c. Linked list
d. Tree
Ans)B

21. The data structures you will use if you want to go to first record from the last and
vice versa______________
a. Tree
b. Linked list
c. Stack
d. Doubly linked circular list
Ans)D

22. In RDBMS, the efficient data structure used in the Internal storage representation is
a. Binary tree
b. Stack
c. B+Tree
d. Graph
Ans)C



23. Pick the appropriate statement for the data structures from the following options
a. May be helpful to develop efficient algorithms in different phases of data
processing
b. Need not give relationship between data items
c. Is programming language dependent
d. None
Ans)A

24. Suppose you opened a notepad, a music player, an excel sheet,
and also you are doing your data structure programming simultaneously.
Your OS implements which data structure for it.
a. Stack
b. Queue
c. Tree
d. Linked list
Ans)B

25. Which of the following abstract data types
can’t be used to represent a many to many
1)Tree
2)Stack
3)Graph
a. 2 and 3
b. 1 and 3
c. 1 and 2
d. None
Ans)C

26. The Linear properties of data structure are estimated on the bases of ?
1. adjecency
2. Linearity
3. Levels
a. 2 and 3
b. 1 and 2
c. 1 and 3
d. ALL
Ans)B

27. The following are the examples of Linear Data Structures?
1. Polynomial 2. Graph 3. Trees
a. 1 and 2
b. 2 and 3
c. 1 and 3
d. None
Ans)D

28. List out the areas in which data structures are applied extensively?
1)Numerical Analysis
2)Graphics
3)Artificial Intelligence
a. 1 and 2
b. 1 and 3
c. 2 and 3
d. 1,2 and 3

Ans)D

29. Which of the following combination of data structures used in the areas : RDBMS,
Network data model and Hierarchical data model are correct
1)RDBMS– Array (i.e. Array of structures)
2)Network data model – Graph
3)Hierarchical data model – Trees
a. and 2
b. 1 and 3
c. 2 and 3
d. None
Ans)C

30. Polynomials in memory may not be maintained through
1)Linked list with header node
2)One dimensional array
3)Stack
a. 2 and 3
b. 1 and 3
c. 1 and 2
d. None
Ans)C

Here is the attachment .