Data Structures Flashcards

1
Q

Array

A

A collection of elements identified by index or key. Arrays have a fixed size and allow constant time access to elements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Linked List

A

A linear data structure where elements are stored in nodes, each pointing to the next node. Allows dynamic size and efficient insertions/deletions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Stack

A

A collection of elements that follows the last in, first out principle. Supports operations like push and pop

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Queue

A

A collection of elements that follows the First in, first out principle. Supports operation like enqueue and dequeue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Hash table

A

A data structure that maps keys to values using a hash function. Provides efficient lookups, insertions, and deletions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Binary tree

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Graph

A

A collection of nodes and edges connecting pairs of nodes. Can be directed or undirected

How well did you know this?
1
Not at all
2
3
4
5
Perfectly