Answers by shishir__roy / GATE Overflow for GATE CSE

6 votes

121

GO Classes Test Series 2024 | Programming | Test 1 | Question: 8
What is the output of the following code? Assume that int is $32$ bits, short is $16$ bits, and the representation is two's complement. unsigned int x = 0xDEADBEEF; unsigned short y = 0xFFFF; signed int z = -1; ... Hello"); if (x > z) printf("World"); Prints nothing Prints Hello Prints World Prints HelloWorld

What is the output of the following code? Assume that int is $32$ bits, short is $16$ bits, and the representation is two’s complement.unsigned int x = 0xDEADBEEF; unsi...

557 views

answered Apr 18, 2022

4 votes

122

GO Classes Test Series 2024 | Programming | Test 1 | Question: 6
Consider the $k$ bit binary pattern on 2's complement system. $\text{T}_{\max}$ and $\text{T}_{\min}$ are maximum and minimum signed numbers we can represent using $k$ bits. $\text{U}_{\max}$ and $\text{U}_{\min}$ are maximum and minimum ... $\text{U}_{\min} = !(1>>31)$ $\text{U}_{\max} = \;\sim(1>>31)$

Consider the $k$ bit binary pattern on 2’s complement system.$\text{T}_{\max}$ and $\text{T}_{\min}$ are maximum and minimum signed numbers we can represent using $k$ b...

621 views

answered Apr 18, 2022

6 votes

123

GO Classes 2023 | Weekly Quiz 7 | Question: 5
We defined a new class of relations GO on a Set. A relation $\text{R}$ on a set $\text{A}$ is said to be GO iff $\forall a,b [ (a\text{R}b \wedge b\text{R}a) \leftrightarrow (a=b) ],$ ... correct about relation GO? Every GO relation is reflexive. Every GO relation is symmetric. Every GO relation is anti-symmetric. Every GO relation is transitive.

