Question 1

The post-order traversal of a hypothetical binary tree is DEBFCA.What is the pre-order traversal?&#10;A)ABCDEF&#10;B)ABFDEC&#10;C)ABDECF&#10;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?&#10;A)Strings&#10;B)Lists&#10;C)Queues&#10;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?&#10;A)Stacks&#10;B)Queues&#10;C)Deques&#10;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?&#10;A)By pruning each empty subtree&#10;B)By adding internal nodes&#10;C)By adding external nodes&#10;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?&#10;A)The distance between two points on a line&#10;B)The length of a line&#10;C)The shape of a line&#10;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?&#10;A)Any plot of points on the graph perpendicular to the y-axis&#10;B)Any plot of points on the graph perpendicular to the x-axis&#10;C)Any plot of points on the graph parallel to the x-axis&#10;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?&#10;A)Subtracting the rise from the run&#10;B)Dividing the run by the rise&#10;C)Multiplying the rise and the run&#10;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?&#10;A)Deque&#10;B)Priority&#10;C)Tree&#10;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

The answer of Recursion is the process of repeating items...

Question 12

The x-axis represents?&#10;A)Consequence&#10;B)Cause&#10;C)Effect&#10;D)Result

Accepted Answer

The answer of The x-axis represents?&#10;A)Consequence&#10;B)Cause&#10;C)Effect&#10;D)Result...

Question 13

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

Accepted Answer

The answer of What are special pointers which point to...

Question 14

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

Accepted Answer

The answer of Which of the following is a non-linear...

Question 15

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

Accepted Answer

The answer of The 'y-axis on a graph is the...

Question 16

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

Accepted Answer

The answer of Which data structure allows deletions at both...

Question 17

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

Accepted Answer

The answer of An ordered pair is?&#10;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?&#10;A)Bubble sort&#10;B)Insertion sort&#10;C)Quick sort&#10;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

The answer of When converting a binary tree into an...

Question 20

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

Accepted Answer

The answer of Which of the following is a definition...

Question 21

A connected graph T without any cycles is called?&#10;A)A tree graph&#10;B)Free tree&#10;C)A tree&#10;D)All of the above

Accepted Answer

The answer of A connected graph T without any cycles...

Question 22

In a graph if e=(u,v)then?&#10;A)e never reaches either u or v&#10;B)e begins at u and ends at v&#10;C)e = 0&#10;D)None of the above

Accepted Answer

The answer of In a graph if e=(u,v)then?&#10;A)e never reaches...

Question 23

Which of the following is a definition of the heap property?&#10;A)Each node will always equal that of its 'children'&#10;B)Each node is greater than or equal to each of its 'children'&#10;C)Each node is less than each of its 'children'&#10;D)None of above

Accepted Answer

The answer of Which of the following is a definition...

Question 24

A binary search tree can sometimes be called what?&#10;A)Binary tree&#10;B)Ordered binary tree&#10;C)Heap&#10;D)Sapling

Accepted Answer

The answer of A binary search tree can sometimes be...

Question 25

In a graph if e=[u,v],then u and v are called?&#10;A)Negative values&#10;B)Not points on the graph&#10;C)Neighbours&#10;D)None of the above

Accepted Answer

The answer of In a graph if e=[u,v],then u and...

Deck 5: Exploring Data With Graphs