Anna University Regulation 2013 Information Technology (IT) CS6202 PDS 1 2marks & 16marks for all 5 units are provided below. Download link for IT 2nd SEM CS6202 Programming and Data Structures 1 Short answers, Question Bank are listed down for students to make perfect utilization and score maximum marks with our study materials.

**CS6202 – PROGRAMMING & DATA STRUCTURES – I **

**Unit III **

**Part –A **

1. What is a data structure?

A data structure is a method for organizing and storing data which would allow efficient data retrieval and usage. A data structure is a way of organizing data that considers not only the items stored, but also their relationships to each other.

2. Why do we need data structures?

x Data structures allow us to achieve an important goal: component reuse.

x Once data structure has been implemented, it can be used again and again in various applications.

3. List some common data structures.

x Stacks

x Queues

x Lists

x Trees

x Graphs

x Tables

4. How data structures are classified?

Data structures are classified into two categories based on how the data items are operated:

i. Primitive data structure

ii. Non-Primitive data structure

a. Linear data structure

b. Non-linear data structure

6. Define ADT (Abstract Data Type)

An abstract data type (ADT) is a set of operations and mathematical abstractions , which can be viewed as how the set of operations is implemented. Objects like lists, sets and graphs, along with their operation, can be viewed as abstract data types, just as integers, real numbers and Booleans.

7. Mention the features of ADT.

a. Modularity

i. Divide program into small functions

ii. Easy to debug and maintain

iii. Easy to modify

b. Reuse

i. Define some operations only once and reuse them in future

c. Easy to change the implementation

8. Define List ADT

A list is a sequence of zero or more elements of a given type. The list is represented as sequence of elements separated by comma.

A1,A2,A3…..AN Where N>0 and A is of type element.

9. What are the ways of implementing linked list?

The list can be implemented in the following ways:

i. Array implementation

ii. Linked-list implementation

iii. Cursor implementation

10. What are the types of linked lists?

There are three types

i. Singly linked list

ii. Doubly linked list

iii. Circularly linked list

CS6202 PDS 1 Unit 1 2marks & 16marks **– ****Download Here**

CS6202 PDS 1 Unit 2 2marks & 16marks **– ****Download Here**

CS6202 PDS 1 Unit 3 2marks & 16marks **– ****Download Here**

CS6202 PDS 1 Unit 4 2marks & 16marks **– ****Download Here**

CS6202 PDS 1 Unit 5 2marks & 16marks **– ****Download Here**

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

__Related Links__

For CS6202 PDS 1 Previous Year Question Papers – **Click here**

For CS6202 PDS 1 Important Questions/Answer Key – **Click here**

For CS6202 PDS 1 Lecture Notes – **Click here**

__Search Terms__

Anna University 2nd SEM IT PDS 1 2marks 16 marks

CS6202 Programming and Data Structures 1 question bank free download

Anna University IT PDS 1 short answers Regulation 2013

CS6202 2marks, PDS 1 Unit wise short answers – IT 2nd Semester