Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?a)Prints numbers from 0 to n-1b)Prints numbers from n-1 to 0c)Prints first n Fibonacci numbersd)Prints first n Fibonacci numbers in reverse orderCorrect answer is option 'C'. Can you explain this answer? - EduRev Computer Science Engineering (CSE) Question

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider the following pseudo code. Assume th...

Join the Discussion on the App

Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?

a)
Prints numbers from 0 to n-1
b)
Prints numbers from n-1 to 0
c)
Prints first n Fibonacci numbers
d)
Prints first n Fibonacci numbers in reverse order

Correct answer is option 'C'. Can you explain this answer?

FREE This question is part of

Test: Queues

Attempt Test

Attempt this Test

Verified Answer

Consider the following pseudo code. Assume that IntQueue is an integer...

The function prints first n Fibonacci Numbers. Note that 0 and 1 are initially there in q. In every iteration of loop sum of the two queue items is enqueued and the front item is dequeued.

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

Consider the following pseudo-code to perform push and pop operation on a stack using enqueue(EQ) and dequeue(DQ) operations on 2 queues q1 and q2. Let x be an element to be pushed in the stack. answer the following questions.push(q1,q2,x){if(q1 is empty){EQ(q2,x);}Else{EQ(q1,x);}}pop(q1, q2){if (q1 is empty){if (q2 is empty){print “stack underflow”;Exit;}else{while(q2 does not contain one element){k= DQ(q2);EQ(q1,k);}Return (DQ(q2));}}Else{while(q1 does not contain one element){k= DQ(q1);EQ(q2,k);}Return (DQ(q1));}}If we perform 8 push and 2 pop operations on the above algorithm then total how many enqueue and dequeue operations are performed on queues? Correct answer is '36'. Can you explain this answer?

View answer

Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3), 200 cylinders (numbered as 0, 1, … , 199), and 256 sectors per track (numbered as 0, 1, … , 255). The following 6 disk requests of the form [sector number, cylinder number, platter number] are received by the disk controller at the same time: [120, 72, 2] , [180, 134, 1] , [60, 20, 0] , [212, 86, 3] , [56, 116, 2] , [118, 16, 1] Currently the head is positioned at sector number 100 of cylinder 80, and is moving towards higher cylinder numbers. The average power dissipation in moving the head over 100 cylinders is 20 milliwatts and for reversing the direction of the head movement once is 15 milliwatts. Power dissipation associated with rotational latency and switching of head between different platters is negligible. The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is _______. Correct answer is '85'. Can you explain this answer?

View answer

Consider the following C function:int foo(){int i;int sum = 0;for(i = 1; i < = 20; i++) sum = sum + i;return sum;}Calculate the least number of temporary variables required to create an intermediate code for above C function. Correct answer is '2'. Can you explain this answer?

View answer

Consider the following pseudo-code to perform push and pop operation on a stack using enqueue(EQ) and dequeue(DQ) operations on 2 queues q1 and q2. Let x be an element to be pushed in the stack. answer the following questions.push(q1,q2,x){if(q1 is empty){EQ(q2,x);}Else{EQ(q1,x);}}pop(q1, q2){if (q1 is empty){if (q2 is empty){print “stack underflow”;Exit;}else{while(q2 does not contain one element){k= DQ(q2);EQ(q1,k);}Return (DQ(q2));}}Else{while(q1 does not contain one element){k= DQ(q1);EQ(q2,k);}Return (DQ(q1));}}If we perform 8 push and 2 pop operations on the above algorithm then total how many enqueue and dequeue operations are performed on queues? Correct answer is '36'. Can you explain this answer?

View answer

Consider the set of all functions f: {0,1, … ,2014} → {0,1, … ,2014} such that f(f(i)) = i, for all 0 ≤ i ≤ 2014. Consider the following statements:P. For each such function it must be the case that for every i, f(i) = i.Q. For each such function it must be the case that for some i, f(i) = i.R. Each such function must be onto.Q.Which one of the following is CORRECT?

View answer

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?a)Prints numbers from 0 to n-1b)Prints numbers from n-1 to 0c)Prints first n Fibonacci numbersd)Prints first n Fibonacci numbers in reverse orderCorrect answer is option 'C'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?a)Prints numbers from 0 to n-1b)Prints numbers from n-1 to 0c)Prints first n Fibonacci numbersd)Prints first n Fibonacci numbers in reverse orderCorrect answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?a)Prints numbers from 0 to n-1b)Prints numbers from n-1 to 0c)Prints first n Fibonacci numbersd)Prints first n Fibonacci numbers in reverse orderCorrect answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?a)Prints numbers from 0 to n-1b)Prints numbers from n-1 to 0c)Prints first n Fibonacci numbersd)Prints first n Fibonacci numbers in reverse orderCorrect answer is option 'C'. Can you explain this answer?.

Solutions for Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?a)Prints numbers from 0 to n-1b)Prints numbers from n-1 to 0c)Prints first n Fibonacci numbersd)Prints first n Fibonacci numbers in reverse orderCorrect answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?a)Prints numbers from 0 to n-1b)Prints numbers from n-1 to 0c)Prints first n Fibonacci numbersd)Prints first n Fibonacci numbers in reverse orderCorrect answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?a)Prints numbers from 0 to n-1b)Prints numbers from n-1 to 0c)Prints first n Fibonacci numbersd)Prints first n Fibonacci numbers in reverse orderCorrect answer is option 'C'. Can you explain this answer?, a detailed solution for Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?a)Prints numbers from 0 to n-1b)Prints numbers from n-1 to 0c)Prints first n Fibonacci numbersd)Prints first n Fibonacci numbers in reverse orderCorrect answer is option 'C'. Can you explain this answer? has been provided alongside types of Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?a)Prints numbers from 0 to n-1b)Prints numbers from n-1 to 0c)Prints first n Fibonacci numbersd)Prints first n Fibonacci numbers in reverse orderCorrect answer is option 'C'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?a)Prints numbers from 0 to n-1b)Prints numbers from n-1 to 0c)Prints first n Fibonacci numbersd)Prints first n Fibonacci numbers in reverse orderCorrect answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam