C Programming N2n Programme

Level 01:  Novice

Module 01: Introduction to C Programming

What is C?

Why C?

Getting Started With C:

Constants , Variables , Keywords

Datatypes

Memory Allocation

Rules for Declaration , Assignment

Your First C Program

What Exactly Happened? / Code Analysis

Number System Conversion

Static Vs Dynamic Memory Allocation (Level 01)

Module 2: Decision Control:

If-else Statement

Nested if-else

Forms of if and Else

Exersise L1.1

Module 03: Looping

While Loop

Do-while Loop

Difference Between While and Do-while

Break Statement

Continue

Nested Looping

Exersise L1.2

Module 04: Case Control

Switch Case

Switch Vs if Else Ladder

Goto Keyword

Using Switch Case

Exersise L1.3

Module 05: Functions

What is Function?

Why Function?

Function Defination

Function Declaration

Scope of Utilising Functions

Exersise L1.4

Module 05: Advanced Functions and Pointers

What is a Pointer?

Why Use Pointer?

Call by Value

Call by Reference

Function Calling

Recursion

Exersise L1.5

Module 06: Arrays

What is an Array?

Utility of Array

Static Vs Dynamic Memory Allocation (Level 02)

Array Initialization

Passing Array Elements to a Function

Passing the Entire Array Elements to a Function

2-dimentional Arrays

Memory Mapping

Matrix Operations

Pointers and 2d Arrays

Pointer to an Array

Passing 2d Array to a Function

Exersise L1.6

--------------------------------------------------------test 01--------------------------------------------------------

Level: Basic

Unit 01: Theory

Number of Questions 30

Time 60 Mins

Unit 02: Practical Execution / Coding Round

Number of Question / Case Study: 2

Time: 20 Mins

Level 02:  Intermediate

Module 01: Array of Pointers

Module 02: Strings

What is a String?

Slandered Library Functions

Array of Pointers to Strings

Limitation of Array of Pointers to Strings

Exercise L2.1

Module 03: Structures

Basics of Structures

Structures, Why?

Uses of Structures

Exercise L2.2

Module 04: Sorting

Regular Sorting

Selection Sorting

Bubble Sorting

Heap Sorting

Exercise L2.3

Module 05: Pattern Prinnting

Exercise L2.4

--------------------------------------------------------test 02--------------------------------------------------------

Level: Intermediate

Unit 01: Theory

Debug the Code/ Find Error / Correct the Code: 30

Time 60 Mins

Unit 02: Practical Execution / Coding Round

Number of Question / Case Study: 2

Time: 20 Mins

Level 03: Ninja

Ninja Module 1: Flow Chart Algorithm

Exercise L3.1

Ninja Module 2: Data Structures

What is Data Structure?

Types of Data Structure

Data Structures. Why?

Stack (Analysis and Algorithm)

Queue (Analysis and Algorithm)

Linked List (Analysis and Algorithm)

Tree (Analysis and Algorithm)

Graph (Analysis and Algorithm)

Exercise L3.2

Ninja Module 3: Misselenious

Exercise L3.2

--------------------------------------------------------test 03--------------------------------------------------------

Level: Hard

Unit 01: Theory

Debug the Code/ Find Error / Correct the Code:  30 Questions

Time 60 Mins

Unit 02: Practical Execution / Coding Round

Number of Question / Case Study: 2

Time: 20 Mins