• Linear vs. Non-linear Data Structures:
• Linear Data Structures: Elements are arranged sequentially where each element has a unique predecessor and successor (except first and last):
• Arrays, Lists, Linked Lists, Stacks, Queues.
• Non-linear Data Structures: Elements are arranged hierarchically or interconnected arbitrarily without a single sequential sequence:
• Tree: Hierarchical parent-child relationship.
• Graphs: Interconnected network of vertices and edges.
• Hash tables: Associative key-value mapping indexed via hash functions (non-sequential).
• List: Classic sequential linear data structure.
• Conclusion: (A), (B) and (C) only are non-linear data structures (Option 1).

Correct option: (1) (A), (6) and (C) only.

• Polymorphism in Java Programming:
• Java supports two fundamental types of polymorphism:

• Compile-time Polymorphism (Static Polymorphism): Resolved during code compilation. Achieved via Method Overloading (same method name with different parameter signatures).
• Runtime Polymorphism (Dynamic Polymorphism): Resolved dynamically at execution time. Achieved via Method Overriding (subclass provides specific implementation of a superclass method).
  • Among the given options, Compile Polymorphism correctly represents compile-time polymorphism.

• Conclusion: Compile Polymorphism (Option 2).

• Java Exception Handling Keywords:
• throw: Keyword used to explicitly throw or generate an exception from any method or block of code (e.g., throw new ArithmeticException("Divide by zero");).
• throws: Keyword used in method signatures to declare the exceptions that the method might throw.
• try: Encloses the block of code to monitor for exceptions.
• catch: Handles the specific exception thrown by a try block.
• Conclusion: An exception is explicitly generated using throw (Option 3).

Correct option: (3) Throw