What will be the output of the following program? 

#include int main() 

{ 

char str1[20] = "Hello "; 

char str2[20] = "Hello"; 

strcpy(str2, str1); 

if (strcmp(str1, str2) == 0) 

printf("Equal "); 

else 

printf("Not Equal "); 

return 0; 

}

1

Which of the following statements about structures and unions in C is true?

Topic: JECA MCA 2025

2

Which of the following pairs correctly matches the type of testing with its main focus or environment?

Topic: JECA MCA 2025

3

Which testing approach specifically ensures that all logical conditions in a decision are tested at least once?

Topic: JECA MCA 2025

4

Which metric gives the best measure of efficiency in a defect discovery process across software development phases?

Topic: JECA MCA 2025

5

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

6

What will be the output of the following C code? #include int main() { int a = 10; int *p = &a…

Topic: JECA MCA 2025

7

What happens when a recursive function in C lacks a proper base condition?

Topic: JECA MCA 2025

8

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

9

Which of the following statements about arrays in C is correct?

Topic: JECA MCA 2025

10

What will be output of the following code snippet? #include int main() { int i; for (i=1;i<=5;i…

Topic: JECA MCA 2025

1

In the context of software quality management, which of the following focuses on preventing defects rather than detecti…

Topic: JECA MCA 2025

2

What is the range of unsigned int in C?

Topic: JECA MCA 2025

3

Which of the following options with grep is used to ignore case while searching?

Topic: JECA MCA 2025

4

Which of the following is not a typical use of stacks?

Topic: JECA MCA 2025

5

In a circular queue of size n, when is the queue considered full?

Topic: JECA MCA 2025

6

Which of the following traversal techniques lists the nodes of a binary search tree in ascending order?

Topic: JECA MCA 2025

7

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

8

The order of an algorithm that finds whether a given Boolean function of n variables produces 1 is

Topic: JECA MCA 2025

9

Which of the following can be done with Linked List?

Topic: JECA MCA 2025

10

What is the worst case time complexity to access an element in a binary search tree?

Topic: JECA MCA 2025