DATA STRUCTURE With C
Objective of the Course:
Using a fundamental computer model as a prototype, the program
highlights the very intimate link between data structure. This program focuses
on basic algorithms and problem solving techniques, understanding Array, link
list, stack, queue, tree and graph.
Learning Outcomes:
After completing the course student able to choose appropriate data
structure as applied to specified problem definition. And also able to use linear and non-linear
data structures like stacks, queues , linked list .
Duration of the Course (in hours) 80 hrs
Minimum Eligibility Criteria and Basic Knowledge of C/C++/java
programming
Pre-requisites, if any
Syllabus
|
|
|
|
|
|
|
S. No |
Topic |
|
Minimum No. of
Hours |
|
|
01. |
|
05 hrs |
||
|
Linear Data Structure: |
|
|||
|
02. |
Linked List
(Singly, Doubly, Circular) |
10 hrs |
||
|
03. |
STACK |
05 hrs |
||
|
Non-linear Data Structure |
|
|||
|
04. |
Queues |
05 hrs |
||
|
05. |
Trees |
10 hrs |
||
|
06. |
Graphs |
05 hrs |
||
|
Sorting AND Searching |
|
|||
|
07. |
Sorting |
|
05 hrs |
|
|
08. |
Searching |
|
05 hrs |
|
|
|
|
Theory / Lecture Hours: |
50 hrs |
|
|
|
|
Practical / Tutorial: |
30 hrs |
|
|
|
|
Total Hours: |
80 hrs |
|