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 balraj_allam
2
answers
1
Made Easy Test Series
b = b + c d = b + d b = b – d e = d + b The minimum number of nodes and edges present in the DAG representation of above basic block respectively are ? 4 and 5 5 and 4 6 and 6 6 and 7
b = b + cd = b + db = b – de = d + bThe minimum number of nodes and edges present in the DAG representation of above basic block respectively are ?4 and 55 and 46 and 6...
2.4k
views
asked
Jan 27, 2019
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
made-easy-test-series
+
–
0
answers
2
made easy test series
The output of the program if dynamic scoping is used__?
The output of the program if dynamic scoping is used__?
547
views
commented
Jan 14, 2019
0
answers
3
MadeEasy Full Length Test 2019: Programming & DS - Recursion
Number of times # will be printed on foo(7) ?
Number of times # will be printed on foo(7) ?
871
views
commented
Jan 13, 2019
Programming in C
programming
recursion
made-easy-test-series
+
–
1
answer
4
MadeEasy Full Length Test 2019: Operating System - Threads
Consider the following statements: S1 : Multiprogramming is used to increase CPU utilization, while time-sharing is used to increase CPU responsiveness in interacting with user. S2 : If a user-level thread is blocked for I/ ... to be assigned to different processors in a multi-processor computer system. Which of the following is true?
Consider the following statements:S1 : Multiprogramming is used to increase CPU utilization, while time-sharing is used to increase CPU responsiveness in interacting wit...
1.8k
views
commented
Dec 28, 2018
Operating System
operating-system
threads
made-easy-test-series
+
–
1
answer
5
MadeEasy Test Series: Operating System - Prcocess
Consider the following statements: S1: Long term scheduler sends the process from ready state to running state. S2: Medium term scheduler controls the degree of multiprogramming. which of the following is correct? Only S1 Only S2 Both S1 & S2 Neither S1 & S2
Consider the following statements:S1: Long term scheduler sends the process from ready state to running state.S2: Medium term scheduler controls the degree of multiprogra...
3.2k
views
commented
Dec 9, 2018
Operating System
made-easy-test-series
operating-system
process
+
–
1
answer
6
MadeEasy Test Series: Operating System - Threads
Consider the following statements: S1: Multiprogramming is used to increase CPU utilization, while time-sharing is used to increase CPU responsiveness in interacting with user. S2: If a user-level-thread is blocked for I/O operation, then kernel of OS will ... of the following is true? Only S1 & S2 Only S2 & S3 Only S1 & S3 None of these
Consider the following statements:S1: Multiprogramming is used to increase CPU utilization, while time-sharing is used to increase CPU responsiveness in interacting with ...
1.7k
views
asked
Dec 9, 2018
Operating System
made-easy-test-series
operating-system
threads
+
–
2
answers
7
MadeEasy Test Series: Operating System - Memory Management
Consider a paging scheme, in which average process size is 32MB and each page table entry size is 4B. The optimal size of page to minimize the total overload due to page table and internal fragmentation is _______KB.
Consider a paging scheme, in which average process size is 32MB and each page table entry size is 4B. The optimal size of page to minimize the total overload due to page ...
1.7k
views
asked
Dec 6, 2018
Operating System
made-easy-test-series
operating-system
memory-management
paging
+
–
9
answers
8
GATE CSE 2010 | Question: 41
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automation that accepts $L$? $n-1$ $n$ $n+1$ $2^{n-1}$
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automati...
24.0k
views
commented
Nov 15, 2018
Theory of Computation
gatecse-2010
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
8
answers
9
GATE CSE 2004 | Question: 57
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The TCP layer prefixes $20$ byte header to the message. This passes through an intermediate network $B$ ... overheads. $325.5$ $\text{Kbps}$ $354.5$ $\text{Kbps}$ $409.6$ $\text{Kbps}$ $512.0$ $\text{Kbps}$
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The ...
19.1k
views
commented
Aug 14, 2018
Computer Networks
gatecse-2004
computer-networks
ip-addressing
tcp
normal
+
–
3
answers
10
GATE CSE 1999 | Question: 22-b
Consider the set of relations EMP (Employee-no. Dept-no, Employee-name, Salary) DEPT (Dept-no. Dept-name, Location) Write an SQL query to: Calculate, for each department number, the number of employees with a salary greater than Rs. 1,00,000
Consider the set of relationsEMP (Employee-no. Dept-no, Employee-name, Salary)DEPT (Dept-no. Dept-name, Location)Write an SQL query to:Calculate, for each department numb...
1.9k
views
answered
Feb 13, 2018
Databases
gate1999
databases
sql
descriptive
easy
+
–
3
answers
11
GATE CSE 2001 | Question: 21-b
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number. Write an SQL query to list the regno of examinees who have a score greater than the average score.
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number.Write an SQL query to list the regno of examinees who have a s...
2.0k
views
answered
Feb 13, 2018
Databases
gatecse-2001
databases
sql
normal
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register