Recent activity by aiyyar.aarushi / GATE Overflow for GATE CSE

1 answer

1

ISI2015-MMA-61
Let $ A = \begin{pmatrix} 1 & 1 & 1 \\ 1 & 2 & 2 \\ 1 & 2 & 3 \end{pmatrix} \text{ and } B=\begin{pmatrix} 1 & 0 & 0 \\ 1 & 1 & 0 \\ 1 & 1 & 1 \end{pmatrix}.$ Then there exists a matrix $C$ ... no matrix $C$ such that $A=BC$ there exists a matrix $C$ such that $A=BC$, but $A \neq CB$ there is no matrix $C$ such that $A=CB$

Let $$ A = \begin{pmatrix} 1 & 1 & 1 \\ 1 & 2 & 2 \\ 1 & 2 & 3 \end{pmatrix} \text{ and } B=\begin{pmatrix} 1 & 0 & 0 \\ 1 & 1 & 0 \\ 1 & 1 & 1 \end{pmatrix}.$$ Thenther...

586 views

commented Dec 17, 2019

1 answer

2

ISI2014-DCG-38
Suppose that $A$ is a $3 \times 3$ real matrix such that for each $u=(u_1, u_2, u_3)’ \in \mathbb{R}^3, \: u’Au=0$ where $u’$ stands for the transpose of $u$. Then which one of the following is true? $A’=-A$ $A’=A$ $AA’=I$ None of these

Suppose that $A$ is a $3 \times 3$ real matrix such that for each $u=(u_1, u_2, u_3)’ \in \mathbb{R}^3, \: u’Au=0$ where $u’$ stands for the transpose of $u$. Then ...

548 views

answered Dec 16, 2019

4 answers

3

Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 14 (Page No. 82)
A computer has a pipeline with four stages. Each stage takes the same time to do its work, namely, $1$ nsec. How many instructions per second can this machine execute?

A computer has a pipeline with four stages. Each stage takes the same time to do its work, namely, $1$ nsec. How many instructions per second can this machine execute?

1.7k views

answered Dec 10, 2019

3 answers

4

GATE CSE 1994 | Question: 13
Consider the following relational schema: COURSES (cno, cname) STUDENTS (rollno, sname, age, year) REGISTERED_FOR (cno, rollno) The underlined attributes indicate the primary keys for the relations. The year' attribute for the STUDENTS relation indicates the year in ... for cno $322.$ Write a SQL query to print the age and year of the youngest student in each year.

Consider the following relational schema:COURSES (cno, cname)STUDENTS (rollno, sname, age, year)REGISTERED_FOR (cno, rollno)The underlined attributes indicate the primary...

6.4k views

commented Dec 9, 2019

6 answers

5

GATE CSE 2003 | Question: 39
Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows: $g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$. Let $p_i$ denote the i-th prime number $\left(p_1 = 2\right)$ ... numbers is the encoding, $h$, of a non-empty sequence of strings? $2^73^75^7$ $2^83^85^8$ $2^93^95^9$ $2^{10}3^{10}5^{10}$

Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows:$g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$.Let $p_i$ denote t...

7.6k views

answered Jan 5, 2019

5 answers

6

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.6k views

answered Nov 29, 2018

4 answers

7

GATE CSE 2003 | Question: 54
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable

Define languages $L_0$ and $L_1$ as follows :$L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $$L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts o...

24.2k views

commented Nov 19, 2018

7 answers

8

UGC NET CSE | January 2017 | Part 3 | Question: 21
Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is ... and (ii) are true (i) is true, (ii) is false (i) is false, (ii) is true

Given the following statements:A class of languages that is closed under union and complementation has to be closed under intersectionA class of languages that is closed ...

2.7k views

answered Nov 17, 2018

3 answers

9

Finite Automata
There are exactly ______different finite automata with 3 states x,y,and z over the alphabet {a,b} where x is always the start state 1)64 2) 256 3) 1024 4)5832

