About Me

header ads

Data Structures Using C (BEC405D)

Data Structures Using C

Course Code BEC405D 
CIE Marks 50
Teaching Hours/Week (L: T:P: S) 3:0:0:0 
SEE Marks 50
Total Hours of Pedagogy 40 
Total Marks 100
Credits 03 
Exam Hours 03
Examination nature (SEE) Theory



Module-1

Arrays:1D,2D and multidimensional.

Pointers: Definition and Concepts, Array of pointers, Structures and unions. Array of structures,

pointer arrays, pointer to structures. Passing pointer variable as parameter in functions

Dynamic memory allocation: malloc(), calloc(), realloc() and free function.

Introduction to data structures and algorithms

Text book 1 -Chapter-1.1-1.3 except Rational Numbers.

Text Book 2, chapter-2




Module-2

The Stack – Definition and examples, primitive operations, Example. Representing Stacks in C,

Example:Infix,Postfix and Prefix,converting an Expression from Infix to Prefix and Program.

Text Book -1-Chapter – 2.1-2.3

Recursion – Recursive Definition and Processes, Recursion in C, Writing Recursive Programs.

Recursions - Text Book -1-Chapter – 3.1-3.3




Module-3

Queues and Lists – The Queue and its sequential representation, Linked Lists, Lists in C.

Other Lists structures – Circular Lists, Stacks, Queues as circular list. The Josephus problem ,doubly

linked lists.

Linked lists and Queues - Text Book -1-Chapter – 4.1-4.3,4.5




Module-4

Trees – Binary Trees, binary tree representations, Huffman algorithm, Trees and their applications.

Searching – Basic searching Techniques, Tree Searching.

Trees - Text Book -1-Chapter – 5.1-5.3,5.5,7.1,7.2




Module-5

Hashing – Introduction, Static Hashing, Dynamic Hashing

Text Book 3 -8.1 – 8.3

Graphs - Graph representation, Elementary graph operations, Minimum cost spanning Trees –

Kruskal’s Algorithm, Prim’s algorithm

Text Book 3 - 6.1,6.2,6.3.1,6.3.2




Suggested Learning Resources:

TEXT BOOKS:

1. Data Structures using C and C++, Yedidyah, Augenstein, Tannenbaum, 2nd Edition, Pearson

Education, 2007.

2. Data Structures using C, Reema Thareja, 2nd Edition, Oxford University Press, 2011

3. Fundamentals of Data structures in C, 2nd Edition, Horowitz, Sahni, Anderson freed

Universities Press,2008




REFERENCEBOOKS:

1. Reema Thareja, Computer fundamentals and programming in C, second edition, Oxford

University Press.

2. Gilberg and Forouzan, Data Structures: A Pseudo-code approach with C, 2ndEd,

CengageLearning,2014.



Web links and Video Lectures (e-Resources):

• https://archive.nptel.ac.in/courses/106/102/106102064/

• https://archive.nptel.ac.in/courses/106/106/106106127/

• https://nptel.ac.in/courses/106102064

• http://elearning.vtu.ac.in/econtent/courses/video/CSE/06CS35.html

• https://nptel.ac.in/courses/106/105/106105171/

• http://www.nptelvideos.in/2012/11/data-structures-and-algorithms.html

• http://elearning.vtu.ac.in/econtent/courses/video/CSE/06CS43.html

• https://nptel.ac.in/courses/106/101/106101060/

Post a Comment

0 Comments