Searching for "CH"

Q:

Two payments of $10,000 each must be made one year and four years from now. If money can earn 9% compounded monthly, what single payment two years from now would be equivalent to the two scheduled payments?

A) 19296 B) 19396
C) 19496 D) 19596
 
Answer & Explanation Answer: A) 19296

Explanation:

The single equivalent payment will be PV + FV.
FV = Future value of $10,000, 12 months later
 $10,000 *(1.0075)/12
 $10,938.07
PV=  Present value of $10,000, 24 months earlier
 $10,000/(1.0075)24
 $8358.31
The equivalent single payment is
$10,938.07 + $8358.31 = $19,296.38

Report Error

View Answer Report Error Discuss

Filed Under: Compound Interest
Exam Prep: Bank Exams
Job Role: Bank PO

Q:

What scheme does the Kernel in Unix System V follow while choosing a swap device among the multiple swap devices?

Answer

Kernel follows Round Robin scheme choosing a swap device among the multiple swap devices in Unix System V.

Report Error

View answer Workspace Report Error Discuss

Subject: Operating Systems Exam Prep: GATE

Q:

Consider the word ROTOR. Whichever way you read it, from left to right or from right to left, you get the same word. Such a word is known as palindrome. Find the maximum possible number of 5-letter palindromes.

A) 17756 B) 17576
C) 12657 D) 12666
 
Answer & Explanation Answer: B) 17576

Explanation:

The first letter from the right can be chosen in 26 ways because there are 26 alphabets.

 

Having chosen this, the second letter can be chosen in 26 ways

 

The first two letters can chosen in 26 x 26 = 676 ways

 

Having chosen the first two letters, the third letter can be chosen in 26 ways.

 

All the three letters can be chosen in 676 x 26 =17576 ways.

 

It implies that the maximum possible number of five letter palindromes is 17576 because the fourth letter is the same as the second letter and the fifth letter is the same as the first letter.

Report Error

View Answer Report Error Discuss

Q:

A Map is an Array,which contains the addresses of the free space in swap device that are allocatable resources,and the number of the resource unit available there.

A) TRUE B) FALSE
Answer & Explanation Answer: A) TRUE

Explanation:

The given statement is clearly true.

Report Error

View Answer Workspace Report Error Discuss

Subject: Operating Systems
Exam Prep: GRE

Q:

In how many different ways can the letters of the word 'DETAIL' be arranged in such a way that the vowels occupy only the odd positions?

A) 36 B) 25
C) 42 D) 120
 
Answer & Explanation Answer: A) 36

Explanation:

There are 6 letters in the given word, out of which there are 3 vowels and 3 consonants.

 

Let us mark these positions as under: 

                                                      (1) (2) (3) (4) (5) (6) 

Now, 3 vowels can be placed at any of the three places out 4, marked 1, 3, 5.  

Number of ways of arranging the vowels = 3P3 = 3! = 6.

 

Also, the 3 consonants can be arranged at the remaining 3 positions. 

Number of ways of these arrangements = 3P3 = 3! = 6. 

Total number of ways = (6 x 6) = 36.

Report Error

View Answer Report Error Discuss

Q:

In a group of 6 boys and 4 girls, four children are to be selected. In how many different ways can they be selected such that at least one boy should be there?

A) 209 B) 290
C) 200 D) 208
 
Answer & Explanation Answer: A) 209

Explanation:

We may have (1 boy and 3 girls) or (2 boys and 2 girls) or (3 boys and 1 girl) or (4 boys). 

 

Required number of ways = 6C1*4C3+6C2*4C2+6C3*4C1+6C4  

6C1*4C1+6C2*4C2+6C3*4C1+6C2 = 209.

Report Error

View Answer Report Error Discuss

Q:

In how many different ways can the letters of the word 'LEADING' be arranged in such a way that the vowels always come together?

A) 720 B) 520
C) 700 D) 750
 
Answer & Explanation Answer: A) 720

Explanation:

The word 'LEADING' has 7 different letters.

When the vowels EAI are always together, they can be supposed to form one letter.

Then, we have to arrange the letters LNDG (EAI).

Now, 5 (4 + 1) letters can be arranged in 5! = 120 ways.

The vowels (EAI) can be arranged among themselves in 3! = 6 ways.

Required number of ways = (120 x 6) = 720.

Report Error

View Answer Report Error Discuss

Q:

Which among the following is not aprocess state in unix?

A) Running B) Runnable
C) Zombie D) Stopped
 
Answer & Explanation Answer: B) Runnable

Explanation:

The process states of unix are running,Zombie,stopped,Waiting.

Report Error

View Answer Report Error Discuss

Filed Under: Operating Systems
Exam Prep: GATE