Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
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)$
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 ...
admin
406
views
admin
asked
Jan 5, 2019
Algorithms
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}$
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 ...
admin
226
views
admin
asked
Jan 5, 2019
Operating System
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}$
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 ...
admin
331
views
admin
asked
Jan 5, 2019
Algorithms
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
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....
admin
215
views
admin
asked
Jan 5, 2019
Operating System
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
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 unip...
admin
243
views
admin
asked
Jan 5, 2019
Operating System
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
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 we...
admin
214
views
admin
asked
Jan 5, 2019
Computer Networks
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
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 $\...
admin
279
views
admin
asked
Jan 5, 2019
CO and Architecture
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
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...
admin
370
views
admin
asked
Jan 5, 2019
Computer Networks
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
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 ...
admin
301
views
admin
asked
Jan 5, 2019
CO and Architecture
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
Which one of the following algorithms cannot sort $n$ numbers in $O(n)$ comparisons?Counting sortRadix sortHeap sortBucket sort
admin
501
views
admin
asked
Jan 5, 2019
Algorithms
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$
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
398
views
admin
asked
Jan 5, 2019
Digital Logic
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
In an instruction execution pipeline, the earliest that the instruction $\text{TLB}$ and data $\text{TLB}$ can be accessed areMemory stage and memory stage respectivelyMe...
admin
228
views
admin
asked
Jan 5, 2019
CO and Architecture
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
Which of the following must be done in order to ensure the integrity of your electronic communication?None of the aboveHash the message without any key, digitally sign th...
admin
234
views
admin
asked
Jan 5, 2019
Computer Networks
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
What key(s) are used by the sender of an encrypted message in an asymmetric-key cipher?Private key of the senderPublic or private key of the senderNeither public nor priv...
admin
209
views
admin
asked
Jan 5, 2019
Computer Networks
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
The problem of finding an integral solution of a given system of integral polynomial equations has complexity:Polynomial-timeExponential-spaceUndecidableExponential-time
admin
278
views
admin
asked
Jan 5, 2019
Theory of Computation
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$
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
761
views
admin
asked
Jan 5, 2019
Computer Networks
uppcl2018
computer-networks
ip-address
subnetting
+
–
1
votes
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}$
Match all items in Group $1$ with correct options from those given in Group $2.$$$\begin{array} {|l|l|} \hline \qquad \qquad \textbf{Group 1} & \qquad \textbf{Group 2} \\...
admin
269
views
admin
asked
Jan 5, 2019
Compiler Design
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}$
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}_...
admin
462
views
admin
asked
Jan 5, 2019
Algorithms
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
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:DenseN...
admin
181
views
admin
asked
Jan 5, 2019
Operating System
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$
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) /* Ch...
admin
402
views
admin
asked
Jan 5, 2019
Operating System
uppcl2018
operating-system
system-call
fork-system-call
+
–
1
votes
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
Which phase during compilation does a compiler recognize the $\textbf{keywords}$ of a language?Code generationParsingDataflow analysisLexical analysis
admin
278
views
admin
asked
Jan 5, 2019
Compiler Design
uppcl2018
compiler-design
lexical-analysis
+
–
2
votes
3
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”
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); }...
admin
424
views
admin
asked
Jan 5, 2019
Programming in C
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$
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 cap...
admin
403
views
admin
asked
Jan 5, 2019
CO and Architecture
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
Which of the following statement is $\text{TRUE}$?Doubling the block size and halving the number of sets will reduce capacity missesThe last-level cache is designed for h...
admin
199
views
admin
asked
Jan 5, 2019
CO and Architecture
uppcl2018
co-and-architecture
cache-memory
multilevel-cache
+
–
1
votes
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}$
How many different Boolean circuits of $n$ variables are there?None of the above$n^{2^{n}}$$2^{2^{n}}$$2^{n}$
admin
414
views
admin
asked
Jan 5, 2019
Digital Logic
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
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 passYou fail if I fai...
admin
204
views
admin
asked
Jan 5, 2019
Mathematical Logic
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
Which of the following best describes the usage of the $\text{TTL}$ (Time to Live) field of an $\text{IP}$ packet?Improve throughputPrevent packet from wandering around f...
admin
314
views
admin
asked
Jan 5, 2019
Computer Networks
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
Which of the following problems are decidable?Checking whether two regular languages are equivalentChecking whether two non-deterministic finite automata accept the same ...
admin
255
views
admin
asked
Jan 5, 2019
Theory of Computation
uppcl2018
theory-of-computation
decidability
+
–
1
votes
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
Which of the following data structures is used by a compiler to manage information about variables and their attributes?abstract syntax treesymbol tablesemantic stackpars...
admin
257
views
admin
asked
Jan 5, 2019
Compiler Design
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
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}).$ $...
admin
277
views
admin
asked
Jan 5, 2019
Theory of Computation
uppcl2018
theory-of-computation
regular-language
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register