WBCHSE HS Modern Computer Application study plan
WBCHSE HS Modern Computer Application · Give each week a clear focus.
8 weeks · About 6 hours per week
Introduction to Computer System and Computer Organization
Classify computer generations by the hardware technology that defines each one and state one limitation of each generation
Draw and label the von Neumann block diagram, then narrate the fetch-decode-execute cycle step by step for a simple instruction
Distinguish primary memory from secondary memory and compute memory sizes across bit, byte, KB, MB, GB using worked conversions
Group input and output devices by the data they handle (text, image, audio, sensor) and justify one pick for a school office and one for a hospital
Explain the role of the ALU, control unit, registers and buses in a single written paragraph without notes
Your checkpoint
A one-page hand-drawn von Neumann diagram with the fetch-decode-execute cycle annotated, plus a 20-question self-test on computer organization scored at 16/20 or better with wrong answers corrected in a log
Programming in C
Declare and initialise variables of int, float, double, char and string types and print each with the correct format specifier
Evaluate mixed-type expressions by hand using operator precedence, associativity and implicit conversion rules
Write, compile and run ten short C programs that read input with scanf and write output with printf
Diagnose and fix common compile-time and run-time errors such as missing semicolons, wrong format specifiers and uninitialised variables
Your checkpoint
A folder of ten working C programs (sum, swap, area of circle, even/odd, largest of three, simple interest, temperature conversion, average of five numbers, character check, currency breakup) with a written error log listing each bug you hit and how you fixed it
Programming in C
Construct nested loops and switch-case constructs to solve pattern-printing and menu-driven problems
Define and call functions with parameters and return values, and explain why pass-by-value protects the caller's variable
Implement recursion for factorial, Fibonacci and sum of digits, then trace each call on paper with the stack of activations
Manipulate one-dimensional and two-dimensional arrays, including searching, summing and matrix-style traversal
Use string handling with arrays of characters and the standard library functions for length, copy and comparison
Your checkpoint
A timed 90-minute written set of eight C problems answered on paper (code plus hand-traced output for two given inputs each), self-marked against a compiler run and scored out of 40
Relational Database Management Systems and SQL
Define relation, tuple, attribute, domain, primary key, candidate key and foreign key and map them onto an actual table you design
Write SELECT statements using WHERE, ORDER BY, DISTINCT and BETWEEN against a table you created
Apply aggregate functions with GROUP BY and HAVING to answer summary questions
Combine two tables with an equi-join and explain what happens to unmatched rows
Use CREATE TABLE, INSERT, UPDATE, DELETE and DROP with appropriate data types and constraints
Your checkpoint
A saved SQL script that builds a three-table school database (student, subject, marks) with keys, inserts at least ten rows per table, and contains 15 commented queries whose outputs you paste into a report
Data Structures
Implement stack operations (push, pop, peek, underflow and overflow checks) using an array and trace the state after each call
Implement a linear queue with front and rear pointers and explain the circular queue fix for the shifting problem
Convert an infix expression to postfix using a stack and evaluate a postfix expression with a worked example
Traverse a singly linked list for insertion, deletion and display, drawing the pointer changes at each step
Compare linear search against binary search and bubble sort against insertion sort on the same data set, counting comparisons in each case
Your checkpoint
A single reference sheet showing the traced internal state of a stack and a queue over ten operations, plus working code or pseudocode for stack push/pop and one sorting routine with the comparison count for a 10-element array
Number Systems and Boolean Algebra & Computer Software and Operating Systems
Convert numbers between binary, octal, decimal and hexadecimal by both positional expansion and repeated division, then verify each answer by converting back
Perform binary addition, subtraction using two's complement, and multiplication on given operands
Construct truth tables for AND, OR, NOT, NAND, NOR and XOR gates and derive the output of a two-level gate circuit from its expression
Simplify Boolean expressions using identities and a Karnaugh map, then re-express the result as a gate circuit
Describe the functions of an operating system and distinguish batch, time-sharing, real-time and distributed systems, plus CUI against GUI with one example each
Your checkpoint
A worked worksheet of 25 mixed problems (ten number conversions, five binary arithmetic, ten Boolean or gate questions) with every step shown, self-marked and any topic below 70 percent scheduled for re-drill in week 8
Computer Networks and the Internet
Compare star, bus, ring and mesh topologies on cost, fault tolerance and ease of expansion using a three-row comparison table
Describe the layered duties of the OSI or TCP/IP model and match a device or protocol to the layer it belongs to
Distinguish hub, switch, router, modem and gateway by the address or signal they work with
Explain IP addressing at a basic level, including the difference between an IP address and a domain name, and trace what happens when a URL is typed into a browser
Classify internet services such as email, FTP, HTTP and search, and state one security precaution for each of browsing and email
Your checkpoint
A labelled network diagram of a small school lab covering topology, devices, cabling and one internet connection, accompanied by 20 multiple-choice questions on networking answered under 25 minutes with a scored answer key
Web Technology and Multimedia
Write valid HTML pages using headings, lists, tables, hyperlinks, images and a basic form with text fields, radio buttons and a submit button
Explain the difference between static and dynamic web pages and identify the roles of a browser, web server and URL
Distinguish multimedia components (text, graphics, audio, video, animation) and match common file formats to their best use
Re-drill the two weakest topics flagged in weeks 4 and 6 using fresh practice questions
Sit a full-length timed mock covering all eight domains and analyse the score by domain
Your checkpoint
A three-page linked HTML mini-site (home, table page, form page) that renders correctly in a browser, plus a completed mock exam with a domain-wise score table and a one-line fix plan for each domain scoring under 60 percent
Milestones
Week 2: Compile and run five of your ten C programs from memory in a fresh file within 30 minutes, and score at least 16/20 on the week-1 computer organization self-test
Week 4: Write and execute 15 SQL queries on your own three-table database without notes, getting correct output on at least 12, and score 60 percent or more on the timed week-3 C paper
Week 6: Solve ten mixed number-conversion and Boolean problems in 45 minutes with at least 80 percent accuracy, and re-run five C programs covering loops, functions and arrays without referring to your earlier code
Week 8: Score at least 60 percent overall on the full-length mock with no single domain below 50 percent, and have the HTML mini-site rendering all three pages with working links