The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Subham Nagar
User Subham Nagar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Subham Nagar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
#set theory #groups
Consider the set H of all 3 × 3 matrices of the type: $\begin{bmatrix} a&f&e\\ 0&b&d\\ 0&0&c\\ \end{bmatrix}$ where a, b, c, d, e and f are real numbers and $abc ≠ 0$. Under the matrix multiplication operation, the set H is: (a) a group (b) a monoid but not a group (c) a semigroup but not a monoid (d) neither a group nor a semigroup
commented
Jan 5, 2019
in
Set Theory & Algebra

80
views
settheory&algebra
grouptheory
matrices
0
answers
2
Self Doubt on Counters
If in question it is given to find no. of counting states of a counter, does it mean that we need to find Mod of the counter or just the no. of distinct states that the counter can have?
asked
Jan 2, 2019
in
Digital Logic

38
views
digitalcounter
flipflop
2
answers
3
Test Series
Is 1 a lattice?
answer selected
Jan 1, 2019
in
Set Theory & Algebra

166
views
testseries
lattice
partialorder
discretemathematics
1
answer
4
GO2019FLT126
Consider the two given functions: int fun1(int x, int y) { if (y==0) return 0; return (x+fun2(x, y1)); } int fun2(int x, int y) { if (x==0) return y; return fun2(x1, x+y); } What will be the value returned by $\text{fun1}(4, 4)$ ____
commented
Dec 31, 2018
in
Algorithms

115
views
go2019flt1
numericalanswers
identifyfunction
algorithms
1
answer
5
GO2019FLT125
Consider the function: int fun(int n) { if (n==4) return n; else return 2*fun(n+1); } A MOD16 ripple counter is holding the count $(1001)_2.$ What will be the count after "$(\text{fun}(2)+15)_{10}$" clock pulses? $(1000)_2$ $(1010)_2$ $(1011)_2$ $(1101)_2$
answered
Dec 31, 2018
in
Digital Logic

177
views
go2019flt1
digitallogic
ripplecounteroperation
1
answer
6
GO2019FLT19
The speed of a bus during the second hour of the journey is twice that in the first hour. Also, its speed in the third hour is twothird the sum of its speeds in the first two hours. Had the bus travelled for three hours at the speed of the first hour, it would have ... speed of the bus for the first three hours. $100 \text{kmph}$ $80 \text{kmph}$ $70 \text{kmph}$ $60 \text{kmph}$
commented
Dec 31, 2018
in
Numerical Ability

145
views
go2019flt1
speedtimedistance
numericalability
1
answer
7
GO2019FLT17
If $a/b=c/d$, then which of the following does not hold good? $(a+b)/b=(c+d)/d$ $(a+c)/(b+d)=(ac)/(bd)$ $(a+b)/(ab)=(c+d)/(cd)$ $(a+c)/(bd)=(ac)(b+d)$
commented
Dec 31, 2018
in
Numerical Ability

120
views
go2019flt1
numericalability
0
answers
8
Worksheet
GO BACK 4 We have to send 9 packet,out of which every 5th packet get lost ,using window size 4 what will number of packet transmitted ? Answer 21 or 23
commented
Dec 23, 2018
in
Computer Networks

19
views
2
answers
9
Memory Heirarchy Doubt
Consider a single level cache with an access time of 2.5ns with a block size of 64 bytes. Main Memory uses a block transfer capability that has a first word (4 bytes) access time of 50ns and an access time of 5ns for each word ... to consider a Strict memory hierarchy method or Parallel accessing method in Solving these types of questions? By Default which way is followed?
commented
Dec 22, 2018
in
CO and Architecture

92
views
coandarchitecture
effectivememoryaccess
cachememory
0
answers
10
Keneth Rosen
Determine whether each of these statements is true or false. 0 ∈ ∅ ∅ ∈ {0} {0} ⊂ ∅ ∅ ⊂ {0} {0} ∈ {0} {0} ⊂ {0} {∅} ⊆ {∅}
commented
Dec 22, 2018
in
Set Theory & Algebra

42
views
0
answers
11
GAte zeal module
Find a positive integer n such that given any set N with sizeN=n, then the number of reflexive relations on N is equal to number of symmetric relations on N______? i am getting n=3, please check
commented
Dec 21, 2018
in
Set Theory & Algebra

