Register
Filter

Recent questions without a selected answer

0 votes
0 answers
1
#TOC regular expression
what will be the regular expression of this DFA using Arden's theorem
what will be the regular expression of this DFA using Arden's theorem
User Avatar
0 votes
2 answers
4
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?
User Avatar
0 votes
1 answer
5
go test series 2025
I bought test series but it shows that you bought only gateoverflow test series....It may be my mistake now what should i do...i want both test series
I bought test series but it shows that you bought only gateoverflow test series....It may be my mistake now what should i do...i want both test series
User Avatar
0 votes
0 answers
6
Linear Algebra AX=B
Consider a matrix A (n×m) ,X(m×n) and B(n×n) such that AX=B . If A has k linearly independent columns then what conclusions can we nake about the number of linearly independent columns of B.
Consider a matrix A (n×m) ,X(m×n) and B(n×n) such that AX=B . If A has k linearly independent columns then what conclusions can we nake about the number of linearly in...
User Avatar
0 votes
1 answer
7
C Programming - Arrays & Pointer (NAT)
#include <stdio.h> int main() { int a[3][2] = {1, 3, 5, 7, 9, 11}; int *ptr = a[0]; ptr += sizeof(int); printf("%d", *ptr); return 0; } (Assume size of int to be $2$ bytes.) The output is __________.
#include <stdio.h int main() { int a[3] = {1, 3, 5, 7, 9, 11}; int *ptr = a[0]; ptr += sizeof(int); printf("%d", *ptr); return 0; }(Assume size of int to be $2$ bytes.)T...
User Avatar
0 votes
1 answer
8
ISI kolkata MTech CS 2019
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths from $u$ to $v$ that do not contain the vertex $w$.
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths fro...
User Avatar
0 votes
1 answer
15
self doubt
how to check the validity of an a argument using laws of logics
how to check the validity of an a argument using laws of logics
User Avatar
0 votes
1 answer
18
Minimal Cover
Consider R(A,B,C,D,E,H) be a relational schema with the following functional dependencies: A->BC, CD->E, E->C, D->AEH, ABH->BD, DH->BC Find minimal cover ?
Consider R(A,B,C,D,E,H) be a relational schema with the following functional dependencies:A->BC, CD->E, E->C, D->AEH, ABH->BD, DH->BCFind minimal cover ?
User Avatar
0 votes
0 answers
19
Digital Logic
What is the maximum n-bit number in base x ,when represented in decimal(10)?
What is the maximum n-bit number in base x ,when represented in decimal(10)?
User Avatar
0 votes
0 answers
22
Graph Theory
A vertex colouring with three colours of a graph G = (V, E) is a mapping V → {R, G, B }. So that any two adjacent vertices does not same colour. Consider the below graphs:
A vertex colouring with three colours of a graph G = (V, E) is a mapping V → {R, G, B }. So that any two adjacent vertices does not same colour. Consider the below grap...
User Avatar
0 votes
0 answers
26
gate 2024
hello,my gate AIR is 645 and my category is OBC-NCL and my brach is CSE so my question is which top iits can i get at this score??
hello,my gate AIR is 645 and my category is OBC-NCL and my brach is CSE so my question is which top iits can i get at this score??
User Avatar
0 votes
0 answers
28
#unacademyDPP
User Avatar
0 votes
0 answers
29
PGEE exam
What Bakery Algorithm improves: (a). throughput (b). latency (c). both (d). None
What Bakery Algorithm improves: (a). throughput (b). latency (c). both (d). None
User Avatar
Page: