Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Tesla!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Tesla!
1
votes
1
TIFR CSE 2019 | Part A | Question: 1
Let $X$ be a set with $n$ elements. How many subsets of $X$ have odd cardinality? $n$ $2^n$ $2^{n/2}$ $2^{n-1}$ Can not be determined without knowing whether $n$ is odd or even
Let $X$ be a set with $n$ elements. How many subsets of $X$ have odd cardinality?$n$ $2^n$$2^{n/2}$$2^{n-1}$Can not be determined w...
3.4k
views
answered
Dec 19, 2018
Set Theory & Algebra
tifr2019
engineering-mathematics
discrete-mathematics
set-theory&algebra
set-theory
+
–
4
votes
2
#Functional Depencency
max number of FD in a relation with 'n' attributes=$2^{2n}$ how this formula is obtained?
max number of FD in a relation with 'n' attributes=$2^{2n}$how this formula is obtained?
495
views
answered
Oct 28, 2018
Databases
database-normalization
databases
+
–
0
votes
3
time complexity
1.9k
views
answered
Sep 28, 2018
Algorithms
algorithms
time-complexity
test-series
+
–
2
votes
4
MIT ASSIGNMENT
Find the complexity of the following function when called with some integer n: void foo(n) { int i,j,k,x=0; for (i=1 ; i <= n ; i++) for (j=1 ; j <= i * i ; j++) for ( k = 1 ; k <= j ; k++) { x=x+10; } }
Find the complexity of the following function when called with some integer n:void foo(n) { int i,j,k,x=0; for (i=1 ; i <= n ; i++) for (j=1 ; j <= i * i ; j++) for ( k ...
703
views
answered
Sep 28, 2018
Algorithms
algorithms
time-complexity
mit-quiz
+
–
0
votes
5
MadeEasy Test Series: Theory Of Computation - Finite Automata
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.
675
views
answered
Sep 27, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
myhill-nerode
finite-automata
+
–
1
votes
6
Probablity-Gravner-58
Let $X$ be a random variable with $P(X=1) =0.2,P(X=2)=0.3$, and $P(X=3)=0.5$. What is the expected value of $X$?
Let $X$ be a random variable with $P(X=1) =0.2,P(X=2)=0.3$, and $P(X=3)=0.5$. What is the expected value of $X$?
264
views
answered
Sep 25, 2018
Probability
probability
engineering-mathematics
gravner
random-variable
+
–
0
votes
7
Probability - Gravner-67.c
You and your opponent both roll a fair die. If you both roll the same number, the game is repeated, otherwise whoever rolls the larger number wins. Let $N$ be the number of times the two dice have to be rolled before the game is ... dollar for winning in the first round, 1 dollar for winning in any other round, and nothing otherwise.Compute your expected winnings .
You and your opponent both roll a fair die. If you both roll the same number, the game is repeated, otherwise whoever rolls the larger number wins. Let $N$ be the number ...
365
views
answered
Sep 25, 2018
Probability
probability
gravner
engineering-mathematics
random-variable
+
–
0
votes
8
Probability - Gravner-67.b
You and your opponent both roll a fair die. If you both roll the same number, the game is repeated, otherwise whoever rolls the larger number wins. Let $N$ be the number of times the two dice have to be rolled before the game is decided. (b) Compute Probability you win
You and your opponent both roll a fair die. If you both roll the same number, the game is repeated, otherwise whoever rolls the larger number wins. Let $N$ be the number ...
470
views
answered
Sep 25, 2018
Probability
probability
gravner
engineering-mathematics
random-variable
+
–
0
votes
9
Probability - Gravner-66
You are dealt one card at random form a full deck and your opponent is dealt $2$ cards (Without any replacement ). If you get an Ace, he pays you $10$ dollar, if you get a King, he pays you $5$ dollar (regardless of his cards). If you have ... red cards, he pays you $1$ dollar. In all other cases you pay him $1$ dollar . Determine your expected earnings . Are they positive?
You are dealt one card at random form a full deck and your opponent is dealt $2$ cards (Without any replacement ). If you get an Ace, he pays you $10$ dollar, if you get ...
331
views
answered
Sep 25, 2018
Probability
probability
gravner
engineering-mathematics
random-variable
+
–
2
votes
10
Relation
State True or False? Empty set Φ is an equivalence relation.
State True or False?Empty set Φ is an equivalence relation.
1.8k
views
answered
Sep 21, 2018
Set Theory & Algebra
relations
+
–
3
votes
11
Identifying self dual function
Given answer: D I am not getting how to approach this question.
Given answer: DI am not getting how to approach this question.
4.7k
views
answered
Aug 23, 2018
Digital Logic
digital-logic
dual-function
ace-test-series
+
–
2
votes
12
Group theory
How to solve it? Better solution
How to solve it?Better solution
359
views
answered
Aug 20, 2018
2
votes
13
Self doubt
Let (g,*) be a group of order p where p is a prime number then number of proper subgroup is? I am getting 1 that is identity element, but somewhere I read, it will be 0. Who is wrong?
Let (g,*) be a group of order p where p is a prime number then number of proper subgroup is?I am getting 1 that is identity element, but somewhere I read, it will be 0....
799
views
answered
Aug 20, 2018
Set Theory & Algebra
discrete-mathematics
+
–
0
votes
14
ISI 2016 MMA 24
Let $f:\mathbb{R} \rightarrow \mathbb{R}$ be a strictly increasing function. Then which one of the following is always true? The limits $\lim_{x\rightarrow a+} f(X)$ and $\lim_{x\rightarrow a-} f(X)$ exist for all real number a if $f$ ... $x$ There cannot not be a real number $L$ such that $f(x) > L$ for all real $x$
Let $f:\mathbb{R} \rightarrow \mathbb{R}$ be a strictly increasing function. Then which one of the following is always true?The limits $\lim_{x\rightarrow a+} f(X)$ and $...
840
views
answered
Apr 30, 2018
Calculus
isi2016
functions
+
–
0
votes
15
ISI-2016-02
How many complex numbers $z$ are there such that $\mid z+1 \mid = \mid z+i \mid$ and $\mid z \mid = 5$ ? $0$ $1$ $2$ $3$
How many complex numbers $z$ are there such that $\mid z+1 \mid = \mid z+i \mid$ and $\mid z \mid = 5$ ?$0$$1$$2$$3$
354
views
answered
Apr 30, 2018
Mathematical Logic
engineering-mathematics
complex-number
+
–
3
votes
16
CMI2016-B-3
An undirected graph can be converted into a directed graph by choosing a direction for every edge. Here is an example: Show that for every undirected graph, there is a way of choosing directions for its edges so that the resulting directed graph has no directed cycles.
An undirected graph can be converted into a directed graph by choosing a direction for every edge. Here is an example:Show that for every undirected graph, there is a way...
759
views
answered
Apr 28, 2018
Graph Theory
cmi2016
descriptive
graph-theory
graph-connectivity
+
–
0
votes
17
CMI2016-B-6
An automatic spelling checker works as follows. Given a word $w$, first check if $w$ is found in the dictionary. If $w$ is not in the dictionary, compute a dictionary entry that is close to $w$. For instance if the user types $\mathsf{ocurrance}$, the spelling checker ... alignments of $x$ and $y$. What is the running time of your algorithm (in terms of the lengths of $x$ and $y)?$
An automatic spelling checker works as follows. Given a word $w$, first check if $w$ is found in the dictionary. If $w$ is not in the dictionary, compute a dictionary ent...
794
views
answered
Apr 28, 2018
Algorithms
cmi2016
dynamic-programming
algorithm-design
descriptive
+
–
0
votes
18
CMI2016-B-5
For a string $x=a_0a_1 \ldots a_{n-1}$ over the alphabet $\{0, 1, 2\}$, define $val(x)$ to be the value of $x$ interpreted as a ternary number, where $a_0$ is the most significant digit. More formally, $val(x)$ ... $ x \in \{0, 1, 2\}^*$ such that $val(x)$ is divisible by 4.
For a string $x=a_0a_1 \ldots a_{n-1}$ over the alphabet $\{0, 1, 2\}$, define $val(x)$ to be the value of $x$ interpreted as a ternary number, where $a_0$ is the most si...
484
views
answered
Apr 28, 2018
Theory of Computation
cmi2016
descriptive
finite-automata
+
–
4
votes
19
ISI2017-MMA-27
A box contains $5$ fair and $5$ biased coins. Each biased coin has a probability of head $\frac{4}{5}$. A coin is drawn at random from the box and tossed. Then the second coin is drawn at random from the box ( without replacing the first one). Given that the first coin has shown head ... the second coin is fair is $\frac{20}{39}\\$ $\frac{20}{37}\\$ $\frac{1}{2}\\$ $\frac{7}{13}$
A box contains $5$ fair and $5$ biased coins. Each biased coin has a probability of head $\frac{4}{5}$. A coin is drawn at random from the box and tossed. Then the second...
2.6k
views
answered
Apr 25, 2018
Probability
isi2017-mma
engineering-mathematics
probability
+
–
23
votes
20
ISI2017-MMA-29
Suppose the rank of the matrix $\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$ is $2$ for some real numbers $a$ and $b$. Then $b$ equals $1$ $3$ $1/2$ $1/3$
Suppose the rank of the matrix$$\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$$is $2$ for some real numbers $a$ and $b$. Then $b$ equals$1$$3$$1/2$$1/3$
2.7k
views
answered
Apr 24, 2018
Linear Algebra
isi2017-mma
engineering-mathematics
linear-algebra
rank-of-matrix
+
–
2
votes
21
ISI2017-MMA-19
If $\alpha, \beta$ and $\gamma$ are the roots of $x^3 - px +q = 0$, then the value of the determinant $\begin{vmatrix}\alpha & \beta & \gamma\\\beta & \gamma & \alpha\\\gamma & \alpha & \beta\end{vmatrix}$ is $p$ $p^2$ $0$ $p^2+6q$
If $\alpha, \beta$ and $\gamma$ are the roots of $x^3 - px +q = 0$, then the value of the determinant$$\begin{vmatrix}\alpha & \beta & \gamma\\\beta & \gamma & \alpha\\\g...
825
views
answered
Apr 24, 2018
Linear Algebra
isi2017-mma
engineering-mathematics
linear-algebra
determinant
+
–
6
votes
22
ISI2017-MMA-1
The area lying in the first quadrant and bounded by the circle $x^{2}+y^{2}=4$ and the lines $x= 0$ and $x=1$ is given by $\frac{\pi}{3}+\frac{\sqrt{3}}{2}$ $\frac{\pi}{6}+\frac{\sqrt{3}}{4}$ $\frac{\pi}{3}-\frac{\sqrt{3}}{2}$ $\frac{\pi}{6}+\frac{\sqrt{3}}{2}$
The area lying in the first quadrant and bounded by the circle $x^{2}+y^{2}=4$ and the lines $x= 0$ and $x=1$ is given by$\frac{\pi}{3}+\frac{\sqrt{3}}{2}$$\frac{\pi}{6}+...
1.8k
views
answered
Apr 23, 2018
Calculus
isi2017-mma
engineering-mathematics
calculus
area-under-the-curve
+
–
0
votes
23
Maths: Probability Distribution
Suppose X is a uniform random variable between 0.50 and 1.00. What is the probability that a randomly selected value of X is between 0.55 and 0.60 or between 0.75 and 0.85? A. 0.00 B. 0.15 C. 0.60 D. 0.30
Suppose X is a uniform random variable between 0.50 and 1.00. What is the probability that a randomly selected value of X is between 0.55 and 0.60 or between 0.75 and 0.8...
664
views
answered
Apr 22, 2018
Probability
engineering-mathematics
probability
random-variable
+
–
3
votes
24
PGEE 2018
let 5,8,11,14,17,20.. be series then 320 will be which term of this series A) 104 B) 106 C) 962 D) 87
let 5,8,11,14,17,20.. be series then 320 will be which term of this series A) 104B) 106C) 962D) 87
904
views
answered
Apr 22, 2018
Set Theory & Algebra
iiith-pgee
sequence-series
+
–
0
votes
25
Data Transfer
I have a normal Doubt Consider a Scenario:- 1. Total number of block are = K Total number of records per block = P Size of record = B bytes And we need to transfer all the blocks in memory. Avg rotation latency = R Seek time = S Block transfer rate ... rotation latency and transfer time for every block rt? else in one access i can transfer everything??? Plz correct me if i am wrong?
I have a normal Doubt Consider a Scenario:-1. Total number of block are = KTotal number of records per block = PSize of record = B bytesAnd we need to transfer all the bl...
269
views
answered
Apr 14, 2018
Operating System
disk
+
–
1
votes
26
self - doubt
Physical memory are divide into frame. The frame of each size are equal. Is the word size in each frame same or it may possible to different in size ? (I am taking about word size in two different frame in main memory. )
Physical memory are divide into frame. The frame of each size are equal. Is the word size in each frame same or it may possible to different in size ?(I am taking abou...
246
views
answered
Apr 14, 2018
Operating System
operating-system
memory-management
+
–
4
votes
27
Introduction to Computer Theory
Give CFG for the following language L =$ {(a^{m})(b^{m+n})(c^{n}) | m,n= 0,1,2,.....}$
Give CFG for the following languageL =$ {(a^{m})(b^{m+n})(c^{n}) | m,n= 0,1,2,.....}$
357
views
answered
Apr 12, 2018
Theory of Computation
theory-of-computation
context-free-language
+
–
3
votes
28
ISI-2014-11
Let $X_1,X_2,X_3,X_4$ be i.i.d. random variables each assuming the value $1$ and $-1$ with probability $\dfrac{1}{2}$ each. Then, the probability that the matrix $\begin{pmatrix}X_1 &X_2\\ X_3 &X_4\end{pmatrix}$ is nonsingular equals $1/2$ $3/8$ $5/8$ $1/4$
Let $X_1,X_2,X_3,X_4$ be i.i.d. random variables each assuming the value $1$ and $-1$ with probability $\dfrac{1}{2}$ each. Then, the probability that the matrix $\begin{...
666
views
answered
Apr 11, 2018
Probability
isi2014
probability
random-variable
+
–
4
votes
29
ISI2015-PCB-CS-6-b
Consider scheduling $n$ processes $P_1, P_2, \dots, P_n$ which are created in this order at almost the same instant. Assume that all processes have exactly one CPU burst of duration $D$ units (and no I/O bursts). Compute the average waiting time ... to switch from one running process to another and $\Delta$ units of time to switch from a terminated process to a running process.
Consider scheduling $n$ processes $P_1, P_2, \dots, P_n$ which are created in this order at almost the same instant. Assume that all processes have exactly one CPU burst ...
2.5k
views
answered
Apr 11, 2018
Operating System
descriptive
isi2015-pcb-cs
operating-system
process-scheduling
+
–
Page:
1
2
3
4
5
6
...
9
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register