Printed Pages – 7 (2)
(iv) The logical or mathematical model of a
E-7111
M.Sc. (Ist Semester) Examination, 2021 particular organization of data is called a
COMPUTER SCIENCE
________.
(Data Structure and Algorithm Implementation)
Time Allowed : Three Hours (v) The simplest type of data structure is
Maximum Marks : 70
________.
SECTION - A
(vi) Each node in a linked list has two pairs of
Note : Attempt any ten questions. Each question carries
______ and ______.
one mark. 10×1=10
(vii) Inserting an item into the stack when stack is
Q. 1. (i) A ________ is an acyclic digraph, which has
only one node with indegree 0, and other nodes not full is called ________ operation and
have in - degree 1. deletion of item from the stack, when stack is
(ii) A data structure where elements can be added not empty is called ________ operation.
or removed at either end but not in the middle
(a) Push, pop
is called ________.
(b) Pop, push
(iii) When new data are to be inserted into a data
structure, but there is not available space ; this (c) Insert, delete
situation is usually called ________. (d) Delete, insert
E-7111 P.T.O. E-7111
(3) (4)
(viii) Identify the data structure which allows (c) Tree
deletions at both ends of the list but insertion (d) Graph
at only one end :
(xi) There is an extra element at the head of the
(a) Input restricted dequeue
list called a ________.
(b) Output restricted dequeue
(a) Antinel
(c) Priority queue
(b) Sentinel
(d) Stack
(ix) Which of the following data structure is non (c) List header
linear type ? (d) List
(a) Strings (xii) A graph is a collection of nodes called _______
(b) Lists
and line segments called arcs or _______ that
(c) Stacks
connect pair of nodes :
(d) Graph
(a) Vertices, edges
(x) To represent hierarchical relationship between
(b) Edges, vertices
elements, which data structure is suitable ?
(a) Dequeue (c) Vertices, paths
(b) Priority (d) Graph node, edges
E-7111 P.T.O. E-7111
(5) (6)
SECTION - B (ii) Write a program for addition of two 2×2 matrix.
(Very Short Answer Type Questions)
(iii) Discuss Polish notation with suitable example.
Note : Attempt any five questions. Each question carries 2
(iv) Explain Warshall algorithm with suitable
marks. Maximum word limit 25-30 words. 5×2=10
example.
Q. 2. (i) What is a list ?
(v) Explain selection sort with suitable algorithm
(ii) What do you mean by records ?
(iii) What is stack ? and implementation.
(iv) What is queue ? (vi) Discuss linear search with suitable example.
(v) What is a graph ? (vii) Write a short note on Binary Search Tree.
(vi) What do you mean by an Algorithm ?
SECTION - D
(vii) What is a tree ?
(Essay Type Questions)
SECTION - C
Note : Attempt any three questions. Each question carries
(Short Answer Type Questions)
10 marks. Maximum word limit 500 words. 3×10=30
Note : Attempt any five questions. Each question carries
4 marks. Maximum word limit 250 words. 5×4=20 Q. 4. (i) Write a program to sort the following numbers
Q. 3. (i) Discuss two dimensional array with suitable using bubble sort :
example. 5 2 10 3 29
E-7111 P.T.O. E-7111
(7)
(ii) Write a short note on Doubly linked list and
circular linked list with suitable example.
(iii) What do you mean by Data Structure ?
Discuss various operations used in it with
suitable example.
(iv) Discuss Kruskal and Dijkstara algorithm with
suitable example.
——
E-7111 100