60
views
relations
0
answers
12
MadeEasy Test Series: Computer Networks  Flow Control Methods
Assume 2 computers are connected via a network. The network uses GoBack 7 sliding window protocol for maintaining flow control. It is observed that every 5th packet that has been sent through the network is lost. ... number of extra packets that has to be resent for transmitting 10 such packet through the network? With explanation.
commented
Dec 17, 2018
in
Computer Networks

378
views
madeeasytestseries
computernetworks
flowcontrolmethods
gobackn
1
answer
13
Zeal Test Series 2019: Programming & DS  Programming In C
The value of z after the execution of the following program is void f(int x) { staticint z; z=z+x; } int main() { int y=10; fork(); fork(); f(y); return 0; } 1.30 2.20 3.40 4. 10
comment edited
Dec 16, 2018
in
Programming

133
views
zeal
programming
programminginc
zeal2019
1
answer
14
B+ tree doubt
Consider a B+ tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a nonroot node? What will be the same in a BTree Please also refer the source from where clearcut formulae are given
asked
Dec 15, 2018
in
Databases

94
views
btree
databases
1
answer
15
made easy test series
answer edited
Dec 11, 2018
in
Compiler Design

48
views
3
answers
16
TIFR2019B2
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ? $8$ $16$ $32$ $64$ None of the above
commented
Dec 9, 2018
in
Algorithms

408
views
tifr2019
algorithms
minimumspanningtrees
0
answers
17
ACE Test Series
In FCFS CPU Scheduling, when a process with a long Burst Time occupies the CPU, which of the following is said to occur: Convoy Effect Starvation Logically speaking, it should be Starvation as other processes would have to wait for a long time. I just want a confirmation as the answer given is Convoy Effect.
edited
Dec 5, 2018
in
Operating System

58
views
operatingsystem
0
answers
18
TLB Effective Access Time
commented
Nov 28, 2018
in
CO and Architecture

336
views
tlb
1
answer
19
Computer Networks
Suppose a TCP message of 2000 bytes of data and 20 bytes of TCP header is passed to the IP layer. Suppose this host is connected to a link with an MTU size of 512 Bytes. What is the total length of the last IP fragment? Express in bytes. What is the value of the offset field in the last fragment?
commented
Nov 27, 2018
in
Computer Networks

134
views
computernetworks
tcp
ip
1
answer
20
gate zeal test TOC
Which of the following statements are true ? If A is a nonregular language and B is a infinite language such that B $\subseteq$ ... iii and iv only (c) i, iii and iv only (d) All please discuss the last two statements( i am not getting it ) iii,iv
commented
Nov 25, 2018
in
Theory of Computation

73
views
nonregular
0
answers
21
Interview
Is the 3 year M.Tech RA (January, sponsored) in IIT HYDERABAD course recently implemented? If anyone can give a review as I have been shortlisted for interview to be held on 26th November but i am not sure to attend or not
asked
Nov 20, 2018
in
Others

119
views
interview
admissions
mtech
1
answer
22
Application Layer
Is SMTP connectionoriented or connectionless ?
asked
Nov 13, 2018
in
Computer Networks

96
views
applicationlayerprotocols
1
answer
23
Test Series
What will be the minimum no. of states for DFA for the above NFA? Please explain.
asked
Sep 23, 2018
in
Theory of Computation

50
views
#dfa
minimalstateautomata
0
answers
24
#Gate2016Question
https://gateoverflow.in/39700/gate2016146 In this question, there is a 4th option named "Syntax Error". So in such questions when do syntax error occurs? Is it related to grammar or something else?
asked
Sep 15, 2018
in
Compiler Design

77
views
gateoverflow
syntaxdirectedtranslation
4
answers
25
Context Free Language
L= { $a^{n}b^{m}$  $n<=m<=2n$ } a) DCFL b) CFL but not DCFL c) Not CFL
answer selected
Aug 20, 2018
in
Theory of Computation

211
views
contextfreelanguages
theoryofcomputation
grammar
1
answer
26
CSMA/CD with and without Collision
A network with CSMA/CD protocol in the MAC layer is running at 1 Gbps over a 1 km cable with no repeaters. The signal speed in the cable is 2 x 108 m/sec. The frame size for this network 10000 bits what is the total time requires to send this frame completely: 1) when there is no collision in the channel. 2) when there is collision in the channel.
commented
Aug 9, 2018
in
Computer Networks

261
views
computernetworks
csmacd
ethernet
1
answer
27
OS#paging
commented
Aug 3, 2018
in
Operating System

21
views
3
answers
28
Test Series
Examine the structure of the EMPLOYEES table: EMPLOYEE_ID NUMBER Primary Key FIRST_NAME VARCHAR2(25) LAST_NAME VARCHAR2(25) Assume all the following four options are executed in the same sequence order. Which statement will not insert a row into the table? a. INSERT ... (employee_id) VALUES (1000); d. INSERT INTO employees (employee_id, first_name, last_name) VALUES ( 1000, John', ');
commented
Aug 1, 2018
in
Databases

192
views
sql
databases
relations
2
answers
29
DRDO 2008
What is the maximum possible height of an AVL tree with 20 nodes?
answered
Jul 25, 2018
in
DS

147
views
2
answers
30
self doubt
(11+1111)* minimized number of states ???
answered
Jul 25, 2018
in
Theory of Computation

53
views
theoryofcomputation
1
answer
31
self doubt
Given a pointer to a node to be deleted what is the time complexity to delete a node in the circular linked list : i think answer is O(1). Am i right?
commented
Jul 22, 2018
in
Programming

37
views
algorithms
3
answers
32
Masters theorem
Solve using Master's Theorem $T(n)=T(n/2)+$ 2n
commented
Jul 16, 2018
in
Algorithms

123
views
mastertheorem
algorithms
timecomplexity
2
answers
33
C programming
int func(int n) { if(n<3) return 1; else return func(n1)+func(n3)+1; } How many invocations for calculating func(func(5))
commented
Jul 11, 2018
in
Programming

284
views
programminginc
recursion
1
answer
34
#Test series
L = {ai bj ck dm}  i+j+k+m is multiple of 13} L is ? (a) Regular (b) Contextfree (c) Turingdecidable (d) TuringRecognizable
commented
Jul 10, 2018
in
Theory of Computation

121
views
2
answers
35
Entity relationship
Minimum number of tables required and explain how
answered
Jun 21, 2018
in
Databases

48
views
3
answers
36
MadeEasy Test Series: CO & Architecture  Pipelining
The instruction pipeline of RISC processor has 200 instructions in which 100 are performing addition, 25 performing division and 75 performing multiplications, where Execution state for addition take 1 clock cycle,multiplication take 3 and division ... +51)*3 Am i doing wrong? Solution with explanation of formulae being used will be welcomed.
commented
Jun 9, 2018
in
CO and Architecture

632
views
madeeasytestseries
coandarchitecture
pipelining
2
answers
37
SelfDoubt
What will be the solution of the following recurrence? $T(n)=3T\sqrt{n}+\log(n)$
commented
Jun 8, 2018
in
Algorithms

153
views
algorithms
recurrence
1
answer
38
Test Series
As all recursive languages are recursively enumerable languages, they also should be Turing Recognizable together with Turing Decidable. This was my logic behind marking the 4th option which says all of the mentioned statements are true. Correct me if I am wrong
asked
Jun 5, 2018
in
Theory of Computation

86
views
theoryofcomputation
2
answers
39
pipelining
A CPU has fivestage pipeline where each stage takes $1\hspace{0.1cm}ns$, $2\hspace{0.1cm}ns$, $1.5\hspace{0.1cm} ns$, $3\hspace{0.1cm}ns$, $2.5\hspace{0.1cm} ns$. Instruction fetch happens in the first stage of the pipeline. ... one clock cycle. $30\%$ of the instructions are conditional branches. Find the average execution time of the program for $1200$ instructions is ________.
commented
Jun 2, 2018
in
CO and Architecture

340
views
coandarchitecture
pipelining
1
answer
40
Made easy test
commented
May 22, 2018
in
Theory of Computation

72
views
50,741
questions
57,244
answers
198,020
comments
104,614
users