CS 326 PRACTICE EXAM 2025/2026 QUESTIONS AND
SOLUTION RATED A+
✔✔Derived Classes and Inheritance - ✔✔Inheritance allows derived classes like
PeekableStack to extend the functionality of base classes like Stack.
✔✔Inheritance Chains and Object Class - ✔✔In Java, all classes implicitly extend the
Object class, making it the root of the inheritance hierarchy.
✔✔GUI Development - ✔✔Java's Swing library offers components like JFrame,
JButton, and JLabel for building GUIs.
import javax.swing.JFrame;
public class WindowApplication {
public static void main(String[] args) {
JFrame frame = new JFrame("Window Application");
frame.setSize(350, 150);
frame.setVisible(true);
}
}
✔✔Event-Driven Programming and Listeners - ✔✔Event-driven programming in Java
relies on listeners to respond to various user interactions.
Event-driven programming is a paradigm where the flow of the program is determined
by events such as user actions (clicks, typing), sensor outputs, or messages from other
programs. In Java, event listeners like ActionListener or WindowListener are used to
handle these events.
✔✔GUI Components and Layouts - ✔✔Layout managers in Java GUIs control the
arrangement of components in a window.
✔✔Drawing and Mouse Events - ✔✔Custom drawing in Java GUIs uses the paint
method, and mouse events are handled by implementing MouseListener.
✔✔Prolog Cut Predicate (!) - ✔✔In Prolog, the cut predicate (!) stops backtracking past
its point in a rule. It's used for optimizing logic flow, ensuring Prolog commits to
decisions made up to the cut, even if a failure occurs later in that rule.
✔✔Cut for Conditional and Loops in Prolog - ✔✔The cut can simulate if-else statements
and loops. For instance, p :- a, !, b. p :- c. behaves like an if-else, and a combination of
cut with recursion can create loop-like structures.
, ✔✔Towers of Hanoi in Prolog - ✔✔Prolog's recursive solution for the Towers of Hanoi,
using the move(N, X, Y, Z) predicate, demonstrates its effectiveness in logical problem
solving.
✔✔Java's Portability and Bytecode - ✔✔Java's compiler turns source code into
machine-independent bytecode, run by the Java Virtual Machine (JVM), ensuring cross-
platform compatibility.
✔✔Java Class and Data Types - ✔✔Java encapsulates all functionalities in classes,
offers primitive and constructed types, and uses a reference model for objects,
abstracting away explicit pointer usage.
✔✔Strings and Object Management in Java - ✔✔Java treats strings as objects with
versatile functionalities and manages object lifecycle automatically through garbage
collection
✔✔Java Arrays and Class Visibility - ✔✔Java arrays are dynamic and support multi-
dimensionality. Classes and their members can have varying visibility levels: public,
private, protected, or package-private.
✔✔Java Interfaces and Polymorphism - ✔✔Interfaces in Java define method contracts
without implementation. They enable polymorphism, allowing for dynamic and flexible
programming styles.
✔✔Prolog Lists - ✔✔Lists in Prolog are non-homogeneous collections, constructed
using the dot functor or shorthand notation. For example, the list [a, b, c] can be
represented as .(a, .(b, .(c, []))). Understanding various representations, like [a, b, c] or
[a | [b, c]], is key for list manipulations in Prolog.
% Explicit dot functor representation
List1 = .(a, .(b, .(c, []))).
% Shorthand bracket notation
List2 = [a, b, c].
% Head-tail representation
List3 = [a | [b, c
✔✔Prolog's member Predicate for List Membership - ✔✔The member predicate checks
if an element belongs to a list, demonstrating basic recursion. Defined as member(X,
[X|_]). and member(X, [_|T]) :- member(X, T)., it illustrates how Prolog processes lists
recursively.
✔✔Recursively Checking Sorted Lists and Counting Elements - ✔✔Prolog can
recursively determine if a list is sorted and count its elements. For sorted lists, sorted([A,
B|T]) :- A =< B, sorted([B|T]).. For counting, nrelem([], 0). and nrelem([_|T], N) :-
nrelem(T, X), N is X+1. demonstrate recursive list traversal.
SOLUTION RATED A+
✔✔Derived Classes and Inheritance - ✔✔Inheritance allows derived classes like
PeekableStack to extend the functionality of base classes like Stack.
✔✔Inheritance Chains and Object Class - ✔✔In Java, all classes implicitly extend the
Object class, making it the root of the inheritance hierarchy.
✔✔GUI Development - ✔✔Java's Swing library offers components like JFrame,
JButton, and JLabel for building GUIs.
import javax.swing.JFrame;
public class WindowApplication {
public static void main(String[] args) {
JFrame frame = new JFrame("Window Application");
frame.setSize(350, 150);
frame.setVisible(true);
}
}
✔✔Event-Driven Programming and Listeners - ✔✔Event-driven programming in Java
relies on listeners to respond to various user interactions.
Event-driven programming is a paradigm where the flow of the program is determined
by events such as user actions (clicks, typing), sensor outputs, or messages from other
programs. In Java, event listeners like ActionListener or WindowListener are used to
handle these events.
✔✔GUI Components and Layouts - ✔✔Layout managers in Java GUIs control the
arrangement of components in a window.
✔✔Drawing and Mouse Events - ✔✔Custom drawing in Java GUIs uses the paint
method, and mouse events are handled by implementing MouseListener.
✔✔Prolog Cut Predicate (!) - ✔✔In Prolog, the cut predicate (!) stops backtracking past
its point in a rule. It's used for optimizing logic flow, ensuring Prolog commits to
decisions made up to the cut, even if a failure occurs later in that rule.
✔✔Cut for Conditional and Loops in Prolog - ✔✔The cut can simulate if-else statements
and loops. For instance, p :- a, !, b. p :- c. behaves like an if-else, and a combination of
cut with recursion can create loop-like structures.
, ✔✔Towers of Hanoi in Prolog - ✔✔Prolog's recursive solution for the Towers of Hanoi,
using the move(N, X, Y, Z) predicate, demonstrates its effectiveness in logical problem
solving.
✔✔Java's Portability and Bytecode - ✔✔Java's compiler turns source code into
machine-independent bytecode, run by the Java Virtual Machine (JVM), ensuring cross-
platform compatibility.
✔✔Java Class and Data Types - ✔✔Java encapsulates all functionalities in classes,
offers primitive and constructed types, and uses a reference model for objects,
abstracting away explicit pointer usage.
✔✔Strings and Object Management in Java - ✔✔Java treats strings as objects with
versatile functionalities and manages object lifecycle automatically through garbage
collection
✔✔Java Arrays and Class Visibility - ✔✔Java arrays are dynamic and support multi-
dimensionality. Classes and their members can have varying visibility levels: public,
private, protected, or package-private.
✔✔Java Interfaces and Polymorphism - ✔✔Interfaces in Java define method contracts
without implementation. They enable polymorphism, allowing for dynamic and flexible
programming styles.
✔✔Prolog Lists - ✔✔Lists in Prolog are non-homogeneous collections, constructed
using the dot functor or shorthand notation. For example, the list [a, b, c] can be
represented as .(a, .(b, .(c, []))). Understanding various representations, like [a, b, c] or
[a | [b, c]], is key for list manipulations in Prolog.
% Explicit dot functor representation
List1 = .(a, .(b, .(c, []))).
% Shorthand bracket notation
List2 = [a, b, c].
% Head-tail representation
List3 = [a | [b, c
✔✔Prolog's member Predicate for List Membership - ✔✔The member predicate checks
if an element belongs to a list, demonstrating basic recursion. Defined as member(X,
[X|_]). and member(X, [_|T]) :- member(X, T)., it illustrates how Prolog processes lists
recursively.
✔✔Recursively Checking Sorted Lists and Counting Elements - ✔✔Prolog can
recursively determine if a list is sorted and count its elements. For sorted lists, sorted([A,
B|T]) :- A =< B, sorted([B|T]).. For counting, nrelem([], 0). and nrelem([_|T], N) :-
nrelem(T, X), N is X+1. demonstrate recursive list traversal.
