61. What will be the output of the following C code?
    

    #include <stdio.h>
        typedef struct N *ptr2;
        struct N
        {
            int n1;
            char n2;
            ptr2 ptr1;
        };
        int main()
        {
            struct N n = {111, 222, &n};
            printf("%d\n", n.ptr1->ptr1->n1);
            return 0;
        }
    

1. 1. 111

   
   
   

   2. 222

   
   
   

   3. Compilation Error

   
   
   

   4. Garbage value

   
   
   

   5. None of these

   
   
   

---

1. View Hint View Answer Discuss in Forum

   NA

   Correct Option: A

   111

---

62. The number of distinct nodes the following struct declaration can point to is _____________.
    

    struct node
        {
            struct node *left;
            struct node *centre;
            struct node *right;
        };
    

1. 1. 3

   
   
   

   2. 2

   
   
   

   3. 1

   
   
   

   4. All of above

   
   
   

   5. None of these

   
   
   

---

1. View Hint View Answer Discuss in Forum

   NA

   Correct Option: D

   Option A, B and C is right answer.

---

---

63. Which of the following is not possible regarding structure variable?

1. 1. 2 different type of structure variable pointing at each other

   
   
   

   2. A structure variable pointing to another structure variable of same type

   
   
   

   3. A structure variable pointing to itself

   
   
   

   4. All of above

   
   
   

   5. None of these

   
   
   

---

1. View Hint View Answer Discuss in Forum

   NA

   Correct Option: E

   None of these

---

64. Which of the following technique is faster for travelling in binary trees?
    

1. 1. Depends from compiler to compiler

   
   
   

   2. Iteration

   
   
   

   3. Recursion

   
   
   

   4. Both Iteration and Recursion

   
   
   

   5. None of these

   
   
   

---

1. View Hint View Answer Discuss in Forum

   NA

   Correct Option: C

   Recursion

---

---

65. Which of the following will stop the loop at the last node of a linked list in the following C code snippet?
    

    struct node
        {
            struct node *next;
        };
    

1. 1. while (p->next != NULL)
          {
              p = p->next;
          }
      

   
   
   

   2. while (1)
          {
              p = p->next;
              if (p == NULL)
                  break;
          }
      

   
   
   

   3. while (p != NULL)
          {
              p = p->next;
          }
      

   
   
   

   4. All of above

   
   
   

   5. None of these

   
   
   

---

1. View Hint View Answer Discuss in Forum

   NA

   Correct Option: A

   None of these

---