ANAND INSTITUTE OF HIGHER TECHNOLOGY A
MONTHLY TEST-II
(Department of Computer Science and Business Systems)
Course Title: C PROGRAMMING AND DATA STRUCTURES Course Code: CS3353
Duration: 1hour 30 mins Date: Marks: 50marks
Class (Year/Sem): II/III
Instructions:
1. Before attempting any question paper, be sure that you got the correct question paper.
2. The missing data, if any, may be assumed suitably
Question
Question Mark BTL CO
No
Part A (5×2 = 10 Marks) Answer all Questions
BTL-1
1 Distinguish between linear data structures from non-linear data structures. 2 CO3
2 Comparison between stack and queue. 2 BTL-1 CO3
3 Difference between call by value and call by reference. 2 BTL-1 CO3
Write a procedure to insert an element in the beginning of a list ADT BTL-1
4 2 CO4
implemented using a singly linked list.
BTL-1
5 Draw the binary search tree for the following inputs.70,15,29,33,44,12,79 2 CO4
Part B (2×13 = 26 Marks)
Write a C code for singly linked list with insert, delete, and display BTL-3 CO3
6a 13
operations using structure pointers.
Or
Analyze and write algorithm for Circular Linked list for the
13 BTL-3
b following operations using structure pointer. 1) Insert 2) Delete 3) CO3
Display
BTL-2
7a Explain in details about tree traversals with an example. 13 CO4
Or
Discuss in details about Kruskal’s and prims algorithm for weighted BTL-2
b 13 CO4
undirected graph.
Part C (1×14 = 14 Marks)
Write a program to reverse a linked list using recursion. BTL-3
8a 14 CO3
Write a routine to merge given two sorted linked lists.
Or
Write and test a program that performs the operation Insert, Delete min,
BTL-3
b Build Heap, 14 CO4
Find min, Decrease Key, Delete, and Increase Key in a binary Heap.
Subject Staff HOD
AIHT/IQAC/QP/MTII/001
ANAND INSTITUTE OF HIGHER TECHNOLOGY B
MONTHLY TEST-II
(Department of Computer Science and Business Systems)
Course Title: C PROGRAMMING AND DATA STRUCTURES Course Code:CS3353
Duration: 1hour 30 mins Date: Marks: 50marks
Class (Year/Sem): II/III
Instructions:
3. Before attempting any question paper, be sure that you got the correct question paper.
4. The missing data, if any, may be assumed suitably
Question
Question Mark BTL CO
No
Part A (5×2 = 10 Marks) Answer all Questions
BTL-1
1 What is Data Structure? 2 CO3
2 Draw the classification diagram of data structures. 2 BTL-1 CO3
3 List out the operations on linear Data Structures. 2 BTL-1 CO3
4 What is binary search tree? 2 BTL-1 CO4
BTL-1
5 Difference between infix expression and postfix expression. 2 CO4
Part B (2×13 = 26 Marks)
Explain the stack ADT. state and explain the different representation of BTL-3 CO3
6a 13
stack with example
Or
Explain the procedure for converting an infix expression to a postfix
expression using stack convert the following infix expression into a
b 13 BTL-3 CO3
postfix expression: x*(w + y/2*x^(4+x)) and evaluate the obtained
postfix expression using the values (x=1, y=2, w=3)
BTL-2
7a . Explain in details about binary search tree with an example. 13 CO4
Or
(i) Construct BST for the following (20,30,10,40,50, -20,
-30,60) BTL-3
b 13 CO4
(ii) Write the algorithm to construction an expression tree and
construction an expression tree for the input ab+cde+**
Part C (1×14 = 14 Marks)
(i) Given two sorted Linked lists L1 and L2. Exemplify and write the
functions to
compute L1 ∩ L2 and L1 U L2. BTL-4
8a 14 CO3
(ii) State the advantages of Linked list over arrays. Specify any two real
time applications
of Linked list.
Or
(i) What is traversal? explain various methods of traversals.
BTL-3
b (ii) What is hash function? explain of concept of hashing table 14 CO4
with examples.
Subject Staff HOD
AIHT/IQAC/QP/MTII/001
AIHT/IQAC/QP/MTII/001
