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 Mojo-Jojo
0
votes
1
tree data-structure
Which of the following data structures will be the most efficient for inserting a number into a sorted list of numbers? Queue Stack Linked list Array
Which of the following data structures will be the most efficient for inserting a number into a sorted list of numbers?QueueStackLinked listArray
899
views
answered
May 21, 2016
Programming in C
data-structures
+
–
0
votes
2
isro
705
views
answered
May 21, 2016
2
votes
3
Logic basics
If i have a statement like : "No large birds live on honey" where domain is set of all Birds Here let Q(x) : x is a large bird R(x) : lives on honey CAn i write this is ∀x (∽Q(x)-->R(x)) ..is it right ? and what about this ∀x (Q(x)-->∽R(x))
If i have a statement like :"No large birds live on honey" where domain is set of all Birds Here let Q(x) : x is a large bird R(x) : lives on honey CAn i write this is&f...
694
views
answered
May 10, 2016
Mathematical Logic
mathematical-logic
+
–
6
votes
4
Logic Basic
I have a proposition here Not Everyone is perfect The above statement also mean there is someone who is perfect So can i write ∃xP(x) where P(x) is x is perfect And in book it is written ∼∀x P(x) Which one is correct and where am i wrong ?
I have a proposition here Not Everyone is perfect The above statement also mean there is someone who is perfect So can i write ∃xP(x) where P(x) is x is perfect And in ...
470
views
answered
May 10, 2016
Mathematical Logic
mathematical-logic
+
–
0
votes
5
assembly
941
views
answered
May 3, 2016
CO and Architecture
8085-microprocessor
non-gate
+
–
3
votes
6
Gate 2008 Ee
Answer given as option a ) My knowledge . Rank of a matrix Q is 4 implies 1 out of 5 rows of Q is zero linearly independent solution = n-r n--> no of unknowns r---> rank therefore linerly independent solution = 5-4 = 1 What is linerly independent Rows ... ? linerly independent vectors ?
Answer given as option a )My knowledge .Rank of a matrix Q is 4 implies 1 out of 5 rows of Q is zerolinearly independent solution = n-rn no of unknownsr - ranktherefore ...
669
views
answered
May 3, 2016
Linear Algebra
rank-of-matrix
+
–
2
votes
7
operating systems
a system has 6 processes sharing 7 resourses if each process needs maximum 3 units then a) deadlock can never occur b)deadlock may occur c)starvation will occur d)none of these
a system has 6 processes sharing 7 resourses if each process needs maximum 3 units thena) deadlock can never occurb)deadlock may occurc)starvation will occurd)none of the...
1.5k
views
answered
May 3, 2016
3
votes
8
GATE2012 AE: GA-10
In the early nineteenth century, theories of social evolution were inspired less by Biology than by the conviction of social scientists that there was a growing improvement in social institutions. Progress was taken for granted and social scientists attempted to ... was a fact. did not approve of Biology. framed the laws of progress. emphasized Biology over Social Sciences.
In the early nineteenth century, theories of social evolution were inspired less by Biology than by the conviction of social scientists that there was a growing improveme...
1.1k
views
answered
May 2, 2016
Verbal Aptitude
gate2012-ae
verbal-aptitude
passage-reading
+
–
9
votes
9
GATE2013 EE: GA-7
Statement: There were different streams of freedom movements in colonial India carried out by the moderates, liberals, radicals, socialists, and so on. Which one of the following is the best inference from the above statement? The emergence ... . Nationalism in India emerged in the context of colonialism. Nationalism in India is homogeneous. Nationalism in India is heterogeneous
Statement: There were different streams of freedom movements in colonial India carried out by the moderates, liberals, radicals, socialists, and so on.Which one of the fo...
2.3k
views
answered
May 2, 2016
Verbal Aptitude
gate2013-ee
passage-reading
verbal-aptitude
verbal-reasoning
+
–
18
votes
10
GATE CSE 2016 Set 1 | Question: GA08
Consider the following statements relating to the level of poker play of four players $P,Q,R \ and \ S$. $P$ always beats $Q$ $R$ always beats $S$ $S$ loses to $P$ only sometimes. $R$ always loses to $Q$ Which of the following can be logically ... $S$ is the absolute worst player in the set (i). only (ii) only (i) and (ii) only' neither (i) nor (ii)
Consider the following statements relating to the level of poker play of four players $P,Q,R \ and \ S$.$P$ always beats $Q$$R$ always beats $S$$S$ loses to $P$ only som...
7.9k
views
answered
Feb 23, 2016
Analytical Aptitude
gatecse-2016-set1
analytical-aptitude
normal
statements-follow
+
–
3
votes
11
GATE CSE 2016 Set 2 | Question: 22
Suppose a database schedule $S$ involves transactions $T_1,\ldots,T_n$ . Construct the precedence graph of $S$ with vertices representing the transactions and edges representing the conflicts. If $S$ is serializable, which one of ... to yield a serial schedule? Topological order Depth-first order Breadth-first order Ascending order of the transaction indices
Suppose a database schedule $S$ involves transactions $T_1,\ldots,T_n$ . Construct the precedence graph of $S$ with vertices representing the transactions and edges repr...
13.2k
views
answered
Feb 19, 2016
Databases
gatecse-2016-set2
databases
transaction-and-concurrency
normal
+
–
0
votes
12
Ace Test Series: CO & Architecture - Cache Memory
I guess explaination is wrong. I am getting 216.
I guess explaination is wrong. I am getting 216.
718
views
answered
Jan 14, 2016
CO and Architecture
ace-test-series
co-and-architecture
cache-memory
page-replacement
+
–
5
votes
13
Equivalence of Turing Machines.
Consider the following two arguments: "For every non deterministic TM M1 there exists an equivalent deterministic TM M2 recognizing the same language." "Equivalence of two Turing Machines is undecidable" These two arguments seem a bit contradicting. What can be concluded from these two arguments?
Consider the following two arguments:"For every non deterministic TM M1 there exists an equivalent deterministic TM M2 recognizing the same language.""Equivalence of two ...
3.5k
views
answered
Jan 7, 2016
Theory of Computation
turing-machine
theory-of-computation
+
–
0
votes
14
TIFR2010-Maths-A-8
Let $f(x)= |x|^{3/2}, x \in \mathbb{R}$. Then $f$ is uniformly continuous. $f$ is continuous, but not differentiable at $x=0$. $f$ is differentiable and $f ' $ is continuous. $f$ is differentiable, but $f ' $ is discontinuous at $x=0$.
Let $f(x)= |x|^{3/2}, x \in \mathbb{R}$. Then$f$ is uniformly continuous.$f$ is continuous, but not differentiable at $x=0$.$f$ is differentiable and $f ' $ is continuous...
1.4k
views
answered
Jan 7, 2016
Calculus
tifrmaths2010
calculus
differentiation
continuity
+
–
1
votes
15
Test Series Question CN
Well Network Layer switch is called Router. This is little confusing.. ( Link layers switch is called bridge :P )
Well Network Layer switch is called Router. This is little confusing.. ( Link layers switch is called bridge :P )
513
views
answered
Jan 6, 2016
Computer Networks
computer-networks
test-series
+
–
1
votes
16
MOCK_GATEFORUM_SAT6 SQL
464
views
answered
Dec 9, 2015
Databases
sql
+
–
0
votes
17
What happens if LALR(1) machine is constructed for the below grammer ? Justify Each Option
Grammar S $\rightarrow$ S1 S1 $\rightarrow$ S1 = S1 | a Where = is the assignment operator in C LALR(1) Machine cannot be constructed with this grammer inadequate states can be resolved using the ... associative inadequate states can be resolved using the fact that the = is right associative Both 2 and 3
Grammar S $\rightarrow$ S1S1 $\rightarrow$ S1 = S1 | aWhere = is the assignment operator in CLALR(1) Machine cannot be constructed with this grammerinadequate states can ...
654
views
answered
Nov 21, 2015
Compiler Design
parsing
compiler-design
+
–
41
votes
18
GATE CSE 2004 | Question: 72
The following is the incomplete operation table of a $4-$ ... last row of the table is $c\;a\;e\; b$ $c\; b\; a\; e$ $c\; b\; e\; a$ $c\; e\; a\; b$
The following is the incomplete operation table of a $4-$element group.$$\begin{array}{|l|l|l|l|l|} \hline \textbf{*} & \textbf{e}& \textbf{a} &\textbf{b} & \textbf{c}\\\...
6.8k
views
answered
Nov 17, 2015
Set Theory & Algebra
gatecse-2004
set-theory&algebra
group-theory
normal
+
–
1
votes
19
cache
how many comparator and multiplexer are required in set assosiative maping technique . ?? what i know till now is if it is p way set assosiative then p comparator will be required.. how many multiplexer will be required. ?
how many comparator and multiplexer are required in set assosiative maping technique . ?? what i know till now is if it is p way set assosiative then p comparator will be...
1.6k
views
answered
Nov 14, 2015
CO and Architecture
cache-memory
co-and-architecture
+
–
9
votes
20
which addressing modes in this question
963
views
answered
Nov 14, 2015
CO and Architecture
addressing-modes
+
–
0
votes
21
microinstruction
1.3k
views
answered
Nov 14, 2015
CO and Architecture
microprogramming
+
–
0
votes
22
clash of cache block replacement and page replacement
can cache block replacement and page replacement activities clash with each other?
can cache block replacement and page replacement activities clash with each other?
434
views
answered
Nov 14, 2015
9
votes
23
How to Find Data Transfer Rate?
Consider a disk pack with following specifications - 16 surfaces, 128 tracks/surface, 256 sector/track and 512Bytes/sector. Now, the disk is rotating at 3600RPM, what is the data transfer rate. Please be as elaborative and simplified in your approach of explaining! Thank you, all the nerds on this site!
Consider a disk pack with following specifications - 16 surfaces, 128 tracks/surface, 256 sector/track and 512Bytes/sector. Now, the disk is rotating at 3600RPM, what is...
3.9k
views
answered
Nov 14, 2015
Operating System
disk
+
–
5
votes
24
ISRO2014-58
Assume the following information. Original timestamp value $= 46$ Receive timestamp value $= 59$ Transmit timestamp value $= 60$ Timestamp at arrival of packet $= 69$ ... and Receive clocks are synchronized Transmit clock should go back by $3$ milliseconds Receive clock should go ahead by $1$ milliseconds
Assume the following information.Original timestamp value $= 46$Receive timestamp value $= 59$Transmit timestamp value $= 60$Timestamp at arrival of packet $= 69$Whic...
7.9k
views
answered
Sep 27, 2015
Computer Networks
isro2014
computer-networks
icmp
+
–
1
votes
25
Time taken to transmit= ?
476
views
answered
Sep 26, 2015
Computer Networks
ethernet
+
–
11
votes
26
An organization is granted the block 150.36.0.0/16.The administrator wants to create 512 subnets.
An organization is granted the block 150.36.0.0/16.The administrator wants to create 512 subnets. Find number of addresses in each subnet. Find the first and last addresses in subnet 1. (A) 128, 150.36.0.1 and 150.36.0.127 ( ... ) 126, 150.36.0.1 and 150.36.0.126 (D) 126, 150.36.0.129 and 150.36.0.254.
An organization is granted the block 150.36.0.0/16.The administrator wants to create 512 subnets. Find number of addresses in each subnet. Find the first and last address...
9.6k
views
answered
Sep 25, 2015
Computer Networks
subnetting
+
–
0
votes
27
A host with IP address 10.100.100.100 wants to use loopback testing,WHAT are the source and destination addresses?
1. 10.100.100.100 & 10.100.100.1002. 10.100.100.100 & 255.255.255.2553. 10.100.100.100 & 127.1.100.14. 127.100.100.100 & 10.100.100.100
5.2k
views
answered
Sep 24, 2015
Computer Networks
network-addressing
+
–
0
votes
28
Which type of conflict is present ?
Hi , I am confused about this grammar . I can find there is one SR conflict , please clarify. S -> Aa | bAc | dc | bda A -> d Here , it is not LL1 as A -> bAc and S -> bda both need to placed in the same cell. Also , should I say that S -> Aa and A -> d are also SR conflicts as they both derive d ? And for that it is not LR(0) as well .
Hi , I am confused about this grammar .I can find there is one SR conflict , please clarify. S - Aa | bAc | dc | bdaA - d Here , it is not LL1 as A - bAc and S - bda both...
1.9k
views
answered
Sep 23, 2015
Compiler Design
compiler-design
parsing
lr-parser
ll-parser
+
–
0
votes
29
No of string accepted by a finite automata
1.4k
views
answered
Sep 21, 2015
Theory of Computation
finite-automata
theory-of-computation
+
–
0
votes
30
which of the following is correct,please explain every point
A multiuser multi-programming O.S can't be implemented on hardware that doesn't support, . address translation .DMA for disk transfer .at least two modes of cpu execution(privileged and non-priviliged) .demand paging
A multiuser multi-programming O.S can't be implemented on hardware that doesn't support,. address translation.DMA for disk transfer.at least two modes of cpu execution(pr...
639
views
answered
Sep 18, 2015
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register