Dark Mode

Recent questions tagged goclasses-scholarship-test1

0 votes

0 answers

1

Query about scholarship test for GO Classes 2024.
Hi @Admin, I would like to know about the scholarship exam dates for GO Classes 2024.

abhisek_31_21004 asked in GATE Apr 27

by abhisek_31_21004

70 views

4 votes

1 answer

2

GO Classes Scholarship 2023 | Test | Question: 1
A relation $\text{R}$ on a set $\text{A}$ is said to be Total Relation iff $a\text{R}b$ Or $b\text{R}a$ Or both, for all $a,b \in \mathrm{A}$. Which of the following options is/are false? Every Total relation is ... total and transitive, then $\mathrm{S}$ is an equivalence relation. The number of total relations on a set of $5$ elements is $1024.$

GO Classes asked in Set Theory & Algebra Aug 7, 2022

645 views

2 votes

3 answers

3

GO Classes Scholarship 2023 | Test | Question: 2
Let $\text{S}$ be the set of all bit-strings of length $7 .$ We define a relation $\mathrm{R}$ on the set $\mathrm{S}$ by the rule that $x\mathrm{R}y$ iff $x$ and $y$ ... such that $\forall j \neq i, x_{j}=y_{j}$ and $x_{i} \neq y_{i}$. What is the cardinality of relation $\mathrm{R}$?

GO Classes asked in Set Theory & Algebra Aug 7, 2022

590 views

4 votes

1 answer

4

GO Classes Scholarship 2023 | Test | Question: 3
Let $\text{A, B}$ be two disjoint non-empty sets. Let $\text{M}$ be the universal set and $\text{A} \cup \text{B}$ is a proper subset of $\mathrm{M}$. For any set $\mathrm{S}$, let $\mathrm{S}^{\prime}$ be the set of those elements ...

GO Classes asked in Set Theory & Algebra Aug 7, 2022

340 views

7 votes

2 answers

5

GO Classes Scholarship 2023 | Test | Question: 4
Consider a $3 \times 11$ rectangular grid as depicted in Figure $1,$ formed by $33$ tiles of area $1\text{m}^2.$ A staircase walk is a path in the grid which moves only right or up. How many staircase walks are there from $\text{A}$ to $\text{B}$ which start by going to the right two times?

GO Classes asked in Combinatory Aug 7, 2022

357 views

4 votes

1 answer

6

GO Classes Scholarship 2023 | Test | Question: 5
Consider $5$ cards, each has a distinct value from the set $\{2,3,4,5,6\},$ so there are $5$ different values, and we put them face down on the table. There are $5$ players and each player is given a number from $2$ ... with the value that player has. If no player loses, then the dealer loses. How many ways are there so that the dealer loses?

GO Classes asked in Combinatory Aug 7, 2022

303 views

4 votes

1 answer

7

GO Classes Scholarship 2023 | Test | Question: 6
Consider three boxes and $12$ balls of the same size. We have $3$ indistinguishable red balls and $9$ distinguishable blue balls. The first box can fit at most three balls, the second box can fit at most four balls and the third box can fit ... all the red balls go into the same box. What is the total number of ways to put all the balls in the boxes?

GO Classes asked in Combinatory Aug 7, 2022

339 views

3 votes

1 answer

8

GO Classes Scholarship 2023 | Test | Question: 7
Define the generating functions $\text{B}(x)=\displaystyle{} \sum_{n=0}^{\infty} 2^{n} x^{n}$ and $F(x)=\displaystyle{} \sum_{n=0}^{\infty} f_{n} x^{n}$ where $f_{n}$ ... $x^{5}$ is $\mathrm{G}(x)?$

GO Classes asked in Combinatory Aug 7, 2022

373 views

3 votes

1 answer

9

GO Classes Scholarship 2023 | Test | Question: 8
In a directed graph $\mathrm{G}=(\mathrm{V}, \mathrm{E})$, two nodes $u$ and $v$ are strongly connected if and only if they are mutually reachable i.e. there is a path from u to $v$ and a path from $v$ to $u$. ... connected components $\dots?$ can not increase can not decrease by more than $1$ can not decrease by more than $2$ may remain unchanged

GO Classes asked in Graph Theory Aug 7, 2022

433 views

4 votes

2 answers

10

GO Classes Scholarship 2023 | Test | Question: 9
Consider the following graph $\text{G:}$ Let $\text{M, C, I, S, B, E}$ be the Matching number, chromatic number, independence number, Clique number, Vertex cover number, and edge cover number, respectively of $\text{G}.$ What is $\text{M+C+I+S+B+E}?$

