PPT 1.1.1 a. Data Structure_Introduction
PPT 1.1.1 a. Data Structure_Introduction
2
Mission of the Department
4
Program Educational Objectives
PEO1 Demonstrate analytical and design skills including the ability to generate creative solutions and foster
team-oriented professionalism through effective communication in their careers.
PEO2 Expertise in successful careers based on their understanding of formal and practical methods of
application development using the concept of computer programming languages and design principles in
accordance to industry 4.0
PEO3 Exhibit the growth of the nation and society by implementing and acquiring knowledge of upliftment of
health, safety and other societal issues.
PEO4 Implement their exhibiting critical thinking and problem- solving skills in professional practices or tackle
social, technical and business challenges.
5
Program Specific Outcomes
6
Contents
• Course Objectives
• Course Outcomes
• Program Outcomes
• Syllabus
• Introduction to Data Structure
• Importance of Data Structure
• Need of Data Structure
• Applications
Course Description
In this course, students will learn about the basic concepts of data
structures, including arrays, linked lists, stacks, queues, trees, and
graphs.
Course Objectives
• To access how the choices of data structure &
CO1 algorithm methods impact the performance of
program
11
Syllabus
Unit-1 Introduction, Arrays and Structures
Searching and Linear Search, Binary Search (Recursive and iterative, Evaluation of Polynomial,
Sorting Polynomial representation, Bubble sort, Selection sort, Insertion sort, Quick
Sort and Merge Sort.
Structure Internal representation of structure, Self –referential structure, types of self-
referential structures.
12
Syllabus
Unit-2 Stack, Queue and Linked List
Linked List Representation of linked list, linked list operations (Create, Insertion, Printing,
Deleting and Traversing), Circular Linked List, doubly linked list and Header
Linked List.
Queue Introduction & Primitive Operations on Queue, Representation using array and
linked List, Queue Operations, Types of queues, Applications of queue.
13
Syllabus
Unit-3 Trees, Graphs and Sorting
Graphs Representation of Graphs, Adjacency Matrix and List, In degree, out degree of
graph, Depth First Search and Breath First Search
14
Data Structure Introduction
• Data structure is a particular way of organizing data in a computer so that it can
be used effectively.
• An efficient data structure also uses minimum memory space and execution time
to process the structure.
• A data structure is not only used for organizing the data. It is also used for
processing, retrieving, and storing data.
• There are different basic and advanced types of data structures that are used in
almost every program or software system that has been developed. Eg- Arrays,
Trees, Graphs, Linked List etc.
Importance of Data Structure
Easy way of
organizing, retrieving, Save storage memory
Requires less time
managing, and space
storing data.
Algorithms Compilers
Designing efficient Parsing and translating
solutions to problems. programming languages.
Book References
TEXT BOOKS
• Seymour Lipchitz, Schaum's Outlines Series Data Structures TMH. J.P. Hayes,
Computer Organization and Architecture, Third Edition, TMH.
• Data Structure Theory Problem and Algorithms, R.S. Salaria, Khanna Book
Publishing Company, Delhi.
REFERENCE BOOKS
• Introduction to Data Structures Applications, Trembley&Soreson, Second
Edition, Pearson Education Robert L. Britton, MIPS Assembly Language
Programming, Pearson Prentice Hall.
• A. Tanenbaum, Y. Lanhgsam and A. J. Augenstein, Data Structures Using C++,
Prentice Hall of India, 1990
Video Links