Tap or click on cards to flip them and reveal the answers. You can use arrow keys as well.
Loading folders...
1/15 cards
What is a Java ArrayList?
Click to flip
An ArrayList is a resizable array, part of Java's Collections Framework, providing the ability to dynamically manage the size.
Click to flip
What is a Java HashMap?
Click to flip
HashMap is a collection class that stores items in key/value pairs, allowing efficient retrieval based on the key.
Click to flip
What is a LinkedList in Java?
Click to flip
A LinkedList is a data structure consisting of a sequence of elements, where each element points to the next, enabling efficient insertions or deletions.
Click to flip
How does a Stack work in Java?
Click to flip
A Stack is a Last In, First Out (LIFO) data structure, meaning the last element added is the first one to be removed.
Click to flip
Describe a Java TreeSet.
Click to flip
A TreeSet is a sorted collection that uses a Red-Black tree to order the elements, providing efficient retrieval of elements sorted by their natural order or a custom comparator.
Click to flip
What is a PriorityQueue in Java?
Click to flip
A PriorityQueue is a data structure that always servesthe lowest (min heap) or highest (max heap) priority element first.
Click to flip
What is a Java Hashtable?
Click to flip
A Hashtable is a data structure that maps keys to values for highly efficient lookups, but unlike HashMap, it is synchronized and thread-safe.
Click to flip
Explain the concept of a Queue in Java.
Click to flip
A Queue is a First In, First Out (FIFO) data structure where elements are added at the end and removed from the start.
Click to flip
What are some common sorting algorithms used in Java?
Click to flip
Common sorting algorithms include Quick Sort, Merge Sort, Bubble Sort, and Insertion Sort.
Click to flip
Describe the binary search algorithm.
Click to flip
Binary search is a searching algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.
Click to flip
What is the difference between Comparable and Comparator in Java?
Click to flip
Comparable is used to sort objects using natural ordering, defined within the class, whereas Comparator allows sorting objects by multiple criteria, external to the class.
Click to flip
What is a graph data structure in Java?
Click to flip
A graph is a collection of nodes (vertices) connected by edges, representing various scenarios such as networks, circuits, or maps.
Click to flip
Explain depth-first search (DFS).
Click to flip
Depth-first search is an algorithm for traversing or searching tree or graph data structures that explores as far as possible along a branch before backtracking.
Click to flip
Explain breadth-first search (BFS).
Click to flip
Breadth-first search is an algorithm for traversing or searching tree or graph data structures that explores all neighbor nodes at the present depth prior to moving on to nodes at the next depth level.
Click to flip
What is the Big O notation?
Click to flip
Big O notation is a mathematical notation used to describe the upper bound performance or the worst-case scenario of an algorithm in terms of time or space consumption.
Click to flip
Need More Study Materials?
Go back to the chat to generate additional resources.