Page No.

: 2
Page No.: 1
Q6. What are the various factors to be considered in deciding a [2]
NIMS UNIVERSITY sorting algorithm?
RAJASTHAN, JAIPUR (Examination May 2025)
Q7. Convert the following infix expression to postfix. [2]
A + B * (C ^ D - E) ^ (F + G * H ) - I
Course Name:- BCA / B. Sc. (IT)
Semester: - II
Q8. Differentiate between simple binary tree and binary search tree. [2]
Subject Name: Data Structure Using C
-
Enrollment No: - MM: 70 Q9. Define recursion with suitable example. [2]
Roll No.: - Time: 3 Hours
Q10. What is priority queue? How it is different from a simple queue. [2]
Note: - 1. It is compulsory to write Enrollment No. and Roll No. in
given space on question paper by the student before writing in Section – B [35 Marks]
Answer Book. The invigilator must check and verify it. (Attempt any five questions from this Section)
2. Question paper is divided into three sections:
Section-A (Very Short Answer), Section-B (Short Answer), Q1. What do you mean by time and space complexity of an [7]
Section-C (Long Answer). algorithm? What are the different asymptotic notations used for
3. Section-A is compulsory, attempt any five questions from complexity measurement.
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. Explain the difference between elementary data item and group [2] (a) stack and queue (b) Simple link list and Circular link list
data item with example.
Q4. Write the algorithm to perform following operations on linear [7]
Q2. Write the algorithm to count the number of even and odd [2] array. Also explain the working of these operations with example.
elements in a linear array of integers. (i) insertion of element at kth index
(ii) deletion of element from kth index
Q3. Differentiate between link list and array. [2]
Q5. Write down algorithm for inserting and deleting elements from [7]
Q4. What is the advantage of circular queue over ordinary queue? [2]
a circular queue implemented using arrays.
Q5. Differentiate between sorting and searching. [2]
P.T.O.
P.T.O.
 Page No.: 3
Q6. Write the algorithm to evaluate a postfix expression using stack. [7]
Also explain its implementation with example.

Q7. Given the following in-order and pre-order traversal reconstruct a [7]
binary tree. (Show all steps)
In-order – D, G, B, E, A, F, I, C
Pre-order – A, B, D, G, E, C, F, I

Section – C [15 Marks]

Q1. (a) What is binary tree? Explain with example and graphical [10]
representation, how binary tree is implemented through by
(i) Link List (ii) Array.
(b) Discuss various basic operations performed on a binary tree. [5]

Q2. (a) What is data structure? Discuss the criteria for the selection of
appropriate data structure. What are the various operations [7]
generally performed on data structure?
(b) Give classification of data structure and explain the need of
various data structure with suitable example. [8]