Karnataka KSEAB SSLC JTS Programming in ANSI C study plan
Karnataka KSEAB SSLC JTS Programming in ANSI C · Give each week a clear focus.
8 weeks · About 6 hours per week
C fundamentals: character set, tokens, identifiers, keywords, data types, constants, variables, declarations & Program development: algorithm, flowchart, debugging, compilation, and simple C programs
List the 32 ANSI C keywords and classify every identifier in a given snippet as keyword, identifier, constant, or operator token
Write, compile, and run five small programs from scratch using a text editor and a command-line compiler, fixing at least one compile error in each
Distinguish valid from invalid identifiers and explain why each invalid one fails, covering underscore, digit-start, and case sensitivity rules
Declare variables of int, float, char, double, and _Bool, print their sizes with sizeof, and state the range of each integer type on the exam's assumed platform
Convert a simple word problem into an algorithm in pseudocode and a matching flowchart using standard symbols
Your checkpoint
A handwritten or typed one-page token cheat sheet plus a folder of five compiling programs with a log of the compiler errors you fixed
Operators and expressions: arithmetic, relational, logical, bitwise, assignment, increment/decrement, precedence, type conversion & Program development: algorithm, flowchart, debugging, compilation, and simple C programs
Evaluate ten mixed arithmetic, relational, and logical expressions by hand using the precedence and associativity table, then verify each with a printed program
Predict and demonstrate the difference between pre-increment and post-increment when the operand is used twice in one expression
Write programs that set, clear, toggle, and test individual bits of an unsigned int using &, |, ^, ~, <<, and >>
Demonstrate implicit conversion in mixed-type arithmetic and force conversion with casts, explaining truncation versus rounding
Trace a program containing short-circuit && and || to show which operands are skipped
Your checkpoint
A ten-row expression evaluation table with your hand-computed answers, the compiler's actual output, and a one-line reason for every mismatch
Control structures: if, if-else, switch, for, while, do-while, break, continue, goto
Write a program using if-else-if and a switch for the same grade-classification problem and note which cases each handles better
Code all three loop forms for the same summation task and state the minimum iteration count each guarantees
Use break and continue inside nested loops and trace the exact output line by line
Rewrite one goto-based loop-exit program using a flag or break, and explain why goto is discouraged
Produce a truth-table trace for a nested decision program before running it, then compare with real output
Your checkpoint
A single program file containing five control-structure exercises, each with a comment block showing your predicted output and the verified output
Functions: declaration, definition, call, parameters, return values, recursion, scope, storage classes & Arrays and strings: one- and two-dimensional arrays, string handling, standard string functions
Write functions with zero, one, and multiple parameters and with return values of different types, including a void function
Implement factorial and Fibonacci both iteratively and recursively, and trace the call stack for factorial of five
Explain the difference between pass-by-value parameters and array parameters, showing why an array argument lets the function change the caller's data
Declare local, global, static local, and register variables in one program and describe lifetime and visibility of each
Read and write one-dimensional arrays with loops, and pass a two-dimensional array to a function with the correct parameter declaration
Your checkpoint
A mini library file of six functions (three recursive, three iterative) with a main that tests each, plus a hand-drawn call-stack diagram for one recursive call
Arrays and strings: one- and two-dimensional arrays, string handling, standard string functions & Input/output and file handling: printf/scanf, character and formatted I/O, file open/close/read/write
Implement string length, copy, concatenate, and compare manually with loops, then repeat using strlen, strcpy, strcat, and strcmp from string.h
Explain the role of the terminating null character and demonstrate what goes wrong when it is missing
Use scanf and printf with width, precision, and field-width specifiers, and read a full line with fgets
Read characters with getchar and write with putchar until end of input, counting lines, words, and characters
Handle a scanf return value and clear leftover input after a failed numeric read
Your checkpoint
A word-count program that reads from standard input and reports lines, words, and characters, plus a table comparing your manual string functions with the library versions on the same test strings
Pointers: pointer declaration, pointer arithmetic, pointers and arrays, pointers and functions, dynamic memory
Declare pointers of several types, print addresses and dereferenced values, and explain the null pointer and the uninitialized pointer hazard
Demonstrate pointer arithmetic on an int array, showing that pointer plus one advances by sizeof the element
Rewrite array indexing as pointer arithmetic and pointer arithmetic as indexing, verifying identical output
Write a function that swaps two integers through pointer parameters and another that returns the largest element via a pointer
Allocate memory with malloc and calloc, check for NULL, use it as an array, and release it with free, explaining a leak and a dangling pointer
Your checkpoint
A pointer-lab program with six commented sections, each printing before and after values, including one deliberate dangling-pointer demonstration you then fix
Structures, unions, enumerations, typedef & Preprocessor directives and standard library overview
Define a struct for a student record, declare variables and arrays of that struct, and access members with dot and arrow operators
Pass a struct to a function by value and by pointer, and state the cost difference
Compare a union and a struct holding the same members by printing sizeof for each and explaining the result
Declare an enum and a typedef for a struct, then use both to shorten declarations
Use #define for constants and macros, #include for headers, and conditional compilation with #ifdef, and list five commonly used standard headers with one function each
Your checkpoint
A student-record program using a typedef struct, an array of records, a pointer-based display function, and an enum for a grade field, plus a header-comparison table
Input/output and file handling: printf/scanf, character and formatted I/O, file open/close/read/write & Program development: algorithm, flowchart, debugging, compilation, and simple C programs
Open a file in read, write, and append modes, check the fopen return value, and close every stream opened
Write records to a text file with fprintf and read them back with fscanf, then repeat with fwrite and fread on binary records
Detect end of file correctly with the fscanf or fgetc return value rather than feof alone
Work through a full sample paper under timed conditions and classify every mistake by domain
Re-derive the algorithm and flowchart for one file-handling program and debug a deliberately broken version using compiler warnings and printed traces
Your checkpoint
A timed mock test scored by domain plus a working record-file program that writes, reads back, and prints its contents, with a short error log of the bugs you fixed
Milestones
Week 2: Score at least 8 of 10 on your own expression-evaluation quiz without running the compiler first, and compile five programs cleanly with no warnings under -Wall
Week 4: Write a recursive factorial and an iterative factorial from memory, trace the recursion by hand correctly, and explain the four storage classes aloud in under three minutes
Week 6: Complete a pointer exercise set scoring at least 80 percent, including one correct malloc-and-free program with a NULL check and no leak
Week 8: Score at least 60 percent on the timed mock paper overall with no domain below 50 percent, and submit the final file-handling program running without errors