SYLLABUS

Unit-wise Syllabus as per JNTU Kakinada Norms:

UNIT 1

1. Algorithm / pseudo code
2. Flowchart
3. Program development steps
4. Structure of C program
5. A Simple C program
6. Identifiers
7. Basic data types and sizes
8. Constants and Variables
9. Operators:- Conditional, Arithmetic, Logical, Increment and Decrement, Bit-wise, Relational, Assignment, Special Operators
10. Expressions and Type conversions
11. Conditional Expressions
12. Precedence and Order of Evaluation.
13. Input-output statements
14. Statements and Blocks
15. if and switch statements
16. Loops- while, do-while and for statements
17. break, continue, goto and labels

UNIT 2

1. Designing structured programs
2. Functions - basics, parameter passing
3. Storage classes- extern, auto, register, static
4. Scope rules and block structure
5. User defined functions
6. Standard Library functions
7. Recursive functions
8. Header files
9. C preprocessor

UNIT 3

1. Arrays- concepts, declaration, definition, accessing elements, storing elements
2. Arrays and Functions
3. Two-dimensional and multi-dimensional arrays
4. Applications of arrays
5. Pointers- concepts, initialization of pointer variables
6. Pointers and function arguments
7. Address arithmetic
8. Character pointers and functions
9. Pointers to Pointers
10. Pointers and multidimensional arrays
11. Dynamic memory managements functions
12. Command line arguments

UNIT 4

1. Derived types - structures
2. Declaration, definition and initialization of structures, accessing structures
3. Nested structures
4. Arrays of structures
5. Structures and functions
6. Pointers to structures
7. Self referential structures
8. Unions
9. Typedef, bitfields

UNIT 5

1. Input and output - concept of a file
2. Text files and binary files
3. Streams
4. Standard I/O
5. Formatted I/O
6. File I/O operations
7. Error handling

UNIT 6

1. Searching - Linear and binary search methods
2. Bubble sort
3. Selection sort
4. Insertion sort
5. Quick sort
6. Merge sort

UNIT 7

1. Introduction to data structures
2. Singly linked lists
3. Doubly linked lists
4. Circular list
5. Representing stacks and queues in C using arrays and linked lists
6. Infix to post fix conversion
7. Postfix expression evaluation

UNIT 8

1. Trees- Binary tress
2. Terminology
3. Representation
4. Traversals
5. Graphs - terminology
6. Representation
7. Graph traversals (dfs & bfs)