DSA Prelim Exam Reviewer

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

1/26

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering key Data Structures and Algorithms terms, definitions, and concepts based on the prelim exam reviewer.

Last updated 9:24 PM on 9/8/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

27 Terms

1
New cards

Algorithm

A step-by-step procedure used to solve a problem.

2
New cards

Array

A collection of elements stored in an ordered sequence.

3
New cards

Linear Data Structure

A data structure where elements are arranged one after another.

4
New cards

Linked List

A collection or sequence of nodes connected using pointers.

5
New cards

Index

The position of an element in an array, which usually starts at 0.

6
New cards

Iteration

The repetition of instructions using a loop.

7
New cards

Non-Linear Data Structure

A data structure where elements are not arranged in a single sequence.

8
New cards

ADT (Abstract Data Type)

Describes the operations that can be performed on a data structure without specifying how they are implemented.

9
New cards

Elements

The individual items stored in a data structure.

10
New cards

Length

The number of elements in a data structure.

11
New cards

Data Structure

A way of organizing and storing data so it can be used efficiently.

12
New cards

Public / External

Data or operations that can be accessed from outside a class or structure.

13
New cards

Pointer Field

A part of a node that stores the address or reference of another node.

14
New cards

Head

The pointer that refers to the first node of a linked list.

15
New cards

Simple Variable

A variable that stores one value.

16
New cards

Recursion

A process where a function calls itself to solve a problem.

17
New cards

Private / Internal

Data or operations that can only be accessed inside a class or structure.

18
New cards

Data Field

The part of a node that stores the actual data.

19
New cards

Recursive

A function or process that calls itself.

20
New cards

Stack

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

21
New cards

Push

A stack operation that adds an element.

22
New cards

Pop

A stack operation that removes an element.

23
New cards

Peek / Top

A stack operation to view the top element.

24
New cards

Doubly Linked List

A linked list where each node has two pointers: Previous pointer and Next pointer.

25
New cards

Binary Recursion

A recursive function that makes two recursive calls.

26
New cards

Predecessor

The element or node that comes before another element or node.

27
New cards

Nodes

The individual parts of a linked list that commonly contain a data field and a pointer field.