0% found this document useful (0 votes)
2 views

PPT 1.1.1 a. Data Structure_Introduction

The document outlines the vision, mission, program outcomes, educational objectives, and specific outcomes for a Bachelor of Computer Application course focused on Data Structures. It details the course content, objectives, outcomes, and the importance of data structures in solving computational problems efficiently. Additionally, it includes a syllabus covering various data structures and their applications in real-world scenarios.

Uploaded by

servator1234
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

PPT 1.1.1 a. Data Structure_Introduction

The document outlines the vision, mission, program outcomes, educational objectives, and specific outcomes for a Bachelor of Computer Application course focused on Data Structures. It details the course content, objectives, outcomes, and the importance of data structures in solving computational problems efficiently. Additionally, it includes a syllabus covering various data structures and their applications in real-world scenarios.

Uploaded by

servator1234
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 21

UNIVERSITY INSTITUTE OF COMPUTING

Bachelor of Computer Application


Subject Name: Data Structure
24CAP-151/24SCT-151
VISION

To be a Centre of Excellence for nurturing computer professionals with


strong application expertise through experiential learning and research
for matching the requirements of industry and society instilling in them
the spirit of innovation and entrepreneurship.

2
Mission of the Department

M1. To provide innovative learning centric facilities and quality-


oriented teaching learning process for solving computational problems.
M2. To provide a frame work through Project Based Learning to
support society and industry in promoting a multidisciplinary activity.
M3. To develop crystal clear evaluation system and experiential
learning mechanism aligned with futuristic technologies and industry.
M4. To provide doorway for promoting research, innovation and
entrepreneurship skills incollaboration with industry and academia.
M5. To undertake societal activities for upliftment of rural/deprived
sections of the society.
3
Program Outcomes
• PO1 Apply mathematics and computing fundamental and domain concepts to find out the solution of defined problems and requirements. (Computational
Knowledge)
• PO2 Use fundamental principle of Mathematics and Computing to identify, formulate research literature for solving complex problems, reaching appropriate
solutions. (Problem Analysis)
• PO3 Understand to design, analyze and develop solutions and evaluate system components or processes to meet specific need for local, regional and global public
health, societal, cultural, and environmental systems.
• PO4 (Design /Development of Solutions)Use expertise research-based knowledge and methods including skills for analysis and development of information to
reach valid conclusions. (Conduct Investigations of Complex Computing Problems)
• PO5 Adapt, apply appropriate modern computing tools and techniques to solve computing activities keeping in view the limitations. (Modern Tool Usage)
• PO6 Exhibiting ethics for regulations, responsibilities and norms in professional computing practices. (Professional Ethics)
• PO7 Enlighten knowledge to enhance understanding and building research, strategies in independent learning for continual development as computer applications
professional. (Life-long Learning)
• PO8 Establishing strategies in developing and implementing ideas in multi- disciplinary environments using computing and management skills as a member or
leader in a team. (Project Management and Finance)
• PO9 Contribute to progressive community and society in comprehending computing activities by writing effective reports, designing documentation, making
effective presentation, and understand instructions. (Communication Efficacy)
• PO10 Apply mathematics and computing knowledge to access and solve issues relating to health, safety, societal, environmental, legal, and cultural issues within
local, regional and global context. (Societal and Environmental Concern)
• PO11 Gain confidence for self and continuous learning to improve knowledge and competence as a member or leader of a team. (Individual and Teamwork)
• PO12 Learn to innovate, design and develop solutions for solving real life business problems and addressing business development issues with a passion for quality
competency and holistic approach. (Innovation and Entrepreneurship)

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

PSO1 Analyze their abilities in systematic planning, developing, testing


and executing complex computing applications in field of Social-Media
and Analytics, Web Application Development and Data Interpretations.
PSO2 Apprise in-depth expertise and sustainable learning that
contributes to multi-disciplinary creativity, permutation, modernization
and study to address global interest.

6
Contents

• Course Objectives
• Course Outcomes
• Program Outcomes
• Syllabus
• Introduction to Data Structure
• Importance of Data Structure
• Need of Data Structure
• Applications
Course Description

Data Structures is a course that focuses on the study of various data


structures and algorithms used in computer science.

