Go on. Explore!

lvl 0 • 0 xp

lvl 1

Home Market Decks Interests

Programming

memorize.ai (lvl 286)

(0)

36 cards

()

Section 1

Preview this deck

Overloading Methods and Constructors

Front

1 / 36

Programming

0.0

0 reviews

5			0
4			0
3			0
2			0
1			0

Active users

All-time users

Favorites

Last updated

6 years ago

Date created

Mar 1, 2020

Cards (36)

Section 1

(36 cards)

Overloading Methods and Constructors

Front

Allows a class to have more than one method or constructor having the same name, if their argument lists are different.

Back

Heap

Front

A simple tree data structure that has a max or min heap. Generally implemented as an array rather than a series of nodes, each having reference to other nodes. Nodes have most of two children.

Back

Big-Oh notation

Front

A classification scheme for functions based on their order of growth as a function of the size of their input.

Back

Searching

Front

Traverse the list checking value we are looking for with the value of each node in the linked list

Back

Recursion

Front

The process of a function calling itself.

Back

Queues

Front

Honor the first in first out (FIFO) strategy, the first item put into the queue will be the first served and so on. They have three core methods: Enqueue, Dequeue, and Peek.

Back

Abstract classes

Front

One that is not used to construct objects, but only as a basis for making subclasses. It exists only to express the common properties of all its subclasses.

Back

Doubly linked list

Front

a linked list in which each element has both forward and backward pointers.

Back

Linked list

Front

a collection of nodes arranged so that each node contains a link to the next node in the sequence

Back

Public

Front

An access modifier that declares a class or method as available to any code.

Back

Private

Front

An access modifier that declares a class or method as only available from inside the same class as the variable.

Back

Peek

Front

Queue Operation: Retrieve an item at the front of the queue without removing it.

Back

Primitive types

Front

Byte, short, int, long, float, double, char, and boolean.

Back

Enums

Front

A special kind of class which has a fixed list of possible values.

Back

Insertion

Front

Adding a node to the tail of the list

Back

Setter

Front

A method that assigns a value to an instance variable.

Back

Getter

Front

A method that returns the value of an instance variable.

Back

Data member

Front

A class variable or instance variable that holds data associated with a class and its objects.

Back

Garbage collection

Front

automatic reclamation of memory occupied by objects that are no longer referenced

Back

Enqueue

Front

Queue Operation: Add an element to the rear.

Back

Two-dimensional array

Front

an array where the elements can be arranged in rows and columns.

Back

Dequeue

Front

Queue Operation: Retrieve an item from the front of the queue, and removes it from the queue

Back

Class

Front

Specifies what subroutines and variables that an object contains. It exists only for creating objects.

Back

Concrete

Front

A class that is not abstract

Back

Object

Front

A collection of variables and subroutines that belong to classes.

Back

Access modifiers

Front

default, public , protected, private

Back

Protected

Front

An access modifier that can be used in subclasses directly or indirectly of the class in which it is defined, but cannot be used in non-subclasses.

Back

Binary Search Tree

Front

A data structure very similar to a tree with the following additional restrictions. Each node can have only 0, 1 or 2 leaf nodes. All left nodes and all of its descendants have smaller values that the root node, while all right nodes and all of its descendants have larger values than the root node.

Back

Methods

Front

A procedure associated with a class. It defines the behavior of the objects that are created from the class.

Back

Inheritance

Front

Refers to the fact that one class can inherit part or all of its structure and behavior from another class.

Back

Singly linked list

Front

a data structure in which each list element contains a pointer to the next list element

Back

Constructor

Front

A method for creating an object in a class. Every class has at least one.

Back

This

Front

Can be used in the source code of an instance method to refer to the object that contains the method.

Back

Super

Front

Refers to the methods and variables in the superclass.

Back

Arrays

Front

a collection of items stored in a contiguous memory location and addressed using one or more indices

Back

Polymorphism

Front

where a method depends on the actual type of the object to which the method is applied.

Back