Scribd
Upload
38 views2 pages

Data 2

The document outlines the details for the CIA Examination II for the Data Structure and Algorithm course at Pachamuthu College of Arts and Science for Women, scheduled for February 21, 2025. It includes information on the exam structure, with parts A, B, and C consisting of multiple-choice questions, short answer questions, and long answer questions, respectively. The document specifies the marks distribution and the total number of question papers required.

Uploaded by

raguraguvarma66
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
38 views2 pages

Data 2

The document outlines the details for the CIA Examination II for the Data Structure and Algorithm course at Pachamuthu College of Arts and Science for Women, scheduled for February 21, 2025. It includes information on the exam structure, with parts A, B, and C consisting of multiple-choice questions, short answer questions, and long answer questions, respectively. The document specifies the marks distribution and the total number of question papers required.

Uploaded by

raguraguvarma66
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Subject Code:23UCSC02 Subject Code:23UCSC02

Pachamuthu College Of Arts And Science For Women Pachamuthu College Of Arts And Science For Women
Dharmapuri. Dharmapuri.
CIA EXAMINATION II--FEB 2025 CIA EXAMINATION II--FEB 2025
Class&Sem:I-CS & II Time :1 Hr Class&Sem:I-CS & II Time :1 Hr
Subject:Data structure and Algorithm Marks : 25 Subject:Data structure and Algorithm Marks : 25
Date :21/02/2025 Date : 21/02/2025
PART- A (5x1=5 Marks) PART- A (5x1=5 Marks)
Answer ALL Questions. Answer ALL Questions.
1.Which queue allows insertation and deletion from both ends? 1.Which queue allows insertation and deletion from both ends?
a)Simple queue b)Circular queue c)Priority queue d)Deque a)Simple queue b)Circular queue c)Priority queue d)Deque
2.Which data structure is used for recursion? 2.Which data structure is used for recursion?
a)Queue b)Stack c)Linked list d) Tree a)Queue b)Stack c)Linked list d) Tree
3.Which tree structure is used for expression evaluation? 3.Which tree structure is used for expression evaluation?
a)Binary search tree b)AVL tree c)Expression tree d)B+tree a)Binary search tree b)AVL tree c)Expression tree d)B+tree
4.Which of the following is a balanced binary search tree? 4.Which of the following is a balanced binary search tree?
a)AVL tree b)Binary tree c)Threaded tree d)Expression tree a)AVL tree b)Binary tree c)Threaded tree d)Expression tree
5.Which traversal is used for breath-first-search(BFS) in a tree? 5.Which traversal is used for breath-first-search(BFS) in a tree?
a)Preorder b)In order c)Post order d)Level order a)Preorder b)In order c)Post order d)Level order
PART – B (2×5=10 Marks) PART – B (2×5=10 Marks)
Answer Any TWO questions out of three. Answer Any TWO questions out of three.
6.How to convert infix expression to postfix expression? 6.How to convert infix expression to postfix expression?
7.What is AVL tree and its operations? 7.What is AVL tree and its operations?
8.What is heap data structure and its applications? 8.What is heap data structure and its applications?
PART – C (1×10=10Marks) PART – C (1×10=10Marks)
Answer either Aor B of the following questions Answer either Aor B of the following questions
9.a)Explain queue and its types with operation. 9.a)Explain queue and its types with operation.
(OR) (OR)
b)Explain binary search tree and its operation. b)Explain binary search tree and its operation.

QPS HOD COE Principal QPS HOD COE Principal

Total Number of QP Require:43 Total Number of QP Require:43

You might also like