This document outlines the course objectives, contents, and outcomes for a Data Structures course using C programming. The course aims to provide practical knowledge of how data is stored in memory and perform operations on data using C. It covers arrays, stacks, queues, linked lists, trees, searching, and sorting algorithms. Students will learn to implement linked data structures, write recursive methods, analyze algorithms, and solve problems using techniques like quicksort, mergesort, and heaps.

1. B.Sc. Computer Science Honours-Semester III
Data Structures Using C
Course Code: CSC307 L-4, T-2, P-0, C-5
Objective:
To give the practical knowledge and the concept of how the data is exactly stored in memory. It also
gives
knowledge to perform different operations on data using concept of C programming and become familiar
with basic techniques of algorithm analysis with writing recursive methods
Course Contents
Unit-I
Introduction: Basic Terminology, Elementary Data Organization, Data Structure operations, Algorithm
Complexity and Time-Space trade-off. Arrays: Array Definition, Representation and Analysis, Single and
Multidimensional Arrays, address calculation, application of arrays, Character String in C.(Lecture 08)
Unit-II
Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push & Pop, Array
Representation of Stack, Linked Representation of Stack, Applications of stack: Conversion of Infix to
prefix and Postfix Expressions, Evaluation of postfix expression using stack. Recursion: Recursive
definition
and processes, recursion in C, example of recursion.
Queues: Array and linked representation and implementation of queues, Operations on Queue: Create,
Add,
Delete, Full and Empty. Circular queue, double ended queue and priority queue. (Lecture 08)
Unit-III
Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List,
Traversing
and Searching of Linked List, Overflow and Underflow, Insertion and deletion to/from Linked Lists,
Garbage Collection and Compaction.
Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, Complete
Binary Tree. Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary
trees, Binary Search Tree (BST), Insertion and Deletion in BST, Path Length. (Lecture 08)
Unit-IV
Searching Sequential search, binary search, comparison and analysis. Sorting: Insertion Sort, Bubble
Sorting,
Quick Sort, Two Way Merge Sort, Heap Sort, Binary Search. (Lecture 08)
Unit-V
Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Representations of
Graphs, Adjacency Matrices, Traversal. (Lecture 08)
Course Outcome:
On Successful completion of the module students will be able to:
� Be familiar with basic data structure of algorithms.
� Be familiar with writing recursive methods by using C.
� Master the implementation of linked data structures such as linked lists and binary trees.
� Be familiar with advanced data structures such as balanced search trees, hash tables, priority queues
data structure.
� Be familiar with several searching and sorting algorithms including quick sort, Merge Sort and Heap
Sort.
� Master analyzing problems and writing program solutions to problems using the above techniques