Sample questions - M.Sc. / Ph.D entrance examination : Computer

Sample questions - M.Sc. / Ph.D entrance examination : Computer
1. If Jogesh’s program runs correctly, he is happy. Which of the following
statements is true?
(a) If Jogesh’s program does not run correctly, he is not happy.
(b) If Jogesh is happy, his program must have run correctly.
(c) If Jogesh is not happy, his program must not have run correctly.
(d) None of the above
2. Let X and Y be two sets such that |X| = 10 and |Y | = 5. Let S be
the set of all injective (i.e., 1–1) functions from X to Y . What is |S|?
(a) 0 (b) 50 (c) 105 (d) 510
3. Consider the following two programs, operating on an array A of n
Program I:
M = A(1)
For i = 2 to n
If A(i) > M
Then M = A(i)
Count = 0
For i = 1 to n
If A(i) = M
Then Count = Count + 1
Output Count
Program II:
If A(1) = A(n)
Then Count = n
i = 1
While (A(i) < A(n)) Do
i = i + 1
Count = n - i + 1
Output Count
(i) Which program correctly counts the number of occurrences of the
maximum element in the array?
(a) I (b) II (c) I and II (d) neither
(ii) Which program correctly counts the number of occurrences of the
maximum element in the array, if the array is sorted in increasing
(a) I (b) II (c) I and II (d) neither
4. A queue is a list with insertions at the end and deletions from the head.
The following list of operations is performed on an empty queue:
(i) What element is deleted by the last DELETE instruction?
(ii) What are the contents of the queue after this sequence of instructions?
5. Is the language consisting of binary strings, whose last three bits
are 011, regular? If yes, construct a finite automaton accepting this
language. If no, provide a proof that the language is not regular.
6. Show that any tree with n vertices has exactly n - 1 edges.
7. Describe the avantages of 2’s complement representation over the sign
magnitude representation. Represent the following integers, if possible,
in 8-bit 2’s complement notation
(a) 113
(b) -127
8. Given a sequence of integers a1, . . . , an, an increasing subsequence is
a sequence of the form ai1 , ai2 . . . , aik such that ai1  ai2 . . .  aik and
i1  i2 . . .  ik. Describe an algorithm that computes the length of
the longest increasing subsequence in a given array.

Related Articles

Computer and Laptop Security Tips

In this resource we are going to have a discussion on the ideas and ways out to safeguard our System and Laptops. There are some additional powerful tips for the laptop security in the end. In order to have a clear cut idea that what is actually the difference between malware, spyware and other security threats, kindly have a look at the resource in detail.

Changing Power Options in Your Computer

Imagine a scenario wherein a user has to switch off the system temporarily, but he/she doesn’t even have the time to save the program/application on which he/she is working. If the user is aware of the various power options available with Windows, he will definitely use them during such scenarios. This article informs change the power options in the computer.

Great way to control the control panel

Control panel is a component in a personal computer using which you can change most of the settings of the computer. Messing up with the control panel can result in serious problems in performance of your computer. So, it's is very important to keep it safe from others who use your computer. Here are some ways to restrict the control panel.

The Value Of Computer Education Today

Computers are being used almost in every field these days. Hence its just natural for us to learn everything we can about these machines. Our day to day works are being controlled by computers designed by us to carry out those tasks. Computers are being used in the fields of education, medicine, transport,military,etc.

Hubs and Need of Hubs

Hub is a special device which is used to extend a network by allowing additional workstations in the network.

More articles: Computer Entrance Exam


No responses found. Be the first to comment...

  • Do not include your name, "with regards" etc in the comment. Write detailed comment, relevant to the topic.
  • No HTML formatting and links to other web sites are allowed.
  • This is a strictly moderated site. Absolutely no spam allowed.
  • Name: