Scribd
Upload
13 views

cd3291 Datastructur Summary Data Structure and Algorithm

Uploaded by

Krishnakaarthik Thirunavakkarasu
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
13 views

cd3291 Datastructur Summary Data Structure and Algorithm

Uploaded by

Krishnakaarthik Thirunavakkarasu
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

Reg.

N
o
JAYA ENGINEERING COLLEGE
[AFFILIATED TO ANNA UNIVERSITY, CHENNAI]
Thiruninravur– 602 024, Thiruvallur Dt., Tamil Nadu.

INTERNAL ASSESSMENT EXAMINATION – II


DEGREE :B.E. / B.Tech(2021-Regulation)
SEMESTER :03
BRANCH :CSE
Sub. Code/ Sub. Name: CD3291-Data structure and Algorithm
Time: 3 Hours Date: 28.10.2023 Maximum Marks: 100
Answer ALL the questions
PART – A (10 x 2 = 20 Marks)

Q.No. Questions STANDARD OF


QUESTION
1. Explain the term Data structure? LO
2. What is abstract data type? LO
3. Define Big theta notation. LO
4. What do you mean by worst case- efficiency of an algorithm? LO
5. Define the term linear data structure. IO
6. What is linked list? IO
7. Write any two applications of stack IO
8. Difference between singly and Double linked list IO
9. What is stack? IO
10. Define dequeue. LO

PART – B (5 x 13 = 65 Marks)
Q.No. Questions STANDARD OF
QUESTION
11. a. Explain the features and characteristics of Object Oriented IO
Programming with suitable examples.
(OR)
b. Derive the Recurrence relation for Fibonacci series algorithm IO
and also explain about Average case Analysis.
12. a. Explain the method of Divide and Conquer with example. IO

(OR)
b. Explain in detail about Inheritance.
IO

13. a. Explain the concept about abstract data types and its LO
implementation.
(OR)

1
b. Explain the concept of Namespace. IO
14. a. Explain about Array based implementation. LO

(OR)
b. Explain in detail about the operations performed in stack. LO
15. a. Explain the concept of doubly linked test. LO

(OR)
b. Explain the concept of linked list and its types. LO

PART – C (1 x 15 = 15 Marks)
Q.No. Questions STANDARD OF
QUESTION
16. a. Elaborate on asymptotic notations with examples. HO

(OR)
b. Implement various operations of circular linked list using HO
python.

Subject In-charge HOD

You might also like