Question Database

Displaying 51 - 100 of 124
Question Keywords Organizer Session number
51 MCI_22.6.pdf birthday problem, Probability DTP-TIFR Mumbai 22
52 MCI_22.5.pdf probability of n events, library of babel DTP-TIFR Mumbai 22
53 MCI_22.4.pdf Conditional Probability DTP-TIFR Mumbai 22
54 MCI_22.3.pdf Probability DTP-TIFR Mumbai 22
55 MCI_22.2.pdf Probability, multiple non-mutually exclusive events DTP-TIFR Mumbai 22
56 MCI_22.1.pdf Probability, multiple non-mutually exclusive events DTP-TIFR Mumbai 22
57 MCI_21.8.pdf enumerative combinatorics dtp tifr mumbai 21
58 MCI_21.7.pdf enumerative combinatorics dtp tifr mumbai 21
59 MCI_21.6.pdf tower of hanoi, binary numbers dtp tifr mumbai 21
60 MCI_21.5.pdf enumerative combinatorics dtp tifr mumbai 21
61 MCI_21.4.pdf combinatorics, enumerative combinatorics dtp tifr mumbai 21
62 MCI_21.3.pdf combinatorics, enumerative combinatorics dtp tifr mumbai 21
63 MCI_21.2.pdf combinatorics, enumerative combinatorics dtp tifr mumbai 21
64 MCI_21.1.pdf combinatorics, enumerative combinatorics dtp tifr mumbai 21
65 MCI_16.4.pdf protocols with randomness, parity STCS TIFR Mumbai 16
66 MCI_16.3.pdf basic extremal graph theory STCS TIFR Mumbai 16
67 MCI_16.2.pdf basic extremal graph theory STCS TIFR Mumbai 16
68 MCI_16.1.pdf parity STCS TIFR Mumbai 16
69 MCI_15.4.pdf pigeon-hole principle, basic inequalities STCS TIFR Mumbai 15
70 MCI_15.3.pdf modular arithmetic STCS TIFR Mumbai 15
71 MCI_15.2.pdf basic inequalities STCS TIFR Mumbai 15
72 MCI_15.1.pdf ramsey numbers, basic extremal graph theory STCS TIFR Mumbai 14
73 MCI_14.4.pdf basic enumerative combinatorics STCS TIFR Mumbai 14
74 MCI_14.3.pdf combinatorial geometry, pigeon-hole principle STCS TIFR Mumbai 14
75 MCI_14.2.pdf reflections STCS TIFR Mumbai 14
76 MCI_14.1.pdf pigeon-hole principle STCS TIFR Mumbai 14
77 MCI_13.4.pdf graph theory, recurrences STCS TIFR Mumbai 13
78 MCI_13.3.pdf information compression STCS TIFR Mumbai 13
79 MCI_13.2.pdf graph theory STCS TIFR Mumbai 13
80 MCI_13.1.pdf recurrences, Fibonacci sequence, combinatorics STCS TIFR Mumbai 13
81 MCI_12.4.pdf voting rule, social choice theory STCS TIFR Mumbai 12
82 MCI_12.3.pdf graph theory, connected graphs, eulerian circuits STCS TIFR Mumbai 12
83 MCI_12.2.pdf graph theory, connected graphs, trees STCS TIFR Mumbai 12
84 MCI_12.1.pdf cryptography, protocols STCS TIFR Mumbai 12
85 MCI_11.4.pdf countable and uncountable infinities IISER Mohali 11
86 MCI_11.3.pdf upper limit, modular arithmetic IISER Mohali 11
87 MCI_11.2.pdf countable infinity, minimising area IISER Mohali 11
88 MCI_11.1.pdf rational numbers, irrational numbers IISER Mohali 11
89 MCI_10.2.pdf floor, arithmetic progression IISER Mohali 10
90 MCI_10.1.pdf truncation, powers of 2 IISER Mohali 10
91 MCI_9.6.pdf markov chains, random walk IISER Mohali 9
92 MCI_9.5.pdf alternating series IISER Mohali 9
93 MCI_9.4.pdf divisibility, factors IISER Mohali 9
94 MCI_9.3.pdf lower and upper limits, points on a line, points on a plane IISER Mohali 9
95 MCI_9.2.pdf solvability of problems, counting, algorithms IISER Mohali 9
96 MCI_9.1.pdf optimisation, maximum area, maximum volume IISER Mohali 9
97 MCI 8.3.pdf Probability, random walk, markov chains IISER Mohali 8
98 MCI 8.2.pdf scale diagrams, legend IISER Mohali 8
99 MCI 8.1.pdf parity, arithmetic progression IISER Mohali 8
100 MCI_ 7.3.pdf linear equations TIFR Mumbai 7