Data Structures and algorithms

What are three examples of Data Structures?

-Arrays -Trees -Graphs

What are the concepts introduced in OOPs?

-Object -Class -Inheritance -Polymorphism -Abstraction -Encapsulation

What is Polymorphism?

A concept that allows a task to be performed in different ways. In Java, we use method overloading and method overriding to achieve polymorphism.

What is Abstraction?

A concept that hides the internal details of an application and only shows the functionality. In Java, we use abstract class and interface to achieve abstraction.

What is inheritance?

A concept that refers to an object gaining all the properties and behaviors of a parent object. It provides code reusability.

What is Encapsulation?

A concept that refers to the wrapping of code and data together into a single unit.

What is a Linked List?

A linked list refers to a linear data structure in which the elements are not necessarily stored in a organized manner

What is a class?

A logical entity that defines the blueprint from which an object can be created or instantiated.

What is an object?

A real-world entity having a particular state and behavior. We can define it as an instance of a class.

What is a stack?

A stack refers to a linear data structure performing operations in a LIFO (Last in First out) order

What is LIFO?

Short for "Last In, Last Out" -This is a way of accessing, storing, and retrieving data. It extracts the data that was stored last first.

What is the OOP's concept?

Short for Object-Oriented Programming system, a paradigm that provides concepts such as objects, classes, inheritance.

Data Structure

This is a storage format that defines the way data is stored, organized, and manipulated

What are Binary Trees?

This is an extension of the linked list structure where where each node has at most two children -this tree has two nodes at all times a left and a right

What is an Array?

This is referred to as a collection of items stored at nearby memory locations.

What is recursion?

This refers to a function calling itself based on a terminating condition. -It uses LIFO and therefor makes use of the stack data structure

What is a Queue?

This refers to a linear data structure that performs operations in a FIFO order. -In a queue the least recently added elements are removed first as opposed to a stack

What is a Binary Search Tree?

is used to store data in a manner that it can be retrieved very efficiently. The left sub-tree contains nodes whose keys are less than the node's key value. The right sub-tree contains nodes whose keys are greater than or equal to the node's key value