GO Classes asked in Graph Theory Aug 7, 2022

447 views

3 votes

1 answer

11

GO Classes Scholarship 2023 | Test | Question: 10
For which of the following does there exist a graph satisfying the specified conditions? A tree with six vertices and six edges. A tree with three or more vertices, two vertices of degree one, and all the other vertices with degree three or ... with $10$ vertices and $8$ edges. A disconnected graph with $12$ vertices and $11$ edges and no cycle.

GO Classes asked in Graph Theory Aug 7, 2022

286 views

5 votes

2 answers

12

GO Classes Scholarship 2023 | Test | Question: 11
Let $\text{U}$ be a set and $\text{X, Y} \subseteq \text{U}$. Define operation twist by $ \operatorname{twist}\text{(X, Y)} =(\text{X} \cap \text{Y}) \cup(\overline{\text{X}} \cap \overline{\text{Y}}). $ Which of the following ... $\operatorname{twist}\text{(X, Y)}=\operatorname{twist}(\overline{\text{X}}, \overline{\text{Y}})$

GO Classes asked in Set Theory & Algebra Aug 7, 2022

259 views

4 votes

1 answer

13

GO Classes Scholarship 2023 | Test | Question: 12
How many non-isomorphic simple undirected graphs are there, each with four vertices and without a cycle?

GO Classes asked in Graph Theory Aug 7, 2022

369 views

4 votes

2 answers

14

GO Classes Scholarship 2023 | Test | Question: 13
Let $\text{T}_{n}$ be the number of ways to arrange cars in a row with $n$ parking spaces if we can use sedans, SUVs, trucks to park such that a truck requires two spaces, whereas a sedan or SUV requires just one space each, and No two ... i.e. initial conditions are already given, hence no need to compute them)

GO Classes asked in Combinatory Aug 7, 2022

490 views

3 votes

1 answer

15

GO Classes Scholarship 2023 | Test | Question: 14
Consider the following C program given below. #include<stdio.h> main() { int a = 4; switch (a) { a--; case 4: printf("Science "); break; default: printf("Technology "); case ... ;Philosophy"); } } What will be the output of the program? Science Knowledge Philosophy Technology Knowledge Philosophy Science Knowledge

GO Classes asked in Programming Aug 7, 2022

430 views

3 votes

1 answer

16

GO Classes Scholarship 2023 | Test | Question: 15
Consider Figure $\text{A}$ and Figure $\text{B}$ which represent $4$ bit signed and unsigned numbers respectively in $2's$ complement system. Assume that a few variables are defined below and initialized in such a way that places them in the spot shown in Figure ... of the following(s) is/are true? $s3 > u3$ $s1 > s3$ $u1 > u3$ $s1 > u3$

GO Classes asked in Programming Aug 7, 2022

395 views

2 votes

2 answers

17

GO Classes Scholarship 2023 | Test | Question: 16
Consider the following declaration of variables $a$ and $b.$ int a = 1, b = 0; Which of the following is/are will evaluate to TRUE? b++ && b == a b++ && a == 0 a || b == --a a || ++b == 0

GO Classes asked in Programming Aug 7, 2022

345 views

3 votes

3 answers

18

GO Classes Scholarship 2023 | Test | Question: 17
Consider the following pair of mutually recursive functions. int f(int n){ if (n==0) return 1; return f(n-1)+g(n-1); } int g(int n){ if (n==0) return 1; return g(n-1) - f(n); } Which of the following is/are will evaluate to TRUE? $f(2) == g(0)$ $g(2)+f(1) == 0$ $g(4)+g(1) == 0$ $f(3)+f(0) == 0$

GO Classes asked in Programming Aug 7, 2022

413 views

3 votes

2 answers

19

GO Classes Scholarship 2023 | Test | Question: 18
Consider the following declaration of pointer variable $p.$ int (*p)[10][5]; If the initial value of $p$ is $1000,$ then what will be the value of $p+1?$ It is given that system has $8$ bytes of address size and $4$ bytes of integer size.

GO Classes asked in Programming Aug 7, 2022

411 views

4 votes

1 answer

20

GO Classes Scholarship 2023 | Test | Question: 19
Consider the following declaration of variable a in C program (row-major order). int a[3][4][5]; Which of the following(s) is/are TRUE about pointer arithmetic operations? Value of $a[2]-a[1]$ is $4$ Value of $a[1][2]-a[0][3]$ is $15$ Value of $a[0][10]-a[1][0]$ is $30$ Value of $a[2]-a[1]$ is $5$

GO Classes asked in Programming Aug 7, 2022

