Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent activity
0
votes
2
answers
1
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...
Kishor_1403
75
views
Kishor_1403
commented
1 hour
ago
Linear Algebra
engineering-mathematics
linear-algebra
system-of-equations
self-doubt
+
–
36
votes
2
answers
2
GATE CSE 1999 | Question: 21
Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal node (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and minimum number of records in the leaf nodes for such a B-tree with height $h, h \geq 1. ($Assume that the root of a tree is at height $0).$
Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal node (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and ...
yuyutsu
8.1k
views
yuyutsu
commented
6 hours
ago
Databases
gate1999
databases
b-tree
normal
descriptive
+
–
0
votes
0
answers
3
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
+
–
3
votes
1
answer
4
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 32
Which of the following sets has the greatest cardinality? The set of real numbers R The set of all functions from R to {0,1} The set of all finite subsets of natural numbers The set of all finite-length binary strings
Which of the following sets has the greatest cardinality?The set of real numbers RThe set of all functions from R to {0,1}The set of all finite subsets of natural numbers...
archiii
509
views
archiii
commented
12 hours
ago
Theory of Computation
goclasses2024-mockgate-14
theory-of-computation
finite-automata
1-mark
+
–
0
votes
0
answers
5
(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
6
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
10
votes
2
answers
7
GATE CSE 2023 | Question: 35
Consider the $\textsf{IEEE-754}$ single precision floating point numbers $\text{P} = \textsf{0xC1800000}$ and $\text{Q} = \textsf{0x3F5C2EF4}.$ ... $\textsf{IEEE-754}$ single precision format? $\textsf{0x404C2EF4}$ $\textsf{0x405C2EF4}$ $\textsf{0xC15C2EF4}$ $\textsf{0xC14C2EF4}$
Consider the $\textsf{IEEE-754}$ single precision floating point numbers $\text{P} = \textsf{0xC1800000}$ and $\text{Q} = \textsf{0x3F5C2EF4}.$Which one of the following ...
AnshG01
11.1k
views
AnshG01
commented
14 hours
ago
Digital Logic
gatecse-2023
digital-logic
number-representation
ieee-representation
2-marks
floating-point-representation
+
–
23
votes
3
answers
8
GATE CSE 1992 | Question: 03,iv
Assume that the last element of the set is used as partition element in Quicksort. If $n$ distinct elements from the set $\left[1\dots n\right]$ are to be sorted, give an input for which Quicksort takes maximum time.
Assume that the last element of the set is used as partition element in Quicksort. If $n$ distinct elements from the set $\left[1\dots n\right]$ are to be sorted, give an...
theradash
4.7k
views
theradash
comment edited
17 hours
ago
Algorithms
gate1992
algorithms
sorting
easy
quick-sort
descriptive
+
–
57
votes
3
answers
9
GATE CSE 2010 | Question: 27
What is the probability that divisor of $10^{99}$ is a multiple of $10^{96}$? $\left(\dfrac{1}{625}\right)$ $\left(\dfrac{4}{625}\right)$ $\left(\dfrac{12}{625}\right)$ $\left(\dfrac{16}{625}\right)$
What is the probability that divisor of $10^{99}$ is a multiple of $10^{96}$?$\left(\dfrac{1}{625}\right)$$\left(\dfrac{4}{625}\right)$$\left(\dfrac{12}{625}\right)$$\lef...
____
13.8k
views
____
commented
17 hours
ago
Probability
gatecse-2010
probability
normal
+
–
26
votes
3
answers
10
GATE CSE 1994 | Question: 1.2
Let $A$ and $B$ be real symmetric matrices of size $n \times n$. Then which one of the following is true? $AA'=I$ $A=A^{-1}$ $AB=BA$ $(AB)'=BA$
Let $A$ and $B$ be real symmetric matrices of size $n \times n$. Then which one of the following is true?$AA'=I$$A=A^{-1}$$AB=BA$$(AB)'=BA$
cprdereddyy
8.0k
views
cprdereddyy
commented
19 hours
ago
Linear Algebra
gate1994
linear-algebra
normal
matrix
+
–
0
votes
0
answers
11
Memory Bottleneck
Describe the bottleneck between the main memory and the CPU, and state how the bottleneck is resolved
Describe the bottleneck between the main memory and the CPU, and state how the bottleneck is resolved
Shubham Sharma 2
47
views
Shubham Sharma 2
edited
19 hours
ago
Operating System
operating-system
cpu
main-memory
memory-bottleneck
+
–
0
votes
0
answers
12
exam 2011
Use the semantic rules below to draw an annotated parse tree for the expression. Compute the final value. (4*2)+3+(3*3+2)n
Use the semantic rules below to draw an annotated parse tree for the expression. Compute the final value. (4*2)+3+(3*3+2)n
Shubham Sharma 2
54
views
Shubham Sharma 2
closed
19 hours
ago
0
votes
0
answers
13
exam 2011
Use the semantic rules below to draw an annotated parse tree for the expression. Compute the final value. (4*2)+3+(3*3+2)n
Use the semantic rules below to draw an annotated parse tree for the expression. Compute the final value. (4*2)+3+(3*3+2)n
Shubham Sharma 2
65
views
Shubham Sharma 2
retagged
20 hours
ago
Compiler Design
compiler-design
parsing
numerical-answers
+
–
1
votes
0
answers
14
ISI PCB 2023 Q2
Shubham Sharma 2
47
views
Shubham Sharma 2
retagged
20 hours
ago
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
isi2023-pcb
+
–
0
votes
1
answer
15
ISI PCB 2023 Q1
Suppose there are three types of people in the world. A person is honest if the person always speaks the truth. A person is a liar if the person always lies. A person is normal if the person sometimes speaks the truth and sometimes lies. In a city ... . C: B is not normal. Based on the above, deduce with appropriate justifications who among A, B and C has committed the crime.
Suppose there are three types of people in the world.A person is “honest” if the person always speaks the truth. A person is a “liar” if the person always lies. A...
Shubham Sharma 2
164
views
Shubham Sharma 2
retagged
20 hours
ago
Mathematical Logic
discrete-mathematics
mathematical-logic
isi2023-pcb
+
–
94
votes
5
answers
16
GATE CSE 2015 Set 1 | Question: 40
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-key operations on a set of data ... if the goal is to achieve the best total asymptotic complexity considering all the operations? Unsorted array Min - heap Sorted array Sorted doubly linked list
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-...
halfcodeblood
24.4k
views
halfcodeblood
commented
20 hours
ago
Algorithms
gatecse-2015-set1
algorithms
data-structures
normal
time-complexity
+
–
47
votes
8
answers
17
GATE CSE 2019 | Question: 37
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of $A_1, A_2, \dots , A_n$ is $O(n)$ $O(n \: \log \: n)$ $O(n^2)$ $\Omega (n^2 \log n)$
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements ...
halfcodeblood
35.9k
views
halfcodeblood
commented
21 hours
ago
Algorithms
gatecse-2019
algorithms
time-complexity
2-marks
+
–
57
votes
6
answers
18
GATE CSE 1999 | Question: 1.13
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is $n-1$ $n$ $n+1$ None of the above
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the w...
halfcodeblood
20.6k
views
halfcodeblood
commented
1 day
ago
Algorithms
gate1999
algorithms
time-complexity
normal
+
–
2
votes
3
answers
19
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
answer edited
1 day
ago
Quantitative Aptitude
gate2023-ee
quantitative-aptitude
modular-arithmetic
+
–
0
votes
0
answers
20
Dbms indexing
꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂
30
views
꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂
commented
1 day
ago
Databases
databases
indexing
+
–
1
votes
3
answers
21
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
2
answers
22
Permutations
In how many ways can four letters from COFFEE be picked considering all permutations?
In how many ways can four letters from COFFEE be picked considering all permutations?
Arjun
212
views
Arjun
commented
1 day
ago
Quantitative Aptitude
general-aptitude
quantitative-aptitude
permutation-and-combination
numerical-answers
+
–
1
votes
1
answer
23
TIFR CSE 2022 | Part B | Question: 3
Consider the problem of sorting $n$ single digit integers (base $10$). This problem can be solved in time $O(n \log n)$ but not $O(n \log \log n)$ $O(n \log \log n)$ but not $O(n)$ $O(n)$ but not $O(n / \log \log n)$ $O(n / \log \log n)$ None of the above.
Consider the problem of sorting $n$ single digit integers (base $10$). This problem can be solved in time$O(n \log n)$ but not $O(n \log \log n)$$O(n \log \log n)$ but no...
ikka
896
views
ikka
commented
1 day
ago
Algorithms
tifr2022
algorithms
sorting
time-complexity
+
–
0
votes
1
answer
24
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
25
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
+
–
26
votes
1
answer
26
GATE CSE 2021 Set 1 | Question: 47
Consider a $\textit{dynamic}$ hashing approach for $4$-bit integer keys: There is a main hash table of size $4$. The $2$ least significant bits of a key is used to index into the main hash table. Initially, the main hash table entries are empty. Thereafter, when more keys are hashed ... notation)? $5,9,4,13,10,7$ $9,5,10,6,7,1$ $10,9,6,7,5,13$ $9,5,13,6,10,14$
Consider a $\textit{dynamic}$ hashing approach for $4$-bit integer keys:There is a main hash table of size $4$.The $2$ least significant bits of a key is used to index in...
snehasish
8.0k
views
snehasish
commented
1 day
ago
Algorithms
gatecse-2021-set1
multiple-selects
algorithms
hashing
2-marks
+
–
20
votes
3
answers
27
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
+
–
1
votes
3
answers
28
GATE CSE 2024 | Set 2 | Question: 52
Let $L_{1}$ be the language represented by the regular expression $b^{*} a b^{*}\left(a b^{*} a b^{*}\right)^{*}$ and $L_{2}=\left\{w \in(a+b)^{*}|| w \mid \leq 4\right\}$, where $|w|$ denotes the length of string $w$. The number of strings in $L_{2}$ which are also in $L_{1}$ is _________.
Let $L_{1}$ be the language represented by the regular expression $b^{*} a b^{*}\left(a b^{*} a b^{*}\right)^{*}$ and $L_{2}=\left\{w \in(a+b)^{*}|| w \mid \leq 4\right\}...
SarthakShastri
2.4k
views
SarthakShastri
commented
1 day
ago
Theory of Computation
gatecse2024-set2
numerical-answers
theory-of-computation
regular-expression
+
–
0
votes
1
answer
29
Semaphores
Can a counting semaphore acquire a negative value? S = 2; 15 P operations done, should the semaphore be 0 or -13
Can a counting semaphore acquire a negative value?S = 2;15 P operations done, should the semaphore be 0 or -13
dhruv_2605
299
views
dhruv_2605
commented
1 day
ago
Operating System
semaphore
operating-system
process-synchronization
+
–
0
votes
1
answer
30
B tree dbms
nareshit
52
views
nareshit
answered
1 day
ago
Databases
binary-tree
+
–
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