We defined a new class of relations “GO” on a Set.A relation $\text{R}$ on a set $\text{A}$ is said to be GO iff $\forall a,b [ (a\text{R}b \wedge b\text{R}a) \leftri...

447 views

answered Apr 15, 2022

2 votes

124

GO Classes 2023 | Weekly Quiz 7 | Question: 1
Let $\text{M}(x)$ denote the predicate $x$ is a mobile ; $\text{B}(x)$ denote the predicate $x$ is black ; $\text{C}(x)$ denote the predicate $x$ has calculator . Suppose that the universe is set of all mobiles. Which of the following ... $: \forall x ( \text{M}(x) \wedge \text{C}(x) )$

Let$\text{M}(x)$ denote the predicate “$x$ is a mobile”;$\text{B}(x)$ denote the predicate “$x$ is black”;$\text{C}(x)$ denote the predicate “$x$ has calculator...

858 views

answered Apr 14, 2022

3 votes

125

GO Classes 2023 | Weekly Quiz 7 | Question: 6
Consider the following logical inferences : $\text{S1} :$ If I study Discrete Mathematics, then I will study Computer Science. If I study C, then I will study Algorithms. Therefore, If I study Discrete Mathematics or C then I will study ... correct but $\text{S2}$ is a correct inference Both $\text{S1}$ and $\text{S2}$ are not correct inferences

Consider the following logical inferences :$\text{S1} :$“If I study Discrete Mathematics, then I will study Computer Science.”“If I study C, then I will study Algor...

439 views

answered Apr 14, 2022

1 votes

126

GO Classes 2023 | Weekly Quiz 7 | Question: 2
Let the universe be the set of all integers. Which of the following statements is/are true? (Where “$+$” is the integer addition) $\forall x \forall y \exists z (x+y = z)$ $\forall x \exists y \forall z (x+y = z)$ $\exists x \forall y \exists z (x+y = z)$ $\exists z \forall x \exists y (x+y = z)$

Let the universe be the set of all integers. Which of the following statements is/are true? (Where “$+$” is the integer addition)$\forall x \forall y \exists z (x+y =...

348 views

answered Apr 14, 2022

2 votes

127

GO Classes 2023 | Weekly Quiz 7 | Question: 10
Consider a set $\text{A} = \{ a,b,c,d,e,f,g \}.$ Consider the following partition $\text{P}$ of set $\text{A}:$ $\text{P} : \{ \{a,b\} , \{c\}, \{d\}, \{e,f,g\} \}$ ... that the set of equivalence classes of $\text{R}$ is exactly the same as partition $\text{P}.$ What is the cardinality of relation $\text{R}?$

Consider a set $\text{A} = \{ a,b,c,d,e,f,g \}.$Consider the following partition $\text{P}$ of set $\text{A}:$$\text{P} : \{ \{a,b\} , \{c\}, \{d\}, \{e,f,g\} \}$We defin...

361 views

answered Apr 14, 2022

3 votes

128

GO Classes 2023 | Weekly Quiz 7 | Question: 11
Let $\text{A}$ be a non-empty set. Let $\text{P(A)}$ denote the power set of $\text{A}.$ Which of the following is/are necessarily true ? If $x \in \text{A}$ then $x$ cannot be an element of $\text{P(A)}.$ If every element of $\text{P(A)}$ ... $\text{B},$ then $\text{A} \subseteq \text{B}.$ $\text{A} \subseteq \text{P(A)}$

Let $\text{A}$ be a non-empty set. Let $\text{P(A)}$ denote the power set of $\text{A}.$Which of the following is/are necessarily true ?If $x \in \text{A}$ then $x$ canno...

410 views

answered Apr 14, 2022

3 votes

129

GO Classes 2023 | Weekly Quiz 7 | Question: 12
Let $\text{A, B}$ be two non-empty sets, with cardinality $3,4$ respectively. Let $\text{R}$ be a relation defined on the power set of $\text{A} \times \text{B}.$ Relation $\text{R}$ is reflexive, symmetric, transitive and antisymmetric. How many equivalence classes does relation $\text{R}$ have?

Let $\text{A, B}$ be two non-empty sets, with cardinality $3,4$ respectively. Let $\text{R}$ be a relation defined on the power set of $\text{A} \times \text{B}.$ Relatio...

727 views

answered Apr 14, 2022

1 votes

130

GO Classes 2023 | Weekly Quiz 7 | Question: 8
Consider the formula $\exists x \exists y \exists z(\text{R}(x, y) \wedge \text{R}(z, y) \wedge \text{R}(x, z) \wedge \neg \text{R}(z, x)).$ For which of the following interpretations, is this formula true? $(\text{N}$ ... $\text{R}(x,y) : y = x0 \;\text{or}\; y = x1.$

Consider the formula $\exists x \exists y \exists z(\text{R}(x, y) \wedge \text{R}(z, y) \wedge \text{R}(x, z) \wedge \neg \text{R}(z, x)).$For which of the following int...

380 views

answered Apr 14, 2022

1 votes

131

NIELIT 2022 April Scientist B | Section A | Question: 3
In the following question, a statement is followed by two assumptions numbered $\text{I}$ and $\text{II}.$ ... If only assumption $\text{II}$ is implicit; If neither $\text{I}$ nor $\text{II}$ is implicit.

In the following question, a statement is followed by two assumptions numbered $\text{I}$ and $\text{II}.$ Consider the statement and the following assumptions to decide ...

650 views

answered Apr 13, 2022

1 votes

132

NIELIT 2022 April Scientist B | Section A | Question: 2
Ramesh and Suresh enter into a partnership with capitals in the ratio of $10:12.$ At the end of $8$ months, Ramesh withdraws. If they receive profits in the ratio of $10:18.$ Find how long Suresh’s capital was used. $7$ months $8$ months $10$ months $12$ months

Ramesh and Suresh enter into a partnership with capitals in the ratio of $10:12.$ At the end of $8$ months, Ramesh withdraws. If they receive profits in the ratio of $10:...

3.3k views

answered Apr 13, 2022

1 votes

133

Array
An array VAL[1..15][1..10] is stored in the memory with each element requiring 4 bytes of storage. If the base address of array VAL is 1500, determine the location of VAL[12][9] when the array VAL is stored in Row wise. ?

An array VAL[1..15][1..10] is stored in the memory with each element requiring 4 bytes of storage. If the base address of array VAL is 1500, determine the location of VAL...

2.1k views

answered Apr 12, 2022

1 votes

134

Made easy test series
Determine the first term of geometric progression is the sum of first term and third term is 40 and sum of second term and fourth term is 80 1)12 2)16 3)8 4)4

