# Multiple choice question for engineering

## Set 1

1. Representation of the different phase of a compound on a two or three dimensional graph is

a) Block diagram

b) Equilibrium diagram

c) Phase diagram

d) None of the mentioned

### View Answer

2. A non-condensable gas is found

a) Above the critical point

b) Below the critical point

c) On the critical point

d) None of the mentioned

### View Answer

3. Incorrect statement about a phase diagram is

a) Phase diagram are based on equilibrium conditions

b) For phase equilibrium, it is assumed that the phase doesn`t remain invariant

c) Phase diagrams enable to view the properties of two or more phases as a function of temperature, pressure and other variable

d) None of the mentioned

### View Answer

4. The one P-T-V combination at which solid, liquid and vapour are in equilibrium, is called

a) Critical point

b) Triple point

c) Saturation point

d) None of the mentioned

### View Answer

5. If the vapour and liquid of a pure component are in equilibrium, the equilibrium pressure is called

a) Partial pressure

b) Vapour pressure

c) Liquid pressure

d) None of the mentioned

### View Answer

6. At a given temperature there is only ________ pressure at which the vapour and liquid phases of a pure substances may exist in equilibrium.

a) Three

b) Two

c) One

d) None of the mentioned

### View Answer

7. The change of phase from liquid to vapour is called

a) Boiling

b) Melting

c) Condensation

d) None of the mentioned

### View Answer

8. __________ is the temperature at which a liquid just start to vaporize.

a) Critical point

b) Bubble point

c) Triple point

d) Saturation point

### View Answer

9. Find the incorrect statement for condensation

a) The change of phase from vapour to liquid

b) Occurs at constant temperature and pressure

c) The process appears as a point in in a P-T diagram

d) All of the mentioned

### View Answer

10.______ is the temperature at which the vapour just begins to condense at a specified pressure, that is the value temperature along the vapour pressure curve.

a) Dew point

b) Bubble point

c) Triple point

d) Critical point

### View Answer

## Set 2

1. Which of the following block information is odd man out in the below figure ?

a) Scatterplots

b) 5 number summary

c) 2D Graph

d) None of the mentioned

### View Answer

2. Which type of graph is shown in the following figure ?

a) Scatterplot

b) Barplot

c) Overlaying

d) None of the Mentioned

### View Answer

3. Which of the following annotation function is used to add or modify text ?

a) word

b) graph

c) lines

d) all of the Mentioned

### View Answer

4. Which of the following package is implemented by lattice plotting system ?

a) grDevices

b) grid

c) graphics

d) all of the Mentioned

### View Answer

5. Point out the wrong statement:

a) Plot are created with multiple functions only

b) Plots are created with both single and multiple function calls

c) Annotation in plot is not especially intuitive

d) None of the Mentioned

### View Answer

6. Which of the following parameter defines line type such as dashed and dotted ?

a) lty

b) pch

c) lwd

d) all of the Mentioned

### View Answer

7. The core plotting engine is encapsulated in graphics package.

a) True

b) False

### View Answer

8. Which of the following argument specifies margin size with regards to par function ?

a) las

b) bg

c) mar

d) All of the mentioned

### View Answer

9. How many stages commonly occurs in creation of plot ?

a) 2

b) 5

c) 8

d) All of the Mentioned

### View Answer

10. Base graphics are used most commonly for creating 2D graphics.

a) True

b) False

### View Answer

## Set 3

1. What kind of linked list is best to answer question like “What is the item at position n?”

a) Singly linked list

b) Doubly linked list

c) Circular linked list

d) Array implementation of linked list

### View Answer

2. Linked lists are not suitable to for the implementation of?

a) Insertion sort

b) Radix sort

c) Polynomial manipulation

d) Binary search

### View Answer

3. Linked list is considered as an example of ___________ type of memory allocation.

a) Dynamic

b) Static

c) Compile time

d) None of the mentioned

### View Answer

4. In Linked List implementation, a node carries information regarding

a) Data

b) Link

c) Data and Link

d) None of the mentioned

### View Answer

5. Linked list data structure offers considerable saving in

a) Computational Time

b) Space Utilization

c) Space Utilization and Computational Time

d) None of the mentioned

### View Answer

6. Which of the following points is/are true about Linked List data structure when it is compared with array

a) Arrays have better cache locality that can make them better in terms of performance

b) It is easy to insert and delete elements in Linked List

c) Random access is not allowed in a typical implementation of Linked Lists

d) All of the mentioned

### View Answer

7. What does the following function do for a given Linked List with first node as head?

void fun1(struct node* head) { if(head == NULL) return; fun1(head->next); printf("%d ", head->data); }

a) Prints all nodes of linked lists

b) Prints all nodes of linked list in reverse order

c) Prints alternate nodes of Linked List

d) Prints alternate nodes in reverse order

### View Answer

8. Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

a) Insertion Sort

b) Quick Sort

c) Heap Sort

d) Merge Sort

### View Answer

^{2}), merge sort is preferred.

## Set 4

1. A linear collection of data elements where the linear node is given by means of pointer is called?

a) Linked list

b) Node list

c) Primitive list

d) None of the mentioned

### View Answer

2. Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only.

Given the representation, which of the following operation can be implemented in O(1) time?

i) Insertion at the front of the linked list

ii) Insertion at the end of the linked list

iii) Deletion of the front node of the linked list

iv) Deletion of the last node of the linked list

a) I and II

b) I and III

c) I, II and III

d) I, II and IV

### View Answer

3. In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

a) Pointer to character

b) Pointer to integer

c) Pointer to node

d) Node

### View Answer

4. What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

a) O(1)

b) O(n)

c) θ(n)

d) θ(1)

### View Answer

5. What would be the asymptotic time complexity to add an element in the linked list?

a) O(1)

b) O(n)

c) O(n^{2})

d) None of the mentioned

### View Answer

6. What would be the asymptotic time complexity to find an element in the linked list?

a) O(1)

b) O(n)

c) O(n^{2})

d) None of the mentioned

### View Answer

7. What would be the asymptotic time complexity to insert an element at the second position in the linked list?

a) O(1)

b) O(n)

c) O(n^{2})

d) None of the mentioned

### View Answer

8. The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?

a) Singly linked list

b) Doubly linked list

c) Circular doubly linked list

d) Array implementation of list

### View Answer

9. Consider the following definition in c programming language

struct node { int data; struct node * next; } typedef struct node NODE; NODE *ptr;

Which of the following c code is used to create new node?

a) ptr = (NODE*)malloc(sizeof(NODE));

b) ptr = (NODE*)malloc(NODE);

c) ptr = (NODE*)malloc(sizeof(NODE*));

d) ptr = (NODE)malloc(sizeof(NODE));

### View Answer

## Set 5

1. The following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function.

/* Link list node */ struct node { int data; struct node* next; }; /* head_ref is a double pointer which points to head (or start) pointer of linked list */ static void reverse(struct node** head_ref) { struct node* prev = NULL; struct node* current = *head_ref; struct node* next; while (current != NULL) { next = current->next; current->next = prev; prev = current; current = next; } /*ADD A STATEMENT HERE*/ }

What should be added in place of “/*ADD A STATEMENT HERE*/”, so that the function correctly reverses a linked list.

a) *head_ref = prev;

b) *head_ref = current;

c) *head_ref = next;

d) *head_ref = NULL;

### View Answer

2. What is the output of following function for start pointing to first node of following linked list?

1->2->3->4->5->6 void fun(struct node* start) { if(start == NULL) return; printf("%d ", start->data); if(start->next != NULL ) fun(start->next->next); printf("%d ", start->data); }

a) 1 4 6 6 4 1

b) 1 3 5 1 3 5

c) 1 2 3 5

d) 1 3 5 5 3 1

### View Answer

3. The following C function takes a simply-linked list as input argument.

It modifies the list by moving the last element to the front of the list and returns

the modified list. Some part of the code is left blank. Choose the correct alternative

to replace the blank line.

typedef struct node { int value; struct node *next; }Node; Node *move_to_front(Node *head) { Node *p, *q; if ((head == NULL: || (head->next == NULL)) return head; q = NULL; p = head; while (p-> next !=NULL) { q = p; p = p->next; } _______________________________ return head; }

a) q = NULL; p->next = head; head = p;

b) q->next = NULL; head = p; p->next = head;

c) head = p; p->next = q; q->next = NULL;

d) q->next = NULL; p->next = head; head = p;

### View Answer

4. The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list.

The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order. What will be the contents of the list after the function completes execution?

struct node { int value; struct node *next; }; void rearrange(struct node *list) { struct node *p, * q; int temp; if ((!list) || !list->next) return; p = list; q = list->next; while(q) { temp = p->value; p->value = q->value; q->value = temp; p = q->next; q = p?p->next:0; } }

a) 1, 2, 3, 4, 5, 6, 7

b) 2, 1, 4, 3, 6, 5, 7

c) 1, 3, 2, 5, 4, 7, 6

d) 2, 3, 4, 5, 6, 7, 1

### View Answer

5. In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

a) log 2 n

b) ^{n}⁄_{2}

c) log 2 n – 1

d) n

### View Answer

6. Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?

a) Possible if X is not last node

b) Possible if size of linked list is even

c) Possible if size of linked list is odd

d) Possible if X is not first node

### View Answer

struct node *temp = X->next; X->data = temp->data; X->next = temp->next; free(temp);

7. You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?

a) Delete the first element

b) Insert a new element as a first element

c) Delete the last element of the list

d) Add a new element at the end of the list

### View Answer

8. In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

a) log2 n

b) ^{n}⁄_{2}

c) log2 n – 1

d) n