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
Recent activity by aik138463
2
answers
1
subnetting
is 255.255.255.52 a valid subnet mask? if yes then what is the no. of subnets?
is 255.255.255.52 a valid subnet mask? if yes then what is the no. of subnets?
816
views
answered
Apr 16, 2018
Computer Networks
subnetting
+
–
4
answers
2
GATE CSE 2018 | Question: 41
Consider the relations $r(A, B)$ and $s(B, C)$, where $s.B$ is a primary key and $r.B$ is a foreign key referencing $s.B$. Consider the query $Q: r \bowtie (\sigma_{B<5} (s))$ Let LOJ denote the natural left outer-join operation. Assume that $r$ and $s$ contain no null ... $r \: LOJ \: (\sigma_{B<5} (s))$ $\sigma_{B<5} (r) \: LOJ \: s$
Consider the relations $r(A, B)$ and $s(B, C)$, where $s.B$ is a primary key and $r.B$ is a foreign key referencing $s.B$. Consider the query$Q: r \bowtie (\sigma_{B<5} (...
15.7k
views
commented
Apr 8, 2018
Databases
gatecse-2018
databases
relational-algebra
normal
2-marks
+
–
8
answers
3
GATE CSE 2018 | Question: 50
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$ and Writeback $(WB)$, The $IF$, $ID$, $OF$ and $WB$ ... no data hazards and no control hazards. The number of clock cycles required for completion of execution of the sequence of instruction is _____.
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$...
24.0k
views
commented
Apr 7, 2018
CO and Architecture
gatecse-2018
co-and-architecture
pipelining
numerical-answers
2-marks
+
–
5
answers
4
GATE CSE 2018 | Question: 11
In an Entity-Relationship (ER) model, suppose $R$ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in $R$ and that the cardinality of E1 is greater than the cardinality of E2. Which ... Every entity in E2 is associated with exactly one entity in E1 Every entity in E2 is associated with at most one entity in E1
In an Entity-Relationship (ER) model, suppose $R$ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in $R$ and ...
28.0k
views
commented
Apr 6, 2018
Databases
gatecse-2018
databases
er-diagram
normal
1-mark
+
–
1
answer
5
COAP 2017
How successful was COAP 2017?
How successful was COAP 2017?
1.5k
views
answered
Apr 3, 2018
IISc/IITs
coap
gate2017
general
+
–
9
answers
6
GATE CSE 2018 | Question: 35
Consider the following languages: $\{a^mb^nc^pd^q \mid m+p=n+q, \text{ where } m, n, p, q \geq 0 \}$ $\{a^mb^nc^pd^q \mid m=n \text{ and }p=q, \text{ where } m, n, p, q \geq 0 \}$ ... Which of the above languages are context-free? I and IV only I and II only II and III only II and IV only
Consider the following languages:$\{a^mb^nc^pd^q \mid m+p=n+q, \text{ where } m, n, p, q \geq 0 \}$$\{a^mb^nc^pd^q \mid m=n \text{ and }p=q, \text{ where } m, n, p, q \ge...
21.3k
views
commented
Apr 1, 2018
Theory of Computation
gatecse-2018
theory-of-computation
identify-class-language
context-free-language
normal
2-marks
+
–
2
answers
7
gate 2018
do anyone has complete exam paper ??? i am not able to get complete question paper of computer science gate paper............ please share a link although gate forum has uploaded the paper but it is not complete .............
do anyone has complete exam paper ???i am not able to get complete question paper of computer science gate paper............please share a linkalthough gate forum has upl...
8.2k
views
answer edited
Feb 15, 2018
2
answers
8
Ace Test Series: Databases - Functional Dependencies
Find what FD is violated by the Relation R = { } i.e. empty relation a. All FD b. Does not violate FD's c. Cannot say d. None of the Above
Find what FD is violated by the Relation R = { } i.e. empty relationa. All FDb. Does not violate FD'sc. Cannot sayd. None of the Above
1.2k
views
commented
Oct 19, 2017
Databases
ace-test-series
databases
database-normalization
+
–
2
answers
9
ace mock test
Is this solution wrong?
Is this solution wrong?
605
views
answered
Sep 7, 2017
1
answer
10
Admission to premier institutes
Hi, My BE final year percentage was 56%. My BE aggregate is around 54%. Im aware that I have no chance in getting admissions to IITs. But IISc has 2nd class(BE aggregate) as their eligibility criteria. Do I qualify for IISc for the following: ... get an interview call? Is there any other premier institute I can apply to(assuming a very good GATE rank). rgds, Poorva
Hi, My BE final year percentage was 56%. My BE aggregate is around 54%. Im aware that I have no chance in getting admissions to IITs. But IISc has 2nd class(BE aggrega...
298
views
answered
Jul 5, 2017
12
answers
11
GATE CSE 2016 Set 1 | Question: 41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Simi...
35.0k
views
answered
Jul 5, 2017
DS
gatecse-2016-set1
data-structures
queue
difficult
numerical-answers
+
–
2
answers
12
theory of computtion
find regular expression of 1. S-> 01A/10B A->0B/1 B->1A/0 and 2. A->A00 /A1/0 3. S->baS/aA A->bbA/bb
find regular expression of1.S- 01A/10BA->0B/1B->1A/0and2.A->A00 /A1/0 3.S->baS/aAA->bbA/bb
497
views
answered
Jun 26, 2017
Theory of Computation
regular-expression
grammar
+
–
1
answer
13
Regular language
L= {(ap)* | p is a prime number} is this regular? if yes, then how?
L= {(ap)* | p is a prime number} is this regular? if yes, then how?
745
views
commented
Jun 17, 2017
1
answer
14
complexity
491
views
commented
Jun 17, 2017
Algorithms
time-complexity
+
–
1
answer
15
Language which is not a CSL but can be accepted by TM
Can anyone give me an example of a language which is not a CSL but can be accepted using a Halting TM?
Can anyone give me an example of a language which is not a CSL but can be accepted using a Halting TM?
1.6k
views
answered
Jun 16, 2017
Theory of Computation
theory-of-computation
context-free-language
pushdown-automata
context-sensitive
recursive-and-recursively-enumerable-languages
turing-machine
+
–
1
answer
16
Operator Precedence
E → E + E | E * E | ( E ) | id What will be operator precedence for above grammar.Is precedence differs due to ambiguity
E → E + E | E * E | ( E ) | idWhat will be operator precedence for above grammar.Is precedence differs due to ambiguity
500
views
commented
Jun 7, 2017
Compiler Design
compiler-design
operator-grammar
operator-precedence
ambiguous-grammar
descriptive
+
–
1
answer
17
This problem is related to Rule of inference and valid argument .
premises are - A A → ( B ∨ C ) B → ¬A conclusion - C is valid or not ?
premises are -AA → ( B ∨ C )B → ¬Aconclusion -C is valid or not ?
1.7k
views
comment reshown
Jun 4, 2017
Mathematical Logic
mathematical-logic
discrete-mathematics
propositional-logic
+
–
1
answer
18
#time-complexity#daa
What will be time complexity for the following algo where n is a Prime number? main() { for(i=1; i<=n; i=2*i) for(j=1; j<=n; j++) { if(n%i == 0) while(k<=n) { a=b+c k=k+1 } } }
What will be time complexity for the following algo where n is a Prime number?main(){for(i=1; i<=n; i=2*i) for(j=1; j<=n; j++) { if(n%i == 0) while(k<=n...
302
views
answered
Jun 3, 2017
Algorithms
time-complexity
+
–
3
answers
19
programming
for(i=n/2;i<=n;i++) how many times will this loop be executed..?
for(i=n/2;i<=n;i++) how many times will this loop be executed..?
280
views
answered
Jun 3, 2017
1
answer
20
oop c++
Consider a pointer declaration int i=10,*p; p=&x; Is p – – ; a valid statement, justify? explain in as simple way as possible.
Consider a pointer declaration int i=10,*p; p=&x;Is p – – ; a valid statement, justify? explain in as simple way as possible.
271
views
answered
May 27, 2017
Programming in C
programming-in-c
+
–
2
answers
21
Ds-tree
Given numbers from 1 to 8. Number 5 is the root of BST.How many number of BST are possible with given constraint.
Given numbers from 1 to 8. Number 5 is the root of BST.How many number of BST are possible with given constraint.
324
views
answer edited
May 27, 2017
2
answers
22
Madeeasy test series
The number of Binary Tree's with 4 nodes (1,2,3,4) where in every Binary Search tree '1' is leaf node are ________________.
The number of Binary Tree's with 4 nodes (1,2,3,4) where in every Binary Search tree '1' is leaf node are ________________.
1.1k
views
answered
May 25, 2017
2
answers
23
regular expression
write the regular expression for the given language L= { W | NO OF a mod 2= 1} (odd no of a's )
write the regular expression for the given language L= { W | NO OF a mod 2= 1} (odd no of a's )
1.2k
views
commented
May 19, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
3
answers
24
Semaphore
Is it's possible for two process to execute P(s) and V(s) operation at the same time on a semaphore variable 's' , means if one process executed p(s) and at the same time another process executed v(s) simultaneously on the same semaphore variable ??
Is it's possible for two process to execute P(s) and V(s) operation at the same time on a semaphore variable 's' , means if one process executed p(s) and at the same time...
441
views
answered
May 19, 2017
1
answer
25
Non CS student requesting for tips!!
I am from non cs background and would like to prepare for gate cs so what subjects should be done first for a good foundation for advanced subjects?
I am from non cs background and would like to prepare for gate cs so what subjects should be done first for a good foundation for advanced subjects?
1.2k
views
answered
May 11, 2017
2
answers
26
#newgradiance #dbms #sql #joins Q2
Here are three relations, R(a,b), S(a,b), and T(a,b). Their current values are: R S T a b 0 0 0 1 1 0 1 1 a b 0 0 0 1 1 0 1 1 a b 0 0 0 1 1 0 1 1 Compute the result of the query: SELECT R.a, R.b, S.b, T.b FROM R, S, T WHERE R.b = S ... times it appears. a) (1,0,0,1) appears once. b) (0,0,1,1) appears twice. c) (0,1,1,1) does not appear. d) (1,1,1,0) appears once.
Here are three relations, R(a,b), S(a,b), and T(a,b). Their current values are:RSTab00011011ab00011011ab00011011Compute the result of the query:SELECT R.a, R.b, S.b, T.b ...
804
views
answered
May 5, 2017
Databases
newgradiance
databases
sql
joins
+
–
1
answer
27
Question Bank GATE
Find the Odd one Out: Candidate Key Super Key Primary Key Alternate Key
Find the Odd one Out: Candidate KeySuper KeyPrimary KeyAlternate Key
429
views
answered
May 4, 2017
Databases
keys
databases
+
–
1
answer
28
GATE Admissions
What colleges i get through gate? GATE 2017...AIR-777...CSE...General Category
What colleges i get through gate?GATE 2017...AIR-777...CSE...General Category
1.3k
views
commented
Mar 30, 2017
2
answers
29
About admission
Hi i wrote gate 2017 and according to the gateoverflow rank prediction my rank should be in the range 660-670 and i have a normalised rank of 491. I belong to general category. I graduated in 2016 and have got an offer from a service company(3.5 lpa) to join ... i get admission into any old NITs or good IITs for CSE? Will it be wise to decline the offer? Please give me some advice.
Hi i wrote gate 2017 and according to the gateoverflow rank prediction my rank should be in the range 660-670 and i have a normalised rank of 491. I belong to general cat...
709
views
answered
Mar 24, 2017
IISc/IITs
admission-gate2017
+
–
3
answers
30
Asymptotic notations
Is $ (5 - n^3) \in \Omega (n^2) $ ?
Is $ (5 - n^3) \in \Omega (n^2) $ ?
693
views
answered
Mar 17, 2017
Algorithms
asymptotic-notation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register