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 Smriti012
0
votes
1
Set Theory and algebra
If we are given a set for ex.S={1,2,.....25} and now if we want to find subsets T ⊆ S of size 5 than it is 25C5 or they are 2^ 25C5.
If we are given a set for ex.S={1,2,.....25} and now if we want to find subsets T ⊆ S of size 5 than it is 25C5 or they are 2^ 25C5.
306
views
answered
Oct 4, 2017
Set Theory & Algebra
discrete-mathematics
+
–
1
votes
2
test series
577
views
answered
Jun 30, 2017
DS
made-easy-test-series
+
–
0
votes
3
Internal organization of memory chip.
What are external connection in "internal organization of memory chip" ? How these lines are decided ? Example memory with 128 bits (16×8) requires 14 external connections. How we decided this ☝ ?
What are external connection in "internal organization of memory chip" ? How these lines are decided ?Example memory with 128 bits (16×8) requires 14 external connection...
4.1k
views
answered
Apr 21, 2017
CO and Architecture
memory-management
carl-hamacher
+
–
0
votes
4
UGC NET CSE | December 2004 | Part 2 | Question: 13
What is the value of the arithmetic expression (Written in C) $2*3/4-3/4*2$ $0$ $1$ $1.5$ None of these
What is the value of the arithmetic expression (Written in C)$2*3/4-3/4*2$$0$$1$$1.5$None of these
1.5k
views
answered
Apr 2, 2017
Programming in C
ugcnetcse-dec2004-paper2
programming-in-c
expression-evaluation
operator-precedence
+
–
2
votes
5
theoryof computation
Both these languages are not equivalent...right ???
Both these languages are not equivalent...right ???
616
views
answered
Apr 2, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-expression
grammar
+
–
0
votes
6
Suppose a, b, c > 0 are in geometric progression and a
Suppose a; b; c > 0 are in geometric progression and ap = bq = cr != 1. Which one of the following is always true? (A) p, q, r are in geometric progression (B) p, q, r are in arithmetic progression (C) p, q, r are in harmonic progression (D) p = q = r
Suppose a; b; c 0 are in geometric progression and ap = bq = cr != 1.Which one of the following is always true?(A) p, q, r are in geometric progression(B) p, q, r are in...
1.2k
views
answered
Mar 27, 2017
Set Theory & Algebra
set-theory&algebra
+
–
2
votes
7
ISRO 2010-ECE Shift register
Given shift register is initially loaded with the bit pattern "1010". After how many clock cycles will the content of shift register be "1010" again? a) 5 b) 9 c) 7 d) 15
Given shift register is initially loaded with the bit pattern "1010". After how many clock cycles will the content of shift register be "1010" again?a) 5b) 9c) 7d) 15
1.1k
views
answered
Feb 28, 2017
Digital Logic
isro-ece
digital-logic
+
–
2
votes
8
ISRO2014-ECE Digital logic
In the following circuit, Y can be expressed as : $\text{Y = BC + A}$ $\text{Y = AC}' + \text{BC}$ $\text{Y = C}$ $\text{Y = B}$
In the following circuit, Y can be expressed as :$\text{Y = BC + A}$$\text{Y = AC}' + \text{BC}$$\text{Y = C}$$\text{Y = B}$
801
views
answered
Feb 22, 2017
Digital Logic
isro2014-ece
isro-ece
digital-logic
combinational-circuit
multiplexer
+
–
1
votes
9
difference between if(a=0) and if(a=non zero)
what is the differernce between if (a=0) and if (a= -7) or any other non-zero number e.g what will be the out put of following program a)if ( a=0) printf(""a is zero ") else printf("a is not zero") and if we replace 0 by some +ve or -ve number then
what is the differernce between if (a=0) and if (a= -7) or any other non-zero number e.g what will be the out put of following program a)if ( a=0)printf(""a is zero ")els...
2.2k
views
answered
Feb 18, 2017
0
votes
10
Threads
Since every thread can access every memory address within the process’ address space, one thread can read, write, or even wipe out another thread’s stack. I am not getting the above statement, stack is specific to a thread then how we can access other thread's stack through Process' address space?
Since every thread can access every memory address within the process’ address space, one thread can read, write, or even wipe out another thread’s stack.I am not get...
1.1k
views
answered
Feb 17, 2017
49
votes
11
GATE CSE 2017 Set 1 | Question: 32
A computer network uses polynomials over $GF(2)$ for error checking with $8$ bits as information bits and uses $x^{3}+x+1$ as the generator polynomial to generate the check bits. In this network, the message $01011011$ is transmitted as: $01011011010$ $01011011011$ $01011011101$ $01011011100$
A computer network uses polynomials over $GF(2)$ for error checking with $8$ bits as information bits and uses $x^{3}+x+1$ as the generator polynomial to generate the che...
11.7k
views
answered
Feb 15, 2017
Computer Networks
gatecse-2017-set1
computer-networks
crc-polynomial
normal
+
–
2
votes
12
Finding initial values of counting semaphore
Below are four concurrent processes and three counting semaphores. What must be the initial values of the three semaphores, so that output “TGE” is obtained?
Below are four concurrent processes and three counting semaphores.What must be the initial values of the three semaphores, so that output “TGE” is obtained?
2.5k
views
answered
Feb 15, 2017
Operating System
operating-system
semaphore
process-synchronization
+
–
4
votes
13
GATE CSE 2017 Set 1 | Question: 01
The statement $\left ( ¬p \right ) \Rightarrow \left ( ¬q \right )$ is logically equivalent to which of the statements below? $p \Rightarrow q$ $q \Rightarrow p$ $\left ( ¬q \right ) \vee p$ $\left ( ¬p \right ) \vee q$ I only I and IV only II only II and III only
The statement $\left ( ¬p \right ) \Rightarrow \left ( ¬q \right )$ is logically equivalent to which of the statements below?$p \Rightarrow q$$q \Rightarrow p$$\left ( ...
9.0k
views
answered
Feb 14, 2017
Mathematical Logic
gatecse-2017-set1
mathematical-logic
propositional-logic
easy
+
–
17
votes
14
GATE CSE 2017 Set 2 | Question: 08
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed? Contiguous Linked Indexed $1$ and $3$ only $2$ only $3$ only $2$ and $3$ only
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed?ContiguousLinkedIndexed$1$ and $3$ only$2$ on...
13.1k
views
answered
Feb 14, 2017
Operating System
gatecse-2017-set2
operating-system
file-system
normal
+
–
28
votes
15
GATE CSE 2017 Set 2 | Question: 1
The representation of the value of a $16\text{-bit}$ unsigned integer $X$ in hexadecimal number system is $\textsf{BCA9}$. The representation of the value of $X$ in octal number system is $571244$ $736251$ $571247$ $136251$
The representation of the value of a $16\text{-bit}$ unsigned integer $X$ in hexadecimal number system is $\textsf{BCA9}$. The representation of the value of $X$ in octal...
6.8k
views
answered
Feb 14, 2017
Digital Logic
gatecse-2017-set2
digital-logic
number-representation
+
–
5
votes
16
GATE CSE 2017 Set 1 | Question: 18
Threads of a process share global variables but not heap heap but not global variables neither global variables nor heap both heap and global variables
Threads of a process shareglobal variables but not heapheap but not global variablesneither global variables nor heapboth heap and global variables
17.1k
views
answered
Feb 13, 2017
Operating System
gatecse-2017-set1
operating-system
threads
+
–
12
votes
17
GATE CSE 2017 Set 1 | Question: 26
Let $G=\left ( V,E \right )$ be $any$ connected, undirected, edge-weighted graph. The weights of the edges in $E$ are positive and distinct. Consider the following statements: Minimum Spanning Tree of $G$ is always unique. Shortest path between ... always unique. Which of the above statements is/are necessarily true? I only II only both I and II neither I nor II
Let $G=\left ( V,E \right )$ be $any$ connected, undirected, edge-weighted graph. The weights of the edges in $E$ are positive and distinct. Consider the following statem...
12.4k
views
answered
Feb 11, 2017
Algorithms
gatecse-2017-set1
algorithms
graph-algorithms
normal
+
–
0
votes
18
CO Doubt
What is the formula for average access time using write-through and write-back policy?
What is the formula for average access time using write-through and write-back policy?
356
views
answered
Feb 9, 2017
1
votes
19
Test Series
Consider a system with logical address space of 4GB and page size is 8KB, physical address space is 256MB. How many bits required to access an entry in single level page table and in inverted page table respectively? A. 19, 15 B. 15, 15 C. 15, 19 D. 19, 19
Consider a system with logical address space of 4GB and page size is 8KB, physical address space is 256MB. How many bits required to access an entry in single level page ...
3.9k
views
answered
Feb 8, 2017
Operating System
operating-system
+
–
2
votes
20
what exactly the probability fir detecting Burst errors?
1.9k
views
answered
Feb 8, 2017
Unknown Category
computer-networks
+
–
1
votes
21
maxima minima made easy
Consider the function f (x) = sin x in the interval X<--[pi/4, 7pi/4]. The number of location/s of the local minima are __________ .
Consider the function f (x) = sin x in the interval X< [pi/4, 7pi/4]. The number of location/s of the local minima are __________ .
650
views
answered
Feb 7, 2017
7
votes
22
MadeEasy Subject Test: Compiler Design - Lexical Analysis
Is the given answer correct?
Is the given answer correct?
1.7k
views
answered
Feb 7, 2017
Compiler Design
made-easy-test-series
compiler-design
compiler-tokenization
lexical-analysis
+
–
0
votes
23
number of cycles in given graph:
Let N1 be the number of distinct cycles of length 3 in given graph and N2 be the number of distinct cycles of length 3, if the graph is labelled. Then N2 - N1 is __________
Let N1 be the number of distinct cycles of length 3 in given graph and N2 be the number of distinct cycles of length 3, if the graph is labelled.Then N2 - N1 is _________...
599
views
answered
Feb 7, 2017
Graph Theory
graph-connectivity
+
–
0
votes
24
Virtual Test Series
199
views
answered
Feb 7, 2017
1
votes
25
Virtual Gate
Calculate the limit (A) 1 (B) 0 (C) -1 (D) Does not exist
Calculate the limit (A) 1 (B) 0 (C) -1 (D) Does not exist
452
views
answered
Feb 7, 2017
2
votes
26
TCP timestamp
A computer receives a time stamp request from another computer at 2 : 34 : 20 P.M. The value of original time stamp is 52,453,000 (milli second). If sender clock is 5 milli second slow, the one-way time is___________ (ms)
A computer receives a time stamp request from another computer at 2 : 34 : 20 P.M. The value of original time stamp is 52,453,000 (milli second). If sender clock is 5 mil...
1.8k
views
answered
Feb 7, 2017
1
votes
27
Graph Theory (Chromatic no)
280
views
answered
Feb 7, 2017
0
votes
28
programming and ds
Let P be a QuickSort Program to sort numbers in ascending order using the first element as pivot. Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2, 3, 4, 5} and {4, 1, 5, 3, 2} respectively. Which one of the following holds? A t1 = 5 B t1 < t2 C t1 > t2 D t1 = t2
Let P be a QuickSort Program to sort numbers in ascending order using the first element as pivot. Let t1 and t2 be the number of comparisons made by P for the inputs {1, ...
721
views
answered
Feb 6, 2017
Algorithms
algorithms
quick-sort
+
–
2
votes
29
Self doubt
DIfference between Static single assignment, 3 address code , 3 address instruction? How these 3 are different in representation?
DIfference between Static single assignment, 3 address code , 3 address instruction?How these 3 are different in representation?
456
views
answered
Feb 6, 2017
CO and Architecture
co-and-architecture
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register