Intro to DSA

Which of the following best describes a data structure?

• A programming language

• A way to organize and store data in memory

• A secret code only nerds understand

• A type of algorithm

Answer explanation

Data structures help arrange data efficiently. Like how students survive college: if you don’t organize your notes, files, and barkada group projects properly, your life (and your code) becomes chaos.

An algorithm can be best compared to:

• A shortcut in coding

• A recipe or step-by-step instruction

• A random sequence of code

• A last-minute cramming session

Answer explanation

Algorithms are like recipes. Skip a step and you’ll end up with sunog na pancit canton.

What is the time complexity of linear search in the worst case?

• O(1) – Easy peasy

• O(log n) – Smarter than it looks

• O(n) – Gotta check everything

• O(n²) – May the odds be ever in your favor

Answer explanation

Worst case: you check everything.
Linear search = “look through every paper in your bag until you find the assignment.”

In pseudocode, what keyword is often used for a repetition/loop?

• START

• END

• WHILE

• PRINT

Answer explanation

In pseudocode, WHILE (or FOR) usually represents repetition.
Because “WHILE True” loops are basically Netflix asking “Are you still watching?”

Which of the following is NOT a linear data structure?

• ARRAY

• QUEUE

• STACK

• GRAPH

Answer explanation

Graphs aren’t linear, just like relationships—messy and full of unexpected connections.

Big-O notation is used to describe:

• The programming syntax

• The growth rate of algorithms

• The number of lines of code

• The memory address of variables

Answer explanation

Big-O tells you how much your program suffers when data gets bigger… like your stress during finals week.

Which data structure works on the principle of First In, First Out (FIFO)?

• Queue

• Stack

• Array

• Tree

Answer explanation

First come, first served. Like the line at Jollibee—unless someone is feeling bee-da bee-da sa linya.

Arrays allow random access to elements using an index.

• True

• False

• Trulse

Answer explanation

Arrays are like instant stalk mode: you can go directly to their profile and find your crush’s latest selfie without scrolling.

A linked list requires contiguous memory allocation.

• False

• True

• Trulse

Answer explanation

Linked lists use non-contiguous memory with pointers/links.
Parang barkada nyo lang: scattered everywhere, but still connected somehow (messenger = link).

Which notation is commonly used to express time and space complexity

• Pi (π) Notation

• Sigma (Σ) Notation

• Delta (Δ) Notation

• Big O Notation

Answer explanation

The language of efficiency.
Big O is like the syllabus.
It doesn’t show every detail of the lesson, but it gives you the “big picture” of how heavy the workload will be.