Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
!KARAN
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by !KARAN
5
answers
1
GATE CSE 2015 Set 1 | Question: 26
$\sum\limits_{x=1}^{99}\frac{1}{x(x+1)}$ = ______.
$\sum\limits_{x=1}^{99}\frac{1}{x(x+1)}$ = ______.
8.1k
views
comment edited
Oct 17, 2020
Combinatory
gatecse-2015-set1
combinatory
normal
numerical-answers
summation
+
–
2
answers
2
NIELIT 2017 DEC Scientist B - Section B: 11
Which of the following are undecidable? $P1$: The language generated by some CFG contains any words of length less than some given number $n$. $P2$: Let $L1$ be CFL and $L2$ be regular, to determine whether $L1$ and $L2$ have common elements $P3$: ... to determine whether epsilon belongs to $L(G)$ $P2$ only $P1$ and $P2$ only $P2$ and $P3$ only $P3$ only
Which of the following are undecidable?$P1$: The language generated by some CFG contains any words of length less than some given number $n$.$P2$: Let $L1$ be CFL and $L2...
2.1k
views
commented
Mar 7, 2020
Theory of Computation
nielit2017dec-scientistb
theory-of-computation
decidability
+
–
4
answers
3
NIELIT 2017 DEC Scientist B - Section B: 52
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is $n(n-1)/2$ $n^{n-2}$ $nx$ $n$
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is$n(n-1)/2$$n^{n-2}$$nx$$n$
3.0k
views
answered
Mar 7, 2020
Graph Theory
nielit2017dec-scientistb
discrete-mathematics
graph-theory
graph-coloring
+
–
6
answers
4
NIELIT 2017 DEC Scientist B - Section B: 2
According to the given language, which among the following expressions does it correspond to ? Language $L=\{x\in\{0,1\}\mid x\text{ is of length 4 or less}\}$. $(0+1+0+1+0+1+0+1)^4$ $(0+1)^4$ $(01)^4$ $(0+1+\varepsilon)^4$
According to the given language, which among the following expressions does it correspond to ?Language $L=\{x\in\{0,1\}\mid x\text{ is of length 4 or less}\}$.$(0+1+0+1+0...
2.4k
views
answered
Mar 7, 2020
Theory of Computation
nielit2017dec-scientistb
theory-of-computation
regular-expression
+
–
6
answers
5
TIFR CSE 2019 | Part A | Question: 5
Asha and Lata play a game in which Lata first thinks of a natural number between $1$ and $1000$. Asha must find out that number by asking Lata questions, but Lata can only reply by saying Yes or no . Assume that Lata always tells the truth. What is ... she can always find out the number Lata has thought of? $10$ $32$ $100$ $999$ $\text{None of the above}$
Asha and Lata play a game in which Lata first thinks of a natural number between $1$ and $1000$. Asha must find out that number by asking Lata questions, but Lata can onl...
4.3k
views
commented
Jan 19, 2020
Algorithms
tifr2019
algorithm-design
binary-search
+
–
3
answers
6
GATE IT 2006 | Question: 52
The following function computes the value of $\binom{m}{n}$ correctly for all legal values $m$ and $n$ ($m ≥1, n ≥ 0$ and $m > n$) int func(int m, int n) { if (E) return 1; else return(func(m -1, n) + func(m - 1, n - 1)); } In the above function, which of the following is the ... $(m = = 1)$ $(n = = 0) || (m = = n)$ $(n = = 0)$ && $(m = = n)$
The following function computes the value of $\binom{m}{n}$ correctly for all legal values $m$ and $n$ ($m ≥1, n ≥ 0$ and $m n$)int func(int m, int n) { if (E) retu...
8.1k
views
comment edited
Jan 10, 2020
Algorithms
gateit-2006
algorithms
identify-function
normal
+
–
12
answers
7
GATE CSE 2014 Set 1 | Question: 42
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers. One-third of the product of the $3$ consecutive integers. One-sixth of the product of the $3$ consecutive integers. None of the above.
Consider the following pseudo code. What is the total number of multiplications to be performed?D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3H...
34.1k
views
commented
Jan 2, 2020
Algorithms
gatecse-2014-set1
algorithms
time-complexity
normal
+
–
2
answers
8
GATE CSE 2009 | Question: 49
Which of the following statements are TRUE? The context diagram should depict the system as a single bubble. External entities should be identified clearly at all levels of DFDs. Control information should not be represented in a DFD. A data store can be connected wither to another data store or to an external entity. II and III II and III I and III I, II and III
Which of the following statements are TRUE?The context diagram should depict the system as a single bubble.External entities should be identified clearly at all levels of...
7.8k
views
commented
Dec 31, 2019
IS&Software Engineering
gatecse-2009
is&software-engineering
normal
data-flow-diagrams
+
–
3
answers
9
ISRO2016-70
Which network protocol allows hosts to dynamically get a unique IP number on each bootup DHCP BOOTP RARP ARP
Which network protocol allows hosts to dynamically get a unique IP number on each bootupDHCPBOOTPRARPARP
4.6k
views
commented
Dec 17, 2019
Computer Networks
isro2016
computer-networks
network-protocols
+
–
3
answers
10
Test by Bikram | Databases | Test 2 | Question: 26
Assume that a data file contains $2000$ records that are ordered by a key attribute $K$ , and a primary index on attribute $K$ is built. The size of key is $5B$ and block pointer is $5B$. Each block of the system is of ... storing meta data). The total number of disk accesses required to fetch the record using the index (in average case) is _____.
Assume that a data file contains $2000$ records that are ordered by a key attribute $K$ , and a primary index on attribute $K$ is built.The size of key is $5B$ and block ...
924
views
comment edited
Dec 9, 2019
Databases
tbb-dbms-2
numerical-answers
databases
file-organization
indexing
+
–
2
answers
11
Test by Bikram | Databases | Test 2 | Question: 17
Which of the following is TRUE about the given schedule S? ... is conflict serializable. It is view serializable but not conflict serializable. It is conflict serializable but not view serializable. It is not serializable.
Which of the following is TRUE about the given schedule S?$\begin{array}{|c|c|} \hline \text{Schedule:} & S \\ \hline T1 & T2 \\ \hline R(A) & {} \\ \hline A=A+100 & {} ...
458
views
commented
Dec 8, 2019
Databases
tbb-dbms-2
databases
transaction-and-concurrency
serializability
conflict-serializable
view-serializable
+
–
3
answers
12
Test by Bikram | Computer Networks | Test 1 | Question: 1
A class B address has the subnet mask of $255.255.224.0$. what will be the IP address of the second host in the second sub network of the main network address $132.55.0.0$? $132.55.0.1$ $132.55.32.2$ $132.55.64.1$ $132.55.64.2$
A class B address has the subnet mask of $255.255.224.0$. what will be the IP address of the second host in the second sub network of the main network address $132.55.0.0...
1.0k
views
commented
Dec 6, 2019
Computer Networks
tbb-cn-1
+
–
11
answers
13
GATE CSE 2014 Set 3 | Question: 27
Every host in an $\textsf{IPv4}$ network has a $1\text{-second}$ resolution real-time clock with battery backup. Each host needs to generate up to $1000$ ... globally unique ID for this purpose. After what period (in seconds) will the identifiers generated by a host wrap around?
Every host in an $\textsf{IPv4}$ network has a $1\text{-second}$ resolution real-time clock with battery backup. Each host needs to generate up to $1000$ unique identifie...
21.5k
views
commented
Dec 6, 2019
Computer Networks
gatecse-2014-set3
computer-networks
ip-addressing
numerical-answers
normal
+
–
2
answers
14
Test by Bikram | Theory of Computation | Test 2 | Question: 24
Consider the following Pushdown Automata Transition Function $\delta$ : 1. $\delta ( q_0 , \epsilon, z_0 ) = ( q_0 , \epsilon)$ 2. $\delta ( q_0 , 0, z_0 ) = ( q_0 , xz_0 )$ 3. $\delta ( q_0 , 0, x ) = ( q_1 , x)$ ... $\{0^{2n} 1^n \mid n \geq 0\}$ $\{0^{2n} 1^{2n} \mid n \geq 0\}$
Consider the following Pushdown Automata Transition Function $\delta$ :1. $\delta ( q_0 , \epsilon, z_0 ) = ( q_0 , \epsilon)$2. $\delta ( q_0 , 0, z_0 ) = (...
509
views
commented
Dec 4, 2019
Theory of Computation
tbb-toc-2
theory-of-computation
pushdown-automata
+
–
1
answer
15
Test by Bikram | Theory of Computation | Test 1 | Question: 16
The Minimal Finite Automata accepting the set of all strings over $(0+1)^*$ that do NOT have the sub-string $0001$ has: $5$ states $6$ states $7$ states $9$ states
The Minimal Finite Automata accepting the set of all strings over $(0+1)^*$ that do NOT have the sub-string $0001$ has:$5$ states$6$ states$7$ states$9$ states
365
views
commented
Dec 3, 2019
Theory of Computation
tbb-toc-1
+
–
1
answer
16
Test by Bikram | Theory of Computation | Test 1 | Question: 6
If L is any regular language accepted by Minimal Finite Automaton with $n$ states, then the number of states in Minimal Finite Automaton to accept Prefix(L) is: $n$ $n+1$ $n+2$ $2n$
If L is any regular language accepted by Minimal Finite Automaton with $n$ states, then the number of states in Minimal Finite Automaton to accept Prefix(L) is:$n$$n+1$$n...
1.1k
views
commented
Dec 3, 2019
Theory of Computation
tbb-toc-1
minimal-state-automata
+
–
2
answers
17
ISI2016-MMA-9
Suppose $X$ and $Y$ are two independent random variables both following Poisson distribution with parameter $\lambda$. What is the value of $E(X-Y)^2$ ? $\lambda$ $2 \lambda$ $\lambda^2$ $4 \lambda^2$
Suppose $X$ and $Y$ are two independent random variables both following Poisson distribution with parameter $\lambda$. What is the value of $E(X-Y)^2$ ?$\lambda$$2 \lambd...
842
views
commented
Dec 1, 2019
Probability
isi2016-mmamma
probability
random-variable
poisson-distribution
expectation
+
–
8
answers
18
GATE CSE 2005 | Question: 65
Consider a three word machine instruction $\text{ADD} A[R_0], @B$ The first operand (destination) $ A[R_0] $ uses indexed addressing mode with $R_0$ as the index register. The second operand (source) $ @B $ uses indirect addressing mode. $A$ and $B$ ... (first operand). The number of memory cycles needed during the execution cycle of the instruction is: $3$ $4$ $5$ $6$
Consider a three word machine instruction$\text{ADD} A[R_0], @B$The first operand (destination) $“A[R_0]”$ uses indexed addressing mode with $R_0$ as the index regist...
33.9k
views
commented
Nov 30, 2019
CO and Architecture
gatecse-2005
co-and-architecture
addressing-modes
normal
+
–
6
answers
19
GATE CSE 2015 Set 3 | Question: 1
The maximum number of processes that can be in $\textit{Ready}$ state for a computer system with $n$ CPUs is : $n$ $n^2$ $2^n$ Independent of $n$
The maximum number of processes that can be in $\textit{Ready}$ state for a computer system with $n$ CPUs is :$n$$n^2$$2^n$Independent of $n$
30.2k
views
commented
Nov 26, 2019
Operating System
gatecse-2015-set3
operating-system
process-scheduling
easy
+
–
15
answers
20
GATE CSE 2003 | Question: 78
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addres...
47.0k
views
comment edited
Nov 25, 2019
Operating System
gatecse-2003
operating-system
normal
virtual-memory
+
–
7
answers
21
GATE CSE 1990 | Question: 7-b
In a two-level virtual memory, the memory access time for main memory, $t_{M}=10^{-8}$ sec, and the memory access time for the secondary memory, $t_D=10^{-3}$ sec. What must be the hit ratio, $H$ such that the access efficiency is within $80$ percent of its maximum value?
In a two-level virtual memory, the memory access time for main memory, $t_{M}=10^{-8}$ sec, and the memory access time for the secondary memory, $t_D=10^{-3}$ sec. What m...
18.9k
views
comment reshown
Nov 25, 2019
Operating System
gate1990
descriptive
operating-system
virtual-memory
+
–
3
answers
22
GATE CSE 2014 Set 1 | Question: 2
Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is ________ .
Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is ________ .
17.3k
views
commented
Nov 16, 2019
Probability
gatecse-2014-set1
probability
uniform-distribution
expectation
numerical-answers
normal
+
–
2
answers
23
Test by Bikram | Data Structures | Test 2 | Question: 7
You are given a linked list, L, and another linked list, P, containing integers, sorted in ascending order. The operation print_lots(L,P) will print the elements in L that are in positions specified by P. For instance, if $P = 1, 3, 4, 6$, the first, ... of your routine function is ______________ ? $O( n^2 )$ $O(n)$ $O(n \log n)$ $O(\log n)$
You are given a linked list, L, and another linked list, P, containing integers, sorted in ascending order. The operation print_lots(L,P) will print the elements in L tha...
1.4k
views
commented
Oct 31, 2019
Programming in C
tbb-ds-2
+
–
1
answer
24
GATE Overflow | Data Structures | Test 1 | Question: 13
When searching for the key value 30 in a binary search tree, nodes containing the key values 10, 20, 25, 35, 70, 80, 90, 100 are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root node containing the value 30?
When searching for the key value 30 in a binary search tree, nodes containing the key values 10, 20, 25, 35, 70, 80, 90, 100 are traversed, not necessarily in the order g...
723
views
commented
Oct 30, 2019
DS
go-ds-1
data-structures
binary-search-tree
numerical-answers
+
–
1
answer
25
GATE Overflow | Data Structures | Test 1 | Question: 26
Consider a stack with 100 elements present. Suppose in a scenario, we are required to remove the first inserted element in it, which is done by POP operations followed by PUSH operations with intermediate elements ... $10$ such removals, without anyother intermediate PUSH/POP operations, total number of PUSH operations required is ______
Consider a stack with 100 elements present. Suppose in a scenario, we are required to remove the first inserted element in it, which is done by POP operations followed by...
1.1k
views
commented
Oct 30, 2019
DS
go-ds-1
data-structures
stack
numerical-answers
+
–
2
answers
26
ISI2017-PCB-CS-2(a)
Write a complete ANSI C code using recursion to calculate the $sum(s)$ of the digits of an integer number (i) consisting of maximum 5 digits. For example, (1) = if $i=12345$, then your program should print $s=15$, (2) if $ i=457$, then $s=16$.
Write a complete ANSI C code using recursion to calculate the $sum(s)$ of the digits of an integer number (i) consisting of maximum 5 digits. For example, (1) = if $i=123...
394
views
answered
Oct 5, 2019
Programming in C
isi2017-pcb-cs
programming
programming-in-c
descriptive
+
–
1
answer
27
ISI2017-PCB-CS-3-a
Let $R(A,B,C)$ be a relation with primary key $(A)$ and $S(A, D, E)$ a relation with primary key $(A, D)$. Each of the relations has $n$ tuples. If the number of tuples in $R \: \text{ natural join } S$ is $m$, then determine the number of tuples in $R$ $\text{ natural left outer join } S$.
Let $R(A,B,C)$ be a relation with primary key $(A)$ and $S(A, D, E)$ a relation with primary key $(A, D)$. Each of the relations has $n$ tuples. If the number of tuples i...
457
views
answered
Oct 5, 2019
Databases
isi2017-pcb-cs
databases
relational-algebra
natural-join
+
–
1
answer
28
ISI2017-PCB-CS-1(a)
Consider an alphabet $\Sigma = \{1, 2, 3\}.$ Design a deterministic finite-state automaton (DFA) that accepts all strings in $\Sigma^*$ in which the digits appear in non-decreasing sequence, from left to right. For example, the string $1123$ and $222$ would be accepted, whereas $21333$ will not be accepted.
Consider an alphabet $\Sigma = \{1, 2, 3\}.$ Design a deterministic finite-state automaton (DFA) that accepts all strings in $\Sigma^*$ in which the digits appear in non-...
679
views
answered
Oct 5, 2019
Theory of Computation
isi2017-pcb-cs
theory-of-computation
finite-automata
+
–
0
answers
29
ISI2017-PCB-CS-3-b
Consider the following relations: $\text{STD_CHOICES } (\underline{\text{Student_ID}}, \underline{\text{Course_ID}}, \text{Semester})$ and $\text{COURSE_ASSIGN} (\underline{\text{Teacher_ID}}, \underline{\text{Course_ID}}, \underline{\text{Semester}})$. The ... the ID for all the students who have not been taught by the same teacher in more than one course across all semesters.
Consider the following relations:$\text{STD_CHOICES } (\underline{\text{Student_ID}}, \underline{\text{Course_ID}}, \text{Semester})$ and$\text{COURSE_ASSIGN} (\underline...
754
views
commented
Oct 5, 2019
Databases
isi2017-pcb-cs
databases
relational-algebra
relational-calculus
descriptive
+
–
1
answer
30
ISI2017-PCB-CS-5(b)
Consider a paging system with the page table stored in memory. If a memory reference takes $200$ nanoseconds, how long does a paged memory reference take? If we add a Translation Lookaside Buffer (TLB) and $75$ percent of all page-table references are ... memory reference time? Assume that finding a page-table entry in the TLB takes $20$ nanoseconds, if the entry is present.
Consider a paging system with the page table stored in memory. If a memory reference takes $200$ nanoseconds, how long does a paged memory reference take? If we add a Tra...
7.9k
views
commented
Oct 5, 2019
Operating System
isi2017-pcb-cs
operating-system
paging
translation-lookaside-buffer
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register