CS6202 PDS 1 Notes, Programming and Data Structures 1 Lecture Notes – IT 2nd SEM Anna University


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

Linear Data Structures

Data structure is the structural representation of logical relationships between elements of data. In other words a data structure is a way of organizing data items by considering its relationship to each other. Data structure mainly specifies the structured organization of data, by providing accessing methods with correct degree of associations. Data structure affects the design of both the structural and functional aspects of a program.

Algorithm + Data Structure = Program

Data structures:

There are two types of data structure Linear and Nonlinear data structure.

Linear data structure:

In linear data structures, values are arranged in linear fashion. Arrays, lists, stacks and queue are examples of linear data structures in which values are stored in a sequence.


Arrays are most frequently used in programming. Mathematical problems like matrix, algebra and etc can be easily handled by arrays. An array is a collection of homogeneous data elements described by a single name.


A list is an ordered set consisting of a varying number of elements to which insertion and deletion can be made. A list represented by displaying the relationship between the adjacent elements is said to be a linear list.


A stack is one of the most important and useful non-primitive linear data structure in computer science. It is an ordered collection of items into which new data items may be added/inserted and from which items may be deleted at only one end, called the top of the stack.


A queue is logically a first in first out (FIFO or first come first serve) linear data structure. The concept of queue can be understood by our real life problems. For example a customer come and join in a queue to take the train ticket at the end (rear) and the ticket is issued from the front end of queue.

Stack ADT

x Stack is a specialized data storage structure (Abstract data type).

x Unlike arrays, access of elements in a stack is restricted.

x It has two main functions

  • push
  • pop

x Insertion in a stack is done using push function and removal from a stack is done using pop function.

x Stack allows access to only the last element inserted hence, an item can be inserted or removed from the stack from one end called the top of the stack. It is therefore, also called Last-In-First-Out (LIFO) list.

x Stack has three properties:

  • capacity stands for the maximum number of elements stack can hold
  • size stands for the current size of the stack
  • elements is the array of elements.

CS6202 PDS 1 Unit 1 notes  Download Here

CS6202 PDS 1 Unit 2 notes  Download Here

CS6202 PDS 1 Unit 3 notes  Download Here

CS6202 PDS 1 Unit 4 notes  Download Here

CS6202 PDS 1 Unit 5 notes  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 Question Bank/2marks 16marks with answers – Click here
For CS6202 PDS 1 Important Questions/Answer Key – Click here
Search Terms

Anna University 2nd SEM IT PDS 1 Lecture Notes

CS6202 Programming and Data Structures 1 Notes free download

Anna University IT PDS 1 Notes Regulation 2013

CS6202 Notes, PDS 1 Unit wise Lecture Notes – IT 2nd Semester


Comments are closed.