Test -1 (ONLINE MODE)

Test Date -31 Aug 2025

• Operators: Arithmetic, relational, logical, and bitwise operators.
• Operator Precedence: Understanding the order of operations.

Unit 1: Introduction to Programming (6 hrs)

• Computer System Components: Introduction to disks, memory, processor, OS, compilers.
• Idea of an Algorithm: Steps to solve logical and numerical problems.
• Representation of an Algorithm: Flowchart and Pseudocode with examples.
• From Algorithms to Programs: Source code, variables, data types, memory locations.
• Errors and Compilation: Syntax and Logical Errors, object and executable code.

Unit 2: Operators, Conditional Branching and Loops (8 hrs)

• Operators: Arithmetic, relational, logical, and bitwise operators.
• Operator Precedence: Understanding the order of operations.
• Conditional Branching: if-else statements and evaluation.
• Loops: Iteration using for and while loops.

Unit 3: Arrays and String (6 hrs)

• Arrays: Declaration, initialization, and bound checking.
• Types of Arrays: One-dimensional (1-D) and two-dimensional (2-D) arrays.
• Strings: Character arrays and strings.

Unit 4: Function, Recursion and Pointers (9 hrs)

• Functions: Using built-in libraries and creating user-defined functions.
• Parameter Passing: Call by Value and passing arrays to functions.
• Recursion: Solving problems with recursion (e.g., Factorial, Fibonacci).
• Pointers: Introduction, defining pointers, and Call by Reference.
• Advanced Pointer Use: Use in self-referential structures.

Unit 5: User-defined Data Types and File Handling (8 hrs)

• Structure: Defining, declaring, initializing, and processing structures.
• Type Definition: Using typedef.
• Union: Definition, declaration, and usage.
• File Handling: Opening, closing, I/O operations on text and binary files.

Unit 6: Basic Algorithms (5 hrs)

• Searching: Introduction to basic searching algorithms.
• Sorting: Basic sorting algorithms (Bubble, Insertion, Selection).
• Numerical Methods: Finding roots of equations.
• Complexity: Introduction to the notion of order of complexity.