adplus-dvertising
frame-decoration

Question

What is the output of the following code?
#include<stdio.h>
#include<stdlib.h>
struct Node
{
      int val;
      struct Node *next;
}*head;
int get_len()
{
      struct Node *temp = head->next;
      int len = 0;
      while(temp != 0)
      {
          len++;
          temp = temp->next;
      }
      return len;
}
int main()
{
      int arr[10] = {1,2,3,4,5}, n = 5, i;
      struct Node *temp, *newNode;
      head = (struct Node*)malloc(sizeof(struct Node));
      head->next = 0;
      int len = get_len();
      printf("%d",len);
      return 0;
}

a.

0

b.

Garbage value

c.

Compile time error

d.

Runtime error

Answer: (a).0

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the output of the following code?

Similar Questions

Discover Related MCQs

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

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

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

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 iterative implementation 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 largest and the smallest element in an array?

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 iterative code used to find the smallest and largest element in a linked list?

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

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

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. What is the time complexity of the above recursive implementation of linear search?

Q. Which of the following methods can be used to search an element in a linked list?

Q. What is the time complexity of the above implementation of linear search on a linked list?

Q. Can binary search be applied on a sorted linked list in O(Logn) time?

Q. What will be time complexity when binary search is applied on a linked list?