Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged uppcl2018
0
votes
1
answer
31
UPPCL AE 2018:55
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in the list that is larger than the second minimum in the list is $\Theta(n \log n)$ $\Theta(n/ \log n)$ $\Theta(1)$ $\Theta(\log n)$
admin
asked
in
Algorithms
Jan 5, 2019
by
admin
381
views
uppcl2018
algorithms
time-complexity
0
votes
0
answers
32
UPPCL AE 2018:54
Assume that a file is written using write $\text{(fd, buf, K)}$ system call, where $\text{fd}$ is the file descriptor and $\text{K}$ is the number of bytes to be written to the current file offset which is a multiple of the disk block size $\text{D}$. The total number ... system call returns None of the above is at least $\text{K/D}$ is equal to $\text{K/D}$ is at most $\text{K/D}$
admin
asked
in
Operating System
Jan 5, 2019
by
admin
210
views
uppcl2018
operating-system
system-call
0
votes
1
answer
33
UPPCL AE 2018:53
Consider a hash table of size $7$ implemented using an array $A[0 \dots 6].$ A modulo hash function $\text{(MOD 7)}$ is used to map the keys, and open addressing is used to handle collisions. If $53, 32, 43, 51, 99$ ... $\text{EMPTY}, 43, 51, 99, 53, 32, \text{EMPTY}$ $\text{EMPTY}, 43, 99, 51, 32, 53, \text{EMPTY}$
admin
asked
in
Algorithms
Jan 5, 2019
by
admin
312
views
uppcl2018
algorithms
hashing
0
votes
0
answers
34
UPPCL AE 2018:52
Consider the following implementation as a solution to the critical section problem for two processes $\text{P}_{0}$ and $\text{P}_{1}$ with id $0$ and $1,$ respectively. int flag[2] = {0,0}; int turn = 0; void lock (int id) /* ... exclusion is guaranteed Mutual exclusion is guaranteed if $\text{S1}$ and $\text{S2}$ are interchanged Solution leads to a deadlock None of the above
admin
asked
in
Operating System
Jan 5, 2019
by
admin
201
views
uppcl2018
operating-system
process-synchronization
deadlock-prevention-avoidance-detection
0
votes
0
answers
35
UPPCL AE 2018:51
Consider the following code. int count = 0; void *thfunc () { int ctr = 0; for(ctr=0; ctr<100; ctr++) count++; } If thfunc is executed by two threads concurrently in a uniprocessor system, what will be the $\textbf{MINIMUM}$ value of count when both threads complete ... increament $\text{R},$ and (iii) store the value of $\text{R}$ in memory. $200$ $100$ $2$ None of the above
admin
asked
in
Operating System
Jan 5, 2019
by
admin
236
views
uppcl2018
operating-system
process-synchronization
threads
0
votes
0
answers
36
UPPCL AE 2018:49
If you are running a website, you purchase a digital certificate from a certification authority, and send your digital certificate to any web-client connecting to your website in order to: Provide your password to access your website Provide ... your website Announce that you actually guarantee security of the website Provide your private key to users connecting to your website
admin
asked
in
Computer Networks
Jan 5, 2019
by
admin
204
views
uppcl2018
computer-networks
cryptography
0
votes
0
answers
37
UPPCL AE 2018:50
Assume that we test the performance of two processors, $\text{P}_{1}$ and $\text{P}_{2},$ on a program. We find the following about each: Processor $\text{P}_{1}$ has a $\text{CPI}$ of $2$ and executes $2$ billion instructions per ... $\text{B}$ Not enough information to tell Processor $\text{A}$ They have equal performance
admin
asked
in
CO and Architecture
Jan 5, 2019
by
admin
263
views
uppcl2018
co-and-architecture
pipelining
0
votes
0
answers
38
UPPCL AE 2018:48
Which of the following always happens during the $\text{SSL/TLS}$ handshake? The server and client already use a fixed set of cryptographic algorithms that are pre-decided by the system administrators The client sends client hello with a set of ... distribution and fixing of algorithms are done offline so there is no need for any exchange of algorithm or key during the handshake
admin
asked
in
Computer Networks
Jan 5, 2019
by
admin
342
views
uppcl2018
computer-networks
cryptography
0
votes
1
answer
39
UPPCL AE 2018:45
In which of the following cases, a process executing in user mode requires an entry into the $\text{OS}$ mode? Decrementing an unsigned integer value stored in a register beyond zero Adding values of two registers using $\textsf{ADD}$ instruction Executing $\textsf{printf} ()$ Accessing a general purpose register
admin
asked
in
CO and Architecture
Jan 5, 2019
by
admin
281
views
uppcl2018
co-and-architecture
addressing-modes
0
votes
1
answer
40
UPPCL AE 2018:46
Which one of the following algorithms cannot sort $n$ numbers in $O(n)$ comparisons? Counting sort Radix sort Heap sort Bucket sort
admin
asked
in
Algorithms
Jan 5, 2019
by
admin
487
views
uppcl2018
algorithms
sorting
0
votes
1
answer
41
UPPCL AE 2018:47
How many Boolean functions in one variable are $\text{NOT}$ idempotent: i.e. they do not satisfy $\forall a.f(f(a)) = f(a).$ $4$ Infinite $1$ $0$
admin
asked
in
Digital Logic
Jan 5, 2019
by
admin
398
views
uppcl2018
digital-logic
boolean-algebra
0
votes
0
answers
42
UPPCL AE 2018:44
In an instruction execution pipeline, the earliest that the instruction $\text{TLB}$ and data $\text{TLB}$ can be accessed are Memory stage and memory stage respectively Memory stage and execute stage respectively Fetch stage and fetch stage respectively Fetch stage and memory stage respectively
admin
asked
in
CO and Architecture
Jan 5, 2019
by
admin
217
views
uppcl2018
co-and-architecture
pipelining
0
votes
0
answers
43
UPPCL AE 2018:43
Which of the following must be done in order to ensure the integrity of your electronic communication? None of the above Hash the message without any key, digitally sign the hash, and then send it to the recipient along with the message Encrypt the ... message Hash the message with the public key of the recipient, and send the hash value of the message along with the message
admin
asked
in
Computer Networks
Jan 5, 2019
by
admin
212
views
uppcl2018
computer-networks
encryption-decryption
0
votes
0
answers
44
UPPCL AE 2018:42
What key(s) are used by the sender of an encrypted message in an asymmetric-key cipher? Private key of the sender Public or private key of the sender Neither public nor private key of the receiver Public key of the receiver
admin
asked
in
Computer Networks
Jan 5, 2019
by
admin
193
views
uppcl2018
computer-networks
encryption-decryption
0
votes
0
answers
45
UPPCL AE 2018:41
The problem of finding an integral solution of a given system of integral polynomial equations has complexity: Polynomial-time Exponential-space Undecidable Exponential-time
admin
asked
in
Theory of Computation
Jan 5, 2019
by
admin
260
views
uppcl2018
theory-of-computation
decidability
0
votes
2
answers
46
UPPCL AE 2018:40
If in $\text{CIDR}$ notation an $\text{IP}$ address is written as $172.26.17.1/25$, the subnet mask is: $255.255.255.192$ $255.255.255.0$ $255.255.240.0$ $255.255.255.128$
admin
asked
in
Computer Networks
Jan 5, 2019
by
admin
743
views
uppcl2018
computer-networks
ip-address
subnetting
1
vote
0
answers
47
UPPCL AE 2018:39
Match all items in Group $1$ with correct options from those given in Group $2.$ ... $\text{P-1, Q-2, R-3, S-4}$ $\text{P-2, Q-3, R-4, S-1}$
admin
asked
in
Compiler Design
Jan 5, 2019
by
admin
246
views
uppcl2018
compiler-design
intermediate-code
0
votes
1
answer
48
UPPCL AE 2018:38
Which of the given options provides the increasing order of asymptotic complexity of functions $\text{f}_{1}, \text{f}_{2}, \text{f}_{3}$ and $ \text{f}_{4} $ ... $\text{f}_{4}, \text{f}_{3}, \text{f}_{2}, \text{f}_{1}$
admin
asked
in
Algorithms
Jan 5, 2019
by
admin
440
views
uppcl2018
algorithms
asymptotic-notation
time-complexity
0
votes
0
answers
49
UPPCL AE 2018:37
A file is organized so that the ordering of data records is the same as, or close to the ordering of data entries in some index. Such an index is commonly known as: Dense None of the above Clustered Sparse
admin
asked
in
Operating System
Jan 5, 2019
by
admin
171
views
uppcl2018
operating-system
file-system
file-organization
0
votes
1
answer
50
UPPCL AE 2018:36
Consider the following program. #include<stdio.h> #include<stdlib.h> #include<unistd.h> int main(void) { pid_t pid; int varl = 100; pid = fork(); if(pid == 0) /* Child process */ varl = 200; fork(); printf( %d , varl); return 0; } Assuming all invocations of fork are ... $200 \; 200 \; 200 \; 200$ $100 \; 100 \; 100 \; 100$ $100 \; 200 \; 200 \; 200$
admin
asked
in
Operating System
Jan 5, 2019
by
admin
382
views
uppcl2018
operating-system
system-call
fork-system-call
1
vote
0
answers
51
UPPCL AE 2018:35
Which phase during compilation does a compiler recognize the $\textbf{keywords}$ of a language? Code generation Parsing Dataflow analysis Lexical analysis
admin
asked
in
Compiler Design
Jan 5, 2019
by
admin
259
views
uppcl2018
compiler-design
lexical-analysis
1
vote
2
answers
52
UPPCL AE 2018:34
What is the output of the following $\text{C}$ program? #include<stdio.h> int main(void){ char s1[] = “Hello”; char s2[] = “World!”; s1 = s2; printf(“%s”,s1); } “World!” “HelloWorld!” “Compilation error” “Hello”
admin
asked
in
Programming in C
Jan 5, 2019
by
admin
386
views
uppcl2018
programming
programming-in-c
output
0
votes
1
answer
53
UPPCL AE 2018:33
Consider a disk pack with $32$ surfaces, $128$ tracks per surface, and $256$ sectors per track, $512$ bytes of data are stored in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to address a particular sector in the disk are respectively: $512 \; \text{MB}, 20$ $256 \; \text{MB}, 20$ $128 \; \text{MB}, 18$ $1024 \; \text{MB}, 21$
admin
asked
in
CO and Architecture
Jan 5, 2019
by
admin
388
views
uppcl2018
co-and-architecture
disk
0
votes
0
answers
54
UPPCL AE 2018:32
Which of the following statement is $\text{TRUE}$? Doubling the block size and halving the number of sets will reduce capacity misses The last-level cache is designed for high capacity rather than low latency Workloads with high temporal locality benefit from smaller cache block sizes Workloads with high spatial locality benefit from smaller cache block sizes
admin
asked
in
CO and Architecture
Jan 5, 2019
by
admin
190
views
uppcl2018
co-and-architecture
cache-memory
multilevel-cache
1
vote
2
answers
55
UPPCL AE 2018:31
How many different Boolean circuits of $n$ variables are there? None of the above $n^{2^{n}}$ $2^{2^{n}}$ $2^{n}$
admin
asked
in
Digital Logic
Jan 5, 2019
by
admin
398
views
uppcl2018
digital-logic
boolean-algebra
0
votes
0
answers
56
UPPCL AE 2018:30
What is logically equivalent to the following statement? “I pass only if you pass” (Note that fail is equivalent to not pass.) If you pass then I pass You fail if I fail You pass only if I pass If you fail then I fail
admin
asked
in
Mathematical Logic
Jan 5, 2019
by
admin
182
views
uppcl2018
mathematical-logic
propositional-logic
0
votes
1
answer
57
UPPCL AE 2018:29
Which of the following best describes the usage of the $\text{TTL}$ (Time to Live) field of an $\text{IP}$ packet? Improve throughput Prevent packet from wandering around forever Reduce packet transmission delay Detect whether any error has been introduced in the packet
admin
asked
in
Computer Networks
Jan 5, 2019
by
admin
293
views
uppcl2018
computer-networks
ip-packet
0
votes
1
answer
58
UPPCL AE 2018:28
Which of the following problems are decidable? Checking whether two regular languages are equivalent Checking whether two non-deterministic finite automata accept the same language Checking whether two context free grammars generate equivalent languages Checking whether a language of a context free grammar is ... $\text{I, II, III}$ and $\text{IV}$ $\text{I}$ and $\text{II}$ only
admin
asked
in
Theory of Computation
Jan 5, 2019
by
admin
230
views
uppcl2018
theory-of-computation
decidability
1
vote
0
answers
59
UPPCL AE 2018:27
Which of the following data structures is used by a compiler to manage information about variables and their attributes? abstract syntax tree symbol table semantic stack parse table
admin
asked
in
Compiler Design
Jan 5, 2019
by
admin
228
views
uppcl2018
compiler-design
lexical-analysis
0
votes
1
answer
60
UPPCL AE 2018:26
Which of the following languages over the alphabet $\Sigma = \{0,1\}$ is regular? $0^{n} 1^{m}$ $0^{n} 1^{m}$ where $m=n+1$ $0^{m} 1^{n}$ where $m \equiv n(\text{mod 3}).$ $\text{I}$ and $\text{III}$ $\text{III}$ and $\text{II}$ $\text{II}$ only $\text{III}$ only
admin
asked
in
Theory of Computation
Jan 5, 2019
by
admin
251
views
uppcl2018
theory-of-computation
regular-language
Page:
« prev
1
2
3
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged uppcl2018
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...