INTRODUCTION

 Name : Sandeep Tuli

 Qualification : M.C.A.(Hons.) , M.Tech. (I.T.)
 Designation : Assistant Professor
 E-mail Id : sandeeptuli@poornima.org
 Branch : Computer Engineering
 Subjects Taught : C, OOPs, DSA, TOC, ADS, DAA,AI, PPL, S/w Engg. ,
E-Commerce, CGMT, CO, D.M.S., C.O.N.M.
 Labs Taken : C Lab, C++ Lab, CGMT Lab, DSA
Lab, DAA Lab, CONM Lab
 Books Authored : Data Structure Using C
 Paper Published : 03 in National Conference
05 in International Conference.
 ?????

UNORGANIZED LIBRARY
 ?????

ORGANIZED LIBRARY
 ?????

UNORGANIZED EXAMINAITON
 ?????

ORGANIZED EXAMINATION
 ?????

UNORGANIZED DESKTOP
 ?????

ORGANIZED DESKTOP
 SO…..
Organizing your data

&

Work on the…
DO NOW
CROSS WORD

REVISION ON C
ZERO LECTURE of
3cs2

&
Data Structure is a particular way of STORING and
ORGANIZING DATA in a computer …
… so that it can be used
EFFICIENTLY.

DATA NOW
ACCESSIBLE
 RESULTS
96 94.23
94 92.96 93.1
91.86
92
89.7
90 88.29 88.69
88 86.68
86 84.56 84.2
84
82
80
78
0 9 1 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8
0 8- 0 9- 1 0- 1 1- 1 2- 1 3- 1 4- 1 5- 1 6- 1 7-
20 20 20 20 20 20 20 20 20 20

AVERAGE RESULT
RELEVANCE TO

BRANCH
 “Algorithms
+
Data Structures ”
=
Programs”!
This subject is important for
GATE (covers 15% of the whole
syllabus) and all other
competitive exams such as
PSU’s as well as entrance
exams of various companies.
 Data structures are used in almost every program or
software system.

 Data structures provide a means to manage huge

amounts of data efficiently, such as large databases and
internet indexing services.

 Data Structure works as the key organizing factor in

software design.
RELEVANCE TO

SOCIETY
Departmental stores,
Reservation Counters,
Surfing Internet,
Hospitals,
Parties,
Traveling ETC……
RELEVANCE TO

SELF
 WELL HALF
BEGUN DONE
 step towards



success
To succeed in every field of life computer knowledge is must.

It enables us to automate the tasks,

 It gives more efficient and accurate results. Thus, helping us to

become part of today’s Computerized World.

 As a computer engineer, the job is to develop Software’s and

builds projects, and without the knowledge of data structures this work
cannot be done.

 Having the knowledge of data structures and algorithms is first step

towards success.
RELEVANCE TO

LAB
Have an efficient programming with Data structure
!!!!!!!!!!!

 The knowledge of this subject is incomplete if we are not implementing

it practically. To thoroughly understand the algorithms, it must be
implemented by various programs and software.
 There is lot of advantageous of data structures and in fact the real
programming is based around data structures only.
 Also to achieve efficiency which is the main feature of any program good
data structure techniques and features must be applied.
 We have a lab related to DSA so whatever we learn in class room we
will implement the same in that lab.
RELEVANCE TO

PREVIOUS
& LAST YEAR
 In previous year we have studied C Language. DSA is the extension of
the same.
 In this semester you are also dealing with OOPS Data Structure could
also be useful to make OOP language more efficient.
 In the coming semester you will have Advanced Data Structure (ADS)
which is again the extension of DSA and Design and analysis of
Algorithm (DAA). Both paper will required the deep knowledge of DSA.
 Apart from above many programming language use the features of Data
Structure like JAVA.
 All of the above each software can not be completed with out the use of
DATA STRUCTURE
 Course Outcomes
CO Course Outcome
To Understand the concept of array, algorithms and their
C202.1 complexity, analyze algorithms and determine the complexity and
the asymptotic performance.
To implement the array on some basic data structures like stack
C202.2
and queue, perform various operations and their applications.
To employ linear data structure, linked list, to solve various
C202.3
problems and discriminate among it's different types.
To implement and distinguished the concepts of array and linked
C202.4 list in design of non-linear data structures like tree to solve
various computing problems.
To demonstrate the knowledge of linked list and array in
C202.5 designing the graph and employ them to model various
engineering problems
To perform major sorting and searching algorithms and analyze
C202.6
their complexity and know when to apply the specific algorithm.
Data Structure:
• Definition & characteristics of algorithms, structures. Difficulties in
estimating exact execution time of algorithms,
• Concept of complexity of program,
• Asymptotic notations: Big-Oh, theta, Omega- Definitions and
examples, Determination of time and space complexity of simple
algorithms without recursion, Representing a function in asymptotic
notations viz 5n2-6n=_(n2)

