Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
pradeep_reddy
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by pradeep_reddy
7
answers
1
GATE CSE 2014 Set 3 | Question: 11
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ______.
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ____...
19.0k
views
commented
Dec 13, 2021
Compiler Design
gatecse-2014-set3
compiler-design
numerical-answers
normal
code-optimization
+
–
10
answers
2
GATE CSE 2001 | Question: 1.10, UGCNET-Dec2012-III: 36
Suppose a processor does not have any stack pointer registers, which of the following statements is true? It cannot have subroutine call instruction It cannot have nested subroutines call Interrupts are not possible All subroutine calls and interrupts are possible
Suppose a processor does not have any stack pointer registers, which of the following statements is true?It cannot have subroutine call instructionIt cannot have nested s...
17.7k
views
commented
Nov 25, 2021
CO and Architecture
gatecse-2001
co-and-architecture
normal
ugcnetcse-dec2012-paper3
runtime-environment
+
–
2
answers
3
GATE CSE 2021 Set 2 | Question: 14
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling? Turnaround time includes waiting time The goal is to only maximize $\text{CPU}$ utilization and minimize throughput Round-robin policy ... $\text{CPU}$ time required by each of the processes is not known apriori Implementing preemptive scheduling needs hardware support
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling?Turnaround time includes waiting timeThe goal is to only maximize $\text{CPU}...
10.4k
views
comment edited
Nov 2, 2021
Operating System
gatecse-2021-set2
multiple-selects
operating-system
process-scheduling
1-mark
+
–
2
answers
4
GATE CSE 1987 | Question: 9e
How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?
How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?
3.1k
views
commented
Jun 17, 2021
Set Theory & Algebra
gate1987
set-theory&algebra
relations
descriptive
+
–
1
answer
5
GATE CSE 1997 | Question: 76-b
Consider the following relational database schema: EMP (eno name, age) PROJ (pno name) INVOLVED (eno, pno) EMP contains information about employees. PROJ about projects and involved about which employees involved in which projects. The underlined attributes are the primary ... makes a copy of $\text{EMP}$ and names it $E$ ($\rho$ is called the rename operator))
Consider the following relational database schema:EMP (eno name, age)PROJ (pno name)INVOLVED (eno, pno)EMP contains information about employees. PROJ about projects and i...
3.2k
views
commented
May 26, 2021
Databases
gate1997
databases
sql
descriptive
normal
+
–
4
answers
6
GATE CSE 1999 | Question: 2.11
Which of the following is/are advantage(s) of virtual memory? Faster access to memory on an average. Processes can be given protected address spaces. Linker can assign addresses independent of where the program will be loaded in physical memory. Program larger than the physical memory size can be run.
Which of the following is/are advantage(s) of virtual memory?Faster access to memory on an average.Processes can be given protected address spaces.Linker can assign addre...
13.7k
views
commented
Mar 30, 2021
Operating System
gate1999
operating-system
virtual-memory
easy
+
–
2
answers
7
GATE CS set1 2016 answer key based on chat discussions
189 views GATE CS Set-1 Answer key based on chat discussions for CS section: 1. best cpu scheduling algo - srtf 2. no.of jk flipflops for a counter - 1 3. min no.of temporary registers - 6 4. worst case time complexities of mergesort, insertion, ... of Min Weight Spanning Tree of 6 distinct edges 1,2,3,4,5,6 - 7 52. missing while loop .. b!=a
189 viewsGATE CS Set-1 Answer key based on chat discussions for CS section:1. best cpu scheduling algo - srtf2. no.of jk flipflops for a counter - 13. min no.of temporary...
2.8k
views
commented
Feb 10, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register