Introduction to Data Structures Flashcards
What are some examples of Abstract Data Types (ADTs)?
- Array
- List
- Map
- Queue
- Set
- Stack
- Table
- Tree
- Vector
What are primitive data structures?
Data structures that are directly operated upon the machine level instructions.
List the primitive data structures.
- INTEGER
- FLOAT/DOUBLE
- CHARACTER
- STRING
- POINTERS
What challenges arise due to increasing application complexity and data volume?
- Processor speed
- Data search
- Multiple requests
What is a file in the context of data structures?
A collection of various records of one type of entity.
Define an entity in data structures.
An entity represents the class of certain objects and contains various attributes.
What is a field in data structures?
A single elementary unit of information representing the attribute of an entity.
What is a group item?
Data items that have subordinate data items.
Define a record in data structures.
A collection of various data items grouped together.
How can data structures be defined?
As a group of data elements that provides an efficient way of storing and organizing data.
What is the relationship between data structures and software performance?
Data structures play a vital role in enhancing the performance of software by enabling efficient data storage and retrieval.
What is information?
Meaningful or processed data that results from systematic arrangement of data.
What are non-primitive data structures?
Data structures derived from primitive data structures, emphasizing the structuring of homogeneous or heterogeneous data items.
What are linear data structures?
Data structures that have homogeneous elements arranged in a sequence.
List examples of linear data structures.
- Stack
- Queue
- Linked Lists
- Arrays
What is a static data structure?
A data structure with a fixed size.
What is a dynamic data structure?
A data structure that is not fixed in size and can be modified during operations.
What is a stack ADT?
A restricted data structure where all insertion and deletions are made at one end, following Last In First Out (LIFO) principle.
What operations can be performed on a stack?
- Push()
- Pop()
- isEmpty()
- Size()
- Peek()
What is a queue ADT?
An ordered collection of items where insertion occurs at the rear and removal at the front, following First In First Out (FIFO) principle.
What operations can be performed on a queue?
- Enqueue(item)
- Dequeue()
- isEmpty()
- Size()
What are the advantages of data abstraction?
- Avoids low level code
- Increases reusability
- Allows independent internal implementation changes
- Enhances application security
What is the definition of Abstract Data Types (ADTs)?
A specification of a set of data and the operations performed on that data, hiding how operations are implemented.
What are the basic operations performed on data structures?
- Insertion
- Deletion
- Searching
- Traversal
- Sorting
- Merging
What distinguishes non-linear data structures?
Data items are connected to several other data items, often exhibiting hierarchical or parent-child relationships.
List examples of non-linear data structures.
- Trees
- Graphs
- Hash table
What is data?
Quantities, characters, or symbols on which operations are performed by a computer.
What is the role of software engineering?
The study of creating large applications based on end user requirements, covering the full lifecycle of software projects.
What is the relationship between program, algorithm, and data structure?
Program = Algorithm + Data Structure