Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Joey
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Joey
14
answers
1
GATE CSE 2019 | Question: 12
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n-1)!$ $1$ $\frac{(n-1)!}{2}$
Let $G$ be an undirected complete graph on $n$ vertices, where $n 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to$n!$$(n-1)!$$1$$\frac{(n-1)!}{2}...
21.0k
views
commented
Apr 24, 2023
Graph Theory
gatecse-2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
1-mark
+
–
1
answer
2
operating system
Can somebody please show atleast one example where a synchromnisation mechanism " DOESNOT GUARANTEE BOUNDED WAITING BUT STILL IT GUARANTEES STARVATION FREEDOM " I am not able to find one .. MY LOGIC : If Bounded waiting is not guaranteed , ... SURELY SUFFER FROM STARVATION ??? Please correct me if I am wrong in understanding of definitions of Bounded waiting,starvation.
Can somebody please show atleast one example where a synchromnisation mechanism " DOESNOT GUARANTEE BOUNDED WAITING BUT STILL IT GUARANTEES STARVATION FREEDOM "I am not a...
330
views
answered
Jan 23, 2023
Operating System
operating-system
process-synchronization
deadlock-prevention-avoidance-detection
+
–
0
answers
3
Applied Mock Test
A uniprocessor computer system has three processes, which alternate 20ms CPU bursts with 80ms I/O bursts. All the processes were created at nearly the same time. The I/O of all the processes can proceed in parallel. The absolute difference of CPU utilization (over a long period of time) using FCFS and Round Robin (time quantum 10ms) for this system is _____ %
A uniprocessor computer system has three processes, which alternate 20ms CPU bursts with 80ms I/O bursts. All the processes were created at nearly the same time. The I/O ...
370
views
commented
Jan 13, 2023
Operating System
test-series
operating-system
cpu
process-scheduling
process
+
–
1
answer
4
is it DCFL OR NOT?
672
views
answered
Dec 12, 2022
Theory of Computation
theory-of-computation
dcfl
+
–
1
answer
5
I have a doubt in this Question , please give me hint
In a randomised BST is constructing with 7 distinct elements . What is the probability that its Inorder and postOrder traversal are same
In a randomised BST is constructing with 7 distinct elements . What is the probability that its Inorder and postOrder traversal are same
218
views
answered
Nov 7, 2022
Algorithms
algorithms
binary-search-tree
+
–
1
answer
6
Testbook Test Series
308
views
answered
Nov 7, 2022
Algorithms
testbook-test-series
+
–
3
answers
7
MadeEasy Test Series: Theory Of Computation - Regular Languages
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
Consider the following statements:$S_1:\{(a^n)^m|n\leq m\geq0\}$$S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $Which of the following is regular?$S_1$ only$S_2...
1.7k
views
answer edited
Sep 25, 2022
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
+
–
1
answer
8
PhD Admissions Written Test (Basic)
Let A be an array containing n integers. It is required to find 3 indices i, j, k such that i < j < k and either A[i] ≤ A[j] ≤ A[k] or A[i] ≥ A[j] ≥ A[k], if such indices exist. The asymptotic time complexity of the fastest algorithm for this problem, assuming the array is already available, is Θ(_____________).
Let A be an array containing n integers. It is required to find 3 indices i, j, k such that i < j < k and either A[i] ≤ A[j] ≤ A[k] or A[i] ≥ A[j] ≥ A[k], if such...
389
views
answer reshown
Sep 20, 2022
Others
data-structures
algorithms
+
–
1
answer
9
ISI 2021
Let us consider the following 2-person game: the players alternately choose a number. The first player starts with a number between 1 and 10, and the players then pick up a number within the next ten of the number that his opponent has chosen earlier. The player ... between 1 and 10 such that whatever may be the strategy of his opponent, the first player will be able to reach 100 first?
Let us consider the following 2-person game: the players alternately choose a number. The first player starts with a number between 1 and 10, and the players then pick up...
843
views
commented
Mar 29, 2022
Others
non-gate
+
–
1
answer
10
operating system
Can cache hit happen in case of TLB miss or one should directly jump to page table in case of TLB miss?
Can cache hit happen in case of TLB miss or one should directly jump to page table in case of TLB miss?
379
views
answered
Oct 18, 2021
Operating System
operating-system
+
–
2
answers
11
UGC NET CSE | October 2020 | Part 2 | Question: 27
Consider $L=L_1 \cap L_2$ where $L_1 = \{ 0^m 1^m 20^n 1^n \mid m,n \geq 0 \}$ $L_2 = \{0^m1^n2^k \mid m,n,k \geq 0 \}$ Then, the language $L$ is Recursively enumerable but not context free Regular Context free but not regular Not recursive
Consider $L=L_1 \cap L_2$ where$L_1 = \{ 0^m 1^m 20^n 1^n \mid m,n \geq 0 \}$$L_2 = \{0^m1^n2^k \mid m,n,k \geq 0 \}$Then, the language $L$ isRecursively enumerable but n...
2.2k
views
answer edited
Oct 7, 2021
Theory of Computation
ugcnetcse-oct2020-paper2
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
3
answers
12
DCFL or CFL?
Given that: { A^m B^n C^k/ if (k=even) then m=n} { A^m B^n C^k/ if (n=even) then m=k} Which of the above languages are DCFL? According to me it is CFL as we have to first count k and then compare other inputs.. same for second language ... is both are DCFL? it is only possible if skip path is exists here? does it exist for DCFLs? so confused please guide me? if given answer is correct?
Given that:{ A^m B^n C^k/ if (k=even) then m=n}{ A^m B^n C^k/ if (n=even) then m=k}Which of the above languages are DCFL? According to me it is CFL as we have to first co...
2.0k
views
answered
Feb 1, 2021
Theory of Computation
theory-of-computation
dcfl
context-free-language
+
–
2
answers
13
UGC NET CSE | October 2020 | Part 2 | Question: 56
Consider the following languages: $L_1=\{a^{\grave{z}^z} \mid \grave{Z} \text{ is an integer} \}$ $L_2=\{a^{z\grave{z}} \mid \grave{Z} \geq 0\}$ $L_3=\{ \omega \omega \mid \omega \epsilon \{a,b\}^*\}$ Which of ... (are) regular? Choose the correct answer from the options given below: $L_1$ and $L_2$ only $L_1$ and $L_3$ only $L_1$ only $L_2$ only
Consider the following languages:$L_1=\{a^{\grave{z}^z} \mid \grave{Z} \text{ is an integer} \}$$L_2=\{a^{z\grave{z}} \mid \grave{Z} \geq 0\}$$L_3=\{ \omega \omega \mid \...
1.6k
views
answer edited
Jan 21, 2021
Theory of Computation
ugcnetcse-oct2020-paper2
theory-of-computation
regular-language
+
–
2
answers
14
UGC NET CSE | October 2020 | Part 2 | Question: 57
Which of the following grammars is(are) ambiguous? $s \rightarrow ss \mid asb \mid bsa \mid \lambda$ $s \rightarrow asbs \mid bsas \mid \lambda$ ... : $(i)$ and $(iii)$ only $(ii)$ only $(ii)$ and $(iii)$ only $(i)$ and $(ii)$ only
Which of the following grammars is(are) ambiguous?$s \rightarrow ss \mid asb \mid bsa \mid \lambda$$s \rightarrow asbs \mid bsas \mid \lambda$$s \rightarrow aAB \\ A \rig...
2.1k
views
answered
Jan 20, 2021
Theory of Computation
ugcnetcse-oct2020-paper2
theory-of-computation
grammar
ambiguous
+
–
3
answers
15
Ace gate test series
Decompose this table in BCNF ,decomposition should be lossless and dependency preserving. plz clarify me how to decompose to get a lossless decomposition here.
Decompose this table in BCNF ,decomposition should be lossless and dependency preserving.plz clarify me how to decompose to get a lossless decomposition here.
901
views
commented
Jan 19, 2021
Databases
database-normalization
+
–
2
answers
16
trace of matrix
If $\lambda^3 - 6\lambda^2 -\lambda +22=0$ is a characteristic equation of $3\ X\ 3$ diagonal matrix, then trace of matrix is
If $\lambda^3 - 6\lambda^2 -\lambda +22=0$ is a characteristic equation of $3\ X\ 3$ diagonal matrix, then trace of matrix is
2.0k
views
answered
Jan 12, 2021
Mathematical Logic
linear-algebra
matrix
+
–
1
answer
17
NIELIT 2017 July Scientist B (IT) - Section B: 22
Let $L$ be a lattice. Then for every $a$ and $b$ in $L$ which one of the following is correct? $a\lor b = a\land \:b$ $a\lor(b\lor c)=(a\lor b)\lor c$ $a\lor(b\land \:c)=a$ $a\lor(b\lor c)=b$
Let $L$ be a lattice. Then for every $a$ and $b$ in $L$ which one of the following is correct?$a\lor b = a\land \:b$$a\lor(b\lor c)=(a\lor b)\lor c$$a\lor(b\land \:...
1.8k
views
answered
Jan 11, 2021
Set Theory & Algebra
nielit2017july-scientistb-it
discrete-mathematics
set-theory&algebra
lattice
+
–
4
answers
18
No. of View equivalent schedules
how many view equivalent schedules are possible for the Sch given below:
how many view equivalent schedules are possible for the Sch given below:
2.3k
views
commented
Jan 10, 2021
Databases
databases
view-serializable
transaction-and-concurrency
+
–
3
answers
19
probability
In a lottery, 10 tickets are drawn at random out of 50 tickets numbered from 1 to 50. What is the expected value of the sum of numbers on the drawn tickets?
In a lottery, 10 tickets are drawn at random out of 50 tickets numbered from 1 to 50. What is the expected value of the sum of numbers on the drawn tickets?
3.8k
views
answered
Jan 7, 2021
Mathematical Logic
probability
engineering-mathematics
conditional-probability
random-variable
+
–
2
answers
20
PROBABILITY QUESTION
2.5k
views
answered
Jan 7, 2021
Probability
probability
conditional-probability
engineering-mathematics
+
–
0
answers
21
Operating System - Galvin - Chapter 3
Galvin, 9th edition on page 146 states that Shared memory can be faster than message passing, since message-passing systems are typically implemented using system calls and thus require the more time-consuming task of kernel intervention. In ... that shared memory is bound to be faster, but aren't the mutex and semaphore calls require Kernel intervention?
Galvin, 9th edition on page 146 states that“Shared memory can be faster than message passing, since message-passing systems are typically implemented using system calls...
1.2k
views
commented
Jan 6, 2021
Operating System
operating-system
process-synchronization
semaphore
shared-memory
+
–
2
answers
22
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 31 (Page No. 468)
One way to prevent deadlocks is to eliminate the hold-and-wait condition. In the text it was proposed that before asking for a new resource, a process must first release whatever resources it already holds ( ... new resource but lose some of the existing ones to competing processes. Propose an improvement to this scheme.
One way to prevent deadlocks is to eliminate the hold-and-wait condition. In the text it was proposed that before asking for a new resource, a process must first release ...
707
views
answered
Jan 6, 2021
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
2
answers
23
UGC NET CSE | October 2020 | Part 2 | Question: 8
What is the radix of the numbers if the solution to the quadratic equation $x^2-10x+26=0$ is $x=4$ and $x=7$? $8$ $9$ $10$ $11$
What is the radix of the numbers if the solution to the quadratic equation $x^2-10x+26=0$ is $x=4$ and $x=7$?$8$$9$$10$$11$
2.5k
views
answered
Jan 6, 2021
Quantitative Aptitude
ugcnetcse-oct2020-paper2
quadratic-equations
+
–
3
answers
24
NIELIT 2016 MAR Scientist C - Section C: 53
An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$. The best algorithm to find all leaders in an array solves it in linear time using a left to right pass of the array solves in linear time ... the array solves it using divide and conquer in time $\theta (n\log n)$ solves it in time $\theta (n^{2})$
An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$. The best algorithm to find all leaders in an arraysolves it in...
1.6k
views
answered
Jan 5, 2021
Algorithms
nielit2016mar-scientistc
algorithms
array
+
–
2
answers
25
Recognize the language
If L be a language recognizable by a finite automata, then language from {L}={w such that w is prefix of v where v belongs to L},is a a. Regular Language b. Context Free language c. Context Sensitive Language d. Recursive Enumerable Language
If L be a language recognizable by a finite automata, then language from {L}={w such that w is prefix of v where v belongs to L},is aa. Regular Languageb. Context Free la...
3.0k
views
commented
Jan 3, 2021
0
answers
26
DFA NFA and ambiguity
Why is Regular grammar obtained from DFA always unambiguous? Why Regular grammar obtained from NFA may or may not be ambiguous?
Why is Regular grammar obtained from DFA always unambiguous?Why Regular grammar obtained from NFA may or may not be ambiguous?
578
views
commented
Jan 3, 2021
Theory of Computation
theory-of-computation
finite-automata
ambiguous
+
–
1
answer
27
Self Doubt : Ambiguity
Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?
Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?
1.1k
views
answered
Jan 3, 2021
Theory of Computation
theory-of-computation
finite-automata
ambiguous
regular-language
context-free-language
context
+
–
1
answer
28
An Introduction to formal languages and automata
find grammar that generates L={a^nb^m:n>=0,m<n}
find grammar that generates L={a^nb^m:n>=0,m<n}
480
views
answered
Jan 3, 2021
1
answer
29
NIELIT Scientist B 2020 November: 115
Considering binary relationships, possible cardinality ratios are: one:one $1:N$ $M:N$ All the options
Considering binary relationships, possible cardinality ratios are:one:one$1:N$$M:N$All the options
512
views
answered
Dec 20, 2020
Unknown Category
nielit-scb-2020
+
–
1
answer
30
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 29 (Page No. 468)
A distributed system using mailboxes has two $IPC$ primitives, send and receive. The latter primitive specifies a process to receive from and blocks if no message from that process is available, even though ... no shared resources, but processes need to communicate frequently about other matters. Is deadlock possible? Discuss.
A distributed system using mailboxes has two $IPC$ primitives, send and receive. The latter primitive specifies a process to receive from and blocks if no message from th...
777
views
answered
Nov 27, 2020
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register