Which testing approach specifically ensures that all logical conditions in a decision are tested at least once?
Previous 10 Questions — JECA MCA 2025
Nearest first
1
2
3
4
5
6
7
8
9
10
Which metric gives the best measure of efficiency in a defect discovery process across software development phases?
Topic: JECA MCA 2025
A risk in a software project has a probability of occurrence of 0.3 and the potential loss if it occurs is estimated to…
Topic: JECA MCA 2025
What will be the output of the following C code? #include
int main() { int a = 10; int *p = &a…
Topic: JECA MCA 2025
What happens when a recursive function in C lacks a proper base condition?
Topic: JECA MCA 2025
Read the following statements about functions in C and choose the correct option: (i) A function in C can return o…
Topic: JECA MCA 2025
Which of the following statements about arrays in C is correct?
Topic: JECA MCA 2025
What will be output of the following code snippet? #include
int main() { int i; for (i=1;i<=5;i…
Topic: JECA MCA 2025
What will be output of the following code snippet? #include
int main() { float x = 5; if(x > 10…
Topic: JECA MCA 2025
Which of the following is not a type of computer code?
Topic: JECA MCA 2025
1 nibble = ______ bits
Topic: JECA MCA 2025
Next 10 Questions — JECA MCA 2025
Ascending by ID
1
2
3
4
5
6
7
8
9
10
Which of the following pairs correctly matches the type of testing with its main focus or environment?
Topic: JECA MCA 2025
Which of the following statements about structures and unions in C is true?
Topic: JECA MCA 2025
What will be the output of the following program? #include
int main() { char str1[20] = "Hello "; …
Topic: JECA MCA 2025
In the context of software quality management, which of the following focuses on preventing defects rather than detecti…
Topic: JECA MCA 2025
What is the range of unsigned int in C?
Topic: JECA MCA 2025
Which of the following options with grep is used to ignore case while searching?
Topic: JECA MCA 2025
Which of the following is not a typical use of stacks?
Topic: JECA MCA 2025
In a circular queue of size n, when is the queue considered full?
Topic: JECA MCA 2025
Which of the following traversal techniques lists the nodes of a binary search tree in ascending order?
Topic: JECA MCA 2025
The running time T(n) of an algorithm is given as follows: T(n)=c+T(n-1), if n>1 and =d if n≤1. Here c and d are consta…
Topic: JECA MCA 2025
