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 zorojuro
5
answers
1
GATE CSE 2013 | Question: 10
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler re-evaluates the process priorities every $T$ time units and decides the next process ... is equivalent to the shortest-job-first algorithm. This algorithm is equivalent to the shortest-remaining-time-first algorithm.
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler re-evaluates th...
29.0k
views
commented
Sep 17, 2023
Operating System
gatecse-2013
operating-system
process-scheduling
normal
+
–
2
answers
2
Output Under Dynamic Scoping
#include<stdio.h> int x=10; int main() { static int x=10; x+=f1()+f2()+f3()+f1(); printf("%d",x); return 0; } int f1(){static int x=25;x++;return x;} int f2(){int x=50;x++;return x;} int f3(){x*=10;return x;} What is the output of the above code, if dynamic scoping is used.
#include<stdio.h int x=10; int main() { static int x=10; x+=f1()+f2()+f3()+f1(); printf("%d",x); return 0; } int f1(){static int x=25;x++;return x;} int f2(){int x=50;x++...
2.1k
views
commented
Feb 18, 2023
Programming in C
dynamic-scoping
programming
+
–
6
answers
3
GATE CSE 2021 Set 1 | Question: 42
Consider the following Boolean expression. $F=(X+Y+Z)(\overline X +Y)(\overline Y +Z)$ Which of the following Boolean expressions is/are equivalent to $\overline F$ (complement of $F$ ... $X\overline Y +Y\overline Z + \overline X\; \overline Y \;\overline Z$
Consider the following Boolean expression.$F=(X+Y+Z)(\overline X +Y)(\overline Y +Z)$Which of the following Boolean expressions is/are equivalent to $\overline F$ (comple...
10.5k
views
commented
Feb 12, 2023
Digital Logic
gatecse-2021-set1
multiple-selects
digital-logic
boolean-algebra
2-marks
+
–
5
answers
4
GATE CSE 2022 | Question: 5
Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is $\text{TRUE}$ about the time complexity of algorithms that solve the above problem ... $O(1)$ space.
Consider the problem of reversing a singly linked list. To take an example, given the linked list below,the reversed linked list should look likeWhich one of the followin...
9.5k
views
commented
Sep 15, 2022
DS
gatecse-2022
data-structures
linked-list
1-mark
+
–
2
answers
5
Ace Test Series: Databases - Transactions
Whether the given schedule is conflict serializable or view serializable or none.
Whether the given schedule is conflict serializable or view serializable or none.
931
views
commented
Sep 11, 2022
Databases
databases
transaction-and-concurrency
ace-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register