Register
Filter

Questions by sourav.

11 votes
2 answers
2
$\{\langle M \rangle \mid M$ is a TM and there exist an input whose length is less than 100, on which $M$ halts$\}$
My Question $\{\langle M \rangle \mid M$ is a TM and there exist an input whose length is less than 100, on which $M$ halts$\}$I have to check that it is Turing Recogniza...
15 votes
1 answer
3
ECE GATE2003-13
Without any additional circuitry an $8:1 $ MUX can be used to obtain Some but not all Boolean functions of $3$ variables All function of $3$ variables but none of $4$ variables All functions of $3$ variables and some but not all of $4$ variables All functions of $4$ variables
Without any additional circuitry an $8:1 $ MUX can be used to obtainSome but not all Boolean functions of $3$ variablesAll function of $3$ variables but none of $4$ varia...
4 votes
2 answers
4
generalised pigeonhole principle
Show that if seven integers are selected from the first 10 positive integers, there must be at least two pairs of these integers with the sum 11. Attempt-:partition will be {(1,10),(2,9),(3,8)(4,7)(5,6)} now how to apply pigeonhole principle to find the answer?
Show that if seven integers are selected from the first10 positive integers, there must be at least two pairsof these integers with the sum 11.Attempt-:partition will be ...
1 votes
1 answer
5
Counting
How many ways are there to seat six people around a circular table where two seatings are considered the same when everyone has the same two neighbors without regard to whether they are right or left neighbors? It would be better if one provide a pictorial explanation.
How many ways are there to seat six people around a circular table where two seatings are considered the samewhen everyone has the same two neighbors without regard to wh...
3 votes
2 answers
7
Graph theory
complement of a complete bipartite graph Km,n .please provide a figure for explanation.
complement of a complete bipartite graph Km,n .please provide a figure for explanation.
3 votes
0 answers
8
graph theory
For which values of m and n is Km,n regular?
For which values of m and n is Km,n regular?
2 votes
1 answer
9
graph
Let n be a positive integer. Show that a subgraph induced by a nonempty subset of the vertex set of Kn is a complete graph.
Let n be a positive integer. Show that a subgraph induced by a nonempty subset of the vertex set of Kn is a complete graph.
3 votes
1 answer
10
RELATIONS
Suppose that A is a nonempty set, and f is a function that has A as its domain. Let R be the relation on A consisting of all ordered pairs (x, y) such that f (x) = f (y). What are the equivalence classes of R?
Suppose that A is a nonempty set, and f is a function that has A as its domain. Let R be the relation on A consisting of all ordered pairs (x, y) such that f (x) = f (y)....
1 votes
2 answers
11
asymptotic notation
if f(n) ≠ O(g(n)) then, g(n) ≠ O(f(n)) state true or false with explanation.
iff(n) ≠ O(g(n)) then, g(n) ≠ O(f(n)) state true or false with explanation.
2 votes
3 answers
12
Asymptotic Notation
Given that, f(n) = O(g(n)) then it implies that h(f(n)) = O(h(g(n)). State TRUE/FALSE with proper Explanation/Examples.Please provide mathematical proof,don't just prove by giving a counter example
Given that, f(n) = O(g(n)) then it implies that h(f(n)) = O(h(g(n)). State TRUE/FALSE with proper Explanation/Examples.Please provide mathematical proof,don't just prove ...
7 votes
2 answers
14
ISRO2016-25
What will be output of the following program? Assume that you are running this program in little-endian processor. #include<stdio.h> int main() { short a=320; char *ptr; ptr=(char *)&a; printf("%d",*ptr); return 0; } 1 320 64 Compilation error
What will be output of the following program? Assume that you are running this program in little-endian processor.#include<stdio.h int main() { short a=320; char *ptr; pt...
6 votes
4 answers
15
ISRO2016-24
In which class of Flynn's taxanomy, Von Neumann architecture belongs to? SISD SIMD MIMD MISD
In which class of Flynn's taxanomy, Von Neumann architecture belongs to?SISDSIMDMIMDMISD
9 votes
5 answers
16
ISRO2016-22
Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, what is the effective access time for the memory? 21.4 ns 29.9 ns 23.5 ns 35.1 ns
Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, w...
4 votes
4 answers
17
ISRO2016-20
What is the output of this C code? #include<stdio.h> void main() { int k=5; int *p=&k; int **m=&p; printf("%d %d %d",k,*p,**m); } 5 5 5 5 5 junk 5 junk junk compile time error
What is the output of this C code?#include<stdio.h void main() { int k=5; int *p=&k; int m=&p; printf("%d %d %d",k,*p, m); }5 5 5 5 5 junk5 junk junkcompile time error
4 votes
3 answers
19
ISRO2016-18
The functional difference between $SR$ flip-flop and $J$-$K$ flip-flop is that : $J$-$K$ flip-flop is faster than $SR$ flip-flop $J$-$K$ flip-flop has a feedback path $J$-$K$ flip-flop accepts both inputs $1$ None of them
The functional difference between $SR$ flip-flop and $J$-$K$ flip-flop is that :$J$-$K$ flip-flop is faster than $SR$ flip-flop$J$-$K$ flip-flop has a feedback path$J$-$K...
8 votes
2 answers
20
ISRO2016-17
Which of the following binary number is the same as its $2's$ complement ? $1010$ $0101$ $1000$ $1001$
Which of the following binary number is the same as its $2's$ complement ?$1010$$0101$$1000$$1001$
Page: