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 : ……………. 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 : 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 : When subroutine is called contents of program counter is location address of __ instruction following call instruction is stored on _ __and program execution is transferred to __ address. a. Non ... , Stack and Main program Cc. Executable, Queue and Subroutine d. Executable, Stack and Subroutine
Last Answer : d. Executable, Stack and Subroutine
Description : The processor uses the stack to keep track of where the items are stored on it this by using the: a. Stack pointer register b. Queue pointer register c. Both a & b d. None of these
Last Answer : a. Stack pointer register
Description : Which of the following is not an inherent application of stack? (A) Implementation of Stack (B) Evaluation of a postfix expression (C) Job Scheduling (D) Reverse a string
Last Answer : (C) Job Scheduling
Description : A system wherein items are added from one and removed from the other end. a) Stack b) Queue c) Linked List d) Array
Last Answer : Answer: b Explanation: In a queue, the items are inserted from the rear end and deleted from the front end
Description : Serial access memories are useful in applications where (A) Data consists of numbers (B) Short access time is required. (C) Each stored word is processed differently. (D) None of these
Last Answer : (D) None of these Explanation: data naturally needs to flow in and out in serial form.
Description : Which of the following statement(s) is/are FALSE in the context of Relational DBMS ? I. Views in a database system are important because they help with access control by allowing users to see only a particular subset of the data ... (B) III and IV only (C) I, II and III only (D) II, III and IV only
Last Answer : (D) II, III and IV only
Description : A data structure that follows the FIFO principle. a) Queue b) LL c) Stack d) Union
Last Answer : Answer: c Explanation: The answer is Stack. A stack follows the FIFO principle. FIFO stands for First In First Out This set of Tricky Computer Fundamentals Questions and Answers focuses on “Flowcharting Rules”
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 : Which is used to store critical pieces of data during subroutines and interrupts: a. Stack b. Queue c. Accumulator d. Data register
Last Answer : a. Stack
Description : Which one of the following is not a linear data structure? (A) Array (B) Binary Tree (C) Queue (D) Stack
Last Answer : (B) Binary Tree
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 : 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 : 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 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 : 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 : 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 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 : 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 : Transparency A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be retrieved with a single query C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these
Last Answer : C. Worth of the output of a machine learning program that makes it understandable for humans
Description : Shallow knowledge A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these
Last Answer : B. The information stored in a database that can be, retrieved with a single query
Description : Search space A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query. C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these
Last Answer : A . The large set of candidate solutions possible for a problem
Description : Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B ... Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks.
Last Answer : (C) Each i-node is 256-bytes long.
Description : LIFO is ______ where as FIFO is ________ a) Stack, Queue b) Queue, Stack c) Priority Queue, Stack d) Stack. Priority Queue
Last Answer : a) Stack, Queue
Description : ___ mode of addressing is a form of implied addressing: a. Stack b. Array Cc. Queue d. ‘Binary
Description : The subprogram finish the return instruction recovers the return address from the: a. Queue b. Stack c. Program counter d. Pointer
Last Answer : b. Stack
Description : Identify the LIFO (Last In First Out) structure among the following: (1) Stack (2) Queue (3) De-queue (4) Array
Last Answer : Stack
Description : The typical elements of process image are ..................... i) User data ii) System Data iii) User program iv) System stack A) i, iii and iv only B) i, ii, and iv only C) ii, iii, and iv only D) All i, ii, iii, and iv
Last Answer : A) i, iii and iv only
Description : A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.
Last Answer : (B) OS maintains only CPU registers for each thread.
Description : A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K
Last Answer : (B) 335 K
Description : The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack
Last Answer : (C) Scheduling parameters
Description : The mean-end analysis process centers around the detection of differences between the current state and the goal state. Once such a difference is isolated, an operator that can reduce the difference ... (A) backward planning (B) goal stack planning (C) operator subgoaling (D) operator overloading
Last Answer : (C) operator subgoaling
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 : In a circular queue the value of r will be .. A) r=r+1 B) r=(r+1)% [QUEUE_SIZE – 1] C) r=(r+1)% QUEUE_SIZE D) r=(r-1)% QUEUE_SIZE
Last Answer : C) r=(r+1)% QUEUE_SIZE
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 : 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 : 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 : 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 : When the RET instruction at the end of subroutine is executed, a. the information where the stack is iniatialized is transferred to the stack pointer b. the memory address of the RET instruction is ... two data bytes stored in the top two locations of the stack are transferred to the stack pointer
Last Answer : c. two data bytes stored in the top two locations of the stack are transferred to the program counter
Description : Which of the following statement is not correct with reference to cron daemon in UNIX O.S? (A) The cron daemon is the standard tool for running commands on a predetermined schedule. (B) It starts ... command lines and the times at which they invoked. (D) Crontab for individual users are not stored.
Last Answer : (D) Crontab for individual users are not stored.
Description : What is a stack? State it’s application.
Last Answer : A: It is a linear data structure which follows the LIFO (Last In First out) pattern. Stack memory is used in recursion. Application: It can be used for reversing strings, for evaluating postfix expressions.