## HCU PHD CS JUNE 2021

Question 1 |

Train A, running on a track with speed a meters per second is x meters long. Train
13 running on a parallel track is y meters in length, and running at b meters per
second. The time t taken for train A to cross a man sitting in train 13:

Is indeterminate due to missing information | |

Question 2 |

Which of the following is not the name of a DNN (deep lleural network):

VGG16 | |

Neocognitron | |

Alexnet | |

Manet |

Question 3 |

A nOn-linear function is required to "saturate" the sum of weighted inputs (here
we use variable x) when being used in a unit activation function for DNN. Which
of the following activation functions does not saturate for all x.

y(x) = tanh x | |

Question 4 |

How many times does the function f(:r) = 2

^{x}(x-5) - 5 cut the X-axis?0 | |

1 | |

2 | |

5 |

Question 5 |

Answer the questions Q. 5 to Q. 8 by reading the passage given below.

The problem of sorting a mass of items, occupying consecutive locations in the store of a computer, may be reduced to that of sorting two lesser segments of data, provided that it is known that the keys of each of the items held in locations lower than a certain dividing line are less than the keys of all the items held ill locations above the dividing line. In this case the two segments may be sorted separately, and as a result the whole mass of data will be sorted.

In practice, the existence of such a dividing line will be rare, but even if it did exist, and its position would be unknown. It is, however, quite easy to rearrange the items in such a way that a dividing line is brought into existence, and its position is known. The method of doing this h&<; been given the name partition.

The first step of the partition process is to choose a particular key value which is known to be within the range of keys of the items in the segment which is to be sorted. A simple method of ensuring this is to choose the actual key value of one of the items in the segment. The chosen key value will be called the bound. The aim is now to produce a situation in which the keys of all the items above the dividing line are equal to or greater than the bound. Fortunately, we do not need to know the position of the dividing line in advance; its position is determined only at the end of the partition process.

What sorting algorithm is described in the passage above?

The problem of sorting a mass of items, occupying consecutive locations in the store of a computer, may be reduced to that of sorting two lesser segments of data, provided that it is known that the keys of each of the items held in locations lower than a certain dividing line are less than the keys of all the items held ill locations above the dividing line. In this case the two segments may be sorted separately, and as a result the whole mass of data will be sorted.

In practice, the existence of such a dividing line will be rare, but even if it did exist, and its position would be unknown. It is, however, quite easy to rearrange the items in such a way that a dividing line is brought into existence, and its position is known. The method of doing this h&<; been given the name partition.

The first step of the partition process is to choose a particular key value which is known to be within the range of keys of the items in the segment which is to be sorted. A simple method of ensuring this is to choose the actual key value of one of the items in the segment. The chosen key value will be called the bound. The aim is now to produce a situation in which the keys of all the items above the dividing line are equal to or greater than the bound. Fortunately, we do not need to know the position of the dividing line in advance; its position is determined only at the end of the partition process.

What sorting algorithm is described in the passage above?

insertion sort | |

Quicksort | |

Merge sort | |

Heap sort |

Question 6 |

What does the method named as partition do?

Rearranges the items such that they are sorted | |

Rearranges the items such that a dividing line comes into existence | |

Moves all smaller elements to one end of the list | |

Moves the dividing line to the end of the list |

Question 7 |

When is the position of the dividing line determined?

At the beginning of the sorting process | |

In the middle of the sorting process | |

At the end of the partition process | |

It is fixed and is programmed as a parameter |

Question 8 |

By what name is the bound more popularly known today?

Pivot | |

Partition | |

Min-heap | |

Big-Oh |

Question 9 |

The classic book on C language titled, "The C Programming Language", is written
by

Kernighan and Ritchie | |

Bill Gates | |

Yashwant Kanit kart | |

Balaguruswamy |

Question 10 |

Which of the following companies in recent times are referred to as the Big Four' in
the IT industry?

Amazon, Apple, Microsoft, IBM | |

Apple, Microsoft, Google, Facebook | |

Amazon, Google~ IBM, Facebook | |

Microsoft, Google, Facebook, IBM. |

Question 11 |

Which of the following is not a browser software produced by Microsoft~

Internet Explorer | |

Edge | |

Opera | |

All of the above |

Question 12 |

"If we move these items from Set P and place them into Set Q, the average value
of both the sets P and Q will increa'3e." Which of the following statements is false
with regards to the items moved from Set P to Set Q?

The average value of the items is higher than the average value of Set P | |

The average value of the items is lower than the average value of Set P | |

The average value of the items is higher than the average value of Set Q | |

None of the above |

Question 13 |

The monthly expenditure of a household, when analysed, was found to fit a quadratic
function e(x) = ax

^{2}+bx + c. Assuming that the monthly expenditure can never be negative (in the past or in the future), what can we say about the roots of e(x)?Both are real | |

Both are complex numbers | |

One is real and one is complex | |

One is real and negativp, the other is real and positive |

Question 14 |

"In this statement there are exactly__________ three-letter words not more no less." Fill the correct option from below to make the complete sentence true.

Two | |

Three | |

Four | |

Cannot be correctly filled |

Question 15 |

Which of these computer scientists is credited with the idea of the world wide web
of documents using hypertext.

Tim Berners-Lee | |

Vincent Van Gogh | |

Vinton Cerf | |

Dennis Ritchie |

Question 16 |

Dennis Ritchie and his colleague were known for the C language and also Unix
operating system. The name of his famous colleague is:

James Gosling | |

Steve Jobs | |

William Gates | |

Kenneth (Ken) Lane Thompson |

Question 17 |

Consider the various display standards like SVGA, VGA, WXGA, XGA and Full HD. Which of these is closest to one megapixels ( approximately 1 X 10

^{6}pixels)?VGA | |

1080p | |

WXGA | |

1440p |

There are 17 questions to complete.