GATE CSE 2021 Set 1 | Combinatorics Question 3 | Discrete Mathematics

GATE CSE 2021 Set 1

Numerical

-0

There are 6 jobs with distinct difficulty levels, and 3 computers with distinct processing speeds. Each job is assigned to a computer such that:

- The fastest computer gets the toughest job and the slowest computer gets the easiest job.

- Every computer gets at least one job.

The number of ways in which this can be done is ______

Your input ____

GATE CSE 2015 Set 3

Numerical

-0

The number of $$4$$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $${1, 2, 3}$$ is____________.

Your input ____

GATE CSE 2012

MCQ (Single Correct Answer)

-0.3

The recurrence relation capturing the optional execution time of the Towers of Hanoi problem with $$n$$ discs is

$$T\left( n \right) = 2T\left( {n - 2} \right) + 2$$

$$T\left( n \right) = 2T\left( {n - 1} \right) + n$$

$$T\left( n \right) = 2T\left( {n/2} \right) + 1$$

$$T\left( n \right) = 2T\left( {n - 1} \right) + 1$$

GATE CSE 2004

MCQ (Single Correct Answer)

-0.3

In a class of 200 students, 125 students have taken Programming Language course, 85 students have taken Data Structures course, 65 student have taken Computer Organization coures; 50 students have taken both Programming Language and Data Structures, 35 students have taken both Programming Languages and Computer Organization; 30 students have taken both Data Structures and Computer Organization; 15 students have taken all the three course.

How many students have not taken any of the three courses?