About this question paper
This is the previous year question paper of IT 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 देखें।
INFORMATION TECHNOLOGY
(Data Structure and Algorithm Implementation) (a) Stack
Time Allowed : Three Hours (b) Queue
Maximum Marks : 70 (c) List
(d) Linked list
SECTION- A
Note : Attempt any ten questions. Each question carries (iii) Queue is also called as _______
one mark. 1×10=10 (a) First in first out
(i) A ________ is a data structure that organizes (c) Last in last out
data similar to a line in the super maket, where (d) Last in first out
the first one in line is the first one out : (iv) A directed graph is ______ if there is a path
(a) Queue linked list from each vertex to every other vertex in the
(b) Stack linked list digraph :
(c) Both of them (a) Weakly connected
(3) (4)
(c) Tightly connected (viii) The number of comparisons done by
(v) In the ______ traversal we process all of a (a) N 21
vertex's descendants before we move to an
adjacent vertex :
(a) Depth first
(d) Depth limited of every element in the list :
(vi) In ______, search start at the beginning of the
list and check every element in the list : (a) Stack
(vii) Which of the following is not the internal sort ?
(a) Insertion sort (a) Before deletion
(5) (6)
(xii) The time complexity of quick sort is ? (Short Answer Type Questions) (250 words)
(Very Short Answer Type Questions) (25-30 words) suitable example.
Note : Attempt any five questions. Each question carries (c) Write a short note on priority queue.
Q. 2. (a) Tree (e) What do you mean by sorting ? Discuss with
(b) Data suitable example.
(f) Write a program in C to find the sum and
average of seven numbers using single
dimension array.
SECTION-D
(Essay Type Questions) (More than 500 words)
Note : Attempt any three questions. Each question carries
10 marks. 3×10=30
Q. 4. (a) Write the algorithm of insertion in stack and
(b) Write a short note on Kruskal and Dijkstara
algorithm.
operations on Data Structure.
(d) Explain selection sort with suitable example
and program.