Description : Which of the following is not the type of queue? A) Ordinary queue B) Single ended queue C) Circular queue D) Priority queue
Last Answer : B) Single ended queue
Description : In a queue, the initial values of front pointer f rare pointer r should be ….. and …….. respectively. A) 0 and 1 B) 0 and -1 C) -1 and 0 D) 1 and 0
Last Answer : B) 0 and -1
Description : There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access ... The final value of semaphore will be: (1) 0 (2) 1 (3) -1 (4) -2
Last Answer : Answer: 1
Description : What is a queue? Give a real life example.
Last Answer : A: It is a linear data structure which follows the FIFO (First In First out) pattern. Real life example: Queue at the ticket counter
Description : The …………….. policy segments the disks request queue into sub queues of the length N. A) SCAN B) C-SCAN C) N-Step SCAN D) FSCAN
Last Answer : C) N-Step SCAN
Description : ……… is not the operation that can be performed on queue. A) Insertion B) Deletion C) Retrieval D) Traversal
Last Answer : D) Traversal
Description : ………… is very useful in situation when data have to stored and then retrieved in reverse order. A) Stack B) Queue C) List D) Link list
Last Answer : A) Stack
Description : ……………. Is a pile in which items are added at one end and removed from the other. A) Stack B) Queue C) List D) None of the above
Last Answer : B) Queue
Description : Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67: (A) 310 (B) 324 (C) 320 (D) 321
Last Answer : (D) 321
Description : Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue ... . (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.
Last Answer : (D) Both S1 and S2 are correct.
Description : Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving ... and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders
Last Answer : Answer: 236 and 208 cylinders Explanation: SSTF Initial head position =53 The closest queue to initial head position=65 head moves from 53 to 65=12 head moves from 65 to 67=2 head moves from 67 ... 122=24 head moves from 122 to 124=2 head moves from 124 to 183=59 Total head movement=208
Description : If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of ... (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes
Last Answer : (C) Only rear pointer changes
Description : Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) ... to a queue (D) This algorithm can be configured to match a specific system under design
Last Answer : (C) Processes are permanently assigned to a queue
Description : If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319
Last Answer : (C) 321
Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5
Last Answer : (A) 3
Description : Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < ... , C (B) C, E, D, B, A (C) E, D, C, B, A (D) C, B, A, E, D
Last Answer : (B) C, E, D, B, A
Description : Consider the following statements : S1: A queue can be implemented using two stacks. S2: A stack can be implemented using two queues. Which of the following is correct ? (A) S1 is correct and S2 is not correct. ( ... S2 is correct. (C) Both S1 and S2 are correct. (D) Both S1 and S2 are not correct.
Last Answer : (C) Both S1 and S2 are correct.
Description : Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction ... . The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228
Last Answer : (2) 173
Description : The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed ... The popped item is ................... (1) A (2) B (3) F (4) G
Last Answer : Answer: 2
Description : Best-First search can be implemented using the following data structure. a) Queue b) Stack c) Priority Queue d) Circular Queue
Last Answer : c) Priority Queue
Description : Best-First search can be implemented using the following data structure A : Queue B : Stack C : Priority Queue D : Circular Queue
Last Answer : C : Priority Queue
Last Answer : A : Queue
Description : The expression x=4+2 % -8 evaluates to A) -6 B) 6 C) 4 D) None of the above
Last Answer : B) 6
Description : For like predicate which of the following is true. i) % matches zero of more characters. ii) _ matches exactly one character. A) i-only B) ii-only C) Both of them D) None of them
Last Answer : C) Both of them
Description : What will be the output of the following segment of the program? main( ) { char *s = “hello world”; int i = 7; printf(“%, *s”, i, s); } (A) Syntax error (B) hello w (C) hello (D) o world
Last Answer : Answer: Marks given to all
Description : Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of 6 seconds of service time. What will be the CPU utilization ? (A) 80 % (B) 50 % (C) 60 % (D) 30 %
Last Answer : (B) 50 %
Description : A direct method of deadlock prevention is to prevent the occurrence of ………….. A) Mutual exclusion B) Hold and wait C) Circular waits D) No preemption
Last Answer : C) Circular waits
Description : The following conditions of policy must be present for a deadlock to be possible. i) Mutual exclusion ii) Hold and wait iii) No preemption iv) Circular wait A) i, ii and iii only B) ii, iii and iv only C) i, iii and iv only D) All i, ii, iii and iv
Last Answer : D) All i, ii, iii and iv
Description : A direct method of deadlock prevention is to prevent the occurrences of ................... A) Mutual exclusion B) Hold and wait C) Circular waits D) No preemption
Description : Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first ... linked list. A) i-only B) ii-only C) Both i and ii D) None of both
Last Answer : C) Both i and ii
Description : Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation? (A) Circular linked list (B) Doubly linked list (C) Linked list (D) Dequeue
Last Answer : (B) Doubly linked list
Description : If the designed speed on a circular curve of radius 1400 m is 80 km/hour, no super-elevation is provided, if the camber, is (A) 4 % (B) 3 % (C) 2 % (D) 1.7 %
Last Answer : Answer: Option C
Description : Which command is used to count just the number of characters in a file? A. wc - 1 B. wc -c C. wc -w D. wc -r E. None of the above
Last Answer : B. wc -c
Description : Which command is used to remove the read permission of the file 'note' from both the group and others? A. chmod go+r note B. chmod go+rw note C. chmod go-x note D. chmod go-r, 4-x note E. None of the above
Last Answer : D. chmod go-r, 4-x note
Description : Which of the following keys is used to replace a single character with new text? A. S B. s C. r D. C E. None of the above
Last Answer : B. s
Description : Which command is used to change protection mode of files starting with the string emp and ending with 1,2, or 3? A. chmod u+x emp[l-3] B. chmod 777 emp* C. chmod u+r ??? emp D. chmod 222 emp? E. None of the above
Last Answer : A. chmod u+x emp[l-3]
Description : Which command is used to sort the lines of data in a file in reverse order A. sort B. sh C. st D. sort -r E. None of the above
Last Answer : D. sort -r
Description : hat is the output when following code is executed ? >>>print r"\nhello" The output is a) a new line and hello b) \nhello c) the letter r and then hello d) error
Last Answer : d) error
Description : A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave
Last Answer : (C) Convex
Description : For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF
Last Answer : (A) In 1NF not in 2NF
Description : Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise? (A) (p∨q∧˥r) ∨ (p∨q∧r) ∧ (˥p∧q∨r) (B) ... ) ∨ (˥q∨˥p∧˥r) (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r) (D) (p∨r∧q) ∨ (p∧q∧r) ∨ (˥p∧q∧r)
Last Answer : (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r)
Description : Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2
Last Answer : (C) 3
Description : If n and r are non-negative integers and n≥r, then p(n + 1, r) equals to (A) P(n,r)(n+1) / (n+1-r) (B) P(n,r)(n+1) / (n-1+r) (C) p(n,r)(n-1) / (n+1-r) (D) p(n,r)(n+1) / (n+1+r)
Last Answer : (A) P(n,r)(n+1) / (n+1-r) Explanation: p(n, r) = n!/(n-r)! p( n+1, r) = (n+1)!/(n+1-r)! = (n+1) n! /(n+1-r) (n-r)! = P(n, r)(n+1)/(n+1-r)
Description : In a binary Hamming code the number of check digits is r then number of message digits is equal to: (A) 2r-1 (B) 2r-r-1 (C) 2r-r+1 (D) 2r+r-1
Last Answer : (B) 2r-r-1
Description : The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if: (a) R1⋂R2→(R1-R2) (b) R1→R2 (c) R1⋂R2→(R2-R1) (d) R2→R1⋂R2 (A) (a) and (b) happens (B) (a) and (d) happens (C) (a) and (c) happens (D) (b) and (c) happens
Last Answer : (C) (a) and (c) happens
Description : Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships between E1 and E2 where R1 is one-many and R2 is many-many. R1 and R2 do not have any ... are required to represent this situation in the Relational Model? (A) 4 (B) 3 (C) 2 (D) 1
Last Answer : (B) 3
Description : Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true? (A) R(Pi)∩W(Pj)=Φ (B) W(Pi)∩R(Pj)=Φ (C) R(Pi)∩R(Pj)=Φ (D) W(Pi)∩W(Pj)=Φ
Last Answer : (C) R(Pi)∩R(Pj)=Φ
Description : "lf my computations are correct and I pay the electric bill, then I will run out of money. If I don't pay the electric bill, the power will be turned off. Therefore, if I don't run out of money and the power is still on ... r and ¬p → ¬b, then (¬r∨p)→¬c (D) if (c∨b) → r and ¬b → ¬p, then (¬r∧p)→¬c
Last Answer : (A) if (c∧b) → r and ¬b → ¬p, then (¬r∧p)→¬c