Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by srestha
0
votes
81
ISI2015-MMA-92
Consider the group $G=\begin{Bmatrix} \begin{pmatrix} a & b \\ 0 & a^{-1} \end{pmatrix} : a,b \in \mathbb{R}, \: a>0 \end{Bmatrix}$ ... is of finite order $N$ is a normal subgroup and the quotient group is isomorphic to $\mathbb{R}^+$ (the group of positive reals with multiplication).
Consider the group $$G=\begin{Bmatrix} \begin{pmatrix} a & b \\ 0 & a^{-1} \end{pmatrix} : a,b \in \mathbb{R}, \: a>0 \end{Bmatrix}$$ with usual matrix multiplication. Le...
1.4k
views
answered
Mar 10, 2019
Set Theory & Algebra
isi2015-mma
group-theory
subgroups
normal
non-gate
+
–
0
votes
82
Kenneth Rosen Edition 6 Question 45 (Page No. 346)
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?
9.2k
views
answered
Mar 3, 2019
Combinatory
combinatory
counting
+
–
0
votes
83
ME Test Series
A 1070 B 1071 C 1072 D 1073
A 1070B 1071C 1072D 1073
286
views
answered
Dec 29, 2018
0
votes
84
TIFR CSE 2019 | Part A | Question: 15
Consider the matrix $A = \begin{bmatrix} \frac{1}{2} &\frac{1}{2} & 0\\ 0& \frac{3}{4} & \frac{1}{4}\\ 0& \frac{1}{4} & \frac{3}{4} \end{bmatrix}$ What is $\displaystyle \lim_{n→\infty}$A^n$ ? $\begin{bmatrix} \ 0 ... $\text{The limit exists, but it is none of the above}$
Consider the matrix$$A = \begin{bmatrix} \frac{1}{2} &\frac{1}{2} & 0\\ 0& \frac{3}{4} & \frac{1}{4}\\ 0& \frac{1}{4} & \frac{3}{4} \end{bmatrix}$$What is $\displaystyle ...
2.8k
views
answered
Dec 21, 2018
Calculus
tifr2019
engineering-mathematics
calculus
limits
matrix
+
–
1
votes
85
geeksforgeeks
#include<stdio.h> int main() { int a[]={1,2,3,4,5,6}; int *ptr=(int *)(&a+1); printf("%d",*(ptr-1)); return 0; } this program print => 6 but if we try #include<stdio.h> int main() { int a[]={1,2,3,4,5,6}; int *ptr=(int *)(&a+2); printf("%d",*(ptr-2)); return 0; } justify why this program not print => 6
#include<stdio.h int main() { int a[]={1,2,3,4,5,6}; int *ptr=(int *)(&a+1); printf("%d",*(ptr-1)); return 0; }this program print = 6 but if we try#include<stdio.h int ma...
7.0k
views
answered
Dec 21, 2018
Programming in C
programming-in-c
+
–
0
votes
86
GATE 2008 MA Exponential Distribution
506
views
answered
Dec 11, 2018
1
votes
87
TIFR CSE 2019 | Part B | Question: 13
A row of $10$ houses has to be painted using the colours red, blue, and green so that each house is a single colour, and any house that is immediately to the right of a red or a blue house must be green. How many ways are there to paint the houses? $199$ $683$ $1365$ $3^{10}-2^{10}$ $3^{10}$
A row of $10$ houses has to be painted using the colours red, blue, and green so that each house is a single colour, and any house that is immediately to the right of a r...
5.0k
views
answered
Dec 9, 2018
Combinatory
tifr2019
combinatory
counting
+
–
6
votes
88
TIFR CSE 2017 | Part A | Question: 15
Let $T(a, b)$ be the function with two arguments (both nonnegative integral powers of 2) defined by the following recurrence: $ T(a, b) = T \left( \frac{a}{2}, b \right) +T\left( a, \frac{b}{2} \right)\quad \quad \quad \text{if } a, b \geq 2$ ... $\begin{pmatrix} r+s \\ r \end{pmatrix}$ $2^{r-s}$ if $r \geq s$, otherwise $2^{s-r}$
Let $T(a, b)$ be the function with two arguments (both nonnegative integral powers of 2) defined by the following recurrence:$ T(a, b) = T \left( \frac{a}{2}, b \right) +...
2.4k
views
answered
Dec 8, 2018
Algorithms
tifr2017
algorithms
recurrence-relation
+
–
1
votes
89
Pielining-Doubt
Consider below sequence of instructions $1.lw\,s2,0(s1)$ $2.lw\,s1,40(s6)$ $3.sub\,s6,s1,s2$ $4.add\,s6,s2,s2$ $5.or\,s3,s6,0$ $6.sw\,s6,50(s1)$ What is the number of clock cycles taken by above set of instructions when ... cycles (b)11 cycles Are my answers correct? Source:https://cseweb.ucsd.edu/classes/wi12/cse141-a/solutions/assignment5-soln.pdf Question 3, part 3 and 4.
Consider below sequence of instructions$1.lw\,s2,0(s1)$$2.lw\,s1,40(s6)$$3.sub\,s6,s1,s2$$4.add\,s6,s2,s2$$5.or\,s3,s6,0$$6.sw\,s6,50(s1)$What is the number of clock cycl...
1.6k
views
answered
Dec 7, 2018
CO and Architecture
pipelining
co-and-architecture
+
–
0
votes
90
Self doubt SQL
Select Rating From professor P2 Where 5>=(Select count (*) From professor P3 Where P2.Rating <= P3.Rating); Can someone please explain the query?
Select Rating From professor P2 Where 5>=(Select count (*) From professor P3 Where P2.Rating <= P3.Rating);Can someone please explain the query?
1.0k
views
answered
Dec 2, 2018
Databases
sql
+
–
0
votes
91
made easy test series
Consider a machine with byte addressable memory 32 bits virtual addresses, 32 bits physical addresses and 4 KB page size. If a two-level page table system is used where each page table occupies one page and page table entries of 4 B each, then the memory overhead for this machine is ________ KB.
Consider a machine with byte addressable memory 32 bits virtual addresses, 32 bits physical addresses and 4 KB page size. If a two-level page table system is used where e...
240
views
answered
Dec 2, 2018
1
votes
92
TOTAL CONFLICT SERIALIZABLE SCHEDULES
Two transactions T1 and T2 are given as T1:r1(A) w1(A) r1(B) w1(B) r1(C) w1(C) T2:r2(B) w2(B) r2(C) w2(C) r2(D) w2(D) The total number of conflicts serializable schedules that can be formed by T1 and T2 are _____
Two transactions T1 and T2 are given asT1:r1(A) w1(A) r1(B) w1(B) r1(C) w1(C)T2:r2(B) w2(B) r2(C) w2(C) r2(D) w2(D)The total number of conflicts serializable schedules th...
1.8k
views
answered
Nov 30, 2018
13
votes
93
MadeEasy Subject Test 2019: Programming & DS - Heap
The minimum number of comparisons required to find the 65th smallest element in a minheap is equal to
The minimum number of comparisons required to find the 65th smallest element in a minheap is equal to
3.5k
views
answered
Nov 24, 2018
DS
made-easy-test-series
data-structures
binary-heap
+
–
0
votes
94
ME Test Series
Consider a CPU containing 2000 instructions, there are 80 misses In the $L_1$ cache and 40 misses In the $L_2$ cache. Assume the miss penalty from the $L_2$ cache to memory is 200 clock cycles, the hit time of $L_2$ cache Is 30 clock cycles, ... time of $L_1$ cache Is 5 clock cycles and these are 1.8 memory references per instruction, then average stall per instruction Is _________.
Consider a CPU containing 2000 instructions, there are 80 misses In the $L_1$ cache and 40 misses In the $L_2$ cache. Assume the miss penalty from the $L_2$ cache to memo...
622
views
answered
Nov 24, 2018
CO and Architecture
co-and-architecture
cache-memory
stall
numerical-answers
made-easy-test-series
+
–
3
votes
95
Zeal Test Series 2019: Set Theory & Algebra - Relations
1.0k
views
answered
Nov 19, 2018
Set Theory & Algebra
zeal
set-theory&algebra
relations
zeal2019
+
–
0
votes
96
Gilbert_Strang_LU_Decomposition
For which numbers c is $A=LU$ impossible? $\begin{bmatrix} 1 & 2 &0 \\ 3 & c &1 \\ 0 &1 &1 \end{bmatrix}$
For which numbers c is $A=LU$ impossible? $\begin{bmatrix} 1 & 2 &0 \\ 3 & c &1 \\ 0 &1 &1 \end{bmatrix}$
742
views
answered
Nov 18, 2018
Linear Algebra
linear-algebra
+
–
1
votes
97
Recursion
How 22 ?
How 22 ?
837
views
answered
Nov 12, 2018
3
votes
98
Pipelining
2.1k
views
answered
Nov 8, 2018
CO and Architecture
pipelining
co-and-architecture
clock-cycles
+
–
2
votes
99
self doubt
Difference between both synchronous and asynchronous I/O on the based of ISR . Means when they are going to invoked during i/o completion ( i.e. before, after ?????? )
Difference between both synchronous and asynchronous I/O on the based of ISR . Means when they are going to invoked during i/o completion ( i.e. before, after ?????? )
323
views
answered
Nov 3, 2018
CO and Architecture
co-and-architecture
input-output
self-doubt
+
–
1
votes
100
Permutation and Combination
An Entrepenuer wants to assign 5 different jobs to 3 of his employees. If every employee is assigned atleast 1 task, how many ways the entrepenuer can assign those task to employees ?
An Entrepenuer wants to assign 5 different jobs to 3 of his employees. If every employee is assigned atleast 1 task, how many ways the entrepenuer can assign those task t...
523
views
answered
Oct 13, 2018
Mathematical Logic
combinatory
engineering-mathematics
+
–
1
votes
101
keneth rosen chapter 6 ex21
A playoff between two teams consists of at most five games. The first team that wins three games wins the playoff. In how many different ways can the playoff occur? (solution without manual calculation).
A playoff between two teams consists of at most five games. The first team that wins three gameswins the playoff. In how many different ways can the playoff occur? (solut...
372
views
answered
Oct 9, 2018
1
votes
102
Irreflexive relation
If Irreflexive relation are represented as directed graphs, then the partitions of an equivalence relation manifest in the form of ______ A) Strongly connected component B) Unilaterally connected component C) Clique D) None of these
If Irreflexive relation are represented as directed graphs, then the partitions of an equivalence relation manifest in the form of ______A) Strongly connected component B...
1.1k
views
answered
Oct 6, 2018
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
irreflexive
relations
bad-question
+
–
3
votes
103
Page tables are stored in memory , which has access time of 100 ns.
Page tables are stored in memory , which has access time of 100 ns. The TLB holding 8 page table entries, has an access time of 10 ns. Using execution of process , it is found that 85 % of the time, a required page table ... requires 2 memory accesses and TLB requires one memory access. A) 38120 ns B) 40000 ns C) 40120 ns D) None
Page tables are stored in memory , which has access time of 100 ns. The TLB holding 8 page table entries, has an access time of 10 ns. Using execution of process , it is ...
5.0k
views
answered
Oct 5, 2018
Operating System
operating-system
virtual-memory
normal
+
–
0
votes
104
Made easy
second one is uncountable?
second one is uncountable?
912
views
answered
Oct 3, 2018
2
votes
105
operating system
Suppose the following jobs are to be executed in a uniprocessor system. Multilevel Feedback Queue(MLQ) is used with queues numbered 1-10, quantum = 2i, where i is thequeue level number and processes are initially placed in the first queue (i.e., level 1). In this schedulingpolicy, each ... 3. 18.6, 3.375, 71.4% 4. 11.6, 3.75, 80.6% Need good explanation :( (answer given is b.)
Suppose the following jobs are to be executed in a uniprocessor system.Multilevel Feedback Queue(MLQ) is used with queues numbered 1-10, quantum = 2i, where i is thequeue...
1.9k
views
answered
Oct 1, 2018
0
votes
106
Linear Algebra RGPV 2001
Test the consistency of the following system of equations and solve if possible $3x + 3y +2z = 1$ $x + 2y = 4$ $10y + 3z = -2$ $2x - 3y -z = 5$
Test the consistency of the following system of equations and solve if possible$3x + 3y +2z = 1$$x + 2y = 4$$10y + 3z = -2$$2x - 3y -z = 5$
755
views
answered
Sep 30, 2018
Linear Algebra
linear-algebra
engineering-mathematics
system-of-equations
+
–
0
votes
107
MIT assigment
Arrange the following functions in their increasing order of complexities. $f(n) = n ^{0.999999} * \log n$ ($\log n$ is not in power) $g(n) = 10000 n$ $h(n) = n^{2}$ $k(n) = (1.000001)^{n}$ $p(n) =\large \frac{2 ^{√n}}{ n^{2}}$ $q(n) = \Large \frac{n^{1.000001}}{\log n}$
Arrange the following functions in their increasing order of complexities.$f(n) = n ^{0.999999} * \log n$ ($\log n$ is not in power)$g(n) = 10000 n$$h(n) = n^{2}...
1.7k
views
answered
Sep 28, 2018
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
3
votes
108
Kenneth Rosen Edition 6th Exercise 7.4 Question 6 (Page No. 496)
Find the closed form for the generating function for the sequence $\{a_n\}$ where (a)$a_n=\binom{n}{2}$ for $n=0,1,2....$ (b)$a_n=\binom{10}{n+1}$ for $n=0,1,2....$
Find the closed form for the generating function for the sequence $\{a_n\}$ where(a)$a_n=\binom{n}{2}$ for $n=0,1,2....$(b)$a_n=\binom{10}{n+1}$ for $n=0,1,2....$
691
views
answered
Sep 28, 2018
Combinatory
kenneth-rosen
generating-functions
discrete-mathematics
+
–
0
votes
109
PREDICATE LOGIC DOUBT 3
E(x) = x is Earthling A(x) = x is Alien What is the corresponding Well Formed Formula for "Nobody is Earthling unless somebody is Alien" ?
E(x) = x is EarthlingA(x) = x is AlienWhat is the corresponding Well Formed Formula for "Nobody is Earthling unless somebody is Alien" ?
508
views
answered
Sep 28, 2018
Page:
« prev
1
2
3
4
5
6
7
8
...
36
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register