Chapter 11. Programming

Question 1

What are primitive data types?

Answer 1

• Basic data types provided by a programming language.
• Examples: Integer, Float, Boolean, Character.

Question 2

What is the difference between an integer and a float?

Answer 2

• Integer: A whole number without a decimal point.
• Float: A number with a fractional part, represented with a decimal point.

Question 3

What is a Boolean data type?

Answer 3

• A data type that can hold one of two values: True or False.
• Used in logical operations and control structures.

Question 4

What is a character data type?

Answer 4

• A single letter, number, or symbol enclosed in single quotes.
• Represents text in programming.

Question 5

What are composite data types?

Answer 5

• Data types that can store multiple values or a collection of items.
• Examples: Arrays, Lists, Tuples.

Question 6

What is an array?

Answer 6

• A collection of elements, all of the same data type, stored in contiguous memory locations.
• Accessed using an index.

Question 7

What are the advantages of using arrays?

Answer 7

• Fast access to elements using indices.
• Efficient in terms of memory usage for fixed-size collections.

Question 8

What is a linked list?

Answer 8

• A linear data structure where each element (node) points to the next.
• Allows for dynamic memory allocation and efficient insertions/deletions.

Question 9

What is the difference between a singly linked list and a doubly linked list?

Answer 9

• Singly linked list: Each node points to the next node only.
• Doubly linked list: Each node points to both the next and previous nodes.

Question 10

What is a stack?

Answer 10

• A linear data structure that follows the Last In, First Out (LIFO) principle.
• Common operations: Push (add), Pop (remove).

Question 11

What are the applications of a stack?

Answer 11

• Used in expression evaluation, function call management, undo operations in software.

Question 12

What is a queue?

Answer 12

• A linear data structure that follows the First In, First Out (FIFO) principle.
• Common operations: Enqueue (add), Dequeue (remove).

Question 13

What are the differences between a queue and a stack?

Answer 13

• Queue: FIFO structure, elements are added at one end and removed from the other.
• Stack: LIFO structure, elements are added and removed from the same end.

Question 14

What is a priority queue?

Answer 14

• A data structure where each element has a priority.
• Elements with higher priority are dequeued before elements with lower priority.

Question 15

What is a hash table?

Answer 15

• A data structure that maps keys to values using a hash function.
• Provides fast access to elements based on key.

Question 16

What are the common uses of hash tables?

Answer 16

• Implementing associative arrays, caches, and sets.
• Used for fast data retrieval.

Question 17

What is a binary tree?

Answer 17

• A hierarchical data structure where each node has at most two children (left and right).
• Used in searching, sorting, and hierarchical data representation.

Question 18

What is the difference between a binary search tree and a balanced binary tree?

Answer 18

• Binary search tree: Left child is less than the parent, right child is greater.
• Balanced binary tree: Maintains a balanced height to ensure efficient operations.

Question 19

What is a graph?

Answer 19

• A collection of nodes (vertices) connected by edges.
• Can be directed or undirected, weighted or unweighted.

Question 20

What are the types of graphs in data structures?

Answer 20

• Directed graph: Edges have a direction.
• Undirected graph: Edges have no direction.
• Weighted graph: Edges have weights/costs associated with them.

Question 21

What is a tuple in programming?

Answer 21

• An ordered collection of elements that can be of different data types.
• Immutable, meaning its elements cannot be changed after creation.

Question 22

What is a set in data structures?

Answer 22

• An unordered collection of unique elements.
• Supports operations like union, intersection, and difference.

Question 23

What are the differences between a list and a tuple?

Answer 23

• List: Mutable, can be modified after creation.
• Tuple: Immutable, cannot be modified after creation.

Question 24

What is a dictionary in programming?

Answer 24

• A collection of key-value pairs where each key is unique.
• Allows fast lookup, addition, and deletion of key-value pairs.

Question 25

What are the advantages of using a dictionary over a list?

Answer 25

- Provides faster lookup times for key-value pairs. - Suitable for associative data where fast access is required.