Arrays: Array as storage element, Row major & column major form of
arrays, computation of address of elements of n dimensional array.
Arrays as storage elements for representing polynomial of one or
more degrees for addition & multiplication, sparse matrices for
transposing & multiplication,
Stack, Queue, De-queue, Circular queue for
• Insertion and deletion with condition for over and underflow,
• Transposition of sparse matrices with algorithms of varying
complexity (Includes algorithms for operations as mentioned).

Evaluation of Expression: Concept of precedence and associativity

in expressions, difficulties in dealing with infix expressions, Resolving
precedence of operators and association of operands, postfix & prefix
expressions, conversion of expression from one form to other form
using stack (with & without parenthesis), Evaluation of expression in
infix, postfix & prefix forms using stack. Recursion.
 
Linear linked lists:
• Singly linear linked lists
• Doubly linear linked lists
• Circularly connected linear linked lists
• insertion, deletion at / from beginning and any point in ordered or
unordered lists.
• Comparison of arrays and linked lists as data structures.
• Linked implementation of
stack, queue and dequeue.
• Algorithms for/of insertion, deletion of stack, queue, dequeue
implemented using linked structures.
• Polynomial representation using linked lists for addition, Concepts of
Head Node in linked lists.

Searching: Sequential and binary search.

Non-Linear Structures: Trees definition, characteristics concept of
child, sibling, parent child relationship etc, binary tree: different types
of binary trees based on distribution of nodes, binary tree (threaded
and unthreaded) as data structure, insertion, deletion and traversal of
binary trees, constructing binary tree from traversal results. Threaded
binary Tree. Time complexity of insertion, deletion and traversal in
threaded and ordinary binary trees.

AVL tree: Concept of balanced trees, balance factor in AVL trees,

insertion into and deletion from AVL tree, balancing AVL tree after
insertion and deletion. Application of trees for representation of sets.
Graphs: Definition, Relation between tree & graph, directed and
undirected graph, representation of graphs using adjacency matrix and
list. Depth first and breadth first traversal of graphs, finding connected
components and spanning tree. Single source single destination
shortest path algorithms.

Sorting: Insertion, quick, heap, topological and bubble sorting

algorithms for different characteristics of input data. Comparison of
sorting algorithms in term of time complexity...
 
 
 Title Author Publisher

Data Structure Seymour Lipchitz TMH

(Schaum’s Outline)

Data Structure Through C G.S.Baluja DHANPAT RAI

 Title Author Publisher
Expert Data Structure with C R. B. Patel Khanna Book
Publishing 
Data Structure using C and C++ M. Tenenbaum Pearson
Data Structure and Algorithm in C++ Adam drozdek Cengage
Learning
Fundamentals of data Structure in C Horowitz, Sahni, Anderson Universities
,freed Press
 http://www.nptel.ac.in (national program on Technology
Enchantment & Learning nptel.iiitm.ac.in)
http://www.nist.gov
http://www.ocw.mit.edu
http://www.w3professors.com

Associations & Institutions

1. COMPASS: Computer Association of Eastern India, Kolkata

www.compassindia.com
2. CSI: Computer Society of India. www/csi-india.org
3. AITTA: All India IT Association www.aitta.org

Journals & Handbooks

1. IJCSIT: International Journal of CS & IT
Publisher: Serial Publication
2. IJCIRA: International Journal of Computational Intelligence
Research & Application Publisher: Serial
Publication
3. JICA: Journal of Intelligent computing & Application
Publisher: international Science Press India.
No. of Working days available (Approx.) – 35+19
No. of Weeks (Approx.) - 16

Special Activities

BEFORE MID TERM AFTER MID TERM

REVISION OF C – 03 SOLVING QUE PAPER – 01
PPT – 03 PPT – 02
CROSSWORD – 01 OBT – 01/BATCH
CLASS TEST – 02
CLASS TEST – 03

Lecture schedule per week

i). University scheme (L+T+P) = 3+1+3
ii). PGC scheme (L+T+P) = 3+1+3
 No. of
Degree of Questio Text/
S. No. of Broad
Name of Unit difficulty n in Reference
No. lectures Area
RTU books
Exam.
Analysis of
Algorithms, Schaum’s
Data Structure,
1. 06 Time & Medium Series, G.S.
Arrays
Space 2 Baluja, R.B.
Complexity Patel
Schaum’s
Stack, Queue,
Sparse , Series,
2. Evaluation of 12 Recursion Medium 2 G.S. Baluja
Expression
Schaum’s
Operations
Series, G.S.
3.
Linked list,
Searching 11 performed
on High 2
Baluja
Polynomial
G.S. Baluja,
Non-Linear
AVL Schaum’s
4. Structures(tree),
AVL
09 Rotations High 2 Series

G.S. Baluja,
Analysis of
5. Graphs, Sorting 09 Sorting Medium 2 Schaum’s
Series
 EXAMS
%of Nature of Syllabus
Sr. Name of the Max. Conducted
passing paper Theory coverage
No. Exam Marks by
marks + Numerical (in %)

1. 1st Mid Term Exam 40 16 Theory 60% PGC

Remaining
2. 2nd Mid Term Exam 40 16 Theory PGC
40%

University (End)
3. 80 24 Theory 100% RTU
Term Exam