Question 1

The post-order traversal of a hypothetical binary tree is DEBFCA.What is the pre-order traversal?
A)ABCDEF
B)ABFDEC
C)ABDECF
D)BDACFE

Accepted Answer

In post-order traversal, the nodes are visited in the order of left child, right child, and then the parent. Given the post-order traversal DEBFCA, we can deduce that A is the root. Since D is the first in post-order, it's the leftmost child. E comes after D, suggesting E is D's right sibling or part of the right subtree. B comes after E but before F and C, indicating B is a parent node before F and C in the post-order, making F and C part of the right subtree. The pre-order traversal starts with the root, then explores the left subtree before the right subtree, leading to the sequence ABDECF.

Question 2

The depth of a complete binary tree is given by? A)D_n = n log₂n B)D_n = n log₂n+1 C)D_n = log₂n D)D_n = log₂n+1

Accepted Answer

D

Question 3

Which of the following data structure is linear type?
A)Strings
B)Lists
C)Queues
D)All of the above

Accepted Answer

Strings, lists, and queues are all examples of linear data structures. In a linear data structure, elements are arranged in a sequential order, where each element is connected to its previous and next element in a single level.

Question 4

Which data structure allows deleting data elements from front and inserting at rear?
A)Stacks
B)Queues
C)Deques
D)Binary search tree

Accepted Answer

Queues operate on the First In, First Out (FIFO) principle, allowing deletion of elements from the front and insertion at the rear.

Question 5

A binary tree can be converted into q 2-trees by doing what?
A)By pruning each empty subtree
B)By adding internal nodes
C)By adding external nodes
D)By replacing every empty subtree with a new external node

Accepted Answer

In a binary tree, converting it into a 2-tree involves ensuring that every internal node has exactly two children. This is achieved by replacing every empty subtree (a place where a child node could exist but doesn't) with a new external node, thus ensuring that every internal node has two children.

Question 6

When representing any algebraic expression E which uses only binary operations in a 2-tree,the variable in E will appear as external nodes and operations in internal nodes.

Accepted Answer

In a 2-tree representation of an algebraic expression that uses only binary operations, the variables (operands) appear as external nodes (leaves) and the operations (like +, -, *, /) are represented by the internal nodes. This structure reflects the hierarchical nature of the operations in the expression.

Question 7

The gradient refers to?
A)The distance between two points on a line
B)The length of a line
C)The shape of a line
D)The slope of a line

Accepted Answer

The gradient of a line refers to its slope, indicating how steep the line is.

Question 8

The x-intercept refers to?
A)Any plot of points on the graph perpendicular to the y-axis
B)Any plot of points on the graph perpendicular to the x-axis
C)Any plot of points on the graph parallel to the x-axis
D)The point where the line cuts the x-axis

Accepted Answer

The x-intercept is the point where a line or curve intersects the x-axis, which means it's the location where the value of y is zero.

Question 9

The gradient is calculated by?
A)Subtracting the rise from the run
B)Dividing the run by the rise
C)Multiplying the rise and the run
D)Dividing the rise (dy)by the run (dx)

Accepted Answer

The gradient of a line, often represented as the slope, is calculated by dividing the change in the vertical direction (rise or dy) by the change in the horizontal direction (run or dx).

Question 10

To represent hierarchical relationship between elements,which data structure is suitable?
A)Deque
B)Priority
C)Tree
D)All of the above

Accepted Answer

Trees are the most suitable data structure for representing hierarchical relationships between elements, as they naturally organize data in a hierarchy from the top (root) down to the leaves.

Question 11

Recursion is the process of repeating items in a self-similar way.

Accepted Answer

Recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem. This process involves a function calling itself directly or indirectly, creating a loop of repeated executions, which is a form of repetition in a self-similar way.

Question 12

The x-axis represents?
A)Consequence
B)Cause
C)Effect
D)Result

Accepted Answer

The x-axis represents the cause, as it is the independent variable that is being manipulated in the experiment.

Question 13

What are special pointers which point to nodes higher in a binary tree called?
A)Twig
B)Floor
C)Road
D)Thread

Accepted Answer

Thread pointers are used in threaded binary trees to make inorder traversal faster and do it without using a stack or recursion. They point to the next node in inorder traversal, which can be a node higher in the binary tree.

Question 14

Which of the following is a non-linear data structure?
A)Stacks
B)Lists
C)Strings
D)None of the above

Accepted Answer

Stacks, Lists, and Strings are all examples of linear data structures where elements are arranged in a sequential order. Non-linear data structures include trees and graphs, where data elements are not arranged in a sequential order.

Question 15

The 'y-axis on a graph is the ____ axis?
A)Vertical
B)Horizontal
C)Diagonal
D)Bell Curve

Accepted Answer

The y-axis on a graph is the vertical axis, which typically represents the dependent variable in a graph.

Question 16

Which data structure allows deletions at both ends of a list but insertion only at one end?
A)Input-restricted deque
B)Output-restricted deque
C)Standard scores
D)Priority queues

Accepted Answer

An input-restricted deque allows insertion at only one end but allows deletion at both ends, fitting the description given.

Question 17

An ordered pair is?
A)Any two numbers where the order is important
B)Any plot of points on the graph perpendicular to the x-axis
C)Any plot of points on the graph parallel to the x-axis
D)The point where the line cuts the x-axis

Accepted Answer

The answer of An ordered pair is?
A)Any two numbers where...

Question 18

Which type of sort algorithm repeatedly steps through a list,comparing each pair of adjacent items and swapping them,if they appear in the wrong order?
A)Bubble sort
B)Insertion sort
C)Quick sort
D)Sinking sort

Accepted Answer

The answer of Which type of sort algorithm repeatedly steps...

Question 19

When converting a binary tree into an extended binary tree,all the original nodes become external on the extended tree.

Accepted Answer

In an extended binary tree (also known as a full binary tree), all the original nodes of the binary tree become internal nodes, not external. External nodes (or leaves) are added to ensure that every internal node has exactly two children.

Question 20

Which of the following is a definition of a complete binary tree?
A)A binary tree in which every level is completely filled and all nodes are as far left as possible
B)A binary tree in which no level is completely filled and all nodes are as far left as possible
C)A binary tree in which every level is completely filled and all nodes are as far right as possible
D)A binary tree in which no level is completely filled and all nodes are as far right as possible

Accepted Answer

A complete binary tree is defined as a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible. This matches the description given in option A.

Quiz 5: Exploring Data With Graphs

The post-order traversal of a hypothetical binary tree is DEBFCA.What is the pre-order traversal?

The depth of a complete binary tree is given by?

Which of the following data structure is linear type?

Which data structure allows deleting data elements from front and inserting at rear?

A binary tree can be converted into q 2-trees by doing what?

When representing any algebraic expression E which uses only binary operations in a 2-tree,the variable in E will appear as external nodes and operations in internal nodes.

The gradient refers to?

The x-intercept refers to?

The gradient is calculated by?

To represent hierarchical relationship between elements,which data structure is suitable?

Recursion is the process of repeating items in a self-similar way.

The x-axis represents?

What are special pointers which point to nodes higher in a binary tree called?

Which of the following is a non-linear data structure?

The 'y-axis on a graph is the ____ axis?

Which data structure allows deletions at both ends of a list but insertion only at one end?

An ordered pair is?

Which type of sort algorithm repeatedly steps through a list,comparing each pair of adjacent items and swapping them,if they appear in the wrong order?

When converting a binary tree into an extended binary tree,all the original nodes become external on the extended tree.

Which of the following is a definition of a complete binary tree?