C Programming Basic Set 2
Bachelor of Science in Computer Science FY (BSc CS),
Bachelor of Science in Computer Science SY (BSc CS),
Bachelor of Science in Computer Science TY (BSc CS),
Bachelor of Science in Information Technology FY (BSc IT),
Bachelor of Science in Information Technology SY (BSc IT),
Bachelor of Science in Animation FY (B.Sc animation),
Bachelor of Computer Applications (BCA),
Bachelor of Science in Information Technology (BSc IT),
Bachelor of Science in Computer Science (BSc CS),
On This Page
This set of C Programming Basic Multiple Choice Questions & Answers (MCQs) focuses on C Programming Basic Set 2
Q1 | Queue is a _____________ list.
- lifo
- lilo
- filo
- fifo
Q2 | The statement print f ("%d", 10 ? 0 ? 5 : 1 : 12); will print?
- 10
- 0
- 12
- 1
Q3 | To represent hierarchical relationship between elements, which data structure is suitable?
- priority
- tree
- dqueue
- all of the above
Q4 | Which of the following data structure is linear type?
- strings
- queue
- lists
- all of the above
Q5 | The statement printf("%c", 100); will print?
- prints 100
- print garbage
- prints ascii equivalent of 100
- none of the above
Q6 | The _______ memory allocation function modifies the previous allocated space.
- calloc
- free
- malloc
- realloc
Q7 | Number of binary trees formed with 5 nodes are
- 30
- 36
- 108
- 42
Q8 | The "C" language is
- context free language
- context sensitive language
- regular language
- none of the above
Q9 | The worst case time complexity of AVL tree is better in comparison to binary search tree for
- search and insert operations
- search and delete operations
- insert and delete operations
- search, insert and delete operations
Q10 | In which tree, for every node the height of its left subtree and right subtree differ almost by one?
- binary search tree
- avl tree
- threaded binary tree
- complete binary tree
Q11 | C is ______ Language?
- low level
- high level
- assembly level
- machine level
Q12 | The Default Parameter Passing Mechanism is called as
- call by value
- call by reference
- call by address
- call by name
Q13 | What is Dequeue?
- elements can be added from front
- elements can be added to or removed from either the front or rear
- elements can be added from rear
- none of the above
Q14 | In which linked list last node address is null?
- doubly linked list
- circular list
- singly linked list
- none of the above
Q15 | Which is the correct syntax to declare constant pointer?
- int *const constptr;
- *int constant constptr;
- const int *constptr;
- a and c both
Q16 | printf("%d%d", book.price, book.page);
- b. printf("%d%d", price.book, page.book);
- .
- printf("%d%d", price::book, page::book);
- printf("%d%d", price->book, page->book);
Q17 | A. double and chars
- b. floats and doubles
- . ints
- and floats
- ints and chars
Q18 | A. The smallest individual units of c program
- b. the basic element
- ecognized by the compiler
- the largest individual units of program
- a & b both
Q19 | B. Keywords have some unknown meanings and these meanings cannot be
- changed.
- . keywords have some predefine meanings and these meanings cannot be
- hanged.
- none of the above
Q20 | A. int constant var =10;
- b. int
- onst var = 10;
- const int var = 10;
- b & c both
Q21 | A. Constant
- b.
- ariable
- special symbol
- none of the avobe
Q22 | A. Halt execution of program
- b. restart execution
- f program
- exit from loop or switch statement
- none of the avobe