StudyXT

MCQs on Pipelining in Computer Architecture  for UGC-NET , GATE, SET and other examinations. Q1. In a 4-stage pipeline with stage delays of 60 ns, 50 ns, 90 ns, and 80 ns, and a latch delay of 10 ns, what is the pipeline cycle time? A. 90 ns B. 100 ns C. 110 ns D. 80 ns Answer: B. 100 ns Explanation: Maximum stage delay = 90 ns; Cycle time = 90 + 10 = 100 ns Q2. If non-pipelined execution takes 280 ns and pipelined execution takes 100 ns, what is the speed-up? A. 2.0 B. 2.5 C. 2.8 D. 3.0 Answer: C. 2.8 Explanation: Speed-up = 280 / 100 = 2.8 Q3. A pipeline has stage delays of 150 ns, 120 ns, 160 ns, and 140 ns. If the latch delay is 5 ns, what is the pipeline cycle time? A. 150 ns B. 155 ns C. 160 ns D. 165 ns Answer: D. 165 ns Explanation: Maximum stage delay = 160 ns; Cycle time = 160 + 5 = 165 ns Q4. A non-pipelined processor runs at 2.5 GHz and takes 4 cycles per instruction. A pipelined version runs at 2 GHz with 5 stages and no stalls. What is ...

  10 multiple-choice questions  on  Distance Vector and Link-State Routing with explanations, useful for  UGC NET, SET, GATE, ISRO, and other competitive exams . Question 1: Basic Concept of Distance Vector Routing Q1: In a distance vector routing protocol, how do routers share routing information? A) By flooding the entire network with routing updates B) By periodically exchanging routing tables with their immediate neighbors C) By using a link-state database to determine the shortest path D) By dynamically updating paths based on link failure reports Answer: B) By periodically exchanging routing tables with their immediate neighbors Explanation: In Distance Vector Routing, routers share their routing tables with neighbors at regular intervals, leading to a simple but slow convergence mechanism. Question 2: Example of Distance Vector Routing Protocol Q2: Which of the following is an example of a Distance Vector routing protocol? A) OSPF ...

10 multiple-choice questions on Routing protocol s  with explanations, useful for UGC NET, SET, GATE, ISRO, and other competitive exams . Question 1: Purpose of Routing Protocols Q1: What is the primary purpose of a routing protocol? A) To assign IP addresses to devices B) To determine the best path for data packets to reach their destination C) To encrypt data during transmission D) To physically connect different networks Answer: B) To determine the best path for data packets to reach their destination Explanation: Routing protocols help routers determine the most efficient path for data transmission across a network, ensuring fast and reliable communication. Question 2: Classification of Routing Protocols Q2: Routing protocols can be broadly classified into which two main categories? A) TCP and UDP B) Distance Vector and Link-State C) IPv4 and IPv6 D) Static and Dynamic Answer: B) Distance Vector and Link-State Explanation: Routing prot...

 Here are 10 multiple-choice questions on Symbol Table with explanations, useful for UGC NET, SET, GATE, ISRO, and other competitive exams . Question 1: Purpose of Symbol Table Q1: What is the main purpose of a Symbol Table in a compiler? A) To store all the variables of a program B) To store information about identifiers like variables, functions, and classes C) To store the machine code of a program D) To store the syntax tree of a program Answer: B) To store information about identifiers like variables, functions, and classes Explanation: The Symbol Table keeps track of identifiers (variables, functions, classes, objects) and their associated information like scope, type, memory location, and access rights . Question 2: Data Structure for Symbol Table Q2: Which of the following data structures is commonly used for implementing a Symbol Table ? A) Stack B) Queue C) Hash Table D) Linked List Answer: C) Hash Table Explanation: A Hash Table allows fast l...

 Here are 10 multiple-choice questions on Compiler Design  for UGC NET, SET, GATE, ISRO, and other competitive exams . Question 1: Symbol Table Management Q1: In block-structured languages, how does the compiler manage multiple symbol tables? A) Using a single global table B) Using a stack of symbol tables C) Using a queue D) Using arrays Answer: B) Using a stack of symbol tables Explanation: Block-structured languages use nested scopes , so the compiler needs to manage different symbol tables dynamically. A stack is the best data structure for this because when entering a new block, a new symbol table is pushed onto the stack, and when exiting, it is popped . Question 2: Lexical Analysis Q2: Which of the following is the main function of a Lexical Analyzer in a compiler? A) To generate intermediate code B) To check syntax and semantics C) To convert source code into tokens D) To optimize the final machine code Answer: C) To convert source code into tok...

