Back to marketplace
Data structure
No description yet. This curated deck is ready for daily study.
Total cards: 6•Content version: v4•Public deck•Updated: 8/1/2026
Card preview (6)
#1
Front (Question)
Back (Answer)
#2
Front (Question)
Arrays
Back (Answer)
A data structure that stores a collection of items at contiguous memory locations.
#3
Front (Question)
Array
Back (Answer)
Fixed size, elements accessed by index, efficient for random access. - Example: int[] numbers = {1, 2, 3, 4, 5}
#4
Front (Question)
Linked Lists
Back (Answer)
Definition: A data structure consisting of a sequence of elements, each pointing to the next
#5
Front (Question)
Linked list
Back (Answer)
-Dynamic size, elements accessed sequentially, efficient for insertion/deletion. - Types: Singly linked list, doubly linked list.
#6
Front (Question)
Stack
Back (Answer)
• Definition: A data structure that follows the Last In, First Out (LIFO) principle. • Operations: Push (add element), Pop (remove top element), Peek (view top element). • Example: Function call stack.