Register
Filter

Questions by admin

0 votes
1 answer
63
TIFR CSE 2024 | Part A | Question: 8
A palindrome is a string that reads the same in reverse (e.g. ABBA or KAYAK or MALAYALAM). How many strings of length 5 using the letters from $\{A, B, C, D, E\}$ have no palindromic substring of length at least 2? $243$ $405$ $540$ $675$ $1280$
A palindrome is a string that reads the same in reverse (e.g. ABBA or KAYAK or MALAYALAM).How many strings of length 5 using the letters from $\{A, B, C, D, E\}$ have no ...
0 votes
0 answers
64
TIFR CSE 2024 | Part A | Question: 9
Compute $\int_{16}^{\infty} \frac{1}{x} \cdot \frac{1}{\sqrt{\sqrt{x}-1}} d x$. $0$ $\frac{\pi}{3}$ $\frac{\pi}{2}$ $\frac{2 \pi}{3}$ $2 \pi$
Compute $\int_{16}^{\infty} \frac{1}{x} \cdot \frac{1}{\sqrt{\sqrt{x}-1}} d x$.$0$$\frac{\pi}{3}$$\frac{\pi}{2}$$\frac{2 \pi}{3}$$2 \pi$
0 votes
0 answers
69
TIFR CSE 2024 | Part A | Question: 14
Let $\text{A}$ and $\text{B}$ be two $n \times n$ invertible matrices with real entries such that every row in $\text{A}$ sums to $1$ and every row in $\text{B}$ sums to $2$ ... $\text{(iii)}$. Statements $\text{(i)}$ and $\text{(iii)}$ are true but not necessarily statement $\text{(ii)}$.
Let $\text{A}$ and $\text{B}$ be two $n \times n$ invertible matrices with real entries such that every row in $\text{A}$ sums to $1$ and every row in $\text{B}$ sums to ...
0 votes
1 answer
72
UGC NET CSE | June 2008 | Part 2 | Question: 2
The complexity of Kruskal's minimum spanning tree algorithm on a graph with ' $n$ ' nodes and ' $e$ ' edges is : $\mathrm{O}(n)$ $\mathrm{O}(n \log n)$ $\mathrm{O}(e \log n)$ $\mathrm{O}(e)$
The complexity of Kruskal's minimum spanning tree algorithm on a graph with ' $n$ ' nodes and ' $e$ ' edges is :$\mathrm{O}(n)$$\mathrm{O}(n \log n)$$\mathrm{O}(e \log n)...
0 votes
1 answer
73
UGC NET CSE | June 2008 | Part 2 | Question: 3
If a code is t-error correcting, the minimum Hamming distance is equal to : $2 t+1$ $2 t$ $2 t-1$ $t-1$
If a code is t-error correcting, the minimum Hamming distance is equal to :$2 t+1$$2 t$$2 t-1$$t-1$
0 votes
3 answers
74
UGC NET CSE | June 2008 | Part 2 | Question: 4
The set of positive integers under the operation of ordinary multiplication is : not a monoid not a group a group an Abelian group
The set of positive integers under the operation of ordinary multiplication is :not a monoidnot a groupa groupan Abelian group
0 votes
0 answers
75
UGC NET CSE | June 2008 | Part 2 | Question: 5
In a set of $8$ positive integers, there always exists a pair of numbers having the same remainder when divided by : $7$ $11$ $13$ $15$
In a set of $8$ positive integers, there always exists a pair of numbers having the same remainder when divided by :$7$$11$$13$$15$
0 votes
1 answer
76
UGC NET CSE | June 2008 | Part 2 | Question: 6
An example of a tautology is : $x \vee y$ $x \mathrm{v}(\sim y)$ $x \mathrm{v}(\sim x)$ $(x=>y) \wedge(x<=y)$
An example of a tautology is :$x \vee y$$x \mathrm{v}(\sim y)$$x \mathrm{v}(\sim x)$$(x=>y) \wedge(x<=y)$
0 votes
1 answer
77
UGC NET CSE | June 2008 | Part 2 | Question: 7
Among the logic families $\text{RTL, TTL, ECL}$ and $\text{CMOS}$, the fastest family is : $\text{ECL}$ $\mathrm{CMOS}$ $\text{TTL}$ $\text{RTL}$
Among the logic families $\text{RTL, TTL, ECL}$ and $\text{CMOS}$, the fastest family is :$\text{ECL}$$\mathrm{CMOS}$$\text{TTL}$$\text{RTL}$
0 votes
1 answer
78
UGC NET CSE | June 2008 | Part 2 | Question: 8
The octal equivalent of the hexadecimal number $\mathrm{FF}$ is : $100$ $150$ $377$ $737$
The octal equivalent of the hexadecimal number $\mathrm{FF}$ is :$100$$150$$377$$737$
0 votes
1 answer
80
UGC NET CSE | June 2008 | Part 2 | Question: 10
The idempotent law in Boolean algebra says that: $\sim(\sim x)=x$ $x+x=x$ $x+x y=x$ $x(x+y)=x$
The idempotent law in Boolean algebra says that:$\sim(\sim x)=x$$x+x=x$$x+x y=x$$x(x+y)=x$
Page: