QUESTIONS
QUESTIONS
O(log n).
.
.
data structure where elements are stored in nodes, and each node
linked list? Answer: In a singly linked list, each node points to the
next node, while in a doubly linked list, each node points to both the
tree (BST)? Answer: A binary search tree is a binary tree where the left
child is less than the parent, and the right child is greater.
.
.
before backtracking.
.
.
Answer: BFS explores all the vertices at the current depth level before
structure that stores key-value pairs and uses a hash function to map
value is greater (max heap) or smaller (min heap) than its children.
.
.
sorting algorithm that selects a pivot element and partitions the array
into two sub-arrays - elements smaller than the pivot and elements
n).
.
.
Describe the merge sort algorithm. Answer: Merge sort is a
sublists to produce new sorted sublists until there is only one sorted
list.
.
.
What is the time complexity of merge sort? Answer: O(n log n).
.
.
connected.
.
.
redundant calculations.
.
.
What is the 0/1 knapsack problem, and how can you solve it
capacity should be filled with items to maximize the total value. It can
to be unfeasible.
.
.
Describe the concept of memoization in dynamic programming.
OOPS
.
maintainability.
.
.
are:
.
class.
.
.
to inherit from.
.
.
inheritances in Java.
.
.
polymorphism.
.
.
Java? Answer: "this" refers to the current instance of the class, while
"super" refers to the immediate superclass of the class. They are used
to access instance variables and methods from the current class and
DBMS
.
data.
.
.
execution plans.
Transaction Manager: Ensures ACID properties for
database transactions.
database.
.
DBMS.
.
.
integrity.
.
.
integrity.
.
.
design.
.
.
where two or more transactions are waiting for each other to release
proceed.
.
.
columnar formats.
.
.
types are:
.
tables.
LEFT JOIN (or LEFT OUTER JOIN): Returns all rows from
the left table and matching rows from the right table.
RIGHT JOIN (or RIGHT OUTER JOIN): Returns all rows from
the right table and matching rows from the left table.
FULL JOIN (or FULL OUTER JOIN): Returns all rows when