Exam Format & Predicted Paper
Read this first. Everything else in the kit is organised around what's in here.
1. The paper, in numbers
| Particular | Value |
|---|---|
| Semester End Examination (ESE) | 60 marks |
| Internal Assessment | 20 marks |
| Total | 100 marks |
| Duration | 3 hours |
| Credits | 3 |
| Teaching hours | 45 |
2. Official unit weightage — your study budget
Straight from the college syllabus. This table is the single most important thing on this page, because it tells you how to divide your remaining hours.
| Unit | Module | Weight | Hours | Share of 60 marks |
|---|---|---|---|---|
| 4 | OOP — classes, objects, constructors, encapsulation, inheritance, polymorphism, abstraction, interfaces, this/super/final |
30% | 12 | ~18 marks |
| 3 | Arrays & Strings — 1D/2D arrays, String, StringBuffer, StringBuilder | 17% | 6 | ~10 marks |
| 2 | Java Language Basics — variables, data types, casting, wrapper classes, autoboxing, operators, conditionals, loops | 15% | 7 | ~9 marks |
| 5 | Exception Handling — checked/unchecked, try-catch, finally, throw/throws, custom exceptions | 15% | 6 | ~9 marks |
| 1 | Overview of OOP & Java — paradigms, features, JVM architecture, JDK/JRE/JVM, compilation | 10% | 4 | ~6 marks |
| 6 | Collections Framework — List, Set, Map, iterators, generics | 10% | 5 | ~6 marks |
| 7 | Advanced Java — multithreading, synchronization, file handling, serialization, lambda, Stream API, Optional | 8% | 5 | ~5 marks |
Read that again: Unit 4 alone is worth more than Units 2+5 combined. If you have three hours left, spend one of them on Unit 4.
3. What the paper actually looks like
From Sample Question/Question_Bank.pdf in the college repo. This is the real
house style.
3.1 Every question is a stem with lettered sub-parts
Q1. a) ............ ← four short sub-parts to open
b) ............
c) ............
d) ............
Q2. a) ............ ← two sub-parts thereafter
b) ............
Q3. a) ............
b) ............
The paper is split into Section A and Section B.
3.2 The verbs never vary — only three exist
| Verb | What it demands | Marks shape |
|---|---|---|
| Differentiate between X and Y | A table, "at least four points" | 4–5 rows |
| Explain … with a suitable example | Definition → mechanism → code | 1 + 2 + code |
| Write a Java program to … | Runnable code + expected output | Code is the mark |
So what? If you write a definition and stop, you score roughly half. Every "explain" answer in this kit carries a program, because that's where the marks live.
3.3 Observed structure — the model paper
| Question | Marks | Sub-parts | Coverage |
|---|---|---|---|
| Q1 | 10 | 4 × 2.5 | Mixed short answers, one from each of 4 different units |
| Q2 | 10 | 2 × 5 | Unit 1 |
| Q3 | 10 | 2 × 5 | Units 2 + 3 |
| Q4 | 10 | 2 × 5 | Unit 4 |
| Q5 | 10 | 2 × 5 | Unit 5 |
| Q6 | 10 | 2 × 5 | Units 6 + 7 |
| 60 |
Each question carries an internal "OR" — you answer one of two alternatives.
4. The recurring differentiation pairs
These appear again and again across the sample bank and your question bank. If you memorise these twenty tables, you have covered the highest-frequency question type on the paper.
| # | Pair | Unit |
|---|---|---|
| 1 | JDK vs JRE vs JVM | 1 |
| 2 | Procedural vs Object-Oriented programming | 1 |
| 3 | Error vs Exception | 5 |
| 4 | Checked vs Unchecked exceptions | 5 |
| 5 | throw vs throws |
5 |
| 6 | final vs finally vs finalize |
4/5 |
| 7 | ArrayList vs LinkedList | 6 |
| 8 | HashMap vs TreeMap | 6 |
| 9 | HashSet vs TreeSet | 6 |
| 10 | Set vs List | 6 |
| 11 | String vs StringBuffer vs StringBuilder | 3 |
| 12 | Method overloading vs Method overriding | 4 |
| 13 | Abstract class vs Interface | 4 |
| 14 | Static binding vs Dynamic binding | 4 |
| 15 | Process vs Thread | 7 |
| 16 | start() vs run() |
7 |
| 17 | Byte stream vs Character stream | 7 |
| 18 | Implicit (widening) vs Explicit (narrowing) casting | 2 |
| 19 | break vs continue |
2 |
| 20 | synchronized method vs synchronized block |
7 |
5. The recurring programs
Every program below appears in the sample bank, the lab manual, or your assignments. Memorise the pattern, not the exact code — variants get asked.
| Program | Appears in |
|---|---|
| Second-largest element without sorting | Sample bank, Lab P7 |
| Largest element in a 2D array | Sample bank, Unit 4 QB |
| Remove duplicates, print sorted | Sample bank, Lab P7 |
| Matrix addition + 3×3 multiplication | Lab P7 |
| Reverse a number / prime / Fibonacci | Lab P4 |
| Even-odd / quadratic roots / largest of three / weekday switch | Lab P3 |
Constructor overloading + chaining with super |
Sample bank, A2 Q3 |
| Method overriding + runtime polymorphism | Sample bank, Unit 6 QB |
| Multiple inheritance via interfaces (circle + square area) | Assignment 2 Q1 |
Custom exception InvalidAgeException (age < 18) |
Sample bank, Lab P17 |
Two Runnable threads + shared counter + synchronized |
Sample bank, Lab P22 |
Student marks in HashMap, filter >75 with Stream API + Optional |
Sample bank |
| Generic class to swap two elements | Sample bank, Lab |
Write + read a file with FileOutputStream / FileInputStream |
Sample bank, Lab |
| Palindrome check | Lab P9 |
6. Course Outcomes → Unit map
The college repo's COs map almost 1:1 onto units. This is the CO logic to predict with — the paper setter's constraint is "cover all six COs."
| CO | Statement | Units | Where it lands on the paper |
|---|---|---|---|
| CO1 | Develop and execute Java programs following standard practices and compilation procedures | 1 | Q2 — JVM architecture, JDK/JRE/JVM, compilation process |
| CO2 | Apply arithmetic, relational, logical, assignment, unary and bitwise operators | 2 | Q3(a) — operators, casting, precedence, autoboxing |
| CO3 | Create, manipulate and operate on 1D and multidimensional arrays | 3 | Q3(b) — array program + String methods |
| CO4 | Analyse runtime errors and implement exception handling | 5 | Q5(a) — try-catch-finally, checked/unchecked |
| CO5 | Design custom exceptions and apply best practices | 5 | Q5(b) — InvalidAgeException, throw vs throws |
| CO6 | Develop advanced applications using multithreading, file handling, collections and modern APIs | 6, 7 | Q6 — Collections + threads |
What the CO constraint tells you
Six COs have to be covered. That tells you something very useful:
- Q5 cannot skip exceptions — it is the only place CO4 and CO5 can be tested.
- Q6 cannot skip Collections or threads — it is the only place CO6 can be tested.
- Q2 cannot skip JVM/JDK/JRE — it is the only place CO1 can be tested.
That's three questions (~30 marks, half the paper) whose topic is fixed before anyone writes a single question.
⚠️ Note on the PDF's CO sheet.
Course Outcomes 1.pdflists five COs using classical OOP vocabulary — "pointers", "destructors", "operator overloading", "virtual functions". Those are not C++ imports; they're the traditional names for Java concepts: references (new), garbage collection, the+operator's String concatenation, and the fact that all Java methods are virtual by default. Unit 6 of your deck even has a slide titled "Operator Overloading" teaching exactly the+case. So when the paper says CO3 = "operator overloading and virtual functions", read it as Unit 6: overloading, overriding, dynamic method dispatch.
7. Predicted paper
Confidence: format ★★★★★ · topic mix ★★★★☆ · exact wording ★★★☆☆
This is a forecast built from the weightage table, the sample bank's phrasing, and the CO constraint. It is not a leaked paper.
SECTION A
Q1. Answer all — [4 × 2.5 = 10]
a) Define OOP. List any four features of Object-Oriented Programming. b) Differentiate between JDK, JRE and JVM. c) Differentiate between checked and unchecked exceptions with one example of each. d) What is autoboxing and unboxing? Give an example.
Q2. [2 × 5 = 10]
a) Explain JVM architecture with a neat diagram. Describe the Java compilation and execution process. b) Explain the four pillars of OOP (Encapsulation, Inheritance, Polymorphism, Abstraction) with suitable examples.
OR
a) Differentiate between procedural programming and object-oriented programming. Explain any two features of OOP. b) What is bytecode? Why is Java platform-independent? Explain the structure of a basic Java program.
Q3. [2 × 5 = 10]
a) Explain type casting. Differentiate between implicit (widening) and explicit (narrowing) casting with examples. Explain operator precedence. b) Write a Java program to find the second-largest element in an array without using built-in sorting methods.
OR
a) Differentiate between String, StringBuffer and StringBuilder with examples. b) Write a Java program to remove duplicate elements from a list and display the unique elements in sorted order.
SECTION B
Q4. [2 × 5 = 10] — Unit 4, the 30% unit
a) What is constructor overloading? Explain the types of constructors with
examples. Also explain the use of this and super keywords.
b) Explain method overloading and method overriding with examples.
Differentiate between them on at least four points.
OR
a) Explain inheritance in Java. Describe the types of inheritance with examples. Why does Java not support multiple inheritance through classes? b) What is an interface? Differentiate between abstract class and interface. Write a program demonstrating multiple inheritance using interfaces.
Q5. [2 × 5 = 10] — CO4 + CO5
a) Explain the try-catch-finally block with an example. Explain multiple
catch blocks.
b) Differentiate between throw and throws. Write a Java program to create
a custom exception InvalidAgeException thrown when age is less than 18.
OR
a) Explain the exception hierarchy. Differentiate between Error and Exception. Differentiate checked and unchecked exceptions. b) Explain exception-handling best practices in Java.
Q6. [2 × 5 = 10] — CO6, Units 6 + 7
a) Explain the List interface. Differentiate between ArrayList and
LinkedList with examples. Write a program to demonstrate any three methods of
ArrayList.
b) Explain the Map interface. Differentiate between HashMap and TreeMap.
Write a program to store and retrieve student records using HashMap.
OR
a) What is multithreading? Explain the two ways to create threads in Java
with examples. Explain the thread life cycle.
b) Explain thread synchronization. Write a program using two Runnable
threads and a shared counter.
8. If your paper follows the 8-unit PDF deck instead
Some of the sample bank leans on Units 6–7 (Collections, Stream API, lambda, Optional, generics). If your actual paper instead follows the 8-unit PDF spine, then:
- Drop the Stream API / lambda / Optional / generics depth → skim
03-UNITS-6-7-COLLECTIONS-ADVANCED.md§6 only. - Add these PDF-only topics, which the repo does not cover but your PPTs do:
- Object cloning — shallow vs deep,
clone(),Cloneable(Unit 6, p77–85) - Inner classes — nested, anonymous (Unit 6, p86–91)
- Proxies — remote / virtual / protection / smart (Unit 6, p92–96)
- Reflection API —
getClass(),getMethods()(Unit 6, p51–53) - Enumerations (Unit 7, p10)
- Packages + classpath (Unit 7, p6–7)
Those six are lower-probability but they are on your syllabus and not in the repo, so they're exactly the kind of thing that appears when you've revised only from the repo.
9. Marks strategy
| Situation | Do this |
|---|---|
| You know the topic | Definition (for 2 marks of the 5) → mechanism → program → output. |
| You half-know it | Write the table first — tables score fast and honestly. Then one code line if you can. |
| You don't know it | Write the differentiation table for the nearest related pair. Partial credit is generous on tables. |
| Program question, stuck | Write the skeleton: class, main, array/loop, System.out.println. Correct structure earns marks even with a logic error. |
| Out of time | Attempt Q4 (Unit 4) first — it's 30% of the paper and the most predictable. |