Question 1

Queue is a _____________ list.&#10;A)lifo&#10;B)lilo&#10;C)filo&#10;D)fifo

Accepted Answer

Queue operates on the principle of "First In, First Out" (FIFO), meaning the first element added to the queue will be the first one to be removed.

Question 2

The statement print f (&#34;%d&#34;, 10 ? 0 ? 5 : 1 : 12); will print?&#10;A)10&#10;B)0&#10;C)12&#10;D)1

Accepted Answer

The expression inside the printf statement uses the ternary operator twice. It evaluates as follows: 10 ? (0 ? 5 : 1) : 12. Since 10 is true, it evaluates the expression in the parentheses: 0 ? 5 : 1. Since 0 is false, it chooses 1. Therefore, the statement prints 1.

Question 3

To represent hierarchical relationship between elements, which data structure is suitable?&#10;A)priority&#10;B)tree&#10;C)dqueue&#10;D)all of the above

Accepted Answer

Trees are specifically designed to represent hierarchical relationships between elements, making them the most suitable data structure for this purpose.

Question 4

Which of the following data structure is linear type?&#10;A)strings&#10;B)queue&#10;C)lists&#10;D)all of the above

Accepted Answer

Strings, queues, and lists are all examples of linear data structures. In a linear data structure, elements are arranged in a sequential order, where each element is connected to its previous and next element in a single level.

Question 5

The statement printf(&#34;%c&#34;, 100); will print?&#10;A)prints 100&#10;B)print garbage&#10;C)prints ascii equivalent of 100&#10;D)none of the above

Accepted Answer

The printf statement with the "%c" format specifier prints the character corresponding to the ASCII value provided. In this case, 100 corresponds to the ASCII character 'd', so it prints the ASCII equivalent of 100.

Question 6

The _______ memory allocation function modifies the previous allocated space.&#10;A)calloc&#10;B)free&#10;C)malloc&#10;D)realloc

Accepted Answer

The realloc function is used to resize a previously allocated memory block without losing the data that was already stored in it. This is useful when you need to increase or decrease the size of your dynamic memory allocation as your program runs.

Question 7

Number of binary trees formed with 5 nodes are&#10;A)30&#10;B)36&#10;C)108&#10;D)42

Accepted Answer

The number of binary trees that can be formed with 'n' nodes is given by the nth Catalan number, which is calculated using the formula Cn = (2n)! / ((n + 1)!n!). For n = 5, the 5th Catalan number is C5 = (2*5)! / ((5 + 1)!*5!) = 42.

Question 8

The &#34;C&#34; language is&#10;A)context free language&#10;B)context sensitive language&#10;C)regular language&#10;D)none of the above

Accepted Answer

The syntax of the "C" language can be described by a context-free grammar, which means it is a context-free language. Context-free languages are a subset of formal languages that are defined by context-free grammars. This allows for the construction of a parse tree that can represent the syntactical structure of all the sentences in the language.

Question 9

The worst case time complexity of AVL tree is better in comparison to binary search tree for&#10;A)search and insert operations&#10;B)search and delete operations&#10;C)insert and delete operations&#10;D)search, insert and delete operations

Accepted Answer

AVL trees are a type of self-balancing binary search tree, where the height of the two child subtrees of any node differ by no more than one. This ensures that the AVL tree remains balanced, leading to improved time complexity for search, insert, and delete operations compared to a standard binary search tree (BST) that is not balanced. In the worst case, a BST can become a linked list with a time complexity of O(n) for these operations, whereas an AVL tree maintains a time complexity of O(log n) due to its balanced nature.

Question 10

In which tree, for every node the height of its left subtree and right subtree differ almost by one?&#10;A)binary search tree&#10;B)avl tree&#10;C)threaded binary tree&#10;D)complete binary tree

Accepted Answer

AVL tree is designed to be a self-balancing binary search tree where the height of the two child subtrees of any node differ by no more than one. This ensures that the tree remains approximately balanced, leading to O(log n) time complexity for search, insertion, and deletion operations.

Question 11

C is ______ Language?&#10;A)low level&#10;B)high level&#10;C)assembly level&#10;D)machine level

Accepted Answer

The answer of C is ______ Language?&#10;A)low level&#10;B)high level&#10;C)assembly level&#10;D)machine...

Question 12

The Default Parameter Passing Mechanism is called as&#10;A)call by value&#10;B)call by reference&#10;C)call by address&#10;D)call by name

Accepted Answer

The answer of The Default Parameter Passing Mechanism is called...

Question 13

What is Dequeue?&#10;A)elements can be added from front&#10;B)elements can be added to or removed from either the front or rear&#10;C)elements can be added from rear&#10;D)none of the above

Accepted Answer

The answer of What is Dequeue?&#10;A)elements can be added from...

Question 14

In which linked list last node address is null?&#10;A)doubly linked list&#10;B)circular list&#10;C)singly linked list&#10;D)none of the above

Accepted Answer

The answer of In which linked list last node address...

Question 15

Which is the correct syntax to declare constant pointer?&#10;A)int *const constptr;&#10;B)*int constant constptr;&#10;C)const int *constptr;&#10;D)a and c both

Accepted Answer

The answer of Which is the correct syntax to declare...

Question 16

The smallest individual units of c program&#10;A)the basic element&#10;B)ecognized by the compiler&#10;C)the largest individual units of program&#10;D)a & b both

Accepted Answer

The answer of The smallest individual units of c program&#10;A)the...

Question 17

int constant var =10;&#10;A)int&#10;B)const var = 10;&#10;C)const int var = 10;&#10;D)b & c both

Accepted Answer

The answer of int constant var =10;&#10;A)int&#10;B)const var = 10;&#10;C)const...

Deck 2: Data Structures and Programming