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 G.K.T
1
votes
1
SPEEDUP CPI
. A program running on a non-pipelined processor executes 15% load instructions (5 cycles), 20% store instructions (4 cycles), 15% branch instructions (3 cycles) and 50% ALU instructions (4 cycles). What is the CPI? Now we execute this program on a ... write) in one cycle, ignoring data and control hazards (only consider structural hazards). What is the speedup over the previous one?
. A program running on a non-pipelined processor executes 15% load instructions (5 cycles), 20% store instructions (4 cycles), 15% branch instructions (3 cycles) and 50%...
1.3k
views
answered
Oct 3, 2017
CO and Architecture
cpi
speedup
+
–
1
votes
2
er diagram
model----> make make----->model both none
model makemake ->modelbothnone
567
views
answered
Sep 11, 2017
Databases
databases
er-diagram
+
–
0
votes
3
confusion in key and FD
can i say A is a key here , here elements of A repeating , i read primary key should be unique , what about otherr
can i say A is a key here , here elements of A repeating , i read primary key should be unique , what about otherr
247
views
answered
Sep 9, 2017
0
votes
4
can we say that 3n+2=O(-n)?
If f(n)=3n+2 then we can say that 3n+2<=(-4)(-n) .Can constant be negative in asymptotic notation?
If f(n)=3n+2 then we can say that 3n+2<=(-4)(-n) .Can constant be negative in asymptotic notation?
1.8k
views
answered
Sep 8, 2017
Algorithms
algorithms
asymptotic-notation
+
–
2
votes
5
doubt . which statement is accurate ?
cardinality of sets is number of elements in set -- wikipedia but in many sites they wrote cardinality is no. of DISTINCT elements in the set ? which is correct
cardinality of sets is number of elements in set wikipediabut in many sites they wrote cardinality is no. of DISTINCT elements in the set ?which is correct
234
views
answered
Sep 7, 2017
0
votes
6
doubts
I am not getting the question
I am not getting the question
283
views
answered
Sep 6, 2017
Theory of Computation
theory-of-computation
+
–
1
votes
7
Set theory doubt
Say if A is proper subset of B i.e A⊂B then is it true - that B⊆A (B is subset of A)? Also one more thing - if A⊂B then AUB = A where U means UNION
Say if A is proper subset of B i.e A⊂B then is it true - that B⊆A (B is subset of A)?Also one more thing - if A⊂B then AUB = A where U means UNION
788
views
answered
Sep 5, 2017
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
set-theory
+
–
1
votes
8
cache memory
when 8-way set associative mapping of cache memory is done and main memory size is 32 GB and Tag field has 10 bits. what will be the cache size ( consider, memory is byte addresable )
when 8-way set associative mapping of cache memory is done and main memory size is 32 GB and Tag field has 10 bits. what will be the cache size ( consider, memory is byt...
3.2k
views
answered
Sep 4, 2017
CO and Architecture
co-and-architecture
cache-memory
+
–
0
votes
9
MDFA.
Consider the following NFA Number of states in the equivalent minimal DFA is_________???? (Note: Count one for the dead state (if required))
Consider the following NFANumber of states in the equivalent minimal DFA is_________????(Note: Count one for the dead state (if required))
571
views
answered
Aug 30, 2017
2
votes
10
#TOC Doubt regarding states
Can NFA has more states or equal states than DFA? Say NFA has n states and DFA has m states then - n>=m possible?
Can NFA has more states or equal states than DFA? Say NFA has n states and DFA has m states then - n>=m possible?
695
views
answered
Aug 21, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
3
votes
11
GATE CSE 1991 | Question: 02-iv
Match the pairs in the following questions by writing the corresponding letters only. ...
Match the pairs in the following questions by writing the corresponding letters only.$$\begin{array}{|c|l|c|l|} \hline A. & \text{The number of distinct binary tree} & P....
5.0k
views
answered
Aug 20, 2017
Combinatory
gate1991
combinatory
normal
match-the-following
+
–
0
votes
12
Two place predicate logic
How to solve these type of question:- ∀x ∀y (x+y = 0) ∀x ∃y (x+y = 0) ∃x ∀y (x+y = 0) ∃x ∃y (x+y = 0) ??
How to solve these type of question:-∀x ∀y (x+y = 0)∀x ∃y (x+y = 0)∃x ∀y (x+y = 0)∃x ∃y (x+y = 0)??
423
views
answered
Jul 23, 2017
Mathematical Logic
mathematical-logic
propositional-logic
two-place-predicate
+
–
1
votes
13
ME test
Which of the following is true? A) If f(n) = O(g(n)) then h(f(n)) = O(h(g(n))) B) If f(n) ≠ O(g(n)) then g(n) = O(f(n)) C) Both A and B D) None
Which of the following is true?A) If f(n) = O(g(n)) then h(f(n)) = O(h(g(n)))B) If f(n) ≠ O(g(n)) then g(n) = O(f(n))C) Both A and BD) None
470
views
answered
Feb 6, 2017
Algorithms
asymptotic-notation
+
–
8
votes
14
Compiler Design(gATE 2010)
GATE 2010 Question The grammar S→aSa∣bS∣c is LL(1) but not LR(1) LR(1) but not LL(1) Both LL(1) and LR(1) Neither LL(1) nor LR(1) I have 2 small doubt First Doubt:-If a grammer is LL(1) then it is always LR(0) ? Is there any grammer which is LL( ... ,LL(1) LR(0) SLR(1) LALR(1) CLR(1).So what is the difference between LR(0) AND LR(1) and which one is more powerfull ?
GATE 2010 QuestionThe grammar S→aSa∣bS∣c is LL(1) but not LR(1)LR(1) but not LL(1)Both LL(1) and LR(1)Neither LL(1) nor LR(1)I have 2 small doubtFirst Doubt:-If a g...
2.4k
views
answered
Jan 30, 2017
Compiler Design
compiler-design
parsing
+
–
0
votes
15
Programming In C
Question Consider the following C-program void foo (int n, int sum) { int k = 0, j = 0; if (n = = 0) return; k = n% 10; j = n/10; sum = sum + k; foo (j, sum); printf ( %d , k); } int main ( ) { int a = 2048, sum = 0; foo (a, sum); printf ( %d/n , sum); } ... above program print? A 8, 4, 0, 2, 14 B 8, 4, 0, 2, 0 C 2, 0, 4, 8, 14 D 2, 0, 4, 8, 0 Please give step by step explanation?
Question Consider the following C-program void foo (int n, int sum) { int k = 0, j = 0; if (n = = 0) return; k = n% 10; j = n/10; sum = sum + k; foo (j, sum); printf (“...
897
views
answered
Jan 24, 2017
4
votes
16
output
#include <stdio.h> void f(int x,int *p) { *p=x; x=10; } int main() { int a=5,b=6; int *p=&a,**q; *p=20; q=&p; f(a,&b); *q=&b; *p=30; printf("%d",b); } How the answer is 30 I am getting 20?
#include <stdio.h>void f(int x,int *p){ *p=x; x=10;}int main(){ int a=5,b=6; int *p=&a, q; *p=20; q=&p; f(a,&b); *q=&b; *p=30; printf("%d",b...
1.2k
views
answered
Jan 24, 2017
0
votes
17
UGC NET CSE | August 2016 | Part 2 | Question: 6
The octal number $326.4$ is equivalent to $(214.2)_{10}$ and $(D6.8)_{16}$ $(212.5)_{10}$ and $(D6.8)_{16}$ $(214.5)_{10}$ and $(D6.8)_{16}$ $(214.5)_{10}$ and $(D6.4)_{16}$
The octal number $326.4$ is equivalent to$(214.2)_{10}$ and $(D6.8)_{16}$$(212.5)_{10}$ and $(D6.8)_{16}$ $(214.5)_{10}$ and $(D6.8)_{16}$ $(214.5)_{10}$ and $(D6.4)_{16}...
2.5k
views
answered
Sep 23, 2016
Digital Logic
ugcnetcse-aug2016-paper2
digital-logic
number-representation
+
–
2
votes
18
UGC NET CSE | August 2016 | Part 2 | Question: 4
What is the probability that a randomly selected bit string of length 10 is a palindrome ? $\frac{1}{64}$ $\frac{1}{32}$ $\frac{1}{8}$ $\frac{1}{4}$
What is the probability that a randomly selected bit string of length 10 is a palindrome ?$\frac{1}{64}$$\frac{1}{32}$$\frac{1}{8}$$\frac{1}{4}$
2.4k
views
answered
Sep 23, 2016
Probability
ugcnetcse-aug2016-paper2
probability
+
–
0
votes
19
ISRO2008-76
The minimum number of fields with each node of doubly linked list is 1 2 3 4
The minimum number of fields with each node of doubly linked list is1234
19.7k
views
answered
Apr 12, 2016
DS
isro2008
data-structures
linked-list
+
–
12
votes
20
GATE2012 AR: GA-8
Ravi is taller than Arun but shorter than Iqbal. Sam is shorter than Ravi. Mohan is shorter than Arun. Balu is taller than Mohan and Sam. The tallest person can be Mohan Ravi Balu Arun
Ravi is taller than Arun but shorter than Iqbal. Sam is shorter than Ravi. Mohan is shorter than Arun. Balu is taller than Mohan and Sam. The tallest person can beMohanRa...
2.7k
views
answered
Feb 16, 2016
Analytical Aptitude
gate2012-ar
logical-reasoning
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register