It solves the single-source shortest-path problem of finding shortest paths from a given vertex to all the other vertices of a nonnegative weighted graph by comparing total weight from all possible paths.

Dijkstra's Shortest Path Algorithm

Statement 1: An AVL tree is a self-balancing binary search tree in which the heights of the left and right subtrees could differ at most by 1 for every node. Statement 2: The difference between the height of the left subtree and the height of the right subtree of a node is called the balance factor (BF) of the node, and the balance factor of any node in an AVL tree should either be −1, 0 or 1. Statement 3: Since AVL tree is also a binary search tree, all the operations are performed in the same way as they are performed in a BST.

All of the three statements are correct.

Statements 1 and 2 are correct while statement 3 is incorrect.

Statements 1 and 3 are correct while statement 2 is incorrect.

None of the three statements are correct.

Statement 1: An expression tree is a binary tree in which the data in the internal nodes are operators and the leaf nodes host the operands. Statement 2: The structure of the tree preserves the hierarchy and associativity of the operators. Statement 3: The in-order, pre-order, and post-order traversals on an expression tree yield infix, prefix, and postfix expressions, respectively.

All of the three statements are correct.

Statements 1 and 2 are correct while statement 3 is incorrect.

Statements 1 and 3 are correct while statement 2 is incorrect.

None of the three statements are correct.

Statement 1: Data Structure maybe classified as either Primitive or Non-Primitive Statement 2: Primitive Data Structures are those data types that are embedded in a particular programming language. Statement 3: Non-Primitive Data Structures, on the other hand, are those complex data structures that may be either embedded in a programming language or user-made for a particular programming language.

All of the three statements are correct.

Statements 1 and 2 are both correct, statement 3 is incorrect.

Statements 1 and 3 are both correct, statement 2 is incorrect.

None of the three statements are correct.

Statement 1: For the machine to evaluate an arithmetic expression in an infix form, it should go through with the following steps; convert from infix to postfix and use evaluation algorithms using stack operators. Statement 2: In the algorithm for converting infix to postfix, if the scanned character is an operator and the stack is empty, push the operator to the stack. Statement 3: If the scanned character has higher or same precedence over operator on top of stack, pop the top of stack and append to postfix string.

Statements 1 and 2 are both correct, statement 3 is incorrect.

All of the three statements are correct.

Statements 1 and 3 are both correct, statement 2 is incorrect.

None of the three statements are correct.

Statement 1: Hash functions convert the original key to a key known as hash key, which can be treated as the address for locating data associated with the original key. Statement 2: A good hash function distributes the keys evenly in the hash table. Statement 3: Hash functions can also be used for storing string type values in a hash table.

All of the three statements are correct.

Statements 1 and 2 are correct while statement 3 is incorrect.

Statements 1 and 3 are correct while statement 2 is incorrect.

None of the three statements are correct.

Statement 1: In a min-heap, the heap property states that the data value of any parent node will be less than or equal to the data value of the children. This results in the smallest data element to be stored in the root of the tree. Statement 2: Deletion in a heap tree involves deleting the right-most child element. Statement 3: Heap Tree data structure can be used to implement priority queues.

Statements 1 and 3 are correct while statement 2 is incorrect.

All of the three statements are correct.

Statements 1 and 2 are correct while statement 3 is incorrect.

None of the three statements are correct.

Statement 1: When deleting the first node in a singly linked list, we simply set the pointer field of the first node to NULL. Statement 2: When deleting a node in a doubly linked list, we need to set the previous and next pointer field of the node to be deleted. Statement 3: When deleting a node in a circular linked list, this will cause the circular linked list to break.

None of the three statements are correct.

All of the three statements are correct.

Statements 1 and 2 are correct while statement 3 is incorrect.

Statements 1 and 3 are correct while statement 2 is incorrect.

Statement 1: When evaluating an arithmetic expression in postfix notation, we scan for a token from left to right. Statement 2: If the scanned token is an operator, pop two operands from the stack. Statement 3: Perform the evaluation with the two operands using the scanned operator. Push the result to the stack.

All of the three statements are correct.

Statements 1 and 2 are both correct, statement 3 is incorrect.

Statements 1 and 3 are both correct, statement 2 is incorrect.

None of the three statements are correct.

Statement 1: When traversing a singly linked list, we know that we have reached the end of the list if the pointer field of the node is set to NULL. Statement 2: When traversing a doubly linked list, we know that we have reached the end of the list if the previous and next pointer fields of the node are set to NULL. Statement 3: When traversing a circular linked list, we know that we have reached the end of the list if the pointer field of the node is pointing to the node being pointed by a head pointer .

Statements 1 and 3 are correct while statement 2 is incorrect.

All of the three statements are correct.

Statements 1 and 2 are correct while statement 3 is incorrect.

None of the three statements are correct.

This algorithm is used to find the minimum spanning tree for a connected weighted graph. The main target of the algorithm is to find the subset of edges by using which, we can traverse every vertex of the graph.

Dijkstra's Shortest Path Algorithm

This algorithm is used to find the minimum spanning tree from a graph. It finds the subset of edges that includes every vertex of the graph such that the sum of the weights of the edges can be minimized.

Dijkstra's Shortest Path Algorithm

This algorithm lists all pair of adjacent vertices and sort them according to their edge weights, then starts constructing the MST by adding one pair of vertices and their edge at a time until all vertices are included in the MST. It will skip a pair of vertices if the vertices are already included in the MST.

Dijkstra's Shortest Path Algorithm

This algorithm selects an edge connecting the tree vertex and vertex that has minimum weight which is not yet in the MST and add the selected edge and the vertex to the minimum spanning tree.

Dijkstra's Shortest Path Algorithm

Which of the following definitions about the terminologies used in a Graph data structure is/are true? Select all that apply.

If two nodes U and V are connected via an edge E, then the nodes U and V are called as neighbors or adjacent nodes or vertices.

A loop is a cycle in which a single arc begins and ends with the same vertex – the end points of the line are the same.

A cycle can be defined as the sequence of nodes that are followed in order to reach some terminal node V from the initial node U.

A strongly connected graph is the one in which every node is connected with all other nodes. A complete graph contain n(n-1)/2 edges where n is the number of nodes in the graph.

Which of the following describes circular linked list?

All of the given statements describe circular linked list.

Circular linked list provides easy manipulation of the pointers and the searching becomes twice as efficient

Circular linked list provides efficient utilization of memory allocation.

One of the disadvantages of circular linked list is its complex implementation of operations on linked list structures

Which of the following does not describe a tree data structure?

A tree is a non-recursive data structure containing the set of one or more data nodes.

A tree is a finite collection of data that are arranged in a hierarchical fashion.

Nodes of a tree either maintain a parent-child relationship between them or they are sibling nodes.

If a tree is not empty, the topmost node is called the root.

Which of the following machine-related problems can be solve using Stack data structure? Select all that apply.

Evaluation of Arithmetic Expression

Which of the following statements about a binary search tree data structure is/are correct? Select all that apply.

A BST is a type of binary tree wherein the value of all the elements on the left subtree are less than the value of the root element.

Binary Search tree can be defined as a class of binary trees, in which the nodes are arranged in a specific order. This is also called ordered binary tree.

The binary search tree is considered as efficient data structure as compared to arrays and linked lists especially in the searching process, since it removes half subtree at every step.

It is slower when inserting or deleting an element in a binary search tree as compared to an array or linked list.

Which of the following statements about deleting a node in a binary search tree data structure is/are true? Select all that apply.

If the node to be deleted has a single subtree (either left or right), then node is deleted and replaced with the root node of its subtree.

If the node to be deleted has both left and right subtrees, then either the largest element from the left subtree (in-order predecessor) or the smallest element from the right subtree (in-order successor) is selected as the replacement for the node to be deleted.

If the node to be deleted has a single subtree (either left or right), then node is deleted and replaced with the rightmost node of its subtree.

If the node to be deleted has both left and right subtrees, then either the smallest element from the left subtree (in-order predecessor) or the largest element from the right subtree (in-order successor) is selected as the replacement for the node to be deleted.

cs102-1

Quiz

•

Computers

•

University

•

Practice Problem

•

Hard

Team Stella

FREE Resource

4

5

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever

or continue with

Microsoft

Apple

Others

Already have an account?

Similar Resources on Wayground

50 questions

RIA Revision for Class Test_Set 2

Quiz

•

University

50 questions

ICT 201-250

Quiz

•

University

45 questions

Computer Hardware and Software Review

Quiz

•

KG - University

50 questions

VIRUS AND ANTIVIRUS

Quiz

•

10th Grade - University

45 questions

Davinci Resolve 17 Fusion 101

Quiz

•

11th Grade - Professi...

45 questions

CS8591-Computer Networks

Quiz

•

University

50 questions

KUIS PKK 2 (PERAKITAN PRODUK)

Quiz

•

KG - Professional Dev...

45 questions

Microsoft Excels: Formulas and Functions

Quiz

•

12th Grade - University

Popular Resources on Wayground

15 questions

Fractions on a Number Line

Quiz

•

3rd Grade

20 questions

Equivalent Fractions

Quiz

•

3rd Grade

25 questions

Multiplication Facts

Quiz

•

5th Grade

54 questions

Analyzing Line Graphs & Tables

Quiz

•

4th Grade

$fractions$

22 questions

fractions

Quiz

•

3rd Grade

20 questions

Main Idea and Details

Quiz

•

5th Grade

20 questions

Context Clues

Quiz

•

6th Grade

15 questions

Equivalent Fractions

Quiz

•

4th Grade

Discover more resources for Computers

20 questions

CompTIA Network+ - Ports and Protocols

Quiz

•

University

cs102-1

49 questions

An L-1 (L negative 1) case occurs when the deleted node is in the left subtree of the closest imbalanced ancestor and the balanced factor of the right child of the ancestor is -1. What is the solution to this rotational case?

An L1 case occurs when the deleted node is in the left subtree of the closest imbalanced ancestor and the balanced factor of the right child of the ancestor is 1. What is the solution to this rotational case?

An R-1 (R negative 1) case occurs when the deleted node is in the right subtree of the closest imbalanced ancestor and the balanced factor of the left child of the ancestor is -1. What is the solution to this rotational case?

Applying Bubble Sort in this given list: 120, 90, 30, 200, 150, 40, 20. What will be the resulting list after the third pass?

Applying Bubble Sort in this given list: 120, 90, 30, 200, 150. How many passes will be needed before the algorithm stops?

Applying Insertion Sort in this given list: 120, 90, 30, 200, 150. How many passes or iterations will be needed before the algorithm stops?

Applying Selection Sort in this given list: 120, 90, 30, 200, 150. How many passes or iterations will be needed before the algorithm stops?

Choose all valid syntax for an operator used on a Queue data structure?

Choose all valid syntax for an operator used on a Stack data structure?

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Computers

cs102-1

49 questions

An L-1 (L negative 1) case occurs when the deleted node is in the left subtree of the closest imbalanced ancestor and the balanced factor of the right child of the ancestor is -1​. What is the solution to this rotational case?

An L1 case occurs when the deleted node is in the left subtree of the closest imbalanced ancestor and the balanced factor of the right child of the ancestor is 1.​ What is the solution to this rotational case?

An R-1 (R negative 1) case occurs when the deleted node is in the right subtree of the closest imbalanced ancestor and the balanced factor of the left child of the ancestor is -1.​ What is the solution to this rotational case?

Applying Bubble Sort in this given list: 120, 90, 30, 200, 150, 40, 20. What will be the resulting list after the third pass?

Applying Bubble Sort in this given list: 120, 90, 30, 200, 150. How many passes will be needed before the algorithm stops?

Applying Insertion Sort in this given list: 120, 90, 30, 200, 150. How many passes or iterations will be needed before the algorithm stops?

Applying Selection Sort in this given list: 120, 90, 30, 200, 150. How many passes or iterations will be needed before the algorithm stops?

Choose all valid syntax for an operator used on a Queue data structure?

Choose all valid syntax for an operator used on a Stack data structure?

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Computers

An L-1 (L negative 1) case occurs when the deleted node is in the left subtree of the closest imbalanced ancestor and the balanced factor of the right child of the ancestor is -1. What is the solution to this rotational case?

An L1 case occurs when the deleted node is in the left subtree of the closest imbalanced ancestor and the balanced factor of the right child of the ancestor is 1. What is the solution to this rotational case?

An R-1 (R negative 1) case occurs when the deleted node is in the right subtree of the closest imbalanced ancestor and the balanced factor of the left child of the ancestor is -1. What is the solution to this rotational case?