Register
Filter

Recent questions without a selected answer

0 votes
1 answer
62
FIRST $ FOLLOW
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =
S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =
User Avatar
0 votes
1 answer
63
FIRST & FOLLOR
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =
S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =
User Avatar
1 votes
1 answer
64
#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
67
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
68
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
1 answer
69
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
2 answers
70
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
71
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
0 answers
73
Relational Database
Give an appropriate tree-structure diagram for the following relational database: Employee (person_name, street, city) Works (person_name, company_name, salary) Company (company_name, city) Manages (person_name, manager_name)
Give an appropriate tree-structure diagram for the following relational database:Employee (person_name, street, city)Works (person_name, company_name, salary)Company (com...
User Avatar
0 votes
1 answer
74
question on Supernetting
You have the following four contiguous networks: $10.0.0.0/24$ $10.0.1.0/24$ $10.0.2.0/24$ $10.0.3.0/24$ What is the supernet address that can represent all these networks?
You have the following four contiguous networks:$10.0.0.0/24$$10.0.1.0/24$$10.0.2.0/24$ $10.0.3.0/24$What is the supernet address that can represent all these networks?
User Avatar
0 votes
1 answer
76
Network Addressing
What is the Network ID for the network denoted by 192.168.242.5/20? a)192.168.242.0 b)192.168.240.0 c)192.168.226.0 d)192.168.192.0
What is the Network ID for the network denoted by 192.168.242.5/20? a)192.168.242.0b)192.168.240.0c)192.168.226.0d)192.168.192.0
User Avatar
0 votes
1 answer
78
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
81
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
1 votes
0 answers
82
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
3 votes
1 answer
89
GO Classes DA 2025 | Weekly Quiz 6 | Change of Basis & Linear Transformation | Question: 6
Suppose that ...
Suppose that$$\left[\left[\begin{array}{l}1 \\2\end{array}\right]\right]_{\mathcal{B}}=\left[\begin{array}{l}3 \\4\end{array}\right] \text { and }\left[\left[\begin{array...
User Avatar
Page: