OOP and Data Structures & Algorithms Reviewer

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/61

flashcard set

Earn XP

Description and Tags

Comprehensive vocabulary review cards covering Java Object-Oriented Programming (classes, variables, methods, constructors, access modifiers, inheritance) and fundamental Data Structures and Algorithms (stacks, queues, linked lists, operations, and time complexities).

62 Terms

1
New cards

Class

A blueprint used for creating objects.

2
New cards

Object

An instance of a class.

3
New cards

Attributes

Variables that store data inside a class.

4
New cards

Instance variable

A variable that is unique for each object.

5
New cards

Static variable

A variable that is shared by all objects of a class.

6
New cards

Methods

Blocks of code that define the actions and behavior of a class.

7
New cards

void

A return type keyword indicating that a method has no return value.

8
New cards

return

A keyword and statement that sends a value back from a method.

9
New cards

Getter

An accessor method used to read a value.

10
New cards

Setter

A mutator method used to change a value.

11
New cards

Static Methods

Methods that belong to the class itself rather than to individual objects.

12
New cards

this Reference

A keyword that refers to the current object.

13
New cards

Method Overloading

Defining methods with the same name but different parameters.

14
New cards

Constructor

A special method that has the same name as the class, no return type, and is called to initialize objects.

15
New cards

Constructor overloading

Defining multiple constructors within the same class with different parameters.

16
New cards

this()

A constructor call that invokes another constructor in the same class, and must be the first statement.

17
New cards

Package

A mechanism used to group related classes.

18
New cards

Import

A keyword used to access and use classes from other packages.

19
New cards

java.lang

A standard Java package that is automatically imported into programs.

20
New cards

CLASSPATH

An environment setting that tells Java where to find classes and packages, using ; as a separator on Windows and : on Linux.

21
New cards

public (Access Modifier)

An access modifier that makes members accessible everywhere.

22
New cards

private (Access Modifier)

An access modifier that restricts accessibility to the same class only.

23
New cards

protected (Access Modifier)

An access modifier that allows access within the same package and subclasses (allows inherited access).

24
New cards

default (Access Modifier)

An access modifier level where access is restricted to the same package only.

25
New cards

Java Class Library (JCL)

A collection of ready-made classes and packages in Java that provides existing methods and functions so programmers do not need to create everything themselves.

26
New cards

Inheritance

An OOP concept that allows a class to inherit fields and methods from another class.

27
New cards

extends

A keyword used in class declarations to inherit from a class.

28
New cards

super()

A statement used to call the parent class constructor.

29
New cards

super(value)

A statement used to call a parent constructor with arguments.

30
New cards

Stack

A linear data structure that follows LIFO (Last In, First Out), where the last element added is the first one removed.

31
New cards

LIFO

Last In, First Out.

32
New cards

PUSH

The basic stack operation used to add an element.

33
New cards

POP

The basic stack operation used to remove the top element.

34
New cards

TOP/PEEK

An operation used to view the top element of a stack.

35
New cards

ISEMPTY

An operation used to check if the stack or data structure is empty.

36
New cards

Overflow

An error condition that occurs when attempting to add an element when the data structure is full.

37
New cards

Underflow

An error condition that occurs when attempting to remove an element when the data structure is empty.

38
New cards

Queue

A linear data structure that follows FIFO (First In, First Out), where the first element added is the first one removed.

39
New cards

FIFO

First In, First Out.

40
New cards

ENQUEUE

The basic queue operation used to add an element.

41
New cards

DEQUEUE

The basic queue operation used to remove the first element.

42
New cards

FRONT

The first element or head position of a queue.

43
New cards

REAR

The last element or tail position of a queue.

44
New cards

Circular Queue

A queue type where the last position connects back to the first.

45
New cards

Priority Queue

A queue type where elements are removed based on priority.

46
New cards

Deque

A queue type that allows insertion and deletion at both ends.

47
New cards

Linked List

A linear data structure made of nodes, where each node contains data and a pointer to the next node.

48
New cards

DATA (Node)

The part of a node that stores the value (also referred to as INFO).

49
New cards

NEXT/LINK

The part of a node that stores the address or pointer pointing to the next node.

50
New cards

Singly Linked List

A linked list type where each node points only to the next node.

51
New cards

Doubly Linked List

A linked list type where nodes point to both previous and next nodes.

52
New cards

Circular Linked List

A linked list type where the last node connects back to the first node.

53
New cards

START/HEAD

The pointer or reference pointing to the first node in a linked list.

54
New cards

NULL

A pointer value in a linked list indicating there is no next node.

55
New cards

Traversal

A basic operation that visits each node in a linked list.

56
New cards

Stack Push (Time Complexity)

The typical time complexity is O(1)O(1).

57
New cards

Stack Pop (Time Complexity)

The typical time complexity is O(1)O(1).

58
New cards

Queue Enqueue (Time Complexity)

The typical time complexity is O(1)O(1).

59
New cards

Queue Dequeue (Time Complexity)

The typical time complexity is O(1)O(1).

60
New cards

Linked List Traversal (Time Complexity)

The typical time complexity is O(n)O(n).

61
New cards

Linked List Search (Time Complexity)

The typical time complexity is O(n)O(n).

62
New cards

Linked List Insert at Beginning (Time Complexity)

The typical time complexity is O(1)O(1).