GATE 2017-2018 :: GATE CSE
-
Using public key cryptography, X adds a digital signature σ to message M, encrypts
- An index is clustered, if
- Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?
-
Which of the following statements is/are FALSE? 1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.2. Turing recognizable languages are closed under union and complementation.3. Turing decidable languages are closed under intersection and complementation.4. Turing recognizable languages are closed under union and intersection.
-
Which of the following statements are TRUE? 1. The problem of determining whether there exists a cycle in an undirected graph is in P.2. The problem of determining whether there exists a cycle in an undirected graph is in NP.3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
- What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
- In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a set are placed in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. The main memory block numbered j must be mapped to any one of the cache lines from
- Which one of the following expressions does NOT represent exclusive NOR of x and y?
-
Function f is known at the following points:
The value of
computed using the trapezoidal rule is
|
A.
Encryption: X's private key followed by Y's private key; Decryption: X's public key followed by Y's public key
|
|
B.
Encryption: X's private key followed by Y's public key; Decryption: X's public key followed by Y's private key
|
|
C.
Encryption: X's public key followed by Y's private key; Decryption: Y's public key followed by X's private key
|
|
D.
Encryption: X's private key followed by Y's public key; Decryption: Y's private key followed by X's public key
|
Whatsapp
Facebook
|
A.
it is on a set of fields that form a candidate key.
|
|
B.
it is on a set of fields that include the primary key.
|
|
C.
the data records of the file are organized in the same order as the data entries of the index.
|
|
D.
the data records of the file are organized not in the same order as the data entries of the index.
|
.
.
.
.