# Answers by Sahreen

0 votes
1
Which one of the following in-place sorting algorithms needs the minimum number of swaps? Insertion Sort Quick Sort Heap Sort Selection Sort
0 votes
2
Which of the following algorithms solves the all pair shortest path problem? Prim's algorithm Dijkstra's algorithm Bellman ford algorithm Floyd warshalls algorithm
–1 vote
3
A bridge has access to ________ address in the same network. Physical Network Datalink Application
0 votes
4
Infrared signals can be used for short range communication in a closed area using _______ propagation. Ground Sky Line of sight Space
0 votes
5
Suppose $A$ is a finite set with $n$ elements.The number of elements and the rank of the largest equivalence relation on $A$ are $\{n,1\}$ $\{n,n\}$ $\{n^2,1\}$ $\{1,n^2\}$