A stack uses FIFO, while a queue uses LIFO.

A stack allows random access, while a queue does not.

A stack uses LIFO, while a queue uses FIFO.

A stack is a type of list, while a queue is also a type of list.

Polymorphism means combining different classes into one.

Polymorphism allows different classes to be used as if they are the same class through a shared interface.

Polymorphism is about hiding how a class works from the user.

Polymorphism means a class can inherit from more than one parent class.

Inheritance allows classes to be created without any relationship to existing classes.

Inheritance is a process where classes are deleted to simplify code structure.

Inheritance is a method for classes to operate independently without sharing features.

Inheritance is a way for a new class to use properties and behaviors from an existing class, which helps in reusing code.

A binary tree is a type of binary search tree with unordered nodes.

A binary search tree is a binary tree where the nodes are arranged in a specific order, which helps in searching for values quickly, while a binary tree does not have this order.

A binary search tree is a tree with random nodes, making searches slow.

A binary search tree can have duplicate values, while a binary tree cannot.

A constructor helps to create methods for a class.

A constructor is used to manage errors in a class.

A constructor helps to remove an object from memory.

A constructor is used to set up the properties of an object.

A data structure that consists of nodes, where each node contains data and a reference to the next node.

A type of array that can grow and shrink in size.

A collection of elements that are stored in a fixed-size block of memory.

A data structure that allows for fast access to elements by index.

Shallow copy makes new objects; deep copy keeps the originals.

Shallow copy keeps the original objects; deep copy makes new copies of everything.

Shallow copy makes new copies of everything; deep copy keeps the originals.

Deep copy is quicker than shallow copy; shallow copy takes more time.

Encapsulation means keeping data and methods together in one place and controlling access to them.

Encapsulation is when data and methods are separated in OOP.

Encapsulation is about sharing properties between classes.

Encapsulation allows creating many copies of a class.

Very fast (O(1))

Fast (O(log n^2))

Moderately fast (O(log n))

Slow (O(n))

Creating objects, Breaking down problems, Saving data, Changing functions

Hiding details, Using parent-child relationships, Changing forms, Simplifying ideas

Hiding details, Combining parts, Using parent-child relationships, Looking back at code

Combining parts, Working together, Passing messages, Using rules

A priority queue processes items in a random order, while a regular queue processes them in the order they arrive.

A priority queue removes items based on their importance, while a regular queue removes items in the order they were added.

A priority queue can have repeated items, while a regular queue cannot.

A priority queue has a fixed size, while a regular queue can change size as needed.

'this' keyword is used to create new functions.

'this' keyword helps to understand the context in which a function is executed.

'this' keyword always points to the main program.

'this' keyword is used to store data in programming.

Linked lists are faster to access than arrays.

Arrays use more memory than linked lists.

Arrays are fast and have a fixed size, while linked lists can grow and are easier to change.

Arrays can change size and linked lists cannot.

A graph is just a bunch of random numbers, shown as text in programming.

A graph is a type of database, shown using SQL commands and tables.

A graph is a structure with points only, shown using basic lists.

A graph is a way to connect points, shown in programming using lists that show connections, tables, or lists of edges.