Code No.
: 22CSC29
CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (Autonomous)
B.E. / B.Tech (ECE / EEE) III Sem (Main / Backlog) Examination December 2024
C and Data Structures
Time: 3 Hours Max Marks: 60
Note: Answer ALL questions from Part-A at one place in the same order and Part–B
(Internal Choice)
Part - A
(5Q X 2M = 10 Marks)
M CO BT
1 Identify which of the following identifiers are valid or invalid. State the (2) 1 3
reason if the identifier is invalid.
i) 2number ii) _recordCount
2 What are command line arguments? What does each argument signify? (2) 2 1
3 Give the contents of stack after performing following operations on an empty (2) 3 3
stack step by step: push(20), push(30), push(23), pop(),pop()
4 What differentiates a circular linked list from a singly linked list? (2) 4 1
5 Write any four applications of graphs (2) 5 2
Part - B
(5Q X 10M = 50 Marks)
M CO BT
6 (a) Develop a C Program to find whether a given number is prime or not. (5) 1 3
(b) Discuss the syntax of entry control statements in C. (5) 1 2
(OR)
7 (a) Give a detailed account on the various operators in C language. (5) 1 2
(b) Develop a C Program to print the first ‘N’ Fibonacci Terms. (5) 1 2
8 (a) Describe different types of file operations with examples. (5) 2 2
(b) Create a C program to accept the Book details like Book name, ISBN (5) 2 3
Number, Publisher Name from the user and retrieve those using
functions.
(OR)
9 (a) What are storage classes in C. Explain their usage with simple example? (5) 2 2
(b) Write a ‘C’ recursive function to find the Factorial of given value. (5) 2 2
10 (a) Trace the infix to postfix conversion algorithm for the given infix (4) 3 3
expression: a*(b*c-d+e/f) and convert it to postfix expression using
stack
(b) Define Stack ADT. Discuss the implementation of StackADT using (6) 3 2
Arrays.
(OR)
11 (a) Define Queue. Implement the following Queue operations using Arrays. (5) 3 2
i) Enqueue() ii) dequeue() iii) display()
(b) Trace the contents of queue after performing the following operations on (5) 3 3
an empty queue: enqueue(24), dequeue(), enqueue(73), enqueue(89),
enqueue(56), dequeue(), enqueue(47), dequeue().
Page 1 of 2
Code No.: 22CSC29
12 (a) Use linked list data structure to implement insertAtBegin() and (5) 4 3
deleteAtEnd() operations.
(b) Develop a C Program to implement a StackADT using arrays. (5) 4 3
(OR)
13 (a) Write a C program to append one linked list L1 to another linked list L2? (5) 4 3
(b) Discuss the various operations that can be performed on Doubly Linked (5) 4 2
Lists.
14 (a) What is a Binary Search Tree (BST)? Make a BST for the following (7) 5 3
sequence of numbers 45, 36, 76, 23, 89, 116, 98, 39, 41, 56, 69, 48 and
Traverse the tree in Preorder, Inorder and postorder.
(b) Discuss the various properties of Binary trees. (3) 5 2
(OR)
15 (a) Describe Graph traversals with examples. (5) 5 2
(b) Perform DFS traversal of the given graph below starting with vertex ‘A’. (5) 5 3
Show the traversal step by step.
*****
Page 2 of 2
