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
Recent activity by zeeshanmohnavi
0
answers
1
DDA Direct Recruitment 2019 - Asst. System Director
Which of the following gives the predicate logic representation of the sentence Ram was a man ? Ram $\rightarrow$ man $\forall x:$ Ram (x) $\rightarrow$ man (x) Man (Ram) Man $\rightarrow$ Ram I have marked option ... I want to raise an objection to this answer. Kindly provide a reliable source which confirms the correct answer for this question.
Which of the following gives the predicate logic representation of the sentence “Ram was a man”?Ram $\rightarrow$ man$\forall x:$ Ram (x) $\rightarrow$ man (x)Man (Ra...
621
views
comment edited
Apr 7, 2019
Mathematical Logic
propositional-logic
discrete-mathematics
+
–
2
answers
2
Probability - Independent Events
What is the probability that, in six throws of a die, there will be exactly one each of “1”, “2”, “3”, “4”, “5” and “6”? $0.00187220$ $0.01432110$ $0.01176210$ $0.01543210$
What is the probability that, in six throws of a die, there will be exactly one each of “1”, “2”, “3”, “4”, “5” and “6”?$0.00187220$$0.01432110$$0...
610
views
answered
Mar 8, 2019
Probability
probability
engineering-mathematics
+
–
2
answers
3
GATE CSE 1997 | Question: 4.9
The expression $( a * b) * c \; op \dots$ where ‘op’ is one of ‘$+$’, ‘$*$’ and ‘$\uparrow$’ (exponentiation) can be evaluated on a CPU with single register without storing the value of ($a * b$) if $\text{‘op’}$ is ‘$+$’ or ‘$*$’ $\text{‘op’}$ is ‘$\uparrow$’ or ‘$*$’ $\text{‘op’}$ is ‘$\uparrow$’ or ‘$+$’ not possible to evaluate without storing
The expression $( a * b) * c \; op \dots$where ‘op’ is one of ‘$+$’, ‘$*$’ and ‘$\uparrow$’ (exponentiation) can be evaluated on a CPU with single registe...
5.0k
views
commented
Jan 30, 2019
Compiler Design
gate1997
compiler-design
target-code-generation
register-allocation
normal
+
–
7
answers
4
GATE CSE 1995 | Question: 2.21
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is: $AB + CD + *F/D +E*$ $ABCD + *F/DE* ++$ $A * B + CD/F *DE ++$ $A + *BCD/F* DE ++$
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is:$AB + CD + *F/D +E*$$ABCD + *F/DE* ++$$A * B + CD/F *DE ++$$A + *BCD/F* DE ++$
38.3k
views
commented
Jan 26, 2019
DS
gate1995
data-structures
stack
easy
+
–
4
answers
5
GATE CSE 2007 | Question: 38, ISRO2016-27
The following postfix expression with single digit operands is evaluated using a stack: $8 \ 2 \ 3 \ {}^\hat{} ∕ \ 2 \ 3 * + 5 \ 1 * -$ Note that $^\hat{}$ is the exponentiation operator. The top two elements of the stack after the first $*$ is evaluated are $6, 1$ $5, 7$ $3, 2$ $1, 5$
The following postfix expression with single digit operands is evaluated using a stack:$$8 \ 2 \ 3 \ {}^\hat{} ∕ \ 2 \ 3 * + 5 \ 1 * -$$Note that $^\hat{}$ is the ex...
16.6k
views
commented
Jan 26, 2019
DS
gatecse-2007
data-structures
stack
normal
infix-prefix
isro2016
+
–
9
answers
6
GATE CSE 2014 Set 3 | Question: 12
Consider the following rooted tree with the vertex labeled $P$ as the root: The order in which the nodes are visited during an in-order traversal of the tree is $SQPTRWUV$ $SQPTUWRV$ $SQPTWUVR$ $SQPTRUWV$
Consider the following rooted tree with the vertex labeled $P$ as the root:The order in which the nodes are visited during an in-order traversal of the tree is$SQPTRWUV$$...
16.5k
views
commented
Jan 26, 2019
DS
gatecse-2014-set3
data-structures
tree
easy
+
–
4
answers
7
GATE CSE 2003 | Question: 63, ISRO2009-25
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements in the set. Deletion of the smallest element Insertion of an ... used but not a heap Both balanced binary search tree and heap can be used Neither balanced search tree nor heap can be used
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements...
20.3k
views
commented
Jan 24, 2019
DS
gatecse-2003
data-structures
easy
isro2009
binary-search-tree
+
–
9
answers
8
GATE CSE 2001 | Question: 2.1
How many $4$-digit even numbers have all $4$ digits distinct? $2240$ $2296$ $2620$ $4536$
How many $4$-digit even numbers have all $4$ digits distinct?$2240$$2296$$2620$$4536$
12.7k
views
commented
Jan 23, 2019
Combinatory
gatecse-2001
combinatory
normal
+
–
4
answers
9
GATE CSE 2003 | Question: 24
Which of the following statements is FALSE? In statically typed languages, each variable in a program has a fixed type In un-typed languages, values do not have any types In dynamically typed languages, variables have no types In all statically typed languages, each variable in a program is associated with values of only a single type during the execution of the program
Which of the following statements is FALSE?In statically typed languages, each variable in a program has a fixed typeIn un-typed languages, values do not have any typesIn...
9.1k
views
commented
Jan 22, 2019
Programming in C
gatecse-2003
programming
normal
type-checking
+
–
1
answer
10
Semaphore
Let m[0]....m[4] be mutexes (binary semaphores) and P[0].......P[4] be processes. Suppose each process P[i] executes the following: wait (m[i]; wait (m(i+1) mode 3]); ........... release (m[i]); release (m(i+1) mod 3]); Will it cause Starvation and deadlock? If the ... (m(i+1) mode 5]); ........... release (m[i]); release (m(i+1) mod 5]); Is there any change in answer in this question?
Let m[0]....m[4] be mutexes (binary semaphores) and P[0].......P[4] be processes. Suppose each process P[i] executes the following:wait (m[i]; wait (m(i+1) mode 3]); ......
5.5k
views
commented
Jan 22, 2019
Operating System
semaphore
operating-system
process-synchronization
+
–
3
answers
11
MadeEasy Test Series: Operating System - Process Schedule
In this question do we have to use non pre-emptive approach since it is said that the os schedules either when runnning process gets blocked I/O or when the running process finishes its cpu burst.And nothing is mentioned ... longer remaining time process completes its I/O and arrives for cpu execution while a shorter one is still executing.
In this question do we have to use non pre-emptive approach since it is said that the os schedules either when runnning process gets blocked I/O or when the running proce...
553
views
commented
Jan 18, 2019
Operating System
operating-system
made-easy-test-series
process-scheduling
+
–
1
answer
12
MadeEasy Full Length Test 2018: Operating System - Resource Allocation
645
views
answered
Jan 18, 2019
Operating System
operating-system
resource-allocation
made-easy-test-series
+
–
0
answers
13
Testbook Test Series: Operating System - CPU Bound and IO Bound
Kindly help me out with the solution of this problem. Thanks in advance.
Kindly help me out with the solution of this problem. Thanks in advance.
263
views
commented
Jan 18, 2019
Operating System
testbook-test-series
operating-system
+
–
1
answer
14
MadeEasy Test Series 2019: Computer Networks - Token Bucket
A token bucket scheme is used for traffic shaping. a new token is put into the bucket at every 10 micro second. assume each token pick one packet which contain 2B of data. it is observed that initial capacity of bucket is 10 Mb. the ... R? is it token arriving rate (0.1M/s) or data transmitted equivalent to token (16bits * 0.1M/s) ?
A token bucket scheme is used for traffic shaping. a new token is put into the bucket at every 10 micro second. assume each token pick one packet which contain 2B of data...
2.3k
views
commented
Jan 15, 2019
Computer Networks
token-bucket
computer-networks
made-easy-test-series
+
–
2
answers
15
Regarding When to take test series
Which approach should be followed: Finishing subtopics and giving test series simultaneously or finishing the full syllabus first and then taking the test series, in December-January? Also, I have heard that Made Easy test series have a lot of errors. Then which one to take?
Which approach should be followed: Finishing subtopics and giving test series simultaneously or finishing the full syllabus first and then taking the test series, in Dece...
876
views
answered
Jan 8, 2019
Study Resources
test-series
preparation
study-resources
+
–
4
answers
16
GATE CSE 2010 | Question: 42
Consider the following schedule for transactions $T1, T2$ and $T3:$ ... correct serialization of the above? $T1 \to T3 \to T2$ $T2 \to T1 \to T3$ $T2 \to T3 \to T1$ $T3 \to T1 \to T2$
Consider the following schedule for transactions $T1, T2$ and $T3:$$$\begin{array}{|c|c|c|}\hline \textbf{T1} & \textbf{T2} & \textbf{T3} \\\hline \text{Read(X)} & \text...
10.6k
views
commented
Jan 7, 2019
Databases
gatecse-2010
databases
transaction-and-concurrency
normal
+
–
2
answers
17
GATE IT 2005 | Question: 66
In a data flow diagram, the segment shown below is identified as having transaction flow characteristics, with $p_2$ identified as the transaction center A first level architectural design of this segment will result in a set of process modules with an associated invocation sequence ... $T_c$ invokes $p_2.$ $p_2$ invokes $p_1,$ and then invokes $p_3,$ or $p_4,$ or $p_5$
In a data flow diagram, the segment shown below is identified as having transaction flow characteristics, with $p_2$ identified as the transaction centerA first level arc...
4.7k
views
commented
Jan 7, 2019
IS&Software Engineering
gateit-2005
data-flow-diagram
normal
non-gate
+
–
5
answers
18
GATE CSE 1993 | Question: 23
The following relations are used to store data about students, courses, enrollment of students in courses and teachers of courses. Attributes for primary key in each relation are marked by *'. Students (rollno*, sname, saddr) courses (cno*, ... name of students who got A grade in at least one course taught by teacher names Ramesh for the above relational database.
The following relations are used to store data about students, courses, enrollment of students in courses and teachers of courses. Attributes for primary key in each rela...
3.9k
views
answered
Jan 6, 2019
Databases
gate1993
databases
sql
relational-calculus
normal
descriptive
+
–
10
answers
19
GATE CSE 1998 | Question: 27
Consider the following relational database schemes: COURSES (Cno, Name) PRE_REQ(Cno, Pre_Cno) COMPLETED (Student_no, Cno) COURSES gives the number and name of all the available courses. PRE_REQ gives the information about which courses are pre- ... relational algebra: List all the courses for which a student with Student_no 2310 has completed all the pre-requisites.
Consider the following relational database schemes:COURSES (Cno, Name)PRE_REQ(Cno, Pre_Cno)COMPLETED (Student_no, Cno)COURSES gives the number and name of all the availab...
8.1k
views
commented
Jan 5, 2019
Databases
gate1998
databases
relational-algebra
normal
descriptive
+
–
0
answers
20
Self-doubt | DBMS | Functional Dependency
Can someone explain the paragraph marked based on relation $r$ given in Figure 7.2? Reference: Database System Concepts by Silberschatz, Korth, Sudarshan 4th Edition.
Can someone explain the paragraph marked based on relation $r$ given in Figure 7.2?Reference: Database System Concepts by Silberschatz, Korth, Sudarshan 4th Edition. �...
433
views
asked
Jan 5, 2019
Databases
database-normalization
databases
+
–
2
answers
21
TIFR CSE 2015 | Part A | Question: 13
Imagine the first quadrant of the real plane as consisting of unit squares. A typical square has $4$ corners: $(i, j), (i+1, j), (i+1, j+1),$and $(i, j+1)$, where $(i, j)$ is a pair of non-negative integers. Suppose a line segment $l$ ... point in the interior of the square. How many unit squares does $l$ pass through? $98,990$ $9,900$ $1,190$ $1,180$ $1,010$
Imagine the first quadrant of the real plane as consisting of unit squares. A typical square has $4$ corners: $(i, j), (i+1, j), (i+1, j+1),$and $(i, j+1)$, where $(i, j)...
1.9k
views
commented
Dec 27, 2018
Quantitative Aptitude
tifr2015
quantitative-aptitude
cartesian-coordinates
+
–
6
answers
22
GATE CSE 2018 | Question: GA-10
A six sided unbiased die with four green faces and two red faces is rolled seven times. Which of the following combinations is the most likely outcome of the experiment? Three green faces and four red faces. Four green faces and three red faces. Five green faces and two red faces. Six green faces and one red face
A six sided unbiased die with four green faces and two red faces is rolled seven times. Which of the following combinations is the most likely outcome of the experiment?T...
14.9k
views
commented
Dec 27, 2018
Quantitative Aptitude
gatecse-2018
quantitative-aptitude
probability
normal
2-marks
+
–
1
answer
23
MadeEasy Test Series: CO & Architecture - Memory Interfacing
Consider a DRAM that must be given a refresh cycle $64$ times per msec. Each refresh operation requires $100 \ nsec$ and a memory cycle requires $200 \ nsec$. The percentage of the memory’s total operating time must be given to refresh is _______ (upto $2$ decimal places)
Consider a DRAM that must be given a refresh cycle $64$ times per msec. Each refresh operation requires $100 \ nsec$ and a memory cycle requires $200 \ nsec$. The percent...
475
views
answered
Dec 26, 2018
CO and Architecture
co-and-architecture
made-easy-test-series
memory-interfacing
+
–
0
answers
24
MadeEasy Test Series: CO & Architecture - Cache Memory
Consider a computer system has a main memory consisting of $1 \text{ M } 16 \ bit$ words. It also has a $4\text{ K-word}$ cache organized in the block set associative manner, with $4$ blocks per set and $64$ words per block. What is the number of bits in ... $10, 5, 6$ bits $10, 4, 7$ bits $11, 4, 7$ bits I am getting an answer of $10, 4, 6$.
Consider a computer system has a main memory consisting of $1 \text{ M } 16 \ bit$ words. It also has a $4\text{ K-word}$ cache organized in the block set associative man...
404
views
commented
Dec 26, 2018
CO and Architecture
co-and-architecture
made-easy-test-series
cache-memory
+
–
0
answers
25
MadeEasy Test Series: Operating System - Disks
Consider a unix inode which maintains $5$ direct disk blocks, $1$ single indirect, $1$ double indirect and $1$ triple indirect DBA. Disk block size is $4 \text{ KB }$ and disk block address is $32 \text{ bits }$. Which of the following is maximum possible file ... $256 \text{ GB }$ $512 \text{ GB }$ $2 \text{ TB }$ Answer by ME: Option $(A)$
Consider a unix inode which maintains $5$ direct disk blocks, $1$ single indirect, $1$ double indirect and $1$ triple indirect DBA. Disk block size is $4 \text{ KB }$ and...
731
views
commented
Dec 25, 2018
Operating System
made-easy-test-series
operating-system
inode
disk
+
–
0
answers
26
MadeEasy Test Series: Operating System - Memory Management
Consider five memory partitions of size $100 \text{ KB }, 500 \text{ KB }, 200 \text{ KB }, 450 \text{ KB and } 600 \text{ KB }$ ... Both next fit and best fit results in same None of the above Answer given by ME: Option $(B)$ My answer: Option $(D)$
Consider five memory partitions of size $100 \text{ KB }, 500 \text{ KB }, 200 \text{ KB }, 450 \text{ KB and } 600 \text{ KB }$ in same order. If sequence of requests fo...
778
views
asked
Dec 25, 2018
Operating System
made-easy-test-series
operating-system
memory-management
+
–
1
answer
27
Paging
Consider a computer system with single level paging architecture having logical address of 'd'-bit. The memory is byte addressable. If the page table entry size is '32'-bits. What must be the optimal page size P by minimizing the page table overhead and internal fragmentation in paging?
Consider a computer system with single level paging architecture having logical address of 'd'-bit. The memory is byte addressable. If the page table entry size is '32'-b...
1.4k
views
commented
Dec 25, 2018
0
answers
28
Test Series Question
What should be the answer?
What should be the answer?
470
views
comment edited
Dec 25, 2018
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
6
answers
29
Deadlock
Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which system is guaranteed to be deadlock free ________. Given answer is 6. I am getting 12.
Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which sy...
5.8k
views
commented
Dec 25, 2018
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
9
answers
30
GATE CSE 2008 | Question: 58
A computer on a $10\text{Mbps}$ network is regulated by a token bucket. The token bucket is filled at a rate of $2\text{Mbps}$. It is initially filled to capacity with $16\text{Megabits}$. What is the maximum duration for which the computer can transmit at the full $10\text{Mbps}$? $1.6$ seconds $2$ seconds $5$ seconds $8$ seconds
A computer on a $10\text{Mbps}$ network is regulated by a token bucket. The token bucket is filled at a rate of $2\text{Mbps}$. It is initially filled to capacity with $1...
25.0k
views
comment edited
Dec 25, 2018
Computer Networks
gatecse-2008
computer-networks
token-bucket
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register