Course Name: Data Structures using C Practical
Course Code: DSC-C-BCA-122 P
Credits: 4
Course Outcomes:
The aim of this course is to enable students to
To comprehend the steps required to solve a problem in order to get the intended
result.
Learn how to properly organize information in the digital environment.
To figure out the core idea behind simple data structures and how they're
implemented.
To understand where and how the data structures are implemented in real world.
Discover how to create computer programs that are effective and optimized.
Prerequisites:
Basic knowledge of writing and understanding computer programs for solving a
problem.
Basic knowledge of C programming.
Contents:
Unit Particulars Hours Credits
No.
1. Unit Title: Sorting and Searching 30 1
Sorting:
1. Write a C program to implement Bubble Sort.
2. Write a C program to implement Selection Sort.
3. Write a C program to implement Insertion Sort.
Searching:
1. Write a C program to implement Linear / Sequential Search.
2. Write a C program to implement Binary Search.
2. Unit Title: Linked Lists: 30 1
Singly Linked List:
1. Write a C program to implement following operations using Singly
Linked List
Creation
Insertion at beginning
Insertion at end
Insertion in between (Before any node)
Insertion in between (After any node)
Traversal
Delete first node
Delete last node
Delete in between (Before any node)
Delete in between (After any node)
Delete particular node
Count no. of nodes in the list
Doubly Linked List:
1. Write a C program to implement following operations using Doubly
Linked List
Creation
Insertion at beginning
Insertion at end
Insertion in between (Before any node)
Insertion in between (After any node)
Traversal
Delete first node
Delete last node
Delete in between (Before any node)
Delete in between (After any node)
Delete particular node
Count no. of nodes in the list
3 Unit Title: Stacks: 30 1
1. Write a C program to implement following operations in STACK (using
Array)
PUSH
POP
PEEP
DISPLAY
2. Write a C program to implement following operations in STACK (using
Linked Lists)
PUSH
POP
PEEP
DISPLAY
3. Write a C program to reverse the string using the STACK.
4. Write a C program to implement recursion.
5. Write a C program to implement conversion of infix expression into
postfix expression (parentheses and non-parentheses).
4 Unit Title: Queues and Trees: 30 1
Queues:
1. Write a C program to implement following operations in SIMPLE
QUEUE (using array)
ENQUEUE (Insertion)
DEQUEUE (Deletion)
DISPLAY
2. Write a C program to implement following operations in SIMPLE
QUEUE (using Linked List)
ENQUEUE (Insertion)
DEQUEUE (Deletion)
DISPLAY
3. Write a C program to implement following operations in CIRCULAR
QUEUE (using array)
ENQUEUE (Insertion)
DEQUEUE (Deletion)
DISPLAY
Trees:
1. Write a C program to implement following operations on Binary Search
Tree using Linked List.
CREATION
INSERTION
TRAVERSAL (In-Order, Pre-Order, Post-Order)
Textbook:
1. Data and File structures using C, Publisher: Oxford, By: Reema Thareja
References:
1. Classic Data Structures Second Edition, Publisher: PHI, By: Debasis Samanta
2. An Introduction to Data Structures with Applications 2nd Edition, (2007), Publisher: Tata McGraw-Hill,
By: Jean-Paul Tremblay, Paul G. Sorenson
3. Introduction to Data Structures in C (2004), Publisher: Pearson Education, By: Ashok N. Kamthane
Webilography:
1. https://www.geekforgeeks.org/data-structure/
2. https://www.tutorialspoint.com/data_structures_algorithms
3. https://www.javatpoint.com/
4. https://www.studytonight.com/data-structures/
Accomplishments of the student after completing the Course:
After completion of this course Student would be able to
Design and implement various abstract data types.
Implement various Data Structure algorithms practically using C Programming Language.
---------------------------------
