Scribd
Upload
9 views21 pages

Session 01

Uploaded by

trailholly72
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views21 pages

Session 01

Uploaded by

trailholly72
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

Data Structure and

Algorithms

Dr. Subhra Rani Patra


SCOPE, VIT Chennai
30.11.2021
Question Pattern for Quizzes and CATs

 MCQs and short answers can be typed (by students) in MOODLE


 Diagrams / mathematical derivations / rough work / schemes / flow charts
and similar other materials can be uploaded by the student for evaluation.
 MCQs
 more than one correct answer model can be followed.
 Questions and choices shall also be shuffled
Attendance

 student class attendance is mandatory.


 Student shall be permitted to appear for CAT – I and CAT – II only if he / she
has a minimum of 75% attendance (as per rule 9.0 pointers are exempted).
 Answer sheets will not be evaluated even if he / she appears for the
examination.
 Appearing for the examination, by debarred students, can be considered
as a „practice‟ for those students. This might help him / her to enhance the
learning outcomes.
 However, mark posting will be disabled in VTOP for students who shall be
debarred for CAT I and II.
CSE2011
Course objectives
• Learn basic data structures and algorithms
• data structures – how data is organized
• algorithms – unambiguous sequence of steps
to compute something
• algorithm analysis – determining how long an
algorithm will take to solve a problem

• Become a better software developer


• "Data Structures + Algorithms = Programs"
Algorithms Programs

• Design • Implementation
• Domain Knowledge • Programmer
• Any language • Programming language
• H/W and OS independent • H/W and OS dependent
• Analyze • Testing
Session Objectives

 To understand the concepts of


– Data structures
– Types of Data Structures
– Applications
– Algorithms
What is Data Structure?
Data structure is a way to “organize data” that enables it to be processed in an
efficient time
Types of data structures
Array

Linked List

Queue Stack
Tree

There are many, but we named a few. We’ll learn these


data structures in great detail!
What is an Algorithm?

A set of rules to be followed to solve a problem

Example- Lets say we want to prepare a homemade salad for dinner


Real life examples
Queue
Tree
Graphs
Searching
Sorting
Insertion
Deletion
Updation
The data structures can also be classified on the basis
of the following characteristics:
Characterstic Description
Linear In Linear data structures,the data items are arranged in
a linear sequence. Example: Array
Non-Linear In Non-Linear data structures,the data items are not in
sequence. Example: Tree, Graph
Homogeneous In homogeneous data structures,all the elements are of
same type. Example: Array
Non- In Non-Homogeneous data structure, the elements may
Homogeneous or may not be of the same type. Example: Structures
Static Static data structures are those whose sizes and
structures associated memory locations are fixed, at
compile time. Example: Array
Dynamic Dynamic structures are those which expands or shrinks
depending upon the program need and its execution.
2 Also, their associated memory locations changes.
0 Example: Linked List created using pointers

You might also like