Determine the first term of geometric progression is the sum of first term and third term is 40 and sum of second term and fourth term is 801)122)163)84)4

1.2k views

answered Apr 12, 2022

2 votes

135

NIELIT 2022 April Scientist B | Section B | Question: 54
The relation scheme $\text{Student Performance (name, courseNo, rollNo, grade)}$ has the following functional dependencies: name, courseNo, $\rightarrow$ grade rollNo, courseNo $\rightarrow$ grade name $\rightarrow$ rollNo rollNo $\rightarrow$ name The ... form of this relation scheme is $\text{2NF}$ $\text{3NF}$ $\text{BCNF}$ $\text{4NF}$

The relation scheme $\text{Student Performance (name, courseNo, rollNo, grade)}$ has the following functional dependencies:name, courseNo, $\rightarrow$ graderollNo, cour...

879 views

answered Apr 12, 2022

2 votes

136

NIELIT 2022 April Scientist B | Section B | Question: 49
Let $\text{R (A, B, C, D)}$ be a relational schema with the following functional dependencies: $\text{A} \rightarrow \text{B, B} \rightarrow \text{C}$ $\text{C} \rightarrow \text{D}$ ... dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving

Let $\text{R (A, B, C, D)}$ be a relational schema with the following functional dependencies: $\text{A} \rightarrow \text{B, B} \rightarrow \text{C}$ $\text{C} \rightar...

995 views

answered Apr 12, 2022

1 votes

137

#Quicksort
In Quicksort of the following numbers, if the pivot is chosen as the first element, what will be the order of the numbers after the use of partition function? Assume we are sorting in increasing order. 11, 15, 9, 13, 17, 7, 5, 12, 6, 18

In Quicksort of the following numbers, if the pivot is chosen as the first element, what will be the order of the numbers after the use of partition function? Assume we a...

484 views

answered Apr 8, 2022

6 votes

138

GO Classes 2023 | Weekly Quiz 6 | Question: 13
#include<stdio.h> int bar(int data[], int i, int a, int x) { if (x<0) return 0; x--; int b = a + data[i]; if(data[i] >0) return bar(data, i+1, b, x); if(data[i] == 0 || i ==x-1) return a; return -a; } int main() ... ;data+1)-data; printf("%d", bar(data, 0, 0, x) ); } What will be the output of a given program? $6$ $-6$ $0$ $5$

#include<stdio.h int bar(int data[], int i, int a, int x) { if (x<0) return 0; x ; int b = a + data[i]; if(data[i] >0) return bar(data, i+1, b, x); if(data[i] == 0 || i =...

537 views

answered Apr 7, 2022

5 votes

139

GO Classes 2023 | Weekly Quiz 6 | Question: 12
#include<stdio.h> #include<string.h> char upstr[50]; void putStar (int n,char str[]){ upstr[n] = str[n]; if(n == strlen(str)) return; else upstr[n+1] = '*'; putStar(n+1,str); } int main() { char str[] = "hello"; ... %s", upstr); } What will be the output of the given program? h*e*l*l*o h*e*l*l*o* h*e*l*l* hello

#include<stdio.h #include<string.h char upstr[50]; void putStar (int n,char str[]){ upstr[n] = str[n]; if(n == strlen(str)) return; else upstr[n+1] = '*'; putStar(n+1,str...

370 views

answered Apr 7, 2022

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true