Data Structure and Algorithm Orientation (ITE 031 – SAS #1)

Vocabulary flashcards covering key terms from the ITE 031 Data Structure and Algorithm orientation, including fundamental concepts, programming paradigms, languages, and course logistics.

Data Structure

A group of data elements that provides an efficient way of storing, organizing, retrieving, and processing data in a computer (e.g., arrays, linked lists, stacks, queues, trees).

Algorithm

A finite, ordered set of steps written to solve a particular problem or perform a specific task.

Programming Language

A vocabulary and set of grammatical rules used to instruct a computer to perform specific tasks.

High-Level Language

User-friendly programming language (e.g., BASIC, C, C++, COBOL, Java, Fortran, Ada, Lisp, Pascal) that abstracts hardware details.

C++

A language supporting procedural and object-oriented programming; popular for systems, browsers, and game development.

Java

An object-oriented language known for rich standard libraries and built-in data-structure classes such as ArrayList, Stack, and Queue.

Array

A contiguous, fixed-size collection of elements of the same type, accessible by index.

Linked List

A linear data structure where elements (nodes) point to the next element, enabling dynamic insertion and deletion.

Stack

A LIFO (Last-In, First-Out) data structure supporting push and pop operations.

Queue

A FIFO (First-In, First-Out) data structure supporting enqueue and dequeue operations.

Node

A basic unit in linked structures (lists, trees, graphs) containing data and one or more links to other nodes.

Tree

A hierarchical data structure consisting of nodes with parent-child relationships, starting from a single root.

Object-Oriented Programming (OOP)

A programming paradigm that models software as interacting objects with attributes and behaviors.

Procedural Programming

A programming paradigm based on procedures or routines (functions) that operate on data.

Structured Programming

A style emphasizing linear flow using sequence, selection, and iteration constructs to improve readability and maintenance.

Event-Driven Programming

A paradigm where program flow is determined by events such as user actions, sensor output, or messages from other programs.

Pseudocode

Plain-language description of an algorithm’s steps, written to be easily understood before coding.

Compiler

A program that translates source code written in a high-level language into machine code executable by a computer.

Interpreter

A program that directly executes instructions written in a programming language without previously compiling them into machine code.

Primitive Data Type

The most basic data types provided by a programming language (e.g., int, char, float) used to build more complex structures.

Data Science Perspective on DSA

Using data structures and algorithms to measure how data responds to user requests, manage memory, and optimize database operations.

JDoodle

An online compiler platform that allows users to write, compile, and run Java, C++, and other languages in a web browser.

Class Standing

A component of the grading system (10%) that reflects attendance and participation.

Periodical Examination

A major assessment worth 40% of the periodical grade in the course.