About this question paper
This is the previous year question paper of CS Data Structure and Algorithm Implementation (MSc) (Semester 1) conducted by Sant Gahira Guru Vishwavidyalaya, Sarguja (Ambikapur) (2021). Practising it helps you understand the exam pattern, important questions and marks distribution of your university.
How to prepare with this paper
- पूरा पेपर एक बार पढ़ें और जो प्रश्न आपको आते हैं उन पर निशान लगाएँ।
- देखें कि हर प्रश्न सिलेबस की किस इकाई से है — जो इकाइयाँ बार-बार आती हैं, वही सबसे ज़रूरी हैं।
- बिना नोट्स देखे 3 घंटे में पेपर हल करें, फिर अपनी किताब से उत्तर मिलाएँ।
- इसी विषय के दूसरे वर्षों के पेपर भी डाउनलोड करें और दोहराए गए प्रश्न ढूँढें।
Questions in this paper (text version)
यह टेक्स्ट मूल PDF से लिया गया है ताकि आप इसे जल्दी पढ़ और खोज सकें। सूत्र, चित्र और हिंदी टेक्स्ट सही न दिखें तो ऊपर दी गई PDF देखें।
st 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
Q. 1. (i) A ________ is an acyclic digraph, which has (vii) Inserting an item into the stack when stack is
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 ________.
(iii) When new data are to be inserted into a data (b) Pop, push
(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
linear type ? (d) List
(a) Strings (xii) A graph is a collection of nodes called _______
connect pair of nodes :
(d) Graph
(x) To represent hierarchical relationship between (a) Vertices, edges
(5) (6)
(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.
(iii) What is stack ? and implementation.
(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)
Note : Attempt any five questions. Each question carries 10 marks. Maximum word limit 500 words. 3×10=30
example. 5 2 10 3 29
(ii) Write a short note on Doubly linked list and
circular linked list with suitable example.
Discuss various operations used in it with
suitable example.
(iv) Discuss Kruskal and Dijkstara algorithm with
suitable example.