1 answer
5
1 answer
6
The number of swaps required to sort the array$8, 22, 7,9, 31, 19, 5, 13$In ascending order using bubble sort is :$10$$9$$13$$14$
1 answer
7
1 answer
8
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of nodes of degree $2$ is $10$. The number of leaf nodes in binary tree is:$10$$11$$12...
1 answer
9
1 answer
10
The best statement to find out that value of a variable lies in the range $7$ to $10$ or $12$ to $15$ in $\text{C}$ language is :switchwhileforcontinue
1 answer
11
Which testing is equivalent to Cyclomatic complexity?Black box testingGreen box testingYellow box testingWhite box testing
1 answer
12
Maintenance testing is performed using which methodology?Breadth test and depth testSanity testingRetestingConfirmation testing
1 answer
19
The maximum number of binary trees that can be formed with three unlabeled nodes is :$1$$5$$4$$3$
1 answer
20
Linked lists are not suitable data structures for which one of the following problems?Insertion sortBinary searchRadix sortPolynomial manipulation
2 answers
23