Scribd
Upload
107 views4 pages

C Language: Day Topics Hours

The document outlines a 30 day training program on C language and data structures. It covers topics like basic C programming, arrays, strings, pointers, structures, file handling, stacks, queues, linked lists, trees, graphs and various searching and sorting algorithms. Key concepts and their implementations are discussed over 3 hours per day with chapters on introduction to C, control statements, functions, arrays, structures and data structures like stacks, queues and linked lists.

Uploaded by

star
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
107 views4 pages

C Language: Day Topics Hours

The document outlines a 30 day training program on C language and data structures. It covers topics like basic C programming, arrays, strings, pointers, structures, file handling, stacks, queues, linked lists, trees, graphs and various searching and sorting algorithms. Key concepts and their implementations are discussed over 3 hours per day with chapters on introduction to C, control statements, functions, arrays, structures and data structures like stacks, queues and linked lists.

Uploaded by

star
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

C Language

Day Chapter Topics Hours


Day 1 Block diagram, CPU & Memory Unit 1
What is S.W, types of S.W
Day 2 1
Computer Basics introduction to programming languages
Day 3 Steps involved in program development 1
Day 4
Algorithms & Flow Charts 2
Day 5
Day 6 Introduction to c History , Features, C program rules 1

Day 7 Structure of c program 1


C Tokens
(Identifiers, Keywords, Constants, Operators, Special
Day 8 1
characters)

C Data Types
Day 9 1
(Primitive, Derived, User Defined)
I/O statements (printf, scanf)
Day 10
Basic programs 2
Day 11 Programs to perform various calculations

Operators
Day 12 (Arithmetic, Relational, Logical, Assignment, 2
Day 13 Increment and Decrement, Bit-wise, Ternary, sizeof() )

Day 14
Programs using operators 2
Day 15
Day 16 Conditional control statements
Day 17 Control statements If else, switch 3
Day 18
Day 19 Loops
Day 20 3
while, do-while, for
Day 21
Jumping Statements
Day 22 1
Goto, Continue, Break
Day Chapter Topics Hours

Array definition, Advantages, types


Day 23
Arrays implementing Single dimensional arrays 3
Day 24
implementing Multi-dimensional arrays
Day 25
Function definition, Advantages

Types of functions
Day 26
Functions classification
Day 27 (return value, not return value, parameters, without
Functions 4
Day 28 parameters)
Day 29
Implementing various kinds of functions
Recursion, storage classes

Day 30 Applying Math functions 1


Day 31 Definition, declaration 3
Day 32 Strings Applying various operations on strings
Day 33 Applying predefined string functions
Day 34 Definition, advantages 4
Day 35 Declaration, assigning address, accessing data using
Pointers
Day 36 pointers, pointer operations, array implementation with
Day 37 pointer, call by reference, Dynamic memory allocation
Definition, advantages, 3

Day 38 Structure definition, implementation of structure, array of


structures, structure as return type & parameters to
Day 39 Structures
function, pointer implementation using structures, Dynamic
Day 40
Memory Allocation using structures

Definition, Definition and implementation, Difference 1


Day 41 Unions between structures and unions

Definition, advantages, 3
Day 42 Performing various operations on files(write, read, modify,
Day 43 Files search)
Day 44 Command line arguments,
Data structures
Day Topics Options Covered Hours
Definition, Advantages 1
Classification of Data Structures
i) Primitive data structures
Day 1 ii)Non primitive data structures
Introduction

a) Linear data structures


b)Nonlinear data structures

Definition, advantages, operations 1


Day 2 Stacks(LIFO’s)
implement Stack using array
Definition, advantages, operations 2
Day 3 Types(linear, circular)
Queues(FIFO’s)
Day 4 Implement Linear Queue using array
Implement Circular Queue using array
Definition, advantages, Linked List Structure 5
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
Day 5
Day 6
2) Double Linked List
Day 7 Linked lists
Implementing create, insert, search, delete operations
Day 8
on double linked lists
Day 9

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
Day Topics Options Covered Hours
Day 10 Definition of Linear search, implementing of Linear search 2
Searching’s
Day 11 Definition of Binary search, implementing Binary search
Implementing various sorting techniques 3
Day 12
Linear sort, selection sort, bubble sort, insertion sort, merge
Day 13 Sorting’s
sort, quick sort, Radix sort
Day 14
Comparing time complexities of sorting’s
Definition, terminology (siblings, root, branch, leaf, degree) 4
Day 15 Binary Tree definition, representation of binary
Day 16 tree(sequential, linked list), Traversals, complete binary tree,
Trees
Day 17 full Binary Tree, Binary Search Tree.
Day 18 Implementing Binary Search Tree operations, insert,
display, delete, search
Definition, advantages, types(directed, undirected), graph 3
Day 19 representations(Adjacency Matrix, Adjacency List, Graph
Day 20 Graphs Traversals(DFS, BFS) implementing DFS & BFS, Spanning
Day 21 Tree definition, Kruskal’s Algorithm, Warshall’s Algorithm,
Dijkstra’s Algorithm

You might also like