Scribd
Upload
10 views

Deep Concept of Data Structure Using C

data structure using c for diploma students

Uploaded by

Aayush Kharkia
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

Deep Concept of Data Structure Using C

data structure using c for diploma students

Uploaded by

Aayush Kharkia
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CSE42D:DATA STRUCTURE USING C

L:4 T:0 P:0 Credits:4

Course Outcomes: Through this course students should be able to

CO1 :: Illustrate how the choice of data structures and algorithm design methods impacts the
performance of programs.

CO2 :: Apply how to solve problems using data structures such as linear arrays, linear lists.

CO3 :: Classify the working of various types of linked lists.

CO4 :: Focus to implement stacks, queues with their application.

CO5 :: Demonstrate various application of complex data structures like trees and graphs

CO6 :: Analyze the performance of various sorting algorithms in data structures

Unit I
Fundamental Notations : Problem solving concept, top down and bottom up design, structured
programming, Concept of data types, variables and constants, Concept of pointer variables and
constants
Unit II
Arrays : Concept of Arrays, Single dimensional array, Two dimensional array and storage strategy of
multidimensional arrays, Operations on arrays with Algorithms (searching, traversing,inserting,
deleting)
Unit III
Linked Lists : Introduction to linked list and double linked list, Representation of linked lists in
Memory, Traversing a linked list, Searching linked list, Insertion and deletion into linked list,
Application of linked lists, Doubly linked lists, Traversing a doubly linked lists, Insertion and deletion
into doubly linked lists
Unit IV
Stacks, Queues and Recursion : Introduction to stacks, Representation of stacks, Implementation
of stacks, Uses of stacks, Introduction to queues, Implementation of queues (with algorithm), Circular
Queues, Dequeues, Recursion
Unit V
Trees and Graphs : Concept of Trees, Concept of representation of Binary tree, Binary search trees
Traversing Binary Trees (Pre order, Post order and In order), Searching, inserting and deleting binary
search trees, Terminology of Graphs, Depth first search, Breadth first search
Unit VI
Sorting and Searching : Introduction, Search algorithm (Linear and Binary), Concept of sorting,
Bubble sort, Insertion Sort, Quick Sort, Selection Sort, Merge Sort

Text Books:
1. DATA STRUCTURES by SEYMOUR LIPSCHUTZ, MCGRAW HILL EDUCATION

References:
1. DATA STRUCTURES USING C by REEMA THAREJA, OXFORD UNIVERSITY PRESS

2. DATA STRUCTURE USING C by MANOJ KUMAR, EAGLE PRAKASHAN

3. DATA STRUCTURES USING C by E BALAGURUSAMY, Tata McGraw Hill, India

4. DATA STRUCTURE AND ALGORITHM USING C by RS SALARIA, KHANNA PUBLISHERS

Session 2022-23 Page:1/2


Session 2022-23 Page:2/2

You might also like