See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions
Engineering GATE CBSE NCERT Psychology English Computer Constitution Astrology Yoga Economics Physics Biology Electronics Microprocessor Career Interview Anatomy Botany
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non pipelined but identical CPU, we can say that?GATE CSE 20001 AnswerConsider a non-pipelined processor with a clock rate of 2.5 gigahertz and average cycles per instruction of four. -gate-cse-20151 AnswerRegister renaming is done is pipelined processors-gate-computer science-20121 AnswerQ.65) Instruction execution in a processor is divided into 5 stages. Instruction Fetch(IF), Instruction Decode (ID), Operand Fetch(OF), Execute(EX), and Write Back(WB), These stages take 5,4,20, 10 and 3 nanoseconds (ns) respectively. A pipelined implementation of the processor requires buffering between each pair of consecutive stages with a delay of 2 ns . -gate computer science 20171 AnswerRegister renaming is done in pipelined processors -gate-cse-20121 AnswerTwo identical discs of same radius R are rotating about their axes in opposite directions with the same constant angular speed . The discs are in the same horizontal plane. At time t = 0, the points P and Q are facing each other as shown in the figure. The relative speed between the two points P and Q is vr . In one time period (T) of rotation of the discs, vr as a function of time is best represented by - jee main 20121 AnswerDefine-Amdahls-law--Derive-an-expression-for-CPU-clock-as-a-function-of-instruction-count-clocks-per-instruction-and-clock-cycle-time/11 AnswerThe clock frequency of an 8085 microprocessor is 5 MHz. If the time required to execute an instruction is 1.4 μs, then the number of T-states needed for executing the instruction is -gate Electronics and Communication 20171 AnswerThe input x(t) and the output y (t) of a continuous-time system are related as1 AnswerConsider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute (RPM). -gate-cse-20151 AnswerConsider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue? Gate1 AnswerDefine Amdahls law. Derive an expression for CPU clock as a function of instruction count clocks per instruction and clock cycle time.1 AnswerSuppose the time to service a page fault is on the average 10 milliseconds, while a memory access takes 1 microsecond. GATE CSE 20001 AnswerA queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)? Gate-cs-20162 AnswerConsider the following table of arrival time and burst time for three processes P0, P1 and P2. -gate-cse-20111 AnswerWhat is the difference between setup time and hold time?1 AnswerWhat is the difference between setup time and hold time?1 AnswerLet the page fault service time be 10ms in a computer with average memory access time being 20ns. -gate-cse-20111 AnswerLet the time taken to switch between user and kernel modes of execution be t1 while the time taken to switch between two processes be t2. Which of the following is TRUE?-gate-computer science-20111 AnswerThe time taken to switch between user and kernel modes of execution be t1 -gate-cse-20111 Answer