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 Prashant.
12
votes
41
ISRO2017-43
Which of the following UML 2.0 diagrams capture behavioral aspects of a system? Use case diagram, Object diagram, Activity diagram and state machine diagram Use case diagram, Activity diagram and state machine diagram Object diagram, Communication Diagram, Timing diagram and Interaction diagram Object diagram, Composite structure diagram, package diagram and Deployment diagram
Which of the following UML 2.0 diagrams capture behavioral aspects of a system?Use case diagram, Object diagram, Activity diagram and state machine diagramUse case diagra...
6.7k
views
answered
May 8, 2017
Object Oriented Programming
isro2017
object-oriented-programming
non-gate
+
–
5
votes
42
ISRO2017-3
Using Newton-Raphson method, a root correct to 3 decimal places of $x^3 - 3x -5 = 0$ 2.222 2.275 2.279 None of the above
Using Newton-Raphson method, a root correct to 3 decimal places of $x^3 - 3x -5 = 0$2.2222.2752.279None of the above
25.8k
views
answered
May 8, 2017
Numerical Methods
isro2017
newton-raphson
non-gate
+
–
17
votes
43
ISRO2017-62
What will be the output of the following C code? #include <stdio.h> main() { int i; for(i=0;i<5;i++) { int i=10; printf("%d" , i); i++; } return 0; } 10 11 12 13 14 10 10 10 10 10 0 1 2 3 4 Compilation error
What will be the output of the following C code?#include <stdio.h main() { int i; for(i=0;i<5;i++) { int i=10; printf("%d" , i); i++; } return 0; }10 11 12 13 1410 10 10 ...
8.8k
views
answered
May 8, 2017
Programming in C
isro2017
programming-in-c
loop
output
+
–
3
votes
44
Aptitude
The number of positive numbers of not more than 10 digits formed using 0,1,2,3?
The number of positive numbers of not more than 10 digits formed using 0,1,2,3?
422
views
answered
Apr 29, 2017
5
votes
45
UGC NET CSE | December 2011 | Part 2 | Question: 6
A hash table has space for $75$ records, then the probability of collision before the table is $6$% full. $.25$ $.20$ $.35$ $.30$
A hash table has space for $75$ records, then the probability of collision before the table is $6$% full.$.25$$.20$ $.35$$.30$
3.6k
views
answered
Apr 28, 2017
DS
ugcnetcse-dec2011-paper2
data-structures
hashing
+
–
5
votes
46
Cormen
Given an adjacency-list representation of a directed graph, how long does it take to compute the out degree of every vertex? How long does it take to compute in-degrees?
Given an adjacency-list representation of a directed graph, how long does it take to compute the out degree of every vertex? How long does it take to compute in-degrees?
2.6k
views
answered
Apr 28, 2017
Algorithms
graph-algorithms
time-complexity
+
–
45
votes
47
GATE CSE 2017 Set 1 | Question: 04
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt{n}$, $n$ ... $\sqrt{n}$, $\log_{2}n$, $n$ $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
Consider the following functions from positive integers to real numbers:$10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$.The CORRECT arrangement of the above functions...
17.9k
views
answered
Apr 28, 2017
Algorithms
gatecse-2017-set1
algorithms
asymptotic-notation
normal
+
–
3
votes
48
Made Easy test series
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of data set used by "A" A. 32 B. 64 C. 128 D. None of above
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of d...
768
views
answered
Apr 25, 2017
Algorithms
algorithms
merge-sort
made-easy-test-series
+
–
0
votes
49
why this program give "Invalid memory reference" error explain it?
//gcc 5.4.0 #include<stdio.h> int main() { int i=3; float f=3.50,*ptr; float *multy(int ,float); ptr=multy(i,f); printf("\n%u %f",ptr,*ptr); return 0; } float * multy(int ii,float jj) { float p=ii*jj; printf("%u %f",&p,p); return (&p); }
//gcc 5.4.0 #include<stdio.h int main() { int i=3; float f=3.50,*ptr; float *multy(int ,float); ptr=multy(i,f); printf("\n%u %f",ptr,*ptr); return 0; } fl...
2.6k
views
answered
Apr 22, 2017
Programming in C
programming-in-c
+
–
9
votes
50
TOC: empty language and epsilon
What is ∅ U ∅* ? a) ∅ b) ϵ c) Both a and b can be answer d) Neither a nor b
What is ∅ U ∅* ?a) ∅b) ϵc) Both a and b can be answerd) Neither a nor b
2.5k
views
answered
Apr 19, 2017
Theory of Computation
theory-of-computation
+
–
2
votes
51
T(n)=16T(n/4)+n! using the Master Theorem
how do i apply master theorem to this? https://s17.postimg.org/x7xld2nf3/Screenshot_82.png what is P and K here?
how do i apply master theorem to this?https://s17.postimg.org/x7xld2nf3/Screenshot_82.pngwhat is P and K here?
21.4k
views
answered
Apr 18, 2017
Algorithms
algorithms
master-theorem
+
–
7
votes
52
Kenneth Rosen Edition 6th Exercise 5.5 Question 15 (Page No. 380)
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21, where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
How many solutions are there to the equationx1 + x2 + x3 + x4 + x5 = 21,where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
10.1k
views
answered
Apr 14, 2017
Combinatory
discrete-mathematics
kenneth-rosen
combinatory
+
–
3
votes
53
Kenneth Rosen Edition 6th Exercise 5.5 Question 15 (Page No. 380)
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21, where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
How many solutions are there to the equationx1 + x2 + x3 + x4 + x5 = 21,where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
10.1k
views
answered
Apr 14, 2017
Combinatory
discrete-mathematics
kenneth-rosen
combinatory
+
–
4
votes
54
kenneith rosen
At least how many numbers should be selected from the set {1, 5, 9, 13, …125} to be assured that two of the numbers selected have a sum of 146?
At least how many numbers should be selected from the set {1, 5, 9, 13, …125} to be assured that two of the numbers selected have a sum of 146?
661
views
answered
Apr 13, 2017
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
+
–
15
votes
55
GATE CSE 2001 | Question: 1.4
Consider the following two statements: $S_1: \left\{ 0^{2n} \mid n \geq 1 \right\}$ is a regular language $S_2: \left\{0^m1^n0^{m+n} \mid m \geq 1 \text{ and } n \geq 1 \right\}$ is a regular language Which of the following statement is correct? Only $S_1$ is correct Only $S_2$ is correct Both $S_1$ and $S_2$ are correct None of $S_1$ and $S_2$ is correct
Consider the following two statements:$S_1: \left\{ 0^{2n} \mid n \geq 1 \right\}$ is a regular language$S_2: \left\{0^m1^n0^{m+n} \mid m \geq 1 \text{ and } n \geq 1 \ri...
14.8k
views
answered
Apr 13, 2017
Theory of Computation
gatecse-2001
theory-of-computation
easy
regular-language
+
–
4
votes
56
GATE Overflow | Operating Systems | Test 1 | Question: 9
Each process $P_i$, where $i= 1$ to $9$ is coded as follows repeat P (mutex) {critical section } V (mutex) forever The code for $P_{10}$ is identical except that it uses $V$ (mutex) instead of $P$ (mutex) and vice ... number of processes that can be inside the critical section at any moment if initial value of the semaphore is 1? 1 2 3 none
Each process $P_i$, where $i= 1$ to $9$ is coded as follows repeat P (mutex) {critical section } V (mutex) foreverThe code for $P_{10}$ is identical except that it uses ...
917
views
answered
Apr 12, 2017
Operating System
go-os-1
operating-system
process-synchronization
mutex
+
–
2
votes
57
Rosen, Discrete Mathematics ,counting
How many partial functions are there from a set with m elements to a set with n elements, where m and n are positive integers?
How many partial functions are there from a set with m elements to a set with nelements, where m and n are positive integers?
397
views
answered
Apr 11, 2017
2
votes
58
Gatebook Test
A man ate 300 mangoes in 15 days , each day eating two more than the previous day . How many mangoes did he eat on the 3rd day?
A man ate 300 mangoes in 15 days , each day eating two more than the previous day . How many mangoes did he eat on the 3rd day?
574
views
answered
Apr 10, 2017
5
votes
59
GATE CSE 2005 | Question: 80
Consider the following data path of a $\text{CPU}.$ The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including incrementation of the $\text{PC}$ and the $\text{GPRs}$ are to be carried out in ... $2$ $3$ $4$ $5$
Consider the following data path of a $\text{CPU}.$The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including increm...
24.3k
views
answered
Apr 8, 2017
CO and Architecture
co-and-architecture
normal
gatecse-2005
data-path
machine-instruction
+
–
12
votes
60
GATE CSE 2007 | Question: 59
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{studId}},{\text{ courseId}})$ gives which student has enrolled for ... Courses in which a proper subset of female students are enrolled. Courses in which only male students are enrolled. None of the above
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{stu...
20.8k
views
answered
Apr 7, 2017
Databases
gatecse-2007
databases
relational-algebra
normal
+
–
3
votes
61
Average Access time in Memory Organization
Consider a Processor with two Caches which it can access directly in parallel $L_1$(80% hit rate) and $L_2$(90% hit rate) with access times as 100ns and 200ns respectively. In case of miss in any of those it fetches the data from hard disk $L_3$(100% hit rate) which has a latency of 500ns. What is the average access time($T_{avg}$) of the organization?
Consider a Processor with two Caches which it can access directly in parallel $L_1$(80% hit rate) and $L_2$(90% hit rate) with access times as 100ns and 200ns respectivel...
4.3k
views
answered
Apr 5, 2017
CO and Architecture
cache-memory
co-and-architecture
page-fault
+
–
4
votes
62
c language
#include <stdio.h> int main() { int a = 1; int b = 1; int c = a || --b; printf("%d %d",c,b); } Answer is given 1, 1 but i m having doubt in logical OR operator and uninary operator .uni operator having higher precedence then so we firstly decrement the 'b' and then perform OR by which i got output 1,0 where i m wrong plz explain.
#include <stdio.h int main() { int a = 1; int b = 1; int c = a || b; printf("%d %d",c,b); }Answer is given 1, 1 but i m having doubt in logical OR operator and uninary ...
2.9k
views
answered
Apr 4, 2017
2
votes
63
Peter Linz Exercise 8.1
#8 Determine whether or not the following languages are context-free (a) L= { anwwRan : n>=0 , w ∈ {a,b}* } (b) L = { anbjanbj : n>=0, j>=0 } (c) L = { anbjajbn : n>=0, j>=0 } (d) L= { anbjakbl : n+j<=k+l } (e) L = { anbjakbl : n<= ... na(w)=nb(w)=2nc(w) } My answers are : (a)CFL (b)Not CFL (c)CFL (d) CFL (e)Not CFL (f)Not CFL (g) Not CFL Please verify.
#8 Determine whether or not the following languages are context-free(a) L= { anwwRan : n>=0 , w ∈ {a,b}* }(b) L = { anbjanbj : n>=0, j>=0 }(c) L = { anbjajbn : n>=0, j>...
1.8k
views
answered
Apr 3, 2017
Theory of Computation
theory-of-computation
context-free-language
+
–
9
votes
64
GATE CSE 2017 Set 1 | Question: 54
A cache memory unit with capacity of $N$ words and block size of $B$ words is to be designed. If it is designed as a direct mapped cache, the length of the $\textsf{TAG}$ field is $10$ bits. If the cache unit is now designed as a $16$-way set-associative cache, the length of the $\textsf{TAG}$ field is ____________ bits.
A cache memory unit with capacity of $N$ words and block size of $B$ words is to be designed. If it is designed as a direct mapped cache, the length of the $\textsf{TAG}$...
19.7k
views
answered
Apr 3, 2017
CO and Architecture
gatecse-2017-set1
co-and-architecture
cache-memory
normal
numerical-answers
+
–
4
votes
65
ISRO2016-ECE Digital Logic
How many inputs & outputs does a full adder have? $3, 2$ $2, 3$ $3, 3$ $2, 2$
How many inputs & outputs does a full adder have?$3, 2$$2, 3$$3, 3$$2, 2$
533
views
answered
Feb 21, 2017
Digital Logic
isro2016-ece
digital-logic
combinational-circuit
adder
+
–
29
votes
66
GATE CSE 2017 Set 2 | Question: 39
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$ ... $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$-NFA whose transition table is given below:$$\...
28.4k
views
answered
Feb 14, 2017
Theory of Computation
gatecse-2017-set2
theory-of-computation
finite-automata
+
–
32
votes
67
GATE CSE 2017 Set 2 | Question: 41
Let $L(R)$ be the language represented by regular expression $R$. Let $L(G)$ be the language generated by a context free grammar $G$. Let $L(M)$ be the language accepted by a Turing machine $M$. Which of the following decision problems are undecidable? Given a ... string $w$, is $w \in L(M)$? I and IV only II and III only II, III and IV only III and IV only
Let $L(R)$ be the language represented by regular expression $R$. Let $L(G)$ be the language generated by a context free grammar $G$. Let $L(M)$ be the language accepted ...
8.6k
views
answered
Feb 14, 2017
Theory of Computation
gatecse-2017-set2
theory-of-computation
decidability
+
–
11
votes
68
GATE CSE 2017 Set 2 | Question: 53
Consider a machine with a byte addressable main memory of $2^{32}$ bytes divided into blocks of size $32$ bytes. Assume that a direct mapped cache having $512$ cache lines is used with this machine. The size of the tag field in bits is _______
Consider a machine with a byte addressable main memory of $2^{32}$ bytes divided into blocks of size $32$ bytes. Assume that a direct mapped cache having $512$ cache line...
9.5k
views
answered
Feb 14, 2017
CO and Architecture
gatecse-2017-set2
co-and-architecture
cache-memory
numerical-answers
+
–
7
votes
69
GATE CSE 2017 Set 2 | Question: 16
Identify the language generated by the following grammar, where $S$ is the start variable. $ S \rightarrow XY$ $ X \rightarrow aX \mid a$ $ Y \rightarrow aYb \mid \epsilon$ $\{a^mb^n \mid m \geq n, n > 0 \}$ $ \{ a^mb^n \mid m \geq n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n > 0 \}$
Identify the language generated by the following grammar, where $S$ is the start variable.$ S \rightarrow XY$$ X \rightarrow aX \mid a$$ Y \rightarrow aYb \mid \epsilon$$...
18.4k
views
answered
Feb 14, 2017
Theory of Computation
gatecse-2017-set2
theory-of-computation
context-free-language
+
–
5
votes
70
GATE CSE 2017 Set 2 | Question: GA-5
There are $3$ red socks, $4$ green socks and $3$ blue socks.You choose $2$ socks. The probability that they are of the same colour is $\dfrac{1}{5}$ $\dfrac{7}{30}$ $\dfrac{1}{4}$ $\dfrac{4}{15}$
There are $3$ red socks, $4$ green socks and $3$ blue socks.You choose $2$ socks. The probability that they are of the same colour is$\dfrac{1}{5}$ $\dfrac{7}{30}$ $\dfra...
9.0k
views
answered
Feb 14, 2017
Quantitative Aptitude
gatecse-2017-set2
quantitative-aptitude
probability
+
–
Page:
« prev
1
2
3
4
5
6
7
...
21
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register