University College of Engineering, Kanchipuram
(A Constituent College of Anna University, Chennai)
Karaipettai, NH-4, Chennai- Bangalore Highway
INTERNAL ASSESSMENT TEST - I
CS3353 - C Programming and Data Structures
Date: 01.10.24 (FN)
Duration: 90Minutes Sem: III/II
Dept: EEE Maximum Marks: 50
PART – A (5x2=10)
(Answer All Questions)
1. List the primary Data Types in C.
2. List out the application of stack and queue.
3. What is Abstract Data Type? Give any two examples.
4. Define Binary Search Tree.
5. List the applications of Tree.
PART – B (2*13 =26)
6. a) i) Write a C Program to return the factorial of a given number. (13)
(or)
(b) i) Convert the given infix expression to a Postfix expression
(A+(B*C-(D/E^F)*G)*H) (8)
ii) Construct the Expression Tree for the above expression with a neat sketch. (5)
7. a) i) What is Stack ADT? Explain in detail about implementation of Stack ADT and write
a routine to push an element in to Stack? (13)
(or)
b) (i) Explain in detail about the types of Linked List with an example and write minimum
two routine for Linked List implementation. (13)
PART – C (1*14 =14)
8. a) i) Construct the BST (Binary Search Tree) for given element 8, 1,4,6,9,2,5,7,10,11
insert ‘8’ in to an empty BST as root and explain the tree traversal inorder, preorder and
postorder. (14)
(or)
b) i) Write a C program to find the largest element in an array. (7)
ii) Write a C program to swap two numbers without using an extra variable. (7)
*** ALL THE BEST ***
