Course Detail

Course Description

C Language
Day Chapter Topics Hours
Day 1
Computer Basics
Block diagram, CPU & Memory Unit 1
Day 2
What is S.W, types of S.W
introduction to programming languages
1
Day 3 Steps involved in program development 1
Day 4
Day 5
Algorithms & Flow Charts 2
Day 6 Introduction to c History , Features, C program rules 1
Day 7 Structure of c program 1
Day 8
C Tokens
(Identifiers, Keywords, Constants, Operators, Special
characters)
1
Day 9
C Data Types
(Primitive, Derived, User Defined)
1
Day 10
Day 11
Basic programs
I/O statements (printf, scanf)
Programs to perform various calculations
2
Day 12
Day 13
Operators
(Arithmetic, Relational, Logical, Assignment,
Increment and Decrement, Bit-wise, Ternary, sizeof() )
2
Day 14
Day 15
Programs using operators 2
Day 16
Day 17
Day 18
Control statements
Conditional control statements
If else, switch 3
Day 19
Day 20
Day 21
Loops
while, do-while, for
3
Day 22
Jumping Statements
Goto, Continue, Break
1
Day Chapter Topics Hours
Day 23
Day 24
Day 25
Arrays
Array definition, Advantages, types
implementing Single dimensional arrays
implementing Multi-dimensional arrays
3
Day 26
Day 27
Day 28
Day 29
Functions
Function definition, Advantages
Types of functions
Functions classification
(return value, not return value, parameters, without
parameters)
Implementing various kinds of functions
Recursion, storage classes
4
Day 30 Applying Math functions 1
Day 31
Day 32
Day 33
Strings
Definition, declaration
Applying various operations on strings
Applying predefined string functions
3
Day 34
Day 35
Day 36
Day 37
Pointers
Definition, advantages
Declaration, assigning address, accessing data using
pointers, pointer operations, array implementation with
pointer, call by reference, Dynamic memory allocation
4
Day 38
Day 39
Day 40
Structures
Definition, advantages,
Structure definition, implementation of structure, array of
structures, structure as return type & parameters to
function, pointer implementation using structures, Dynamic
Memory Allocation using structures
3
Day 41 Unions
Definition, Definition and implementation, Difference
between structures and unions
1
Day 42
Day 43
Day 44
Files
Definition, advantages,
Performing various operations on files(write, read, modify,
search)
Command line arguments,
3
Data structures
Day Topics Options Covered Hours
Day 1
Introduction
Definition, Advantages
Classification of Data Structures
i) Primitive data structures
ii)Non primitive data structures
a) Linear data structures
b)Nonlinear data structures
1
Day 2 Stacks(LIFO’s)
Definition, advantages, operations
implement Stack using array
1
Day 3
Day 4
Queues(FIFO’s)
Definition, advantages, operations
Types(linear, circular)
Implement Linear Queue using array
Implement Circular Queue using array
2
Day 5
Day 6
Day 7
Day 8
Day 9
Linked lists
Definition, advantages, Linked List Structure
Types of Linked Lists
1) Singular Linked List
Implementing create, insert, search, delete operations
on singular linked lists
Implementing create, insert, search, delete operations
on single circular linked lists
2) Double Linked List
Implementing create, insert, search, delete operations
on double linked lists
Implementing create, insert, search, delete operations
on double circular linked lists
Implementing Stack operations using linked list
Implementing Queue operations using linked list
Implementing DEQueue operations using linked list
5
Day Topics Options Covered Hours
Day 10
Day 11
Searching’s
Definition of Linear search, implementing of Linear search
Definition of Binary search, implementing Binary search
2
Day 12
Day 13
Day 14
Sorting’s
Implementing various sorting techniques
Linear sort, selection sort, bubble sort, insertion sort, merge
sort, quick sort, Radix sort
Comparing time complexities of sorting’s
3
Day 15
Day 16
Day 17
Day 18
Trees
Definition, terminology (siblings, root, branch, leaf, degree)
Binary Tree definition, representation of binary
tree(sequential, linked list), Traversals, complete binary tree,
full Binary Tree, Binary Search Tree.
Implementing Binary Search Tree operations, insert,
display, delete, search
4
Day 19
Day 20
Day 21
Graphs
Definition, advantages, types(directed, undirected), graph
representations(Adjacency Matrix, Adjacency List, Graph
Traversals(DFS, BFS) implementing DFS & BFS, Spanning
Tree definition, Kruskal’s Algorithm, Warshall’s Algorithm,
Dijkstra’s Algorithm
3