Anna University Regulation 2013 Information Technology (IT) CS6202 PDS 1 Important Questions for all 5 units are provided below. Download link for IT 2nd SEM CS6202 Programming and Data Structures 1 Answer Key is listed down for students to make perfect utilization and score maximum marks with our study materials.

UNIT 3

Part-A

1 Define ADT. Give any two examples.

2 Define Circular Doubly Linked List.

3 List out the Areas in which Data Structures are Applied Extensively.

4 Define Non Linear Data Structure.

5 What are the types of linked list?

7 Distinguish Between Linear and Non Linear Data Structures.

9 Differentiate arrays and linked lists

10 Give an Example for linked list application.

11 Binary search cannot be performed on a linked list. Examine.

12 Illustrate the use of linked list with an example.

13 Show the ways in which list ADT can be implemented.

14 Compare calloc() and realloc() function and mention its application in linked list.

15 Analyze and Write a find routine in array implementation.

16 Analyze and write the array representation of a polynomial P(x)=4×3 +6×2 +7x+9

17 Should arrays or linked lists be used for the following types of applications. Support your justification.

1. Many search operations in sorted list.

2. Many search operations in Unsorted list.

19 Develop a simple C Program to Modify a Node in a Linked List

20 Develop an algorithm for insertion operation in a singly linked list.

If you require any other notes/study materials, you can comment in the below section.

Search Terms

Anna University 2nd SEM IT PDS 1 Important Questions