Tamil Nadu HSE Second Year Computer Science study plan

Define class, object, encapsulation, inheritance and polymorphism in your own words and map each to a Python example you type yourself

Write and run at least eight small classes covering constructors (init), instance attributes, class attributes and the str method

Convert between binary, octal, decimal and hexadecimal by hand for twenty numbers, then verify each with Python's bin(), oct(), hex() and int(x, base)

Perform binary addition, subtraction using 1's and 2's complement, and state the range of signed 8-bit values

Implement single and multilevel inheritance with method overriding, and call the parent constructor using super()

Explain and demonstrate the difference between a list, tuple, set and dictionary by choosing the right one for five stated problems

Code list operations from scratch without library shortcuts: insert at position, delete by value, search, reverse and merge two sorted lists

Trace a stack's push and pop sequence on paper and then implement it using a Python list with overflow and underflow checks

Implement a queue using a list and again using collections.deque, and compare their time cost for enqueue and dequeue

Convert an infix expression to postfix by hand and evaluate it with a stack-based function you write

Read a text file line by line, count words and characters, and write the results to a second file

Handle file exceptions with try, except and finally, and use the with statement for safe closing

Parse a CSV-style file manually with split() and store records in a list of dictionaries

Draw an ER-style diagram for a school library on paper showing entities, attributes, primary keys and one-to-many relationships

Write and execute CREATE TABLE statements with appropriate data types, PRIMARY KEY, NOT NULL, UNIQUE and FOREIGN KEY constraints

Write at least fifteen SELECT queries covering WHERE, ORDER BY, DISTINCT, IN, BETWEEN, LIKE and aggregate functions with GROUP BY and HAVING

Write INSERT, UPDATE and DELETE statements and explain how a foreign key restricts deletion

Explain the difference between DDL and DML commands and give two examples of each

Write join queries (inner join and a left join) across two tables and explain in one sentence what rows are excluded by each

Define the terms protocol, bandwidth, topology, LAN, WAN and the client-server model with one real example each

Describe the role of IP address, MAC address, DNS, HTTP and HTTPS in loading a single web page, in correct order

Compare star, bus, ring and mesh topologies on cost, fault tolerance and ease of troubleshooting

Explain the TCP versus UDP trade-off and name one application suited to each

Build a valid HTML page using headings, lists, tables, images with alt text, links and a form with labelled inputs

Apply CSS with inline, internal and external stylesheets and explain the cascade order with a demonstration

Use class and id selectors, box model properties, and one layout technique (float or flexbox) to place three boxes side by side

Write JavaScript that validates a form field, changes element content with getElementById, and responds to a button click event

Identify and fix at least five deliberate errors in a broken HTML/CSS/JS page you construct yourself

Write functions with default arguments, keyword arguments and return values, and split a 60-line script into reusable functions

Implement linear search, binary search and bubble sort from memory, and state the best and worst case for each

Draw flowcharts and write pseudocode for three problems before coding them, then compare your pseudocode to the final code

Use a Python dictionary to store and update records persisted through a JSON or text file

Explain the steps of algorithmic problem solving: problem definition, analysis, design, coding, testing and debugging

Summarise ethical issues in computing: privacy, data protection, software piracy, plagiarism and responsible use of social media, with one concrete scenario each

Review your week 1 to 7 deliverables and rewrite any notes that are vague or copied rather than in your own words

Solve two full-length practice papers under timed conditions without notes

List every wrong or guessed answer, tag it by domain, and re-study only the two weakest domains

Recite from memory the definitions, syntax and key terms for number systems, OOP and algorithms