C Multiple Choice Questions (Part 1)

C Multiple Choice Questions

1. Representation of data structure in memory is known as

1. Recursive
2. Abstract data type (Ans)
3. Storage structure
4. File structure

2. Which of the following search algorithm requires a sorted array?

1. Linear search
2. Hash search
3. Binary search (Ans)
4. All of these

3. The largest element of an array index is called its

1. Lower bound
2. Upper bound  (Ans)
3. Range
4. All of the above

4. Which of the following is a Compound assignment operators?

1. +=
2. *=
3. /=
4. All the above  (Ans)

5.  What will be the output of 5.0 / 2?

1. 2
2. 3
3. 0
4. 2.5  (Ans)

6. What is %f, %d, %s and %c?

1. Number Specifier
2. Format Specifier  (Ans)
3. Access Specifier
4. None of the above

7. Which of the following is correct set of keywords?

1. unsigned, external, typedef, signed
2. unsigned, volatile, typedef, every
3. unsigned, volatile, typedef, sizeof  (Ans)
4. None of the above

8. The keywords are also called

1. Safe words
2. Static words
3. Reserved words  (Ans)
4. Reused words

9. Every C Program must have one function called?
   
   
   1. switch()
   2. main()  (Ans)
   3. struct()
   4. for()

10. Which is the correct syntax to declare constant pointer?
    
    
    1. int *const constPtr;
    2. *int constant constPtr;
    3. const int *constPtr;
    4. A and C both  (Ans)

11. In which linked list last node address is null?
    
    
    1. Doubly linked list
    2. Circular list
    3. Singly linked list  (Ans)
    4. None of the above

12. What is Dequeue?
    
    
    1. Elements can be added from front
    2. Elements can be added to or removed from either the front or rear  (Ans)
    3. Elements can be added from rear
    4. None of the above

13. The Default Parameter Passing Mechanism is called as
    
    
    1. Call by Value  (Ans)
    2. Call by Reference
    3. Call by Address
    4. Call by Name

14. C is ______ Language?
    
    
    1. Low Level 
    2. High Level  (Ans)
    3. Assembly Level
    4. Machine Level
    
    

15. In which tree, for every node the height of its left subtree and right subtree differ almost by one?
    
    
    1. Binary search tree
    2. AVL tree  (Ans) 
    3. Threaded Binary Tree
    4. Complete Binary Tree

16. The worst case time complexity of AVL tree is better in comparison to binary search tree for
    
1. Search and Insert Operations
2. Search and Delete Operations
3. Insert and Delete Operations
4. Search, Insert and Delete Operations  (Ans)

17. The "C" language is
    
    
    1. Context free language  (Ans)
    2. Context sensitive language
    3. Regular language
    4. None of the above

18. Number of binary trees formed with 5 nodes are
    
    
    1. 30
    2. 36
    3. 108
    4. 42  (Ans)

19. The _______ memory allocation function modifies the previous allocated space.
    
    
    1. calloc
    2. free
    3. malloc
    4. realloc  (Ans)

20. The statement printf("%c", 100); will print?
    
    
    1. prints 100
    2. print garbage
    3. prints ASCII equivalent of 100  (Ans)
    4. None of the above

21. Which of the following data structure is linear type?
    
    
    1. Strings
    2. Queue
    3. Lists
    4. All of the above  (Ans)

22. To represent hierarchical relationship between elements, which data structure is suitable?
    
    
    1. Priority
    2. Tree  (Ans)
    3. Dqueue
    4. All of the above

23. The statement print f ("%d", 10 ? 0 ? 5 : 1 : 12); will print?
    
    
    1. 10
    2. 0
    3. 12
    4. 1  (Ans)

24. Queue is a _____________ list.
    
    
    1. LIFO
    2. LILO
    3. FILO
    4. FIFO  (Ans)