Register
Filter

Recent questions without a selected answer

0 votes
0 answers
1
B tree dbms
User Avatar
0 votes
0 answers
4
IITM research aptitude paper 2024
 
 
User Avatar
0 votes
0 answers
5
IITM research aptitude paper 2024
 
 
User Avatar
0 votes
0 answers
6
IITM research aptitude paper 2024
 
 
User Avatar
0 votes
0 answers
7
IITM research aptitude paper 2024
 
 
User Avatar
0 votes
0 answers
8
IITM research aptitude paper 2024
How many correct paths are there for the ant to travel from $A\rightarrow G$ using the given line segments (including the given working examples)? .
How many correct paths are there for the ant to travel from $A\rightarrow G$ using the given line segments (including the given working examples)? .
User Avatar
0 votes
0 answers
9
IITM research aptitude paper 2024
 
 
User Avatar
0 votes
0 answers
10
IITM research aptitude paper 2024
 
 
User Avatar
0 votes
0 answers
11
IITM research aptitude paper 2024
 
 
User Avatar
0 votes
0 answers
12
IITM research aptitude paper 2024
 
 
User Avatar
0 votes
1 answer
17
Constructors
A constructor cannot be explicitly called by the client program. true or false?
A constructor cannot be explicitly called by the client program. true or false?
User Avatar
0 votes
0 answers
18

A program that includes the file containing a class declaration is called a ________ program of the class.
A program that includes the file containing a class declaration is called a ________ program of the class.
User Avatar
1 votes
0 answers
19
Arrays
Consider an integer upper triangular 2D array arr[–8 to +7][–8 to +7] having base address 1000. If the size of the integer is 4 bytes, the address of the element present at location arr[–6][4] is- ____________.
Consider an integer upper triangular 2D array arr[–8 to +7][–8 to +7] having base address 1000. If the size of the integer is 4 bytes, the address of the element pres...
User Avatar
0 votes
1 answer
21
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
22
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
23
#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
26
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
27
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
28
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
29
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
30
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
Page: