Explore topic-wise InterviewSolutions in .

This technology uses radio waves in the frequency range of 2.402 GHz to 2.480 GHz. And transmit data in short distance. Mobile phones, Laptops, tablets etc use Bluetooth technology to transmit data.

By using Bluetooth Dongle(a small device that can be buy from the shop) we can convert non Bluetooth PC into Bluetooth enabled and transmits data with data transmission rate of 3 Mbs onwards.

‘\0’  is known as a string terminator.

(b) main(). A C++ program must contains at least one main() function

Reserved words for the compiler is Keywords.

1. Villi: 

Cardiac, fundic and pyloric are the three major parts of stomach. But villi are small finger like foldings in the intestine. 

2. Villi: 

Duodenum, jejunum and ileum are three regions of intestine but villi are small finger like foldings inside the intestine. 

3. Gastric: 

Parotid, Sublingual and submaxillary are three pairs of salivary gland produce saliva. But gastric gland is stomach gland produce gastric juice.

The execution of a program ends with main( ) function.

1. Invalid, because exponent part should not be a floating point number 

2. valid

>> is the input operator.

(b) It increases surface area for absorption of food.

<< is the output operator.

\n sequence is used for this.

Comment statements are ignored by the compiler True

The execution of a program starts at main( ) function.

Villi actually decrease the movement of chyme. The function of villi is to increase the surface area of the intestine for the absorption of digested nutrients.

1. Break – It is valid( break is the keyword, not Break); 

2. Simple. interest – It is not valid, because dot(.) is used.

1. Mucous cell – Secrete mucus 

2. Chief cells – Secrete proteolytic enzyme Pepsin 

3. Parietal cells – Secrete HCL

It is not a valid identifier because it violates the rule 

The rules for naming an identifier is as follows: 

1. It must be start with a letter(alphabet) 

2. Under score can be considered as a letter

3. White spaces and special characters cannot be used. 

4. Key words cannot be considered as an identifier

Cascading of I/O operator

The statement is True.

To represent null character \0 is used.

C = A + B. Here A and B are called Operand.

In the standard dictionary the words are arranged in sorted order so binary search method is more suitable to find the word “MATHEMATICS”.

Cascading of I/O operator

d) “c”, It is a string constant the others are character constant.

Symbols used to perform an operation is called Operator.

Thyroid gland. Thyroid gland is an endocrine gland. All others are exocrine gland.

Yes. It is a hexa decimal number

Arranging elements from smallest to largest (ascending) or largest to smallest(descending) is called sorting. 

There are two sorting methods 

1. Bubble sort: 

It is a simple sorting method. In this sorting considering two adjacent elements if it is out of order, the elements are interchanged. After the first iteration the largest(in the case of ascending sorting) or smallest(in the case of descending sorting) will be the end of the array. This process continues.

 2. Selection sort:

In selection sort the array is divided into two parts, the sorted part and unsorted part. First smallest element in the unsorted part is searched and exchanged with the first element. Now there is 2 parts sorted part and unsorted part. This process continues.

intx is a valid declaration.

The index of the first element is 0.

In a text book the words are not arranged in sorted order so linear search method is convenient.

(d) Array elements are dissimilar elements

It is a single dimensional array. If the user doesn’t specify the size the operating system allocates the number of characters + one (for null character for text) bytes of memory. So here OS allocates 9 bytes of memory.

The index of the last element is 199

It is not valid. The correct declaration is as follows, int mark[50]. Use square brackets instead of parenthesis

Array is collection of same type of elements. With the same name we can store more elements. The elements are distinguished by using its index or subscript. To store 50 marks of 50 students we have to declare 50 variables, it is a laborious work. 

Hence the need for arrays arise. By using array this is very easy as follows int mark[50]. Here the index of first element is 0, then 1, 2, 3, etc upto 49.

#include<iostream>

using namespace std; 

int main(() 

{ 

char a[9] = “COMPUTER”; 

inti; 

for (i=8; i>=0; i- -) 

{ 

cout<<a[i]; 

} 

}

It is the process of finding the position of the given element. 

1. Linear search: 

In this method each element of the array is compared with the element to be searched starting from the first element. If it finds the position of the element in the array is returned.

2. Binary search: 

It uses a technique called divide and conquer method. It can be performed only on sorted arrays. First we check the element with the middle element. There are 3 possibilities. The first possibility is the searched element is the middle element then search can be finished. 

The second possibility is the element is less than the middle value so the upper bound is the middle element. The third possibility is the element is greater than the middle value so the lower bound is the middle element. Repeat this process.

Locate a particular person from a queue can be carried out by using two ways. 

1. Linear search:

In this method each element of the array is compared with the element to be searched starting from the first element. If it finds the position of the element in the array is returned.

2. Binary search: 

It uses a technique called divide and conquer method. It can be performed only on sorted arrays. First we check the element with the middle element. There are 3 possibilities. The first possibility is the searched element is the middle element then search can be finished.

The second possibility is the element is less than the middle value so the upper bound is the middle element. The third possibility is the element is greater than the middle value so the lower bound is the middle element. Repeat this process.

To store an integer 4 bytes needed so 

AR[10] needs 10 × 4 = 40 bytes

The above C++ statement declares an array named num that can store maximum 10 integer numbers.

char name[21j;

(d) surrounded by brackets

An array is a collection of elements with same data type. The index of first element is 0 (zero) and the index of last element is size -1. There are 2 methods linear search and binary search.

Searching: It is the process of finding the position of the given element. 

1. Linear search: 

In this method each element of the array is compared with the element to be searched starting from the first element. If it finds the position of the element in the array is returned.

2. Binary search: 

It uses a technique called divide and conquer method. It can be performed only on sorted arrays. First we check the element with the middle element. There are 3 possibilities. The first possibility is the searched element is the middle element then search can be finished. 

The second possibility is the element is less than the middle value so the upper bound is the middle element. The third possibility is the element is greater than the middle value so the lower bound is the middle element. Repeat this process.8.3 Two dimensional (2D) arrays.

Some occasions we have to store 6 different marks of 50 students. For this we use 2D arrays. An array with two subscripts is used, eg. int mark[r][c]; Here r is the row and c is the column.

We have to declare 50 variables individually to store total marks of 50 students. It is a laborious work. 

Hence we use array, it is an efficient way to declare 50 variables. With a single variable name we can store multiple elements.

eg: int mark[50]. 

Here we can store 50 marks. 

The first mark is in mark[0], second is in mark[1]…. etc the fiftieth mark is in mark[49],

(b) the seventh

The elements of an array of size ten are numbered from 0 to 9

Priority Queues:- 

There are some queues in which we can insert items or delete items from any position based on some property. Now, those queues based on the property of priority of the task to be processed are referred to as priority queues. 

To implement a priority queue we first need to identify different levels of priority and categorize them as the least priority through the most priority level. After having identified the different levels of priority required, we then need to classify each incoming item (job) as to what priority level should be assigned to it. While creating the queues, we need to create n queues if there are n priority levels defined initially. Let suppose there are three priority levels identified as P1, P2, and P3. In this case we would create three queues as Q1, Q2 and Q3 each representing priority levels P1, P2, and P3 respectively. Now every job would have a priority level assigned to them. Jobs with priority level as P1 will be inserted in Q1. Jobs with priority level P2 are inserted in Q2 and so on. 

 Each queue will follow FIFO behavior strictly. Jobs are always removed from the front end of any queue. Elements in the queue Q2 are removed only when Q1 is empty and the elements of the queue Q3 are only removed when Q2 is empty and so on.