DATA STRUCTURES SET:1
Read the paragraph and answer the following questions
A tree is a special type of data structure that looks like an upside-down tree in real life. It starts with a
single node called the root, and each node can have child nodes. One common type of tree is the binary
tree, where each node has at most two children. Trees are used to store data in a way that makes searching
and sorting faster. A binary search tree (BST) is a kind of tree where all smaller values go to the left and
larger values go to the right. Trees are used in many places like file systems, decision-making systems, and
computer games.
1. What is the top node of a tree called?
Answer:
2. What is a tree in data structures?
Answer:
3. How many children can a node have in a binary tree?
Answer:
4. What is a binary search tree (BST)?
Answer:
5. What are the nodes below a parent node called?
Answer:
6. Where are trees used in real life?
Answer:
7. What do we call a node that has no children?
Answer:
8. Why are trees useful?
Answer:
9. What kind of structure does a tree follow?
Answer:
10. Can a tree have more than one root?
Answer:
DATA STRUCTURES SET:2
Read the paragraph and answer the following questions
A data structure is a way of organizing and storing data so it can be used efficiently. Different data
structures are used for different purposes. For example, arrays store items in a fixed-size list, while linked
lists store items in a chain of connected nodes. A stack allows data to be added and removed in a "last in,
first out" way, and a queue uses "first in, first out." Trees are used to show data in a hierarchy, like a family
tree, and graphs show how things are connected. Choosing the right data structure helps programs run
faster and use less memory.
1. What is a data structure?
Answer:
2. What is an array?
Answer:
3. What is a linked list?
Answer:
4. How does a stack work?
Answer:
5. How does a queue work?
Answer:
6. What is a tree in data structures?
Answer:
7. What is a graph used for?
Answer:
8. Which data structure is best for undo operations?
Answer:
9. Which data structure is often used in printer queues?
Answer:
10. Why are data structures important?
Answer:
DATA STRUCTURES SET:3
Read the paragraph and answer the following questions
Data structures help us manage and organize data in a computer. They make it easier to find, add, and
remove information. For example, a stack is like a stack of books—you take the top one first. A queue is like
a line of people waiting—you serve the first person who came in. Arrays are useful when you know how
many items you have, while linked lists are better when the number of items can change. Hash tables store
data using a key, like how you look up a word in a dictionary. Trees are good for storing data in a sorted
order, and graphs are used to show connections, like maps or social networks.
1. Why do we use data structures?
Answer:
2. What is a stack similar to?
Answer:
3. What real-life example is like a queue?
Answer:
4. When is an array useful?
Answer:
5. What makes a linked list different from an array?
Answer:
6. What does a hash table use to store data?
Answer:
7. When would you use a tree?
Answer:
8. What are graphs used for?
Answer:
9. What does FIFO stand for in queues?
Answer:
10. What kind of order does a stack use?
Answer: