CHSE Odisha Elective Computer Science study plan

Distinguish the functional blocks of a computer (CPU, ALU, control unit, registers, cache, primary and secondary memory, input/output units) and state the role of each in one line

Trace the fetch–decode–execute cycle for a simple instruction and identify which register holds the address, the instruction and the operand

Compare primary and secondary storage and classify given devices and media as input, output, or storage

Write, compile and run C programs that declare variables of each basic data type, read input with scanf and print formatted output with printf

Apply arithmetic, relational, logical and assignment operators, and predict the result of expressions involving precedence and type conversion

Implement decision making with if, if–else, nested if, else–if ladder and switch, and choose the correct construct for a stated problem

Write for, while and do–while loops to solve classic problems such as sum of digits, reversal, palindrome check, prime test and star patterns

Break a program into user-defined functions, explain the difference between call by value and call by reference, and demonstrate recursion with factorial and Fibonacci

Convert integers and fractions between binary, octal, decimal and hexadecimal, and subtract signed 8-bit numbers using 1's and 2's complement

State the range of values representable in 8-bit sign-magnitude, 1's complement and 2's complement form and explain overflow

Declare, initialise and traverse one-dimensional and two-dimensional arrays, and implement matrix addition, transpose and multiplication

Manipulate strings using both character arrays and the string.h functions strlen, strcpy, strcat and strcmp, and write at least two of these from scratch

Simplify Boolean expressions with the standard identities, including De Morgan's laws, and prove each simplification with a truth table

Minimise 2- and 3-variable expressions using Karnaugh maps and express the result in both SOP and POS form

Identify the symbols and truth tables of AND, OR, NOT, NAND, NOR and XOR gates, and explain why NAND and NOR are called universal gates

Explain pointer declaration, the address-of and dereference operators, and pointer arithmetic on an int array

Use pointers to swap two values and to pass arrays and pointers into functions, and distinguish this clearly from call by value

Define structures, declare arrays of structures, and access members through both the dot operator and the arrow operator with a pointer

Open, write, read and close text files using fopen, fprintf, fscanf and fclose, and handle a NULL file pointer safely

Trace a program containing a pointer and a structure on paper, drawing the memory layout with addresses and values

Implement a stack using both an array and a singly linked list, and state the overflow and underflow conditions for each

Convert an infix expression to postfix and evaluate a postfix expression using a stack, showing the stack contents at every step

Implement a linear queue and a circular queue, and explain why the circular version avoids the wasted-space problem

Perform insertion, deletion and traversal on a singly linked list, and compare its memory behaviour with an array

Compare linear search with binary search and trace bubble, selection and insertion sort on a given list, stating the time complexity of each

Define the relational model terms tuple, attribute, domain, degree, cardinality, primary key, candidate key and foreign key, and identify each in a given table

Draw an entity–relationship diagram for a small scenario and map it to tables, then normalise those tables to second and third normal form while naming the dependency removed at each step

Write DDL statements (CREATE TABLE with constraints, ALTER TABLE, DROP TABLE) and DML statements (INSERT, UPDATE, DELETE) that execute without errors

Write SELECT queries using WHERE, ORDER BY, DISTINCT, GROUP BY, HAVING and the aggregate functions COUNT, SUM, AVG, MIN and MAX

Write join queries across two related tables and a simple subquery, and explain the difference between WHERE and HAVING

Compare bus, star, ring and mesh topologies on cost, fault tolerance and performance, and distinguish LAN, MAN and WAN with an example of each

Map the seven OSI layers to the four TCP/IP layers and place protocols and devices (hub, switch, router, gateway) at the correct layer

Explain IP addressing, identify the class and default mask of a given IPv4 address, and convert between dotted-decimal and CIDR notation for simple subnets

Describe how DNS resolves a name, how HTTP request and response work, and the roles of FTP and SMTP in a mail transfer

Distinguish circuit switching from packet switching and compare guided media (twisted pair, coaxial, optical fibre) with unguided media

Write valid HTML5 pages using headings, paragraphs, lists, tables, images, hyperlinks and a form with text fields, radio buttons, checkboxes and a submit button

Apply CSS through inline, internal and external styles, and use selectors, colour, font and box-model properties to control a page layout

Distinguish the multimedia types (text, graphics, audio, video, animation) and match common file formats to their typical use

Re-attempt every previously wrong practice question across all seven domains and write a short note explaining the corrected reasoning

Complete two full-length timed mock papers under exam conditions and review each error immediately afterwards