Scribd
Upload
13 views2 pages

DSC Cat 2 Set 1

Uploaded by

Raja Rajeswari CSE (CS)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views2 pages

DSC Cat 2 Set 1

Uploaded by

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

R22 Register No.

NANDHA ENGINEERING COLLEGE, ERODE - 52


(An Autonomous Institution, Affiliated to Anna University, Chennai)
B.E/B.Tech. Continuous Assessment Test - II AUG 2023
AI & DS/EEE/ECE/IT/
Year : 01 Semester: 2
CSE/CSE(CS)/IoT/BME
22AIC01/22CSC01/22CCC01/22CIC01/22ITC01-DATA STRUCTURES USING C
Time : 105 minutes Maximum Marks : 60
Bloom’s Taxonomy levels
R- Remembering U- Understanding Ap-Applying
(K1) (K2) (K3)
An- Analysing E- Evaluating C- Creating
(K4) (K5) (K6)
GENERAL INSTRUCTIONS TO THE CANDIDATES
1. Candidates are instructed to answer the questions as per Bloom’s Taxonomy Knowledge level (K1
to K6)
2. Candidates are strictly instructed not to write anything in the question paper other than their register
number.
3. Candidates should search their pockets, desks and benches and handover to the Hall Superintendent/
Invigilator if any paper, book or note which they may find therein as soon as they enter the
examination hall.
4. Candidates are not permitted to bring electronic watches with memory, laptop computers, personal
systems, Walkie-talkie sets, paging devices, mobile phones, cameras, recording systems or any other
gadget/device/object that would be of unfair assistance to him/her.
5. Corrective measures as per NEC examination policies will be imposed for malpractice in the hall
like copying from any papers, books or notes and attempting to elicit the answer from neighbors.
COURSE OUTCOMES :
CO1 The student will be able to able to perform array and string operations using pointers.
CO2 The student will be able to able to manipulate different operations using linked list.
CO3 The student will be able to able to deploy different operations on stack and queue.
CO4 The student will be able to determine the structure and operations on trees
CO5 The student will be able to implement the various operations on graph

K1
Part – A (Answer All the Questions) - 6 X 2 = 12 Marks CO to Marks
K6
A1 Define peek() operation. 3 K1 2
A2 What are the applications of Queue? 3 K2 2
A3 Differentiate Single rotation and double rotation in AVL tree. 4 K2 2
A4 Define max heap with suitable example. 4 K1 2
A5 State Bi-connected graph with example. 5 K1 2
A6 Trace the applications of graph? 5 K2 2
K1
Part – B (Answer All the Questions ) - 3 X 16 = 48 Marks CO to Marks
K6
B1 (a) Write a C program to implement following ADT operations 4 K3 16
of Binary Search Tree.
1.Insertion
2. Deletion
3. Find
4. Findmin and Findmax
6. Display
(OR)
B1 (b) Construct an AVL tree for the following data 13, 8, 5, 9, 4, 6, 4 K3 16
12, 2, 1 and 3.Explain about AVL rotation.
B2 (a) Differentiate BFS and DFS with suitable example. 5 K2 16
(OR)
B2 (b) Write a C program to implement topological sort with proper 5 K2 16
example.
B3 (a) (i) Explain about euler circuit with proper example. 5 K2 4
(ii) Construct Expression tree for a b c * + d e * f + g * + 4 K3 4
(iii) Explain queue operation with suitable program. 3 K3 8
enqueue() - 4,17,13,21,9,2
dequeue() – element 4
(OR)
B3 (b) (i) Sort the given digraph using topological sort using source 5 K3 4
removal algorithm.

Write a C program to implement min priority queue 4 K2 4


(ii)
operations.
Create circular queue with following elements15,25,17,9,36 3 K3 8
(iii)
and delete one by one element using C program.

Prepared by Scrutinized by Approved by

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy