Scribd
Upload
12 views7 pages

Pseudocode Test 2 Cram Up

The document consists of a series of programming questions and multiple-choice answers related to concepts such as runtime errors, stack and queue implementations, pseudocode outputs, and algorithmic techniques. Each question tests knowledge on programming logic, data structures, and algorithm efficiency. The questions cover a range of topics, including error types, search techniques, and the behavior of specific code snippets.

Uploaded by

1697571taruni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views7 pages

Pseudocode Test 2 Cram Up

The document consists of a series of programming questions and multiple-choice answers related to concepts such as runtime errors, stack and queue implementations, pseudocode outputs, and algorithmic techniques. Each question tests knowledge on programming logic, data structures, and algorithm efficiency. The questions cover a range of topics, including error types, search techniques, and the behavior of specific code snippets.

Uploaded by

1697571taruni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

1.

a. 1
b. Runtime Error
c. Compile Time Error
d. 3

2.
a. 1
b. 2
c. 4
d. Hello World

3.
a. 4
b. 12
c. 20
d. Either 12 or 20

4.
a. It will display two if x > y > z
b. It will display two if z <= y
c. It will display four if x <= y
d. It will display four if x > y < z

5.
a. It will print address of k + address of r
b. It will print address of r
c. It will print address of k
d. Compile Time Error
6. Which of the following applications may use a stack
a. A parenthesis balancing program
b. Syntax analyzer for a compiler
c. Keeping track of local variables at run time
d. All the above
7. Which of the following is a direct search technique
a. Binary Search
b. Tree Search
c. Linear Search
d. Hashing
8. From the following which is NOT true with respect to a STACK
a. Stack supports LIFO order of deletion of elements
b. Stack is a dynamic set where elements are removed in the reverse order of their
insertions
c. It is not possible to insert or remove elements anywhere else except at the top of the
stack
d. All the above are correct
9. From the following where queue implementation is useful
a. Load Balancing
b. When data is transferred asynchronously between two processes
c. When a resource is shared among multiple consumers
d. All the above
10. Suppose queue is implemented using a linked list and its front node rear nodes are tracked by
two reference variables what reference variables will change during an insertion into a NON
EMPTY queue
a. Front one
b. Rear One
c. Both
d. None
11. What does the run() do in general
1. int fun(int x, int y)
2. {
3. if (y == 0) return 0;
4. return (x + fun(x, y-1));
5. }
6. int run(int a, int b)
7. {
8. If (b == 0) return 1;
9. return fun(a, run(a, b-1));
10. }
a. Calculate x+x*y
b. Calculate yx
y
c. Calculate x
d. Calculate x*y
12. What will be the output of the following pseudocode
1. Input a = 6, b = 9
2. Integer n
3. Set res = 1
4. if (a > 10 && b < a)
5. Print Error Message
6. else
7. for(n=a; n<b; n=n+1)
8. res = res * n
9. End for loop
10. Print res

Note: ‘&&’ operator returns true if and only if both expressions inside if() are true

a. 336
b. 124
c. 42
d. 256
13. What will be the output of the following pseudocode
1.Input n = 1234
2. Integer q, r, and rn
3. set q=n and rn=0
4. while(q > 0)
5. r = q mod 10
6. rn = rn + r^3
7. q = q / 10
8. End while loop
9. Print rn
(Note: mod finds the remainder after division of one number by another. For example
“5 mod 2” would evaluate to 1 because 5 divided by 2 leaves a quotient of 2 and
remainder of 1)
a. 100
b. 36
c. 321
d. 10
e. None

14.
a. 4
b. 12
c. 3
d. None of the above

15. Consider the following pseudocode


1. a: = 1
2. b : = 1;
3. while (a <=500)
4. begin
5. a: = 2a;
6. b: = b + 1;
7. end
What is the value of b at the end of the pseudocode?
a. 4
b. 5
c. 6
d. 7
16. What will be the output of following code
1. Input m=9, n=6
2. m=m+1
3. n=n-1
4. m=m+n
5. if(m>n)
6. print m
7. else
8. print n
a. 5
b. 6
c. 10
d. 15

17.
a. 9
b. 21
c. 6
d. 15
18. What will be the output of following pseudocode for a given array a[5]=3, 4, 6, 1, 2 and pos is 2?
(Note: n=size of array i.e. 5 and starting array index is 0]
1. Declare i, j, n, pos
2. Repeat for j=pos to n-1
3. Set a[j] = a[j+1] [End loop]
4. n=n-1;
5. Display the new array
6. End
a. 3 2 4 6 1 2
b. 3 4 1 2
c. 3 4 2 1 2
d. 3 6 1 2

You might also like