Question
The radius of a circle is 10 cm, and the length of the
chord is 12 cm. Find the distance between the chord and the centre of the circle. ÂSolution
Length of the chord = 12 cm So, half of the length of the chord = 6 cm So, distance between the chord and centre = √ {10² - 6² } = √ {100 - 36} = √ {64} = 8 cmÂ
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:
