BSEB Inter Computer Science study plan

Sketch the block diagram of a computer from memory and write the function of the CPU, ALU, control unit, registers, cache, RAM, ROM and at least four input and output devices.

Convert 20 decimal numbers to binary, octal and hexadecimal and back, and represent 8 negative decimal values in 8-bit 1's and 2's complement, checking every answer by reversing the operation.

Construct truth tables for AND, OR, NOT, NAND, NOR and XOR, then write the Boolean expression for 10 two-level gate circuits described in words.

Simplify 10 Boolean expressions using De Morgan's laws, distribution and absorption, and prove each simplification with its own truth table.

State in five bullet points each the difference between analog and digital computers, and between system software and application software, and give two examples of each software type.

Write, compile and run 10 short C programs covering printf/scanf input-output, every primitive data type, and the arithmetic, relational, logical and assignment operators.

Hand-trace and then verify on a machine the output of 8 programs using if-else-if ladders, nested if and switch-case, including one program with a deliberate fall-through case.

Write 6 loop programs from scratch: sum of digits, reverse of a number, prime check, factorial, Fibonacci series and a nested-for pattern printer.

Predict the result of 15 mixed-type expressions before running them, then explain each result using operator precedence and implicit versus explicit type conversion.

Reproduce from memory the size and format specifier of each C data type and the syntax of if, if-else, switch, while, do-while and for.

Write 8 C programs that define and call user-defined functions, including two call-by-value examples and two recursive ones (factorial and Fibonacci).

Declare, initialise, pass to functions and search one-dimensional and two-dimensional arrays in 6 programs, and manipulate strings both with and without string.h.

Open, write, read and append to a text file using fopen, fprintf, fscanf, fgets and fclose, and handle a missing file by printing an error instead of crashing.

Implement a stack with push and pop and a queue with enqueue and dequeue over an array, and hand-trace 10 operation sequences to predict the output before running them.

Draw the node structure of a singly linked list and write C code for creation, insertion at the beginning and end, and deletion of one node using pointers and malloc.

Classify 25 devices and components as input, output, primary memory, secondary memory or processing unit, and record the unit and typical capacity of 8 storage media.

Build from memory a comparison table of registers, cache, RAM, ROM, magnetic disk, SSD and optical disk on speed, volatility, cost per GB and typical use.

List the five core functions of an operating system (process, memory, file, device management and user interface) and give one concrete Windows example of each.

Perform and then write down the exact steps for 10 Windows operations: create, rename, copy, move, delete, restore from the Recycle Bin, change view, search by file extension, create a shortcut and read file properties.

Explain the difference between compiler, interpreter and assembler, and between GUI and CLI, in five lines each with one example.

Draw the three-level architecture of a DBMS and define table, tuple, attribute, primary key, foreign key and candidate key with one example of each.

Write CREATE TABLE statements for four related tables using correct data types and NOT NULL, UNIQUE, PRIMARY KEY and FOREIGN KEY constraints.

Write and execute 20 SQL queries using SELECT, WHERE, ORDER BY, DISTINCT, IN, BETWEEN, LIKE, aggregate functions, GROUP BY, HAVING and a two-table join.

Run INSERT, UPDATE and DELETE statements on the practice tables and describe what each does to a child table that holds a foreign key.

Normalise one unnormalised table of about eight columns up to 1NF, 2NF and 3NF, justifying each decomposition in one sentence.

Define network, node, bandwidth, protocol and topology, and distinguish LAN, MAN and WAN with one example of each.

Draw and label bus, star, ring and mesh topologies and list two advantages and two disadvantages of each from memory.

Name the layers of the TCP/IP model and place eight protocols (HTTP, FTP, SMTP, DNS, TCP, UDP, IP, ARP) in the correct layer with a one-line function for each.

Convert 10 IP addresses between dotted-decimal and binary form and identify the class (A, B or C) and default subnet mask of each.

Describe the working of e-mail, the World Wide Web and a search engine in five steps each, naming the client, server and protocols involved.

Write valid HTML from memory for a four-page site: a home page, a table page, a form page and a list-and-image page, using headings, paragraphs, lists, links, images, tables and forms with correct attributes.

Explain and apply 10 tags or attributes (table, form, input types, select, textarea, img with alt, a href, meta) and state one practical use case for each.

Find and fix 10 deliberate errors in HTML snippets you write yourself: unclosed tags, wrong nesting, missing quotes and misspelt attribute names.

List 10 cyber-safety practices covering strong passwords, two-factor authentication, phishing recognition, safe browsing, software updates, backups and the legal consequences of hacking and plagiarism, with one concrete example each.

Describe five common threats (virus, worm, Trojan, phishing, ransomware) and one prevention step for each.

Sit two full-length mock papers under exam timing, one at the start and one at the end of the week, and mark each domain section separately.

Re-solve every item missed in either mock and write out the correct method, repeating each item type until it is solved twice without notes.

Recite from memory the conversion rules, gate symbols, SQL clause order and HTML tag list produced in weeks 1, 5 and 7, at 90% accuracy.

Re-time the two heaviest sections, Domain 1 and Domain 4, until per-question time falls below one minute.

Rank all eight domains by mock score and write a three-item repair list for the weakest domain to work through before the exam.