Page No.
: 2
Page No.: 1
NIMS UNIVERSITY
RAJASTHAN, JAIPUR (Examination May 2025) Q6. What is data structure? Why do we need to study data structure? [2]
Q7. Convert the following infix expression into prefix. [2]
Course Name:- BCA / B. Sc. (IT)
A + B * (C ^ D - E) ^ (F + G * H ) - I
Semester: - II
Subject Name: Data Structure Using C
Q8. Define binary search tree with example. [2]
-
Enrollment No: - MM: 70
Roll No.: - Time: 3 Hours Q9. Define attribute, entity and entity set with example. [2]
Note: - 1. It is compulsory to write Enrollment No. and Roll No. in Q10. What is priority queue? How it is different from a simple queue. [2]
given space on question paper by the student before writing in
Answer Book. The invigilator must check and verify it. Section – B [35 Marks]
2. Question paper is divided into three sections: (Attempt any five questions from this Section)
Section-A (Very Short Answer), Section-B (Short Answer),
Section-C (Long Answer). Q1. Define algorithm. What are various properties of algorithm? [7]
3. Section-A is compulsory, attempt any five questions from What do you mean by time and space trade off?
Section-B, and attempt any one question from Section-C.
4. The intended marks for questions are given in brackets [ ]. Q2. Consider an array, arr[1:9, -4:1, 5:10] with a base address [7]
5. Draw & label diagrams where necessary. of 400 and the size of each element is 2 Bytes in memory.
Compute the address of element arr[5][-1][8] with the help of
Section – A [20 Marks] (i) row-major order, (ii) column-major order.
(Attempt all questions from this Section)
Q3. Distinguish between following with example of applications: [7]
Q1. How Binary Search is different from Linear Search? [2] (a) Link list and Array (b) Simple Queue and Priority Queue
Q2. List any four sorting methods. [2] Q4. What is binary tree and how it is different form a simple tree. [7]
Discuss various basic operations performed on a binary tree.
Q3. List any four application of queue in computer science. [2]
Q5. Define stack. How it is different from queue? Write the [7]
Q4. What is sparse matrix? Give one example. How it is different from [2]
other matrix? algorithm to perform PUSH and POP operations on stack
implemented using link list.
Q5. Differentiate between sorting and searching. [2]
Q6. Write the algorithm to convert an infix expression into postfix [7]
expression using stack. Explain implementation with example.
P.T.O. P.T.O.
Page No.: 3
Q7. Write the in-order, pre-order and post-order tree traversal for [7]
the given binary tree (show all steps).
Section – C [15 Marks]
(Attempt any one question from this Section)
Q1. (a) Define link list. Write the algorithm to insert a new-node in a [10]
link list (i) at the beginning (ii) after a given node (iii) at last.
Also explain the above operations with graphical representation.
(b) Define following types of link lists and explain with
[5]
appropriate example that in what circumstances these link lists are
more beneficial in compare to simple link list:
(i) Circular link list (b) Doubly link list.
Q2. (a) Write the algorithm to perform following operations on linear
array and explain the working of these operations with example. [8]
(i) insertion of element at kth index
(ii) deletion of element from kth index
(b) Differentiate between following with example:
(i) data and information
[7]
(ii) fixed length and variable length record
(iii) elementary data item and group data item
