Kerala Plus Two Computer Science (DHSE) study materials
Kerala Plus Two Computer Science (DHSE) study resources

Kerala Plus Two Computer Science (DHSE) study plan

Kerala Plus Two Computer Science (DHSE) · Give each week a clear focus.

8 weeks · About 7 hours per week

Week 1

Classes, Objects, Constructors and Inheritance & Object-Oriented Programming Concepts

  • Define a class with private data members and public member functions, then write a short program that creates two objects and prints their state

  • Implement and contrast the four constructor types (default, parameterised, copy, and a destructor pairing) in a single compilable file

  • Classify ten given code snippets as illustrating encapsulation, data abstraction, inheritance, or polymorphism, writing one sentence of justification for each

  • Trace the order of constructor and destructor calls in a two-level single-inheritance program and predict the output before running it

Your checkpoint

A single C++ file containing four classes (one per inheritance type: single, multilevel, multiple, hierarchical) with a written output-prediction table for each, self-checked by compiling and running

Week 2

Classes, Objects, Constructors and Inheritance & Object-Oriented Programming Concepts

  • Rewrite a base-class member function as virtual and demonstrate runtime polymorphism through a base-class pointer array

  • Apply the three visibility modes (private, protected, public) during inheritance and tabulate the resulting access status of base members in the derived class

  • Explain function overloading versus function overriding using two original code examples, each annotated line by line

  • Solve five exam-style questions on constructor overloading and inheritance output prediction under timed conditions

Your checkpoint

A one-page hand-drawn access-mode table (3 visibility modes x 3 inheritance types) plus five solved output-prediction questions with answers checked against actual program runs

Week 3

Data Structures: Arrays, Stacks and Queues & Linked Lists and Memory Management

  • Implement a stack of integers using an array with push, pop, peek, and isEmpty, including overflow and underflow guards

  • Convert an infix expression to postfix using your own stack and evaluate the postfix form with the same stack class

  • Implement a circular queue with front and rear indices and demonstrate the wrap-around case in a test run

  • Write insertion, deletion, and traversal routines for a singly linked list and compare its memory behaviour with an array in a short paragraph

  • Distinguish static and dynamic memory allocation in C++ using new and delete, and show a deliberate memory-leak scenario and its fix

Your checkpoint

A working menu-driven program combining an array-based stack, a circular queue, and a singly linked list, with a printed test transcript showing each operation and its output

Week 4

Structures and Pointers in C++ & Linked Lists and Memory Management

  • Declare a struct with mixed data types and access its members through both a variable and a pointer using the arrow operator

  • Pass a struct to a function by value and by reference, and record the observable difference in the program output

  • Implement a self-referential structure and use it to build a three-node linked list, printing each node through pointer traversal

  • Write a program that swaps two integers using pointers and explain why pass-by-pointer changes the caller's variables

Your checkpoint

A pointer-and-structure practice file with six small programs, each accompanied by a two-sentence comment stating the expected output before execution

Week 5

Database Concepts and SQL

  • Map a given school scenario into tables, identify primary and foreign keys, and draw the resulting relational schema

  • Write SQL queries using SELECT, WHERE, ORDER BY, GROUP BY, and HAVING against a three-table schema you define yourself

  • Apply INNER JOIN and a left join to the same tables and state in one line how the result sets differ

  • Create tables with appropriate data types and constraints, and perform INSERT, UPDATE, and DELETE with a verification SELECT after each

  • Classify five DDL and five DML statements from a mixed list and state the purpose of each

Your checkpoint

A complete SQL script (table creation, sample data, and at least twelve queries) with a written answer sheet showing the expected result of each query

Week 6

Web Technology: HTML, CSS and JavaScript & PHP and Server-Side Scripting

  • Build a three-page linked HTML site using headings, lists, tables, images, and hyperlinks, validating that all tags are properly nested

  • Style the site with an external CSS file using class and ID selectors, and demonstrate the box model through a visible border, padding, and margin change

  • Write JavaScript that validates a registration form (non-empty fields, numeric phone, email pattern) and displays inline error messages

  • Write a PHP script that accepts form data via POST, validates it server-side, and echoes a sanitised confirmation message

  • Compare client-side and server-side validation in a short table naming one concrete failure each approach prevents

Your checkpoint

A functioning mini web application: HTML form styled with external CSS, validated by JavaScript in the browser and re-validated by a PHP script that echoes the submitted values

Week 7

Computer Networks and Internet Basics & ICT, IT Applications and Emerging Trends

  • Label a network topology diagram you draw yourself with hub, switch, router, and gateway, and state the OSI layer each device primarily operates at

  • Distinguish LAN, WAN, and MAN, and identify the transmission media (twisted pair, coaxial, fibre, wireless) suited to each with one justification

  • Trace a URL request from browser to server, naming DNS resolution, IP addressing, and HTTP as distinct steps

  • Explain any four emerging-technology terms (for example cloud computing, IoT, edge computing, generative AI, blockchain) with one authentic everyday application each

  • List five ICT-enabled services in Kerala or India and state the technology each depends on

Your checkpoint

A two-page illustrated summary sheet covering topologies, the OSI layer model, the URL request path, and four emerging technologies with real applications

Week 8

Data Structures: Arrays, Stacks and Queues & Database Concepts and SQL & Web Technology: HTML, CSS and JavaScript & Computer Networks and Internet Basics

  • Re-solve the highest-error questions from weeks 3, 5, 6, and 7 without notes, then mark each as mastered or still weak

  • Complete two full-length timed mock papers under exam conditions and score them against the marking scheme

  • Recite from memory the key definitions for stack, queue, primary key, foreign key, DOM, and protocol, checking each against your notes

  • Build a one-page formula and syntax card covering SQL clauses, CSS selector forms, and stack/queue operations

  • Rank all ten domains by mock-paper accuracy and schedule two final revision blocks for the two weakest

Your checkpoint

Two scored mock papers with a written error log listing every wrong answer, its root cause, and the corrective action taken

Milestones

Week 2: Can write a four-class inheritance program from scratch in under 25 minutes and correctly predict constructor/destructor order and virtual function dispatch without running it

Week 4: Can implement a stack, a circular queue, and a three-node linked list from memory in one sitting, and explain the difference between static and dynamic allocation in your own words

Week 6: Can produce a working HTML form with external CSS, JavaScript validation, and PHP server-side handling in a single 60-minute session without referring to notes

Week 8: Scores at least 70 percent on both timed mock papers, with no domain below 50 percent accuracy and a completed error log for every missed question