CSE 12 – Basic Data Structures Vocabulary

This set of flashcards includes key vocabulary terms and their definitions relevant to CSE 12 – Basic Data Structures.

Generics

A feature in Java that allows the creation of classes, interfaces, and methods with a placeholder for data type.

ArrayList

A resizable array implementation of the List interface in Java.

Linked List

A linear data structure where each element is a separate object, linked using pointers.

Iterator

An interface in Java that provides a way to iterate through a collection without exposing its underlying representation.

Runtime Analysis

The study of the time complexity and performance of algorithms.

Hashing

A technique used to uniquely identify a specific object from a group of similar objects by using a hash function.

Stack

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

Queue

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

Priority Queue

An abstract data type where each element has a priority and elements with higher priorities are served before those with lower priorities.

Binary Tree

A tree data structure where each node has at most two children, referred to as the left child and the right child.

Binary Search Tree

A binary tree in which all the left descendants of a node are less than the node, and all the right descendants are greater.

Sorting Algorithms

Procedures to arrange elements in a certain order (e.g., ascending or descending).