Introduction to Data Structures Flashcards

1
Q

What are some examples of Abstract Data Types (ADTs)?

A
  • Array
  • List
  • Map
  • Queue
  • Set
  • Stack
  • Table
  • Tree
  • Vector
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are primitive data structures?

A

Data structures that are directly operated upon the machine level instructions.

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

List the primitive data structures.

A
  • INTEGER
  • FLOAT/DOUBLE
  • CHARACTER
  • STRING
  • POINTERS
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What challenges arise due to increasing application complexity and data volume?

A
  • Processor speed
  • Data search
  • Multiple requests
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is a file in the context of data structures?

A

A collection of various records of one type of entity.

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

Define an entity in data structures.

A

An entity represents the class of certain objects and contains various attributes.

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

What is a field in data structures?

A

A single elementary unit of information representing the attribute of an entity.

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

What is a group item?

A

Data items that have subordinate data items.

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

Define a record in data structures.

A

A collection of various data items grouped together.

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

How can data structures be defined?

A

As a group of data elements that provides an efficient way of storing and organizing data.

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

What is the relationship between data structures and software performance?

A

Data structures play a vital role in enhancing the performance of software by enabling efficient data storage and retrieval.

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

What is information?

A

Meaningful or processed data that results from systematic arrangement of data.

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

What are non-primitive data structures?

A

Data structures derived from primitive data structures, emphasizing the structuring of homogeneous or heterogeneous data items.

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

What are linear data structures?

A

Data structures that have homogeneous elements arranged in a sequence.

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

List examples of linear data structures.

A
  • Stack
  • Queue
  • Linked Lists
  • Arrays
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is a static data structure?

A

A data structure with a fixed size.

17
Q

What is a dynamic data structure?

A

A data structure that is not fixed in size and can be modified during operations.

18
Q

What is a stack ADT?

A

A restricted data structure where all insertion and deletions are made at one end, following Last In First Out (LIFO) principle.

19
Q

What operations can be performed on a stack?

A
  • Push()
  • Pop()
  • isEmpty()
  • Size()
  • Peek()
20
Q

What is a queue ADT?

A

An ordered collection of items where insertion occurs at the rear and removal at the front, following First In First Out (FIFO) principle.

21
Q

What operations can be performed on a queue?

A
  • Enqueue(item)
  • Dequeue()
  • isEmpty()
  • Size()
22
Q

What are the advantages of data abstraction?

A
  • Avoids low level code
  • Increases reusability
  • Allows independent internal implementation changes
  • Enhances application security
23
Q

What is the definition of Abstract Data Types (ADTs)?

A

A specification of a set of data and the operations performed on that data, hiding how operations are implemented.

24
Q

What are the basic operations performed on data structures?

A
  • Insertion
  • Deletion
  • Searching
  • Traversal
  • Sorting
  • Merging
25
Q

What distinguishes non-linear data structures?

A

Data items are connected to several other data items, often exhibiting hierarchical or parent-child relationships.

26
Q

List examples of non-linear data structures.

A
  • Trees
  • Graphs
  • Hash table
27
Q

What is data?

A

Quantities, characters, or symbols on which operations are performed by a computer.

28
Q

What is the role of software engineering?

A

The study of creating large applications based on end user requirements, covering the full lifecycle of software projects.

29
Q

What is the relationship between program, algorithm, and data structure?

A

Program = Algorithm + Data Structure