Two motorists set out at the same time from A to B, a distance of 100 miles. They both followed the same route and travelled at different though uniform speeds of integral number of miles /hour. The difference in their speeds was a prime number of miles/hour. After they had been driving for 2 hrs, the distance of the slower car from A was five times that of the faster car from B. How fast did the motorists drive?

A job is done by M men in D days. Then M + N men can do the same job in

An academic institute starts a class at 10:00 A.M. and ends at 1:47 P.M. It has 4 periods of equal distribution of time. After each period there is a gap of 5 minutes to start another period. What is the exact duration of the period?

A contractor estimated that one of his bricklayers would take 9 hrs to build a certain wall and the other 10 hours. However, he knew from experience that when they worked together, 10 fewer bricks laid per hour. Since he was in a hurry, he put both men on the job and found it took exactly 5 hours to build the wall. How many bricks did it contain?

The number of ways in which 3 men and 2 women can sit in a row so that no two men are adjacent is

Given the statement, "I always cut the top-right corner of a milk packet for opening it", a milk packet with its top-right corner cut is

A common problem in Computer Science research is to minimise an equation of the Form



where λ is a parameter, E_t , E_m and E_d are the total, model and data errors. Model

error reflects the mismatch between predicted and actual values, while data error is

the error due to noise in the data. For noisy data, the value of λ should be

Using general knowledge about Computer Science and by reading the following paragraph carefully, answer the Questions 8 - 12 below:

Princeton asked me to develop a course in automata theory. Since there were no courses or books on the subject, I asked McCluskey to recommend some materials for a course on automata theory. He gave me a list of six papers and told me that the material would probably give students a good background in automata theory. McCluskey'S list included works by Warren McCulloch and Walter Pitts, Michael Rabin and Dana Scott, John Backus and Peter Naur, Noam Chomsky, Juris Hartmanis and RichardStearns, and, of course, Alan Turing.

In 1943 McCulloch and Pitts, working in neurophysiology, published a paper on a logical calculus for describing events in neuron nets. The paper had a notation for describing how these strings of zeros and ones combine in neurons to produce new strings of zeros and ones. This notation was subsequently developed into the language of regular expressions for describing sets of strings. Rabin and Scott were mathematicians who developed a model of a computer with a finite amount of memory. They called this model the finite-state automaton, and showed that the possible behaviors of finite-state automata were precisely those behaviors that could be described by the regular expressions that grew out of the work of McCulloch and Pitts. ...... The work of Hartmanis and Stearns attracted researchers and focused· attention on the topic of complexity. Among the more significant advances that resulted were the classification of the complexity of most major mathematical theories, the reducibility of many combinatorial problems, the concept of NP-completeness, and a deeper understanding of concepts such as randomness. Also, through this course I met Jeffrey Ullman and Alfred Aho, with whom I subsequently collaborated for many years. Formal Languages and Automata Theory, which I wrote with Ullman, also evolved from this course.

Who is the ’I’, in the passage?

Using general knowledge about Computer Science and by reading the following paragraph carefully, answer the Questions 8 - 12 below:

Princeton asked me to develop a course in automata theory. Since there were no courses or books on the subject, I asked McCluskey to recommend some materials for a course on automata theory. He gave me a list of six papers and told me that the material would probably give students a good background in automata theory. McCluskey'S list included works by Warren McCulloch and Walter Pitts, Michael Rabin and Dana Scott, John Backus and Peter Naur, Noam Chomsky, Juris Hartmanis and RichardStearns, and, of course, Alan Turing.

In 1943 McCulloch and Pitts, working in neurophysiology, published a paper on a logical calculus for describing events in neuron nets. The paper had a notation for describing how these strings of zeros and ones combine in neurons to produce new strings of zeros and ones. This notation was subsequently developed into the language of regular expressions for describing sets of strings. Rabin and Scott were mathematicians who developed a model of a computer with a finite amount of memory. They called this model the finite-state automaton, and showed that the possible behaviors of finite-state automata were precisely those behaviors that could be described by the regular expressions that grew out of the work of McCulloch and Pitts. ...... The work of Hartmanis and Stearns attracted researchers and focused· attention on the topic of complexity. Among the more significant advances that resulted were the classification of the complexity of most major mathematical theories, the reducibility of many combinatorial problems, the concept of NP-completeness, and a deeper understanding of concepts such as randomness. Also, through this course I met Jeffrey Ullman and Alfred Aho, with whom I subsequently collaborated for many years. Formal Languages and Automata Theory, which I wrote with Ullman, also evolved from this course.
...... denotes some missing sentences in the passage. What are the most likely missing sentences?

Using general knowledge about Computer Science and by reading the following paragraph carefully, answer the Questions 8 - 12 below:

Princeton asked me to develop a course in automata theory. Since there were no courses or books on the subject, I asked McCluskey to recommend some materials for a course on automata theory. He gave me a list of six papers and told me that the material would probably give students a good background in automata theory. McCluskey'S list included works by Warren McCulloch and Walter Pitts, Michael Rabin and Dana Scott, John Backus and Peter Naur, Noam Chomsky, Juris Hartmanis and RichardStearns, and, of course, Alan Turing.

In 1943 McCulloch and Pitts, working in neurophysiology, published a paper on a logical calculus for describing events in neuron nets. The paper had a notation for describing how these strings of zeros and ones combine in neurons to produce new strings of zeros and ones. This notation was subsequently developed into the language of regular expressions for describing sets of strings. Rabin and Scott were mathematicians who developed a model of a computer with a finite amount of memory. They called this model the finite-state automaton, and showed that the possible behaviors of finite-state automata were precisely those behaviors that could be described by the regular expressions that grew out of the work of McCulloch and Pitts. ...... The work of Hartmanis and Stearns attracted researchers and focused· attention on the topic of complexity. Among the more significant advances that resulted were the classification of the complexity of most major mathematical theories, the reducibility of many combinatorial problems, the concept of NP-completeness, and a deeper understanding of concepts such as randomness. Also, through this course I met Jeffrey Ullman and Alfred Aho, with whom I subsequently collaborated for many years. Formal Languages and Automata Theory, which I wrote with Ullman, also evolved from this course.

Who invented the finite state automaton?

Using general knowledge about Computer Science and by reading the following paragraph carefully, answer the Questions 8 - 12 below:

Princeton asked me to develop a course in automata theory. Since there were no courses or books on the subject, I asked McCluskey to recommend some materials for a course on automata theory. He gave me a list of six papers and told me that the material would probably give students a good background in automata theory. McCluskey'S list included works by Warren McCulloch and Walter Pitts, Michael Rabin and Dana Scott, John Backus and Peter Naur, Noam Chomsky, Juris Hartmanis and RichardStearns, and, of course, Alan Turing.

In 1943 McCulloch and Pitts, working in neurophysiology, published a paper on a logical calculus for describing events in neuron nets. The paper had a notation for describing how these strings of zeros and ones combine in neurons to produce new strings of zeros and ones. This notation was subsequently developed into the language of regular expressions for describing sets of strings. Rabin and Scott were mathematicians who developed a model of a computer with a finite amount of memory. They called this model the finite-state automaton, and showed that the possible behaviors of finite-state automata were precisely those behaviors that could be described by the regular expressions that grew out of the work of McCulloch and Pitts. ...... The work of Hartmanis and Stearns attracted researchers and focused· attention on the topic of complexity. Among the more significant advances that resulted were the classification of the complexity of most major mathematical theories, the reducibility of many combinatorial problems, the concept of NP-completeness, and a deeper understanding of concepts such as randomness. Also, through this course I met Jeffrey Ullman and Alfred Aho, with whom I subsequently collaborated for many years. Formal Languages and Automata Theory, which I wrote with Ullman, also evolved from this course.

What was the difficulty in offering the course on Finite Automata Theory at Princeton?

Using general knowledge about Computer Science and by reading the following paragraph carefully, answer the Questions 8 - 12 below:

Princeton asked me to develop a course in automata theory. Since there were no courses or books on the subject, I asked McCluskey to recommend some materials for a course on automata theory. He gave me a list of six papers and told me that the material would probably give students a good background in automata theory. McCluskey'S list included works by Warren McCulloch and Walter Pitts, Michael Rabin and Dana Scott, John Backus and Peter Naur, Noam Chomsky, Juris Hartmanis and RichardStearns, and, of course, Alan Turing.

In 1943 McCulloch and Pitts, working in neurophysiology, published a paper on a logical calculus for describing events in neuron nets. The paper had a notation for describing how these strings of zeros and ones combine in neurons to produce new strings of zeros and ones. This notation was subsequently developed into the language of regular expressions for describing sets of strings. Rabin and Scott were mathematicians who developed a model of a computer with a finite amount of memory. They called this model the finite-state automaton, and showed that the possible behaviors of finite-state automata were precisely those behaviors that could be described by the regular expressions that grew out of the work of McCulloch and Pitts. ...... The work of Hartmanis and Stearns attracted researchers and focused· attention on the topic of complexity. Among the more significant advances that resulted were the classification of the complexity of most major mathematical theories, the reducibility of many combinatorial problems, the concept of NP-completeness, and a deeper understanding of concepts such as randomness. Also, through this course I met Jeffrey Ullman and Alfred Aho, with whom I subsequently collaborated for many years. Formal Languages and Automata Theory, which I wrote with Ullman, also evolved from this course.

Which of the following did not grow out of the work by Hartmanis and Stearns?

Which plots show the relationship between two or three variables when comparing data sets consisting of multiple observations?

Variability in groups of observations with widely differing means can be compared using the following measure

Features / attributes of patterns, which can be measured, are called

Find the sample variance, standard deviation and range of the following data: 572, 572, 573, 568, 569, 575, 565, 570

The president and treasurer are to be chosen from a student club consisting of 50 people. How many different choices of officers are possible if there are no restrictions?

In a college football training session, the defensive coordinator needs to have 10 players standing in a row. Among these 10 players, there are 1 freshman, 2 sophomore, 4 juniors and 3 seniors. How many different ways can they be arranged in a row if only their class level will be distinguished?

In how many ways can 5 different trees be planted in a circle?