menu
search
Log In

GO Book for GATECSE 2022GATE Overflow Book for GATE CSE 2022

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects


GATE Overflow
Recent questions tagged combinatory

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts
Webpage for Combinatory:

Recent questions tagged combinatory

5 votes
5 answers
1
GATE CSE 2021 Set 2 | Question: 50
Let $S$ be a set of consisting of $10$ elements. The number of tuples of the form $(A,B)$ such that $A$ and $B$ are subsets of $S$, and $A \subseteq B$ is ___________
Let $S$ be a set of consisting of $10$ elements. The number of tuples of the form $(A,B)$ such that $A$ and $B$ are subsets of $S$, and $A \subseteq B$ is ___________
asked Feb 18 in Combinatory Arjun 1.3k views
5 votes
2 answers
2
GATE CSE 2021 Set 1 | Question: 19
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 ___________.
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 ___________.
asked Feb 18 in Combinatory Arjun 1.3k views
0 votes
1 answer
3
CMI-2020-DataScience-B: 5
A permutation $\sigma$ is a bijection from the set $[n]=\{1,2,\dots ,n\}$ to itself. We denote it using the notation $\begin{pmatrix}1 & 2 & & n \\ {\sigma(1)} & {\sigma(2)} &\dots & {\sigma(n)} \end{pmatrix},$ ...
A permutation $\sigma$ is a bijection from the set $[n]=\{1,2,\dots ,n\}$ to itself. We denote it using the notation $\begin{pmatrix}1 & 2 & & n \\ {\sigma(1)} & {\sigma(2)} &\dots & {\sigma(n)} \end{pmatrix},$ e.g. if $n=3$ ... $\sigma =\begin{pmatrix} 1 & 2 & 3&4&5&6 \\ 2& 3&4&5&1&6 \end{pmatrix}, \; \tau=\begin{pmatrix} 1 & 2 & 3&4&5&6 \\ 4& 1&3&2&6&5 \end{pmatrix}$
asked Jan 29 in Others soujanyareddy13 32 views
0 votes
1 answer
4
CMI-2020-DataScience-B: 6
A permutation $\sigma$ is a bijection from the set $[n]=\{1,2, ,n\}$ to itself. We denote it using the notation $\begin{pmatrix}1 & 2 & & n \\ {\sigma(1)} & {\sigma(2)} & & {\sigma(n)} \end{pmatrix},$ e.g. ... $|A_{\sigma} |$ and $|A_\tau|?$ Can you relate these with the signs of permutations $\sigma$ and $\tau ?$
A permutation $\sigma$ is a bijection from the set $[n]=\{1,2, ,n\}$ to itself. We denote it using the notation $\begin{pmatrix}1 & 2 & & n \\ {\sigma(1)} & {\sigma(2)} & & {\sigma(n)} \end{pmatrix},$ ... $|A_{\sigma} |$ and $|A_\tau|?$ Can you relate these with the signs of permutations $\sigma$ and $\tau ?$
asked Jan 29 in Others soujanyareddy13 22 views
1 vote
2 answers
5
NIELIT Scientific Assistant A 2020 November: 19
What is the total number of ways to reach from $A$ to $B$ in the network given? $12$ $16$ $20$ $22$
What is the total number of ways to reach from $A$ to $B$ in the network given? $12$ $16$ $20$ $22$
asked Dec 8, 2020 in Quantitative Aptitude gatecse 317 views
2 votes
2 answers
6
UGCNET-Oct2020-II: 2
How many ways are there to pack six copies of the same book into four identical boxes, where a box can contain as many as six books? $4$ $6$ $7$ $9$
How many ways are there to pack six copies of the same book into four identical boxes, where a box can contain as many as six books? $4$ $6$ $7$ $9$
asked Nov 20, 2020 in Combinatory jothee 740 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...