Karnataka II PUC Computer Science (KSEAB) study plan

Convert 20 values among binary, octal, decimal and hexadecimal by hand, and compute the 1's and 2's complement of ten 8-bit numbers showing every step.

Classify input devices, output devices and memory types (RAM, ROM, cache, secondary storage) by function and state one distinguishing feature for each of at least twelve devices.

Explain how characters are represented in ASCII, ISCII, Unicode and EBCDIC, and give one concrete difference between any two of them.

Write algorithms and matching flowcharts for five problems (sum of n numbers, largest of three, factorial, Fibonacci series, prime check), then write pseudocode for two of them.

Answer ten short-answer questions on computer generations, block diagram of a computer and bus/CPU components without looking at notes.

Define class, object, encapsulation, abstraction, inheritance and polymorphism, then match each of ten given scenarios to the OOP principle it illustrates.

Write, compile and run five C++ programs that declare int, float, char, double and bool variables and print their sizes and ranges using sizeof.

Convert ten algebraic expressions into C++ expressions respecting operator precedence and associativity, and predict the output of eight mixed-type expression snippets before running them.

Use if, if-else, nested if, switch and all three loops to write six programs: grade calculator, largest of three, sum of digits, multiplication table, reverse a number, and a star pattern.

Finish control-structure practice by writing nested-loop pattern programs and examples using break, continue and goto, dry-running each on paper before typing it.

Declare, initialise and traverse one-dimensional arrays of int, float and char, and write programs for sum, average, maximum/minimum, linear search and bubble sort.

Implement three two-dimensional array programs: matrix addition, matrix multiplication and transpose, printing results in row-column form.

Manipulate C-style strings both with and without , writing programs for length, copy, concatenation, comparison and palindrome checking.

Write functions demonstrating call by value versus call by reference, default arguments, inline functions and function overloading, and state in one line each how the compiler resolves every call.

Implement recursion for factorial, Fibonacci and GCD, and trace the full call stack and return values for factorial(5) on paper.

Define structures, nested structures and arrays of structures, and write a program that stores five student records and prints the topper with total and average marks.

Define a class with private data members and public member functions, create multiple objects, and show what happens when a private member is accessed from main().

Write classes using default, parameterised and copy constructors plus a destructor, and state exactly when each of the four is invoked during object creation and destruction.

Overload unary and binary operators (++, +, -, ==) once as member functions and once as friend functions, and explain which operand becomes the argument in each style.

Implement a class using static data members and a static member function, and show how the shared counter changes as three objects are created and destroyed.

Use friend functions and the this pointer in small programs, and give one situation where each is necessary rather than optional.

Implement single, multilevel, multiple, hierarchical and hybrid inheritance, and tabulate how public, protected and private derivation change the access of base-class members.

Resolve ambiguity in multiple inheritance using the scope resolution operator and virtual base classes, and state the constructor execution order for a three-level hierarchy.

Declare pointers, apply pointer arithmetic, create pointers to objects, arrays of pointers and use the this pointer, including a program that swaps two values through pointers.

Read and write text files with ofstream, ifstream and fstream using the in, out, app, ate and binary open modes, including one program that copies a file into a second file.

Compare bus, star, ring, tree and mesh topologies and LAN, MAN and WAN on cost, fault tolerance and ease of expansion, then choose the best fit for four described scenarios with reasons.

Map the seven OSI layers onto the TCP/IP model and match TCP, UDP, IP, HTTP, FTP, SMTP, POP3, DNS and DHCP to their layer and purpose.

Explain IP addressing, domain names, URL structure, web browsers, search engines, firewalls and cyber ethics, giving one concrete example of each.

Write SQL statements for CREATE TABLE with primary and foreign keys, INSERT, UPDATE, DELETE, SELECT with WHERE, ORDER BY, GROUP BY and HAVING, the five aggregate functions, and a two-table join.

Build HTML pages using headings, paragraphs, ordered and unordered lists, hyperlinks, images, tables and a form with text fields, radio buttons, checkboxes, submit and reset buttons.

Re-attempt the week-1 self-test and both milestone papers, and log every question still scoring below 70% into a single revision sheet.

Compile a one-page syntax sheet covering number-system conversions, C++ declarations and operator rules, SQL clauses and HTML tags, and revise from it only.

Work through the textbook chapter-end exercises for the two domains with the lowest mock scores, writing full answers under timed conditions.