1st Year Computer Chapter 4 TestComputational Structures

Q1. Multiple choice questions (Attempt all · 10 × 1 = 10)

1. Which graph allows movement in only one direction between two nodes?

   1. Undirected graph

   2. Weighted graph

   3. Circular graph

   4. Directed graph

2. Which data structure has a root node and follows a hierarchy?

   1. Graph

   2. Queue

   3. Stack

   4. Tree

3. In Python, which data structure can be used to simulate a queue?

   1. Tuple

   2. List

   3. Set

   4. Dictionary

4. Lists are helpful in implementing which of the following?

   1. Arrays only

   2. Graphs only

   3. Stack and Queue

   4. None of the above

5. What are the components of a graph?

   1. Roots and branches

   2. Nodes and files

   3. Vertices and edges

   4. Parents and children

6. Which of the following best represents a leaf node?

   1. Node with one child

   2. Node with multiple children

   3. Node without children

   4. Node with a parent only

7. Which function is used to remove the first occurrence of an item from a list by value?

   1. delete( )

   2. pop( )

   3. erase( )

   4. remove( )

8. What is the function of edges in a tree?

   1. Store data

   2. Connect nodes

   3. Delete nodes

   4. Sort data

9. Which traversal method is used when deleting a file system?

   1. Pre-order

   2. In-order

   3. Post-order

   4. Level-order

10. An operation that removes an item from the top of the stack:

    1. Push

    2. Pop

    3. Peek

    4. Add