Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions and answers
0
votes
0
answers
1
Self Doubt : Number of CLK pulse
I have a 3 bit shift register SISO (serial in and serial out) I took 3 CLK (clock) pulse to insert 1 0 1 and now I need to retrive them serially How may CLK pulse I would need ?. I went online and check most of the answers says that for SISO shift registers its takes N-1 CLK pulses but there is no explanation given. Can some one explain me why . Thanks
I have a 3 bit shift register SISO (serial in and serial out) I took 3 CLK (clock) pulse to insert 1 0 1 and now I need to retrive them serially How may CLK pulse I would...
arpit.jha
17
views
arpit.jha
asked
12 hours
ago
Digital Logic
shift-registers
digital-logic
+
–
0
votes
0
answers
2
(Transactions and Schedules in Databases)
Q.3(a): You are given the following schedules involving three transactions (T1, T2, T3) performing operations on database items (A, B, C, D): Schedule S1: T1: R(A), R(B), W(C) T2: W(A), R(B), R(C) T3: W ... + 1; write(X). Modify transactions T1 and T2 by adding appropriate lock and unlock instructions to ensure they adhere to the two-phase locking protocol.
Q.3(a): You are given the following schedules involving three transactions (T1, T2, T3) performing operations on database items (A, B, C, D): Schedu...
zdwew
12
views
zdwew
asked
14 hours
ago
0
votes
0
answers
3
SELF
I am Passing out in 2024, i have given gate 2024 and got 7.5k rank, i did not get selected in placements, now i have no job , my score 456 GEN, now i have three option, take drop but i don't know if i can handle pressure without job, take nit ... am not getting any revert back from any company on off campus .? what should i do, is it good to prepare while studying ni NIT jalandhar??
I am Passing out in 2024, i have given gate 2024 and got 7.5k rank, i did not get selected in placements, now i have no job , my score 456 GEN, now i have three option, t...
WangJIan
15
views
WangJIan
asked
14 hours
ago
1
votes
3
answers
4
ACE TOC Test
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ? $0^*(1^*0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ?$0^*(1^*0)^*$$0^*1010^*$$0^*1^*01^*$$0^*(10+1)^*$
archiii
425
views
archiii
answered
1 day
ago
Theory of Computation
theory-of-computation
ace-test-series
regular-expression
+
–
0
votes
1
answer
5
PhD Admissions Written Test (Basic)
Let A be a sorted array of distinct integers of length n. Design an algorithm to find an index i such that A[i] = i if such an index exists. If there are more than one such indices, you may output any one ... −1. The asymptotic time complexity of the fastest algorithm for this problem, assuming the array is already available, is Θ ______________________________
Let A be a sorted array of distinct integers of length n. Design an algorithm to find an index i such that A[i] = i if such an index exists. If there are more than one su...
ikka
495
views
ikka
answered
1 day
ago
Others
sorting
array
time-complexity
asymptotic-notation
+
–
0
votes
1
answer
6
GATE DS&AI 2024 | Question: 35
Consider the following sorting algorithms: Bubble sort Insertion sort Selection sort Which ONE among the following choices of sorting algorithms sorts the numbers in the array $[4,3,2,1,5]$ in increasing order after exactly two passes over the array? $\text{(i)}$ only $\text{(iii)}$ only $\text{(i)}$ and $\text{(iii)}$ only $\text{(ii)}$ and $\text{(iii)}$ only
Consider the following sorting algorithms:Bubble sortInsertion sortSelection sortWhich ONE among the following choices of sorting algorithms sorts the numbers in the arra...
ikka
959
views
ikka
answered
1 day
ago
Algorithms
gate-ds-ai-2024
algorithms
sorting
+
–
20
votes
3
answers
7
GATE CSE 2022 | Question: 38
Consider the following languages: $L_{1} = \{ ww | w \in \{a,b\}^{\ast} \}$ $L_{2} = \{a^{n} b^{n} c^{m} | m,n \geq 0 \}$ $L_{3} = \{a^{m} b^{n} c^{n} | m,n \geq 0 \}$ Which of the following statements is/are $\text{FALSE}?$ ... $L_{2}$ is context-free. $L_{2}, L_{3}$ and $L_{2} \cap L_{3}$ all are context-free. Neither $L_{1}$ nor its complement is context-free.
Consider the following languages:$L_{1} = \{ ww | w \in \{a,b\}^{\ast} \}$$L_{2} = \{a^{n} b^{n} c^{m} | m,n \geq 0 \}$$L_{3} = \{a^{m} b^{n} c^{n} | m,n \geq 0 \}$Which ...
SarthakShastri
11.7k
views
SarthakShastri
answered
1 day
ago
Theory of Computation
gatecse-2022
theory-of-computation
context-free-language
multiple-selects
2-marks
+
–
2
votes
3
answers
8
GATE Electrical 2023 | GA Question: 9
The digit in the unit's place of the product $3^{999} \times 7^{1000}$ is _________. $7$ $1$ $3$ $9$
The digit in the unit's place of the product $3^{999} \times 7^{1000}$ is _________.$7$$1$$3$$9$
ikka
1.0k
views
ikka
answered
1 day
ago
Quantitative Aptitude
gate2023-ee
quantitative-aptitude
modular-arithmetic
+
–
0
votes
1
answer
9
B tree dbms
nareshit
52
views
nareshit
answered
1 day
ago
Databases
binary-tree
+
–
98
votes
13
answers
10
GATE CSE 2007 | Question: 59
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{studId}},{\text{ courseId}})$ gives which student has enrolled for ... Courses in which a proper subset of female students are enrolled. Courses in which only male students are enrolled. None of the above
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{stu...
nareshit
21.1k
views
nareshit
answered
1 day
ago
Databases
gatecse-2007
databases
relational-algebra
normal
+
–
35
votes
8
answers
11
GATE CSE 2018 | Question: 45
Consider the following program written in pseudo-code. Assume that $x$ and $y$ are integers. Count (x, y) { if (y !=1 ) { if (x !=1) { print("*"); Count (x/2, y); } else { y=y-1; Count (1024, y); } } } The number of times that the $print$ statement is executed by the call $Count(1024, 1024)$ is _____
Consider the following program written in pseudo-code. Assume that $x$ and $y$ are integers.Count (x, y) { if (y !=1 ) { if (x !=1) { print("*"); Count (x/2, y); } else {...
suraj_soni
13.4k
views
suraj_soni
answered
1 day
ago
Algorithms
gatecse-2018
numerical-answers
algorithms
recursion
2-marks
+
–
2
votes
2
answers
12
NIELIT Scientific Assistant A 2020 November: 88
The given array is $\text{arr={1, 2, 4, 3}}$. Bubble sort is used to sort the array elements. How many passes will be done to sort the array? $4$ $2$ $1$ $3$
The given array is $\text{arr={1, 2, 4, 3}}$. Bubble sort is used to sort the array elements. How many passes will be done to sort the array?$4$$2$$1$$3$
sagarsanjaypawar15
863
views
sagarsanjaypawar15
answered
1 day
ago
Algorithms
nielit-sta-2020
algorithms
sorting
bubble-sort
+
–
0
votes
2
answers
13
made easy test series 2023 question
Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following: Which one of them is correct ?
Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following:Which one of them is correct ?
archiii
422
views
archiii
answered
1 day
ago
Theory of Computation
theory-of-computation
regular-expression
made-easy-test-series
+
–
4
votes
3
answers
14
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 62
Below you see the transition table of a finite state automaton. The initial state is $0;$ the final state is $4.$ $\emptyset$ denotes the fail state, where no successful transition is possible for the given symbol. Note that when encountering a $b$ in state ... $\mathrm{abbb}^+\mathrm{c}^+\mathrm{c}$ $a b^* b b(c c)^+$
Below you see the transition table of a finite state automaton. The initial state is $0;$ the final state is $4.$ $\emptyset$ denotes the fail state, where no successful ...
archiii
390
views
archiii
answered
1 day
ago
Theory of Computation
goclasses2024-mockgate-11
goclasses
theory-of-computation
finite-automata
regular-expression
2-marks
+
–
1
votes
2
answers
15
GO Classes 2024 | IIITH Mock Test 5 | Question: 67
A sum of money doubles at compound interest in $6$ years. In how many years it will become $16$ times? $16$ years $24$ years $48$ years $96$ years
A sum of money doubles at compound interest in $6$ years. In how many years it will become $16$ times?$16$ years$24$ years$48$ years$96$ years
ikka
208
views
ikka
answered
1 day
ago
Quantitative Aptitude
goclasses2024-iiith-mock-5
goclasses
quantitative-aptitude
compound-interest
1-mark
+
–
2
votes
4
answers
16
System Call FORK()
Int main () { fork(); printf("a"); fork(); printf("b"); return 0; } How many distinct outputs are possible of above code? And also give outputs
Int main (){fork();printf("a");fork();printf("b");return 0;}How many distinct outputs are possible of above code? And also give outputs
Prakash_017
1.0k
views
Prakash_017
answered
1 day
ago
Operating System
operating-system
fork-system-call
+
–
0
votes
0
answers
17
Test series
How can i see my result report and rsponse after attempting test of Gateoverflow test series ?
How can i see my result report and rsponse after attempting test of Gateoverflow test series ?
sainiaditya9896
23
views
sainiaditya9896
asked
2 days
ago
11
votes
4
answers
18
GATE CSE 2016 Set 1 | Question: GA07
Indian currency notes show the denomination indicated in at least seventeen languages. If this is not an indication of the nation's diversity, nothing else is. Which of the following can be logically inferred from the above ... notes have sufficient space for all the Indian languages. Linguistic pluralism is strong evidence of India's diversity.
Indian currency notes show the denomination indicated in at least seventeen languages. If this is not an indication of the nation's diversity, nothing else is.Which of th...
heyAbhi07
3.3k
views
heyAbhi07
answered
2 days
ago
Verbal Aptitude
gatecse-2016-set1
verbal-aptitude
verbal-reasoning
normal
+
–
0
votes
1
answer
19
self doubt
How a^i b^j | i !=(2j+1) is dcfl?
How a^i b^j | i !=(2j+1) is dcfl?
archiii
92
views
archiii
answered
2 days
ago
Theory of Computation
theory-of-computation
dcfl
pushdown-automata
+
–
0
votes
1
answer
20
gate zeal
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arrive and then all processes leave the barrier. Let the number of processes in the set be n and ... correct if there are only n-1 processes instead of n. (d) The barrier implementation is correct for the set of n processes
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arr...
Shaik Masthan
61
views
Shaik Masthan
answered
2 days
ago
Operating System
operating-system
process-synchronization
zeal
+
–
0
votes
1
answer
21
College exam
A person turns 6 times left, 7 times right and again turns 2 times left. If he finds himself in south direction, then find initial direction
A person turns 6 times left, 7 times right and again turns 2 times left. If he finds himself in south direction, then find initial direction
Shaik Masthan
74
views
Shaik Masthan
answered
2 days
ago
Analytical Aptitude
general-aptitude
direction-sense
+
–
0
votes
1
answer
22
UGC NET CSE | October 2022 | Part 1 | Question: 84
The total storage capacity of a floppy disk having $80$ tracks and storing $128$ bytes/sector is $163,840$ bytes. How many sectors does this disk have? $2^{7}$ $2048$ $4 \mathrm{~K}$ $16$
The total storage capacity of a floppy disk having $80$ tracks and storing $128$ bytes/sector is $163,840$ bytes. How many sectors does this disk have?$2^{7}$$2048$$4 \ma...
mozhi1984
641
views
mozhi1984
answered
2 days
ago
Others
ugcnetcse-oct2022-paper1
+
–
12
votes
5
answers
23
GATE CSE 2021 Set 2 | Question: 23
Consider the following $\text{ANSI C}$ function: int SomeFunction (int x, int y) { if ((x==1) || (y==1)) return 1; if (x==y) return x; if (x > y) return SomeFunction(x-y, y); if (y > x) return SomeFunction (x, y-x); } The value returned by $\textrm{SomeFunction(15, 255)}$ is __________
Consider the following $\text{ANSI C}$ function:int SomeFunction (int x, int y) { if ((x==1) || (y==1)) return 1; if (x==y) return x; if (x y) return SomeFunction(x-y, y...
Shubhamishere
5.2k
views
Shubhamishere
answered
2 days
ago
Algorithms
gatecse-2021-set2
numerical-answers
algorithms
identify-function
output
1-mark
+
–
1
votes
1
answer
24
ISRO 2024
Consider the context-free grammer $G$ below. There $S$ is the starting non terminal symbol, while $a$ and $b$ are terminal symbols. $S \rightarrow aaSb | T$ $T \rightarrow Tb | a$ Which of the following statments is true about the language $L(G)$ generated by $G$? ... $aaaabb$ does not $aaaabb$ belongs to $L(G)$ but $aabbaabb$ does not $aaabb$ belongs to $L(G)$ but $aaaaabbb$ does not
Consider the context-free grammer $G$ below. There $S$ is the starting non terminal symbol, while $a$ and $b$ are terminal symbols.$S \rightarrow aaSb | T$$T \rightarrow ...
archiii
273
views
archiii
answered
2 days
ago
Theory of Computation
isro-2024
theory-of-computation
grammar
+
–
3
votes
3
answers
25
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 35
Which of the following strings are a member of the language described by the regular expression $\left(a^* {b} {a}^* b a^* b {a}^*\right)^*$ $b b b b$ $bbaaabb$ $bbaaabbbabb$ $b b a b b b a b$
Which of the following strings are a member of the language described by the regular expression $\left(a^* {b} {a}^* b a^* b {a}^*\right)^*$$b b b b$$bbaaabb$$bbaaabbbabb...
archiii
634
views
archiii
answered
2 days
ago
Theory of Computation
goclasses2024-mockgate-14
theory-of-computation
regular-expression
multiple-selects
1-mark
+
–
26
votes
3
answers
26
GATE CSE 1993 | Question: 12
The following Pascal program segments finds the largest number in a two-dimensional integer array $A[0\dots n-1, 0\dots n-1]$ using a single loop. Fill up the boxes to complete the program and write against $\fbox{A}, \fbox{B}, \fbox{C} \text{ and } \fbox{D}$ in your answer ... A[i, j]>max then max:=A[i, j]; if |C| then j:=j+1; else begin j:=0; i:=|D| end end end
The following Pascal program segments finds the largest number in a two-dimensional integer array $A[0\dots n-1, 0\dots n-1]$ using a single loop. Fill up the boxes to co...
Debargha5943
5.1k
views
Debargha5943
answered
3 days
ago
DS
gate1993
data-structures
array
normal
descriptive
+
–
9
votes
4
answers
27
GATE CSE 2020 | Question: GA-7
If $P = 3$, $R = 27$, $T = 243$, then $Q + S =$ ________ $40$ $80$ $90$ $110$
If $P = 3$, $R = 27$, $T = 243$, then $Q + S =$ ________$40$$80$$90$$110$
shashwat_aditya07
5.9k
views
shashwat_aditya07
answered
3 days
ago
Analytical Aptitude
gatecse-2020
analytical-aptitude
logical-reasoning
sequence-series
2-marks
+
–
0
votes
1
answer
28
Indexing
consider a disk with block size 1024 bytes.A block pointer 6 bytes and record pointer 8 bytes.File has 10000 records.Every record is fixed length of 100 bytes. Its key is SSN which is of 2 bytes. The file is not ordered by the field SSN and want to construct secondary index on SSN.
consider a disk with block size 1024 bytes.A block pointer 6 bytes and record pointer 8 bytes.File has 10000 records.Every record is fixed length of 100 bytes. Its key is...
nareshit
44
views
nareshit
answered
3 days
ago
Databases
databases
indexing
+
–
0
votes
1
answer
29
Discrete Mathematics | Set Theory | Relation | Equivalance Relation
which if the following statement is True for every set? a. $\exists$ a equivalence class that is also a partition set. b. Every equivalence relation on a set defines a partition of that set. c. $\exists$ a partition of a set that is also equal to equivalence class of the set on some equivalence relation.
which if the following statement is True for every set?a. $\exists$ a equivalence class that is also a partition set.b. Every equivalence relation on a set defines a part...
Jai Saraswat
109
views
Jai Saraswat
answered
3 days
ago
Set Theory & Algebra
discrete-mathematics
set-theory
analytical-aptitude
equivalence-class
+
–
5
votes
3
answers
30
GO Classes CS Test Series 2025 | Discrete Mathematics | Topic Wise Test 1 | Question: 1
For a given predicate $\mathrm{P}(\mathrm{x}),$ you might believe that the statements $\forall \mathrm{xP}(\mathrm{x})$ or $\exists \mathrm{xP}(\mathrm{x})$ ... the domain, that $P(n)$ is true. Show for every element $n$ in the domain, that $P(n)$ is false.
For a given predicate $\mathrm{P}(\mathrm{x}),$ you might believe that the statements $\forall \mathrm{xP}(\mathrm{x})$ or $\exists \mathrm{xP}(\mathrm{x})$ are either tr...
Cxdr
449
views
Cxdr
answered
3 days
ago
Mathematical Logic
goclasses_2025_cs_dm_tw_1
goclasses
mathematical-logic
first-order-logic
easy
1-mark
+
–
8
votes
5
answers
31
GATE CSE 2021 Set 1 | Question: 48
Consider the following $\text{ANSI C}$ function: int SimpleFunction(int Y[], int n, int x) { int total = Y[0], loopIndex; for (loopIndex=1; loopIndex<=n-1; loopIndex++) total=x*total +Y[loopIndex]; return total; } Let $\textsf{Z}$ be an array ... $i$ such that $0 \leq i \leq 9$. The value returned by $\textsf{SimpleFunction(Z},10,2)$ is __________
Consider the following $\text{ANSI C}$ function:int SimpleFunction(int Y[], int n, int x) { int total = Y[0], loopIndex; for (loopIndex=1; loopIndex<=n-1; loopIndex++) to...
suraj_soni
6.4k
views
suraj_soni
answered
3 days
ago
Algorithms
gatecse-2021-set1
algorithms
numerical-answers
identify-function
2-marks
+
–
0
votes
0
answers
32
self doubt
what's the condition to draw PDA for a^(2j+1)b^j such that j>=1.Since the language L={aaab,aaaaabb,aaaaaaabbb,.......}. Is pda possible?
what's the condition to draw PDA for a^(2j+1)b^j such that j>=1.Since the language L={aaab,aaaaabb,aaaaaaabbb,.......}.Is pda possible?
Vignesh859
36
views
Vignesh859
asked
4 days
ago
Theory of Computation
pushdown-automata
npda
dpda
+
–
1
votes
1
answer
33
Kenneth H. Rosen
Let P (x) be the statement x can speak Russian and let Q(x) be the statement x knows the computer language C++. Express each of these sentences in terms of P (x), Q(x), quantifiers, and logical connectives. The domain for quantifiers consists of ... Every student at your school either can speak Russian or knows C++. d) No student at your school can speak Russian or knows C++.
Let P (x) be the statement “x can speak Russian” and let Q(x) be the statement “x knows the computer language C++.” Express each of these sentences in terms of P ...
Tanay1
49
views
Tanay1
asked
4 days
ago
Unknown Category
discrete-mathematics
kenneth-rosen
mathematical-logic
propositional-logic
self-doubt
+
–
0
votes
0
answers
34
Kenneth H. Rosen
Related to inhabitants of an island on which there are three kinds of people: knights who always tell the truth, knaves who always lie, and spies (called normals by Smullyan [Sm78]) who can either lie or tell the truth. You encounter three people, A, B, and C. ... B- Valid C- Valid YES Spy Knave Knight A- Valid B- Valid C- Valid YES Is my solution correct? Anyone please verify?
Related to inhabitants of an island on which there are three kinds of people: knights who always tellthe truth, knaves who always lie, and spies (called normals by Smully...
Bhaskar_Saini
35
views
Bhaskar_Saini
asked
4 days
ago
Unknown Category
discrete-mathematics
kenneth-rosen
self-doubt
+
–
0
votes
0
answers
35
Dbms indexing
Reenadayal
30
views
Reenadayal
asked
5 days
ago
Databases
databases
indexing
+
–
2
votes
1
answer
36
Gate Wallah DPP
Consider the following function: int arc(int i, int j) { if(i<2) return j+2; else if(j<2) return arc(i-1, 1); else return arc(i-1, arc(i, j-2)); } The value returned by arc(2, 6) is _________
Consider the following function:int arc(int i, int j){if(i<2) return j+2;else if(j<2) return arc(i-1, 1);else return arc(i-1, arc(i, j-2));}The value returned by arc(2, 6...
Khushboo Solanki
79
views
Khushboo Solanki
asked
6 days
ago
Programming in C
programming-in-c
numerical-answers
+
–
0
votes
1
answer
37
Functions
Consider the following function: int arc(int i, int j) { if(i<2) return j+2; else if(j<2) return arc(i-1, 1); else return arc(i-1, arc(i, j-2)); } The value returned by arc(2, 6) is ____________
Consider the following function:int arc(int i, int j){if(i<2) return j+2;else if(j<2) return arc(i-1, 1);else return arc(i-1, arc(i, j-2));}The value returned by arc(2, 6...
Khushboo Solanki
50
views
Khushboo Solanki
asked
6 days
ago
Programming in C
functions
+
–
0
votes
2
answers
38
Kenneth H. Rosen - Propositional Logic
Explain, without using a truth table, why (p ∨ ¬q) ∧ (q ∨ ¬r) ∧ (r ∨ ¬p) is true when p, q, and r have the same truth value and it is false otherwise.
Explain, without using a truth table, why (p ∨ ¬q) ∧ (q ∨ ¬r) ∧ (r ∨ ¬p) is true when p, q, and r have the same truth value and it is false otherwise.
surya k
62
views
surya k
asked
6 days
ago
Unknown Category
discrete-mathematics
kenneth-rosen
mathematical-logic
propositional-logic
self-doubt
+
–
2
votes
2
answers
39
Kenneth H. Rosen - Propositional Logic
Which of these sentences are propositions? What are the truth values of those that are propositions? a) Boston is the capital of Massachusetts. b) Miami is the capital of Florida. c) 2 + 3 = 5. d) 5 + 7 = 10. e) x + 2 = 11. f ) Answer this question.
Which of these sentences are propositions? What are the truth values of those that are propositions?a) Boston is the capital of Massachusetts.b) Miami is the capital of F...
Tanay1
49
views
Tanay1
asked
6 days
ago
Unknown Category
discrete-mathematics
kenneth-rosen
mathematical-logic
propositional-logic
self-doubt
+
–
0
votes
2
answers
40
self doubt
For the system of linear equation Ax=0 where matrix A(mxn) , what can we say about the number of solutions for this equation : 1. if all n columns of A are linearly Independent. 2. if less than n columns of A are linearly Independent.
For the system of linear equation Ax=0 where matrix A(mxn) , what can we say about the number of solutions for this equation :1. if all n columns of A are linearly Indepe...
pr4sh4nt
75
views
pr4sh4nt
asked
6 days
ago
Linear Algebra
engineering-mathematics
linear-algebra
system-of-equations
self-doubt
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register