Scribd
Upload
35 views

Cia 1

This document contains details of a CIA test for the Data Structures course at Sri Balaji Chockalingam Engineering College. The test has two parts: Part A contains 6 short answer questions about data structures concepts like circular queues, binary trees, and tree traversal terms. Part B contains 3 longer answer questions about linked lists, expression conversion between infix and postfix notation, expression evaluation using stacks, expression trees, and binary search trees with examples.

Uploaded by

Kavinhariharasudhan Sankaralingam
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
35 views

Cia 1

This document contains details of a CIA test for the Data Structures course at Sri Balaji Chockalingam Engineering College. The test has two parts: Part A contains 6 short answer questions about data structures concepts like circular queues, binary trees, and tree traversal terms. Part B contains 3 longer answer questions about linked lists, expression conversion between infix and postfix notation, expression evaluation using stacks, expression trees, and binary search trees with examples.

Uploaded by

Kavinhariharasudhan Sankaralingam
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

SRI BALAJI CHOCKALINGAM ENGINEERING COLLEGE, ARNI

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING


CIA TEST-I
CS2301-DATA STRUCTURE
YEAR/SEM: II/III

MAX.MARKS: 60

DATE: 20-08-2013

DURATION: 100 Mins


PART-A

(6*2=12)

(Answer All Questions)


1. What is Circular Queue?
2. Define Data Structure.
3. Compare Tree with Binary Tree.
4. Define the following.
Sibling, Height, Depth.
5. Define Linear Implementation of Tree.
6. Define Binary search Tree with example.
PART-B

(3*16=48)

7. Explain in detail about Singly linked list with all its operations.

(16)

(OR)
8. Explain in detail about Linked list implementation of stack.

(16)

9. (a) Explain with steps to convert from infix to postfix expression.

(8)

(b) Convert the Infix expression to Postfix expression (a+b*c-d)/(e*f-g)

(8)

(OR)
10. (a) Explain the concept of evaluating postfix expression with an example (8)
(b) Explain in detail about balancing the symbols using Stack

(8)

11. (a) Explain the construction of expression tree and construct the expression
tree for XYAB-*CD-/+

(12)

(b) Explain in detail about left most child, right sibling concept.

(4)

(OR)
12. Explain the concept of Binary search Tree with all its operations & construct a
Binary search Tree for 25,32,11,8,7,15,19,37,48

(16)

You might also like