10 multiple-choice questions related to identifying the normal form of a table based on given functional dependencies, useful for UGC NET, SET, GATE, ISRO, and other competitive exams .  Question 1: 1NF Identification Q1: A table with the following structure is given: Attributes: {A, B, C} Functional Dependencies: A → B, A → C Does this table meet the requirements of 1NF? A) Yes, because all attributes are atomic B) No, because there are partial dependencies C) Yes, because there are no repeating groups D) No, because it violates 3NF Answer: A) Yes, because all attributes are atomic Explanation: A table is in 1NF if all its attributes contain atomic values and there are no repeating groups. The given table does not have any repeating groups or multi-valued attributes, so it satisfies the criteria of 1NF. Question 2: 2NF Identification Q2: A table with the following structure is given: Attributes: {A, B, C} Functional Dependencies: A → B, A → C Is thi...

Multiple-Choice Questions on Normalization and Normal Forms in DBMS for UGC NET, GATE, SET, ISRO and other exams  Question 1: Normalization Definition Q1: Normalization in a database is a process of: A) Reducing data redundancy and improving data integrity B) Increasing data redundancy for faster access C) Encrypting the database D) Creating more tables Answer: A) Reducing data redundancy and improving data integrity Explanation: Normalization is a systematic approach to organizing data in a database to minimize redundancy and ensure data integrity. It involves decomposing larger tables into smaller, well-structured tables while maintaining relationships among data. Question 2: First Normal Form (1NF) Q2: A table is in the First Normal Form (1NF) if: A) All values in the table are atomic and there are no repeating groups B) It contains no partial dependencies C) It contains no transitive dependencies D) It is free of all anomalies Answer: A) All value...

10 multiple-choice questions on the boot process in operating systems for ISRO, EMRS, GATE, KV, NET, and other exams. Question 1: Boot Process Definition Q1: The boot process is the sequence of events that occurs: A) When a user logs out B) When the system is powered on and the operating system is loaded C) When an application is opened D) When the system goes to sleep Answer: B) When the system is powered on and the operating system is loaded Explanation: The boot process refers to the series of steps that occur when a computer is turned on, including hardware initialization, loading the operating system, and preparing the system for use. Question 2: First Step in Boot Process Q2: The first step in the boot process is typically: A) Loading the operating system kernel B) Initializing system hardware C) Running the BIOS or UEFI firmware D) Loading device drivers Answer: C) Running the BIOS or UEFI firmware Explanation: When a computer starts, ...

10 multiple-choice numerical questions on paging in operating systems for UGC NET, SET, ISRO and Other exam. Question 1: Page Size Calculation Q1: If a system uses a 32-bit address space and a page size of 4 KB, how many pages are there in the address space? A) 1024 B) 4096 C) 1048576 D) 262144 Answer: C) 1048576 Explanation: The number of pages is calculated as: Total address space Page size = 2 32  bytes 2 12  bytes = 2 20 = 1048576  pages \frac{\text{Total address space}}{\text{Page size}} = \frac{2^{32} \text{ bytes}}{2^{12} \text{ bytes}} = 2^{20} = 1048576 \text{ pages} Question 2: Number of Frames Q2: If the physical memory is 1 GB and the page size is 4 KB, how many frames are available in the physical memory? A) 256 B) 1024 C) 256000 D) 262144 Answer: D) 262144 Explanation: The number of frames is given by: Physical memory Page size = 1  GB 4  KB = 2 30  bytes 2 12  b...