The course covers the theoretical foundations of data structures, as well


as practical techniques for implementing and manipulating them.

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

• To Solve problems based upon different data


CO2 structure & also write programs

• Choose an appropriate data structure for a particular


CO3 problem.

• To efficiently implement the different data


CO4 structures. 9
Course Outcomes
C • Infer the knowledge of basic data structures and
O their implementations
1
C • Ascertain the strength and weakness of different
O data structures
2
C • Figure out the algorithmic complexity of simple,
O non-recursive programs
3
C • Develop novel solutions to small scale programming
O challenges involving data structures and recursion
4
C • Select sensibly appropriate data structures and
O algorithms for problems and to justify that choice
5 10
Program Outcomes
• PO1 Apply mathematics and computing fundamental and domain concepts to find out the solution of defined problems and requirements. (Computational
Knowledge)
• PO2 Use fundamental principle of Mathematics and Computing to identify, formulate research literature for solving complex problems, reaching appropriate
solutions. (Problem Analysis)
• PO3 Understand to design, analyze and develop solutions and evaluate system components or processes to meet specific need for local, regional and global public
health, societal, cultural, and environmental systems.
• PO4 (Design /Development of Solutions)Use expertise research-based knowledge and methods including skills for analysis and development of information to
reach valid conclusions. (Conduct Investigations of Complex Computing Problems)
• PO5 Adapt, apply appropriate modern computing tools and techniques to solve computing activities keeping in view the limitations. (Modern Tool Usage)
• PO6 Exhibiting ethics for regulations, responsibilities and norms in professional computing practices. (Professional Ethics)
• PO7 Enlighten knowledge to enhance understanding and building research, strategies in independent learning for continual development as computer applications
professional. (Life-long Learning)
• PO8 Establishing strategies in developing and implementing ideas in multi- disciplinary environments using computing and management skills as a member or
leader in a team. (Project Management and Finance)
• PO9 Contribute to progressive community and society in comprehending computing activities by writing effective reports, designing documentation, making
effective presentation, and understand instructions. (Communication Efficacy)
• PO10 Apply mathematics and computing knowledge to access and solve issues relating to health, safety, societal, environmental, legal, and cultural issues within
local, regional and global context. (Societal and Environmental Concern)
• PO11 Gain confidence for self and continuous learning to improve knowledge and competence as a member or leader of a team. (Individual and Teamwork)
• PO12 Learn to innovate, design and develop solutions for solving real life business problems and addressing business development issues with a passion for quality
competency and holistic approach. (Innovation and Entrepreneurship)

11
Syllabus
Unit-1 Introduction, Arrays and Structures

Introduction Pointers and Dynamic memory allocation, Types of data structures,


Mathematical notation and functions, Algorithm Analysis: Space Complexity,
Time Complexity, Asymptotic Notation and Algorithmic complexity, Abstract
Data Type.

Array Array Introduction, Types, Applications, Operation on an array

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.

Stack Introduction & Primitive operations on stack, memory Representation of Stack


via arrays and Linked List, Stack Operations, Application of Stack , Evaluation of
Expression: Evaluation of Postfix expression, Infix to Postfix and prefix forms
for expressions.

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

Trees Definition, Terminology, Representation, Binary tree: Introduction,


Representation of Binary Tree and its types, Traversal (In-order, Pre-order,
Post-order). Binary Search Tree, Heap Tree and its Types, AVL/Height Balanced
Tree

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

Problem-Solving Efficient AlgorithmsMemory Manageme


Data structures provide The choice of data Data structures help
the tools and techniques structure can greatly optimize memory usage
to solve complex influence the efficiency by storing and retrieving
problems by organizing and performance of data in an organized
and managing data algorithms, leading to manner, reducing waste
effectively. faster and more scalable and improving overall
solutions. system performance.
Need Of data Structure

Easy way of
organizing, retrieving, Save storage memory
Requires less time
managing, and space
storing data.

Data representation Easy access to the Modification of Data


is easy large database is easy
Applications of Data
Structures

Databases Operating Systems


Efficient storage and Managing memory,
retrieval of data. files, and processes.

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

Introduction to Data Structures


THANK YOU

Created by: Mehak Bhatia (E16757)


[email protected]

You might also like