Scribd
Upload
18 views2 pages

Unit 1 Cs3251

Uploaded by

narmathaapcse
Copyright
© © All Rights Reserved
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
18 views2 pages

Unit 1 Cs3251

Uploaded by

narmathaapcse
Copyright
© © All Rights Reserved
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/ 2

Reg.No.

PGP COLLEGE OF ENGINEERING AND TECHNOLOGY, NAMAKKAL


DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
CONTNOUS INTERNAL ASSESSMENT TEST I
AD321 – DATA STRUCTURES DESIGN
Academic Year: 2023-2024(EVEN Semester)
Year/Semester &Branch: I Year/II Semester
Faculty Name: Ms.S.NARMATHA AP/CSE Date: 12.04.2024
Max. Marks: 100 Time: 3 hours
Blooms Taxonomy
Course Outcome(s) Question Numbers
Level
RE –Remembering
CO1: UN-Understanding
AP-Applying
AN-Analyzing
CO2: EV-Evaluating
CR-Creating
PART-A Answer ALL Questions (10x2=20 Marks)
1. Define data structure and how the data types are classified at the higher level? [UN] 2
2. What is recursion in data structure? [RE] 2
3. Find the ADT is linked lists that has no NULL, links justify? [RE] 2
4. List the applications of stack ADT? [AN] 2
5. Define ADT and features of ADT? [UN] 2
6. Define List ADT? [RE] 2
7. What are the ways of implementing linked list? [RE] 2
8. How double ended queue is different from circular queue? [AP] 2
9. What are the types of Analysis of Algorithms? [UN] 2
10. What are the difference between ADT and data structure? [UN] 2
PART-B Answer ALL Questions (5 X 13=65 Marks)
1 (a) (i) [UN] (13)
List out all object oriented programming concepts and explain in detail.
1
OR
(b) (i) Explain about asymptotic notations and their role in algorithmic analysis. [UN] (13)
(8)
1 (a) (i) List out and explain various operation of linked list. [UN] (13)
2
OR [UN] (16)
(b) (i) What is a deque? Explain its types and its operations with diagrammatic [UN] (13)
representation.
[UN] (16)
1 (a) (i) Explain the concepts of shallow and deep copying with an example. [UN] (8)
3
(ii) Write a short note on the ADT and Objects. [UN] (5)
OR
Reg.No.

(b) (i) Discuss the Analysis of recursive algorithm with an example. [UN] (8)
(ii Explain the concepts of python Inheritance with an example. (5)
)

1 (a) (i) Write a program to derive an ADT to perform insertion and deletion in a [UN] (8)
4 singly linked list.
(ii Discuss and write a python program to merge two sorted arrays. [UN] (5)
)
OR
(b) (i) Explain the various operations of the list ADT with examples. [UN] (13)

1 (a) (i) What is Priority Queue and analyze its implementation. [UN] (8)
5
(ii Write a program to implement the stack ADT using linked list. [UN] (5)
)

PART C (Compulsory Question) (1X15=15)

1 (a) (i) Prove or solve that the worst case time of the extraction operation on a heap [UN] (15)
6 implemented as an array is O(log n).
OR
(b) (i) Convert the given infix expression AB*C-DEF into a postfix and postfix [UN] (15)
output into prefix expressions and explain the procedure in detail. Illustrate
the steps.

Prepared by Approved by Principal


(S.NARMATHA, AP/CSE) ( HOD /CSE)

You might also like