Data - more nodes!

studied byStudied by 0 people
0.0(0)
learn
LearnA personalized and smart learning plan
exam
Practice TestTake a test on your terms and definitions
spaced repetition
Spaced RepetitionScientifically backed study method
heart puzzle
Matching GameHow quick can you match all your cards?
flashcards
FlashcardsStudy terms and definitions

1 / 27

encourage image

There's no tags or description

Looks like no one added any tags here yet for you.

28 Terms

1

Data Structure

A systematic way of organizing and accessing data.

New cards
2

Algorithm

A generic step-by-step set of instructions for solving a problem.

New cards
3

Abstract Data Type (ADT)

A theoretical model of a data structure that specifies what operations are allowed but not how they are implemented.

New cards
4

Big O Notation

Describes the worst-case complexity of an algorithm.

New cards
5

O(1)

Constant time – operations take the same time regardless of input size.

New cards
6

O(n)

Linear time – performance scales directly with input size.

New cards
7

O(n²)

Quadratic time – performance scales with the square of input size.

New cards
8

O(log n)

Logarithmic time – performance scales logarithmically with input size.

New cards
9

O(bⁿ)

Exponential time – performance doubles with each additional input.

New cards
10

O(n!)

Factorial time – performance grows extremely fast with input size.

New cards
11

Inheritance

A class can inherit attributes and methods from another class.

New cards
12

Constructor (init)

A special function that initializes an object.

New cards
13

Access Control

Refers to the visibility of variables; public, protected, and private attributes.

New cards
14

Stack

A linear data structure that follows the Last In, First Out (LIFO) principle.

New cards
15

Queue

A linear data structure that follows the First In, First Out (FIFO) principle.

New cards
16

Deque

A data structure that allows insertions and deletions from both the front and back (double-ended queue).

New cards
17

Node

A fundamental building block of linked data structures, consisting of a data field and a reference to the next node.

New cards
18

push(item)

Adds an item to the top of the stack.

New cards
19

pop()

Removes and returns the top item from the stack.

New cards
20

peek()

Returns the top item from the stack without removing it.

New cards
21

enqueue(item)

Adds an item to the back of the queue.

New cards
22

dequeue()

Removes and returns the front item from the queue.

New cards
23

add_front(item)

Adds an item to the front of the deque.

New cards
24

add_rear(item)

Adds an item to the back of the deque.

New cards
25

remove_front()

Removes and returns the front item from the deque.

New cards
26

remove_rear()

Removes and returns the back item from the deque.

New cards
27

self Keyword

Refers to the instance of the class.

New cards
28

str Method

Defines how an object is represented as a string.

New cards
robot