There are exactly ______different finite automata with 3 states x,y,and z over the alphabet {a,b} where x is always the start state1)64 2) 256 3) 1024 4)5832

3.2k views

answered Nov 16, 2018

2 answers

10

the possible no of dfa with three states
Q The possible no of dfa with three states X,Y and Z, where X being always initial state for the DFA over the alphabet {0,1} a)5830 b)5831 c)5832 d)5932 correct answer is option C,but what is the systematic way to get it??

QThe possible no of dfa with three states X,Y and Z, where X being always initial state for the DFA over the alphabet {0,1}a)5830b)5831c)5832d)5932correct answer is optio...

7.8k views

commented Nov 16, 2018

2 answers

11

UGC NET CSE | August 2016 | Part 2 | Question: 35
Which of the following is FALSE ? The grammar $S \rightarrow aS|aSbS|\in$, where $S$ is the only non-terminal symbol, and $\in$ is the null string, is ambiguous. An unambiguous grammar has same left most and right most derivation. An ambiguous grammar can never be $LR(k)$ for any $k$. Recursive descent parser is a top-down parser.

Which of the following is FALSE ?The grammar $S \rightarrow aS|aSbS|\in$, where $S$ is the only non-terminal symbol, and $\in$ is the null string, is ambiguous.An unambig...

2.6k views

answered Nov 15, 2018

6 answers

12

GATE CSE 2018 | Question: GA-10
A six sided unbiased die with four green faces and two red faces is rolled seven times. Which of the following combinations is the most likely outcome of the experiment? Three green faces and four red faces. Four green faces and three red faces. Five green faces and two red faces. Six green faces and one red face

A six sided unbiased die with four green faces and two red faces is rolled seven times. Which of the following combinations is the most likely outcome of the experiment?T...

14.9k views

commented Oct 31, 2018

5 answers

13

GATE CSE 2003 | Question: 29, ISRO2009-73
Which of the following scenarios may lead to an irrecoverable error in a database system? A transaction writes a data item after it is read by an uncommitted transaction A transaction reads a data item after it is read by an ... it is written by a committed transaction A transaction reads a data item after it is written by an uncommitted transaction

Which of the following scenarios may lead to an irrecoverable error in a database system?A transaction writes a data item after it is read by an uncommitted transactionA ...

14.8k views

commented Oct 22, 2018

11 answers

14

GATE CSE 2001 | Question: 2.13
Consider the following data path of a simple non-pipelined CPU. The registers $A, B$, $A_{1},A_{2}, \textsf{MDR},$ the $\textsf{bus}$ and the $\textsf{ALU}$ are $8$-$bit$ wide. $\textsf{SP}$ and $\textsf{MAR}$ are $16$-$bit$ registers. The ... $\textsf{CPU}$ clock cycles are required to execute the "push r" instruction? $2$ $3$ $4$ $5$

Consider the following data path of a simple non-pipelined CPU. The registers $A, B$, $A_{1},A_{2}, \textsf{MDR},$ the $\textsf{bus}$ and the $\textsf{ALU}$ are $8$-$bit$...

21.2k views

commented Oct 9, 2018

2 answers

15

GATE CSE 2008 | Question: 36
Which of the following are NOT true in a pipelined processor? Bypassing can handle all RAW hazards Register renaming can eliminate all register carried WAR hazards Control hazard penalties can be eliminated by dynamic branch prediction I and II only I and III only II and III only I, II and III

Which of the following are NOT true in a pipelined processor?Bypassing can handle all RAW hazardsRegister renaming can eliminate all register carried WAR hazardsControl h...

22.1k views

commented Oct 7, 2018

1 answer

16

Linked List
What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the number of nodes in linked list, you may assume that n > 8. (A) O(1) and O(n) (B) O(1) and O(1) (C) O(n) and O(1) (D) O(n) and O(n)

What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list?Let n be the number of nodes in linked list, you may...

11.8k views

commented Apr 29, 2017

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