389 views

1 vote

1 answer

21

GO Classes Scholarship 2023 | Test | Question: 20
Consider the following declarations of a few variables. int (*p1)[3]; int (*p2)[3]; int (*t1)[2]; int (*t2)[2]; Let the initial values of $p1, p2, t2$ and $t1$ are $1000, 1036, 2000$ and $2040$ respectively. Consider ... is correct but $\text{S2}$ is incorrect $\text{S2}$ is correct but $\text{S1}$ is incorrect Both are correct Both are incorrect

GO Classes asked in Programming Aug 7, 2022

269 views

3 votes

1 answer

22

GO Classes Scholarship 2023 | Test | Question: 21
Let arrays OneD and TwoD are declared as follows as: int OneD[10]; int TwoD[4][5]; Which of the following is/are valid syntax to pass OneD and TwoD to some function fun()? A syntax is valid if it gets compiled without any warning or error. void fun(int OneD[10]); void fun(int OneD[5]); void fun(int TwoD[][5]); void fun(int **TwoD);

GO Classes asked in Programming Aug 7, 2022

387 views

4 votes

1 answer

23

GO Classes Scholarship 2023 | Test | Question: 22
Consider below two program fragments. Assume malloc is always successful, and sizes are as follows - sizeof (int *)=8 bytes sizeof ( double)=8 bytes sizeof ( char )=1 byte sizeof ( int )=4 byte Program 1 int **p; p = (int ... run time error, but Program $1$ will run fine. Both programs will always run fine. Both programs may produce run time errors.

GO Classes asked in Programming Aug 7, 2022

351 views

4 votes

1 answer

24

GO Classes Scholarship 2023 | Test | Question: 23
#include <stdio.h> int main() { int i= 255; short int *s= (short int *)&i; printf("%d\n", *s); } What will be the output of the above program in little-endian and big-endian, respectively? $(65280\text{ is } 255\times2^8)$ $255,\; 0$ $65280,\; 0$ $0,\;0$ $0,\; 65280$

GO Classes asked in Programming Aug 7, 2022

329 views

1 vote

1 answer

25

GO Classes Scholarship 2023 | Test | Question: 24
Consider the following function $\text{magic5().}$ void magic5(int x, int y){ if (condition) printf("magic"); } What condition we can write in “if-statement” such that $\text{magic5(5,5)}$ will print magic? !(x==5)!=!(y==5) (x==5)?!(y==5):(x==5) ((x==5)||(y==5))&&!((x==5)&&(y==5)) None of these

GO Classes asked in Programming Aug 7, 2022

204 views

3 votes

3 answers

26

GO Classes Scholarship 2023 | Test | Question: 25
Consider struct alignment rules as described below - Each primitive data (int, char, float, etc.) type requiring $\text{K}$ bytes must be stored at the address must be multiple of $\text{K}.$ ... a [5]; long int b; } What will be $\text{sizeof(struct s)}?$ $24$ $18$ $32$ $20$

GO Classes asked in Programming Aug 7, 2022

270 views

2 votes

3 answers

27

GO Classes Scholarship 2023 | Test | Question: 26
What will be the output of the following C program? int sum = 0; for (int i = 1; i <= 10; i++) for (int j = 1; j <= 10; j++){ sum += i * j; }

GO Classes asked in Programming Aug 7, 2022

268 views

2 votes

3 answers

28

GO Classes Scholarship 2023 | Test | Question: 27
What will be the number of recursive calls for $\textsf{mystery(5)}$ including the first call? void mystery(int n) { if (n == 0 || n == 1) return 0; mystery(n-2); printf("%d", n); mystery(n-1); }

GO Classes asked in Programming Aug 7, 2022

312 views

3 votes

1 answer

29

GO Classes Scholarship 2023 | Test | Question: 28
What will be the output of the following program? #include<stdio.h> struct _go{ char b[20]; char *a; struct _go *c; }x[2] = {"GATE", "2023", x+1, "GO", "Classes", x}, *p = x; typedef struct_go go; go ... ;c, n-2); } int main() { printf("%s",mystry(p,2023)->a); } GATE $2023$ Run time error GO

GO Classes asked in Programming Aug 7, 2022

350 views

1 vote

2 answers

30

GO Classes Scholarship 2023 | Test | Question: 29
In which of the following case(s) character array must end with null char? char c[] = "GATE"; char c[] = {'2', '0', '2', '3'}; char c[4] = "GATE"; char c[16] = "2023";

GO Classes asked in Programming Aug 7, 2022

539 views

Page:

Recent questions tagged goclasses-scholarship-test1