Question
24 × 25 – 375 + 5² = 25% of ? + 2.5% of
6000 What will come in the place of questions (?) mark in following questions.Solution
24 × 25-375 + 5 ² = 25% of ? + 2.5% of 6000 600 – 375 + 25 = 25% of ? + 150 250 – 150 = 25% of ? ? = 100/25 ×100 ? = 400
Which algorithm finds Minimum Spanning Tree in a weighted graph by adding edges in increasing order?
The Master Theorem gives time complexity for recurrences of the form:
In hashing, what is a collision?
Which of the following properties must a problem exhibit to be solvable by a greedy algorithm?
A unique piece of information that is used in encryption.
Which of the following sorting algorithms is best for nearly sorted data?
Which algorithm returns a minimum spanning tree (MST) and uses a priority queue to select the next edge connected to the growing tree?
In a binary search tree (BST), what is true about the left child of a node?
What is the time complexity of inserting an element in a heap?
Depth-First Search (DFS) typically uses which data structure implicitly or explicitly?
Relevant for Exams:
