Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by shikharV
18
votes
1
GATE CSE 2016 Set 1 | Question: 19
Consider the following code segment. x = u - t; y = x * v; x = y + w; y = t - z; y = x * y; The minimum number of total variables required to convert the above code segment to static single assignment form is __________.
Consider the following code segment.x = u - t; y = x * v; x = y + w; y = t - z; y = x * y;The minimum number of total variables required to convert the above code segment...
27.6k
views
answered
Feb 13, 2016
Compiler Design
gatecse-2016-set1
compiler-design
static-single-assignment
normal
numerical-answers
+
–
4
votes
2
GATE CSE 2015 Set 2 | Question: 40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
19.5k
views
answered
Jan 25, 2016
Set Theory & Algebra
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
+
–
9
votes
3
GATE CSE 2015 Set 1 | Question: 52
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
17.2k
views
answered
Jan 24, 2016
Theory of Computation
gatecse-2015-set1
theory-of-computation
finite-automata
easy
numerical-answers
minimal-state-automata
+
–
11
votes
4
GATE CSE 2015 Set 1 | Question: 19
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection? If the sequence number of a segment is $m,$ then the sequence number of the subsequent segment is always ... always less than or equal to the advertised window. III only I and III only I and IV only II and IV only
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection?If the sequence number ...
18.9k
views
answered
Jan 24, 2016
Computer Networks
gatecse-2015-set1
computer-networks
tcp
normal
+
–
35
votes
5
GATE CSE 1999 | Question: 2.19
Arrange the following configuration for CPU in decreasing order of operating speeds: Hard wired control, Vertical microprogramming, Horizontal microprogramming. Hard wired control, Vertical microprogramming, Horizontal microprogramming. Hard ... , Vertical microprogramming, Hard wired control. Vertical microprogramming, Horizontal microprogramming, Hard wired control.
Arrange the following configuration for CPU in decreasing order of operating speeds:Hard wired control, Vertical microprogramming, Horizontal microprogramming.Hard wired ...
7.4k
views
answered
Jan 15, 2016
CO and Architecture
gate1999
co-and-architecture
microprogramming
normal
+
–
3
votes
6
Resource for studying microprogramming
I want to know how much important topic is microprogramming for gate? And what and from where I should prepare for this topic?
I want to know how much important topic is microprogramming for gate? And what and from where I should prepare for this topic?
586
views
answered
Jan 3, 2016
CO and Architecture
co-and-architecture
horizontal
microprogramming
+
–
5
votes
7
GATE CSE 2000 | Question: 1.1
The minimum number of cards to be dealt from an arbitrarily shuffled deck of $52$ cards to guarantee that three cards are from same suit is $3$ $8$ $9$ $12$
The minimum number of cards to be dealt from an arbitrarily shuffled deck of $52$ cards to guarantee that three cards are from same suit is$3$$8$$9$$12$
10.1k
views
answered
Dec 10, 2015
Combinatory
gatecse-2000
easy
pigeonhole-principle
combinatory
+
–
1
votes
8
Calculating total external fragmentation
Please check whether the given explanation is correct or not.
Please check whether the given explanation is correct or not.
7.7k
views
answered
Nov 28, 2015
Operating System
operating-system
memory-management
+
–
6
votes
9
GATE CSE 2003 | Question: 61
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of \(1. . . n\)? \(\frac{n(n-1)}{2}\) \(\frac{n(n-1)}{4}\) \(\frac{n(n+1)}{4}\) \(2n[\log_2n]\)
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i a_j\).If all permutations are equally likel...
22.0k
views
answered
Nov 19, 2015
Algorithms
gatecse-2003
algorithms
sorting
inversion
normal
+
–
1
votes
10
Output of following code
Given answer: 1990 Please explain
Given answer: 1990Please explain
955
views
answered
Nov 18, 2015
Programming in C
programming-in-c
algorithms
+
–
10
votes
11
Understanding Rice theorem
Please share some good resources and questions which can make it easier for me to understand and apply Rice theorem.
Please share some good resources and questions which can make it easier for me to understand and apply Rice theorem.
7.5k
views
answered
Nov 16, 2015
Theory of Computation
theory-of-computation
+
–
35
votes
12
GATE CSE 2004 | Question: 35
Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of these pairs identify a tree uniquely? preorder and postorder inorder and postorder preorder and inorder level order and postorder I only II, III III only IV only
Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of these pairs identify a tree uniquely?preorder and postorderi...
8.9k
views
answered
Nov 15, 2015
DS
gatecse-2004
data-structures
binary-tree
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register