Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
__
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by __
4
answers
1
GATE CSE 2013 | Question: 51
The procedure given below is required to find and replace certain characters inside an input character string supplied in array $A$. The characters to be replaced are supplied in array $oldc$, while their respective replacement characters are supplied in array $newc$. ... will be successful in exposing the flaw in this procedure? None $2$ only $3$ and $4$ only $4$ only
The procedure given below is required to find and replace certain characters inside an input character string supplied in array $A$. The characters to be replaced are sup...
5.2k
views
commented
Oct 9, 2017
DS
gatecse-2013
data-structures
array
normal
+
–
4
answers
2
C programming
Does C perform array out of bound checking? What is the output of the following program? int main() { int i; int arr[5] = {0}; for (i = 0; i <= 5; i++) printf("%d ", arr[i]); return 0; }
Does C perform array out of bound checking? What is the output of the following program?int main() { int i; int arr[5] = {0}; for (i = 0; i <= 5; i++) printf("%d ", arr[i...
1.6k
views
commented
Oct 9, 2017
Programming in C
programming-in-c
array
+
–
10
answers
3
GATE CSE 2013 | Question: 29
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in each sector is $512$ bytes. Data are organized cylinder-wise and the addressing ... cylinder number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in...
29.8k
views
commented
Oct 4, 2017
Operating System
gatecse-2013
operating-system
disk
normal
+
–
2
answers
4
Test by Bikram | Databases | Test 2 | Question: 30
Consider the following set of relations: EMP (eno, ename , dno) DEPT (dno, dname) Primary key columns are underlined and dno in EMP is a foreign key referring primary key of DEPT table. Now, consider the following queries: QUERY: $1$ SELECT ... Query:1 and Query:2 returns different number of columns. I, II only III, IV only II, III only I, IV only
Consider the following set of relations: EMP (eno, ename , dno) DEPT (dno, dname)Primary key columns are underlined and dno in EMP is a foreign key referrin...
520
views
commented
Sep 6, 2017
Databases
tbb-dbms-2
databases
sql
+
–
9
answers
5
GATE CSE 2017 Set 1 | Question: 51
Consider a $2$-way set associative cache with $256$ blocks and uses $\text{LRU}$ replacement. Initially the cache is empty. Conflict misses are those misses which occur due to the contention of multiple blocks for the same cache set. Compulsory ... $10$ times. The number of conflict misses experienced by the cache is _________ .
Consider a $2$-way set associative cache with $256$ blocks and uses $\text{LRU}$ replacement. Initially the cache is empty. Conflict misses are those misses which occur d...
38.4k
views
commented
May 2, 2017
CO and Architecture
gatecse-2017-set1
co-and-architecture
cache-memory
conflict-misses
normal
numerical-answers
+
–
2
answers
6
GATE CSE 2017 Set 1 | Question: 16
The following functional dependencies hold true for the relational schema $R\left \{V,W,X,Y,Z \right \}$: V $\rightarrow$ W VW $\rightarrow$ X Y $\rightarrow$ VX Y $\rightarrow$ Z Which of the following is irreducible equivalent for this set of functional ... $\rightarrow$ Z V $\rightarrow$ W W $\rightarrow$ X Y $\rightarrow$ V Y $\rightarrow$ X Y $\rightarrow$ Z
The following functional dependencies hold true for the relational schema $R\left \{V,W,X,Y,Z \right \}$:V $\rightarrow$ WVW $\rightarrow$ XY $\rightarrow$ VXY $\rightarr...
13.1k
views
commented
Feb 17, 2017
Databases
gatecse-2017-set1
databases
database-normalization
normal
+
–
15
answers
7
GATE CSE 2017 Set 1 | Question: 22
Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet $\{a,b\}$. The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting $L$ is ___________ .
Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet $\{a,b\}$. The smallest number of states needed in a deterministic finite-...
29.0k
views
answered
Feb 13, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
finite-automata
numerical-answers
minimal-state-automata
+
–
0
answers
8
do I have to apply separately for exam I already for it with the thought of Inclusion of gate score
bbnlbsnlclinlcbarc application without gate score
334
views
commented
Feb 13, 2017
IS&Software Engineering
general
admissions
+
–
0
answers
9
#nlc payment
@ arjun sir for nlc application i have done sbi collect payment 2 days before but still nlc is showing fee paid status as not paid what to do now
@ arjun sir for nlc application i have done sbi collect payment 2 days before but still nlc is showing fee paid status as not paid what to do now
461
views
asked
Jan 15, 2017
2
answers
10
GATE Overflow | Operating Systems | Test 1 | Question: 12
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is - $e^-{15}$ $e^{-5}$ $1 - e^{-5}$ $1-e^{-10}$
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is -$e^-...
728
views
commented
Oct 21, 2016
Operating System
go-os-1
operating-system
resource-allocation
+
–
3
answers
11
Network media
Shiva is working as a network engineer and recently he got an assignment to design a reliable but cheaper Ethernet connection between two offices. The Details are like this. Two buildings are just 150 meters apart. There can be frequent problems with volatge potential differences between two offices. ... STP b. coaxial c. Fiber optic I. a , b or c II. b or c III. b only IV. c only
Shiva is working as a network engineer and recently he got an assignment to design a reliable but cheaper Ethernet connection between two offices. The Details are like t...
336
views
answered
Sep 8, 2016
Computer Networks
computer-networks
+
–
3
answers
12
MadeEasy Test Series 2017: Computer Networks - Congestion Control
Consider the effect of using slow start on a line with 10 msec round trip time. The receiver window and the size of congestion window are set to 38 KB and 36 KB respectively. Sender side threshold is set to 18 KB. After 8 ... to send first full window of 18 KB is______ Assume window size at the start of slow start phase is 2 KB.
Consider the effect of using slow start on a line with 10 msec round trip time. The receiver window and the size of congestion window are set to 38 KB and 36 KB respectiv...
2.3k
views
answered
Sep 8, 2016
Computer Networks
made-easy-test-series
computer-networks
congestion-control
+
–
1
answer
13
Lectures for Basics of Wi-Fi and Network security
Does anyone has any online resource that contains good lectures on Basics of Wi-Fi and Network security? Thanks in advance .
Does anyone has any online resource that contains good lectures on Basics of Wi-Fi and Network security? Thanks in advance .
363
views
answered
Sep 7, 2016
Computer Networks
computer-networks
+
–
5
answers
14
gate
A 1Mbps satellite link connects two ground stations. The altitude of the satellite is 6000 km and speed of the signal is 3 × 10^8 m/s. What should be the packet size for a channel utilization of 50% for a satellite link using go-back-63 sliding window protocol? Assume that the acknowledgment packets are negligible in size and that there are no errors during communication.
A 1Mbps satellite link connects two ground stations. The altitude of the satellite is 6000 km and speed of the signal is 3 × 10^8 m/s. What should be the packet size for...
887
views
answered
Sep 7, 2016
1
answer
15
Network Security
Consider the scenarios. 1. A wifi connection without encryption. 2. Presence of malicious virus 3. Authentication with weak password. In network security paradigm given scenarios can be classified as: (A). 1. Threat 2. Threat 3. Vulnearability (B). 1. ... Threat 3. Threat (C). 1. Threat 2. Vulnearability 3. Vulnearability (D). 1. Vulnearability 2. Threat 3. Vulnearability
Consider the scenarios.1. A wifi connection without encryption.2. Presence of malicious virus3. Authentication with weak password.In network security paradigm given scen...
1.5k
views
answered
Sep 7, 2016
Computer Networks
computer-networks
network-security
+
–
1
answer
16
I don't understand this question can I use a multiplexer
An industrial control circuit has four inputs (A, B, C & D) which activate a single output (F) under the following operating conditions: C & A can never be High (1) at the same time. If D is high (1) and ... 1), the output is active. All other input combinations cause the output to be low (0). Design and implement this control.
An industrial control circuit has four inputs (A, B, C & D) which activate a single output (F) under the following operating conditions:• C & A can never be High (1) at...
437
views
answered
Sep 7, 2016
2
answers
17
Ravindrababu_SQL
Consider the above table A. How many tuples does the result of the following SQL queries contain ? Q1: select Location from A where AreaCode in (101, 103); Q2: Select Location from A where AreaCode = 101 UNION Select Location from A where AreaCode = ... ) NULL value is counted as many times it occur. please guide me how deal with NULL values in diferent occassions.THANKS in ADVANCE
Consider the above table A. How many tuples does the result of the following SQL queries contain ?Q1: select Location from A where AreaCode in (101, 103);Q2: Select Locat...
407
views
answered
Sep 5, 2016
2
answers
18
Virtual Gate Test Series: Calculus - Limits
How to solve this?
How to solve this?
738
views
commented
Sep 5, 2016
Calculus
engineering-mathematics
calculus
limits
virtual-gate-test-series
+
–
1
answer
19
integration 10[IN]
http://gateforum.com/wp-content/uploads/2013/01/IN-2010.pdf Question 21 The integral $\int _{-\infty} ^{\infty}\delta (t-\frac{\pi}{6})6\sin(t)dt$ evaluates to (A).6 (B).3 (c).1.5 (D).0
http://gateforum.com/wp-content/uploads/2013/01/IN-2010.pdf Question 21The integral $\int _{-\infty} ^{\infty}\delta (t-\frac{\pi}{6})6\sin(t)dt$ evaluates to(A).6(B).3(c...
1.3k
views
commented
Sep 5, 2016
Calculus
calculus
+
–
2
answers
20
transition diagram for the given regular language
L={wxwr∣ w,x∈(a,b)*} Is this language regular language? Plz give transition diagram or table?
L={wxwr∣ w,x∈(a,b)*}Is this language regular language?Plz give transition diagram or table?
526
views
answered
Sep 4, 2016
Theory of Computation
theory-of-computation
regular-language
+
–
3
answers
21
CMI2011-A-03
You have a bag with $347$ black balls and $278$ white balls. Without looking, you pick up two balls from the bag and apply the following rule. If both balls are of the same colour, you throw them both away. Otherwise, you throw away the black ... are possible, but the probability of it being white is greater. Both colours are possible, but the probability of it being black is greater.
You have a bag with $347$ black balls and $278$ white balls. Without looking, you pick up two balls from the bag and apply the following rule. If both balls are of the sa...
1.1k
views
commented
Sep 4, 2016
Probability
cmi2011
probability
+
–
3
answers
22
Evaluate the following definite integral ?
Evaluate the following definite integral : $\int \limits_0^1 \log \left(\frac{1}{x} - 1 \right)$
Evaluate the following definite integral :$\int \limits_0^1 \log \left(\frac{1}{x} - 1 \right)$
1.2k
views
answered
Sep 4, 2016
Calculus
integration
calculus
engineering-mathematics
integrals
+
–
1
answer
23
daa doubt
how to decide height , depth and level of tree and no. of internal nodes in tree some books take root as internal node height as no. of edges b/w root and leaf(longest path), some take level starting from root as 0
how to decide height , depth and level of treeand no. of internal nodes in treesome books take root as internal nodeheight as no. of edges b/w root and leaf(longest path)...
257
views
asked
Sep 2, 2016
DS
binary-tree
data-structures
+
–
3
answers
24
doubt | ER Diagram
wat does arrow represent in er diagram when can we many to one or one to many by seeing arrows
wat does arrow represent in er diagramwhen can we many to one or one to many by seeing arrows
2.0k
views
asked
Sep 2, 2016
Databases
databases
er-diagram
+
–
1
answer
25
daa
The conventional way of multiplying two n-bit integers requires O(n2) time. There are much better ways of multiplying long integers, based on a divide-and-conquer approach. For example, we can break each n-bit integer into n/2-bit halves, and produce the result by making 3 recursive calls to n/2-bit multiplications ... of some sort. a) x=53; y=12. b) x=44; y=11. c) x=40; y=10. d) x=27; y=8.
The conventional way of multiplying two n-bit integers requires O(n2) time. There are much better ways of multiplying long integers, based on a divide-and-conquer approac...
355
views
asked
Sep 2, 2016
Algorithms
time-complexity
+
–
0
answers
26
dag
Here is a sequence of twelve array assignments and references: r = a[i] s = a[j] t = a[i] a[j] = b u = a[i] v = a[j] a[j] = c w = a[i] x = a[j] y = a[i] z = a[j] a[j] = b Construct the DAG for these instructions. Which of the following pairs of variables label the same node of the DAG? a) t and u b) r and s c) w and y d) t and s
Here is a sequence of twelve array assignments and references:r = a[i]s = a[j]t = a[i]a[j] = bu = a[i]v = a[j]a[j] = cw = a[i]x = a[j]y = a[i]z = a[j]a[j] = bConstruct th...
554
views
asked
Sep 2, 2016
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
test-series
+
–
3
answers
27
context sensitive grammer
In a context sensitive grammer, 1).number of grammar symbols on the left-hand side of a production can’t be greater than the number of non-terminals on the right-hand side is this true or false ?
In a context sensitive grammer,1).number of grammar symbols on the left-hand side of a productioncan’t be greater than the number of non-terminals on the right-hand sid...
930
views
answered
Sep 1, 2016
1
answer
28
toc minimal dfa
. Find minimized finite automata which recognizes the below languages, separately by m1 and m2 over binary strings as input, then find the number of states in each of the following. L1:L2 is a language, which contains a set of strings which produces a remainder ... contains 8 states (c) m1 contains 3 states and m2 contains 9 states (d) m1 contains 4 states and m2 contains 9 states
. Find minimized finite automata which recognizes the below languages, separately by m1 and m2 over binary strings as input, then find the number of states in each of the...
836
views
commented
Sep 1, 2016
Theory of Computation
theory-of-computation
minimal-state-automata
+
–
1
answer
29
toc
Find minimized finite automata which recognizes the below languages, separately by m1 and m2 over binary strings as input, then find the number of states in each of the following. L1:L2 is a language, which contains a set of strings which produces a remainder 1', when ... m2 contains 8 states (c) m1 contains 3 states and m2 contains 9 states (d) m1 contains 4 states and m2 contains 9 states
Find minimized finite automata which recognizes the below languages, separately by m1 andm2 over binary strings as input, then find the number of states in each of the fo...
347
views
asked
Sep 1, 2016
Unknown Category
minimal
finite-automata
+
–
1
answer
30
toc
10. Consider the following languages: L ne = {〈M〉│L(M) ≠ ф } L e = {〈M〉│L(M) = ф } where 〈M〉 denotes encoding of a Turning machine M Then which one of the following is true? (a) Lne is r.e. but not recursive and Le is not r.e. (b) Both are not r.e. (c) Both are recursive (d) Le is r.e. but not recursive and Lne is not r.e.
10. Consider the following languages:Lne = {〈M〉│L(M) ≠ ф }Le = {〈M〉│L(M) = ф }where 〈M〉 denotes encoding of a Turning machine MThen which one of the f...
1.3k
views
asked
Sep 1, 2016
Unknown Category
recursive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register