DEPARTMENT OF INFORMATION TECHNOLOGY

MIT Campus, Anna University, Chennai - 600 044.

IT5352 – PROGRAMMING AND DATA STRUCTURES
Regulation 2019
Course Outcomes
CO1: Develop C programs for any real world/technical application.
CO2: Apply advanced features of C in solving problems.
CO3: Write functions to implement linear and non–linear data structure operations.
CO4: Suggest and use appropriate linear/non–linear data structure operations for solving a given problem.
CO5: Appropriately use sort and search algorithms for a given application.
CO6: Apply appropriate hash functions that result in a collision free scenario for data storage and retrieval.

3/8 B.Tech -IT Assessment Test II Maximum Marks:50

Date : 19/12/2023 Time : 11/2 hours
Part-A (5X2=10)

Q.No Questio Marks CO Blooms

ns Level
1 Compare array and linked list. 2 3 1

2 Suppose a queue is maintained by a circular array. QUEUE with N=12 memory 2 3 2

cells. Find the number of elements and positions of FRONT and REAR in QUEUE
if FRONT =9 and REAR=5 and then four elements are deleted. Show the QUEUE.
3 Write a program segment to open a file with file name “123.txt”, and write one line 2 2 2
of text into it.
4 What are expression trees? Represent the following expression using a tree. 2 4 2
(x+ ((y/z)*w)-u)

5 What is a macro? How do you use it? 2 4 2

Part-B (2X13=26)

Q.No Questions Marks CO Blooms

Level
Write a C program to define a structure called Height which is defined in terms of Feet 8 2 3
6.a. i and inches. Write suitable functions to read, display, addition and subtraction of two
heights.
Suppose you want to store the height of a student in one of the following formats. FPS
6.a.ii system – it is a string like 5’10’’ (use char array) and CGS system –it is an integer like 5 2 3
178(use int data type). How can you store the height in an efficient way? Illustrate.

OR
6.b.i Develop a C program that reads employee information (e.g., name, employee ID, salary) 8 2 3
from a file. Calculate the net salary by deducting taxes and other deductions. Write the
updated employee records back to the file.
6.b.ii 5 2 3

7.a.i Write suitable ADT operations to multiply two polynomials using singly linked list. 8 3 3
7.a.ii Write the pseudo code for evaluating any postfix expression. Simulate how the following 5 3 3
postfix expression is evaluated using stack 1 2 3 3 ^ ^ - 4 5 6 * + 7 * -
OR
7.b.i Simulate the result of inserting 45,39,56,12,34,78,32,10,89,54,67,81 one at a time into an 3 4 3
initially empty binary search tree.
 Delete the elements 10,12,45 one by one from the above binary search tree. 3 4 3

7.b.ii

7.b.iii Write suitable ADT’s to perform insertion and deletion operations in a binary search tree. 7 4 3

Part-C (1X14=14)

Q. No Questions Marks CO BL

16.a. 7

16.b 7