adplus-dvertising
frame-decoration

Question

What does the following code do?
#include<stdio.h>
int search_num(int *arr, int num, int len)
{
     int i;
     for(i = 0; i < len; i++)
     if(arr[i] == num)
      return i;
     return -1;
}
int main()
{
      int arr[5] ={1,2,3,4,5},num=3,len = 5;
      int indx = search_num(arr,num,len);
      printf("Index of %d is %d",num,indx);
      return 0;
}

a.

Finds the index of all the occurrences of the number that is searched

b.

Finds the index of the first occurrence of the number that is searched

c.

Finds the index of the last occurrence of the number that is searched

d.

None of the mentioned

Answer: (b).Finds the index of the first occurrence of the number that is searched

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What does the following code do?

Similar Questions

Discover Related MCQs

Q. Consider the array {1,1,1,1,1}:
Which of the following techniques can be used to search an element in the above array?

Q. Which of the following techniques can be used to search an element in an unsorted array?

Q. What is the time complexity of the recursive implementation used to find the largest and smallest element in a linked list?

Q. What is the time complexity of the above iterative code used to find the smallest and largest element in a linked list?

Q. Which of the following methods can be used to find the largest and smallest number in a linked list?

Q. What is the time complexity of the above recursive implementation used to find the largest and the smallest element in an array?

Q. What is the time complexity of the above iterative implementation used to find the largest and smallest element in an array?

Q. Which of the following methods can be used to find the largest and smallest element in an array?

Q. What is the time complexity of the above recursive implementation used to find the length of the string?

Q. Which of the following can be the base case for the recursive implementation used to find the length of a string?

Q. Which of the following can be the base case for the recursive implementation used to find the length of linked list?

Q. What is the time complexity of the above iterative implementation used to find the length of a linked list?

Q. What is the space complexity of the recursive implementation used to convert a decimal number to its binary equivalent?

Q. What is the time complexity of the recursive implementation used to convert a decimal number to its binary equivalent?

Q. Which of the following is the binary representation of 100?

Q. What can be the minimum sum of digits for a 4 digit number?

Q. What can be the maximum sum of digits for a 4 digit number?

Q. Which of the following methods can be used to find the sum of digits of a number?

Q. Which of the following methods used to find the sum of first n natural numbers has the least time complexity?

Q. What is the time complexity of the above recursive implementation used to find the sum of the first n natural numbers?