Scribd
Upload
21 views3 pages

About

Data Structures and Algorithm using C

Uploaded by

joyaljms98
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
21 views3 pages

About

Data Structures and Algorithm using C

Uploaded by

joyaljms98
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/ 3

22-382-0102 DATA STRUCTURES CATEGORY L T P CREDIT

AND ALGORITHMS
USING C CORE 3 1 0 4

Prerequisite: Mathematical Fundamentals

Course Outcomes: After the completion of the course the student will be able to

CO 1 Explain different constructs of the C programming (Cognitive level: Understand)


language.

CO 2 Describe functions, structures, and pointers in C. (Cognitive level: Understand)

CO 3 Differentiate between linear and non-linear data (Cognitive level: Understand)


structures.

CO 4 Illustrate the use of various data structures ( Heap / (Cognitive level: Analyse)
Graph) for solving a given computational problem.

CO 5 Select appropriate sorting technique for a given (Cognitive level: Analyse)


scenario and storing the given dataset using
appropriate hash function.

Mapping of Course Outcomes with Programme Outcomes - Low=1, Medium=2, High=3

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO 1 3 2 2

CO 2 3 3 2

CO 3 3 2 2 2

CO 4 3 3 3 3

CO 5 3 2 3

11
22-382-0102 DATA STRUCTURES AND ALGORITHMS USING C

UNIT I (10 Hours)


Basic Programming Constructs of C: Character Set, Identifiers and Keywords, Variables,
Constants, Operators and Expressions; Data Types: Basic data types, Array, String;Control
Structures: Conditional statements, Branching, Looping, switch, break, continue, goto
statements.

UNIT II (12 Hours)


Functions: function declaration, function definition, function prototype, function call, passing
parameters to functions, Returning value, passing arrays to functions, Recursion, Macro;
Structure: Declaration, initialization, nested structures;Union; Pointers: Pointer Variables,
Dereferencing Pointers; Dynamic Memory Allocation: malloc, calloc, realloc and free
functions.

UNIT III (12 Hours)


Elementary Data Structures: List, Stack, Queue-Array and Linked List Implementation. Non
Linear Data Structure: Trees -Binary Trees, Binary Tree traversal (In Order, Pre Order, Post
Order) Binary Search Tree: Searching an element in BST, Insertion and Removal of Elements

UNIT IV (14 Hours)


Heaps: Properties, Representations (Array Based and Linked). Min Heap, Max Heap. Insertion
and deletion of elements, Heap implementation of priority queue.
Graphs: Properties, Representations (Edge List, Adjacency list, Adjacency Matrix), Graph
Traversals (Depth First and Breadth First Search), Directed Graph.

UNIT V (12 Hours)


Sorting Techniques – Insertion Sort, Quick Sort, Merge Sort and Heap Sort
Dictionaries: Hash Tables, Hash Functions, Collision Handling Methods - Separate Chaining,
Open Addressing - Linear & Quadratic Probing, Double Hash

12
TEXTBOOK
1. “Fundamentals of Data Structures in C", by Ellis Horowitz. SartajSahni and Anderson
Freed, Edition 2, 2008, Universities Press.
2.” Mastering C”, by K.R .Venugopal, S.R Prasad Edition 11, 2011 , Reprint, Tata
McGraw-Hill.
3. “Introduction to Algorithms”, by Thomas H. Cormen, Charles E. Leiserson, Ronald
L,Edition 4.

REFERENCE BOOKS

1. “The C Programming Language”,by Kernighan, Brain W and Ritchie, Dennis


M,Edition 2,2007, Prentice Hall.
2. “Programming with C”, Byron Gottfried,Edition 2, 2002,Schaum’s outline series3.
3. “Data Structures using C”,by Aaron M.Tanenbaum, Moshe J.Augenstein,1986,
Prentice Hall International Inc, Englewood Cliffs, NJ.
4. “Data Structures using C”, by Aaron M Tanenbaum,YedidyahLangsam, Moshe J
Augenstein, 2009,Prentice Hall International, Inc.
5. “ Algorithms and Data Structures :The Basic Toolbox” ,by Kurt Mehlhorn and Peter
Sanders , 2008,Springer-Verlag Berlin Heidelberg.

Web Resources

NPTEL
● Data Structures And Algorithms - (Computer Science and Engineering course from
IIT Delhi) NPTEL Lecture Videos by Prof. Naveen Garg from IIT Delhi
https://www.nptelvideos.com/course.php?id=401

13

You might also like