Recent activity by KrishnaGupta / GATE Overflow for GATE CSE

1 answer

1

DRDO CSE 2022 Paper 2 | Question: 14
A relational database contains two tables movie, and genre, in which movie table has columns movie_no, movie_name, and genre_id, while genre table has columns genre_id, and genre_name. Following insert statements were executed successfully to populate the ... How many rows and columns will be retrieved by the following SQL statement? Select * from movie, genre

A relational database contains two tables movie, and genre, in which movie table has columns movie_no, movie_name, and genre_id, while genre table has columns genre_id, a...

403 views

answered Jul 8, 2023

5 answers

2

GATE CSE 2000 | Question: 2.12
The following arrangement of master-slave flip flops has the initial state of $P, Q$ as $0, 1$ (respectively). After three clock cycles the output state $P, Q$ is (respectively), $1, 0$ $1, 1$ $0, 0$ $0, 1$

The following arrangement of master-slave flip flopshas the initial state of $P, Q$ as $0, 1$ (respectively). After three clock cycles the output state $P, Q$ is (respect...

11.8k views

commented Jun 23, 2023

1 answer

3

ISRO2013-ECE Digital Logic
What is the division factor of the given clock divider circuit? $2$ $3$ $1.5$ $2.5$

What is the division factor of the given clock divider circuit?$2$$3$$1.5$$2.5$

1.7k views

commented Jun 23, 2023

1 answer

4

Discrete Mathematics | Propositional Logic | Test 1 | Question: 14
A compound sentence is a $\textit{tautology}$ if it is true independently of the truth values of its component atomic sentences. A sentence is $\textit{atomic}$ if it contains no sentential connectives. Let $P,Q$ and ... $(P \leftrightarrow P) \leftrightarrow P$ is a tautology Number of correct statements are ______

A compound sentence is a $\textit{tautology}$ if it is true independently of the truth values of its component atomic sentences. A sentence is $\textit{atomic}$ if it con...

336 views

commented Apr 12, 2023

0 answers

5

Discrete Mathematics | Propositional Logic | Test 1 | Question: 7
The $\textit{well-formed formulas (wff)}$ of propositional logic are obtained by using the following rules: 1. An atomic proposition $\phi$ is a well-formed formula. 2. If $\phi$ ... (P, Q and R are atomic propositions) Total number of well-formed formulas are ______

The $\textit{well-formed formulas (wff)}$ of propositional logic are obtained by using the following rules: 1. An atomic proposition $\phi$ is a well-formed formula. 2. ...

660 views

commented Apr 12, 2023

2 answers

6

GO Classes CS 2025 | Weekly Quiz 3 | Propositional Logic | Question: 7
Which of the following logical arguments is/are valid? $\begin{aligned} & P \rightarrow(Q \rightarrow R) \\ & \neg R \\ \therefore & \neg P \\ & \end{aligned}$ ...

Which of the following logical arguments is/are valid?$\begin{aligned} & P \rightarrow(Q \rightarrow R) \\ & \neg R \\ \therefore & \neg P \\ & \end{aligned}$$\begin{alig...

538 views

answered Apr 7, 2023

2 answers

7

GO Classes 2024 | Weekly Quiz 7 | Linear Algebra | Question: 10
Let $A=\begin{pmatrix}1 & 2 & 1 & 0 & 0 \\ 1 & 2 & 2 & 2 & 3 \\ -1 & -2 & 0 & 2 & 3\end{pmatrix}$ What will be the $\text{rank(A)}?$ $1$ $2$ $3$ $5$

Let $A=\begin{pmatrix}1 & 2 & 1 & 0 & 0 \\ 1 & 2 & 2 & 2 & 3 \\ -1 & -2 & 0 & 2 & 3\end{pmatrix}$What will be the $\text{rank(A)}?$$1$$2$$3$$5$

717 views

answered Apr 7, 2023

4 answers

8

GO Classes 2024 | Weekly Quiz 7 | Linear Algebra | Question: 6
If $\text{A}$ is a $4 \times 3$ matrix and $\text{A} x=b$ is not solvable for some $b$ and the solutions are not unique when they exist, possible values for the rank of $\text{A}$ are ________ (list all possibilities). $0$ $1$ $2$ $3$

If $\text{A}$ is a $4 \times 3$ matrix and $\text{A} x=b$ is not solvable for some $b$ and the solutions are not unique when they exist, possible values for the rank of $...

1.1k views

commented Apr 7, 2023

4 answers

9

GO Classes CS 2025 | Weekly Quiz 2 | Propositional Logic | Question: 10
In propositional logic if $\left ( P \rightarrow Q \right )\wedge \left ( R \rightarrow S \right )$ and $\left ( P \vee R \right )$ are two premises such that $\begin{array}{c} (P \to Q) \wedge (R \to S) \\ P \vee R \\ \hline Y \\ \hline \end{array}$ $Y$ is the premise : $P \vee R$ $P \vee S$ $Q \vee R$ $Q \vee S$

In propositional logic if $\left ( P \rightarrow Q \right )\wedge \left ( R \rightarrow S \right )$ and $\left ( P \vee R \right )$ are two premises such that$$\begin{arr...

1.1k views

answered Mar 27, 2023

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