Infosys pseudocode
Infosys pseudocode
Section Summary
No. of Questions: 135
Duration: 100 min
Additional Instructions:
None
Which of the following sequences are depth rst traversals of the above graph?
1. abeghf
2. abfehg
3. abfhge
4. afghbe
choose the correct answer the options given below
only 1 and 4
Q2.
What will be the output of the following pseudocode a=2?
1.fun(int a)
2. if(a < 1 )
3. return
4. else
5. Print a
6. fun(a-1)
7. Print a
8. Return
A. 1 2
B. 2 1
C. 2 1 1 2
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 1/63
9/11/2019 Six Phrase - mySlate
D. 3 2 1 1 2 3
Q3.
4) Records are randomly distributed by a hash function in a space that can hold N number of records. The probability that the mth
record is the rst record to result in a collision is
Q4.
Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4). Entry Win the matrix W below is the weight of the edge {i, j}.
What is the minimum possible weight of a spanning tree T in this graph such that vertex O is a leaf node in the tree T?
in this graph such that vertex O is a leaf node in the tree T?
01814
1 0 12 4 9
W = 8 12 0 7 3
14702
49320
A. 8
B.7
C.9
D.10
Q5.
Consider an unsorted array A[1…n] with n distinct values the following algorithm can be used to search a given x in that array.
1.choose a k uniformly at random from 1…n;
2.if A[k]=x then stop else Goto 1;
Assume that x is present in the array A,what will be the expected number of comparisons required by the algorithm before it
terminates?
A.n
B.2n
C.n-1
D.n/2
Q6.
Consider the following fragment. Which of the following statements will be executed in this case?
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 2/63
9/11/2019 Six Phrase - mySlate
Q7.
Consider the following pseudocode. How many multiplications are performed here?
1. M=2
2. for i=1 to N do
3. for j= i to N do
4. for k=j+1 to N do
5. M=M*3
6. End for
7. End for
8. End for
Q8.
Find out the number of interchange needed to convert the given array into max-heap.
89,19,50,17,12,15,2,5,7,11,6,,9,100
A.5
B.3
C.2
D.4
Q9.
Four matrices Ay, Ay, Az and A, of dimensions a xb, bxc, cx d and dx e respectively can be multiplied in several ways with the
different number of total scalar multiplications.
If a = 10, b = 100, c = 20, d = 5 and e = 80, then at least how many scalar multiplications are required here?
A. 44000
C. 19000
D. 80000
Q10.
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 3/63
9/11/2019 How many leaf nodes are present in a binary tree havingSix
a depth
Phrase - H?
mySlate
A. 2 + 1
B. 2H
C. 2H+1 + 1
D. 2H-1 - 1
Q11.
Identify the point that is NOT true with respect to a stack.
B.It is not possible to insert or remove elements anywhere else except the top
of the stack
D.Stack is a dynamic set where elements are removed in the reverse order of
their insertions
Q12.
Identify the point that is NOT true with respect to a stack.
C. Stack is a dynamic set where elements are removed in the reverse order of
the insertions
D.It is not possible to insert or remove elements anywhere else except top on
the stack
Q13.
If a binary tree has 10 nodes then what is the height of the tree?
A.9
B.11
C.12
D.3
Q14.
If a node having two children is deleted from a binary tree, it is replaced by its:
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 4/63
9/11/2019 Six Phrase - mySlate
B. Preorder predecessor
C. Inorder successor
D. Inorder predecessor
Q15.
If the address of A[1][1]and A[2][1] are 1000 and 1010 respectively and each element occupies 2 bytes then the array has been
stored in__________order.
A.matrix major
C.Column major
D.row major
Q16.
Information about which of the following options is not present in the adjacency matrix representation of a graph?
A. Parallel edges
B. Nodes
C. Direction of edges
D. Edges
Q17.
Let A, B, C, D, E be sorted sequences having lengths 20, 24, 30, 35, 50 respectively, they are to be merged into a single sequence by
merging together two sequences at a time. How many comparisons are needed in the worst case by the optimal algorithm?
A. 544
B. 256
C. 423
D. 358
Q18.
Maximum height of an AVL tree with 7 nodes is:
A. 6
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 5/63
9/11/2019 Six Phrase - mySlate
B. 5
C. 3
D. 4
Q19.
Maximum possible number of nodes in the binary tree at level 5 is:
A.31
B.16
C.30
D.28
Q20.
Suppose a queue is implemented using a linked list and its front node and rear node are tracked by two reference variable . which
of these reference variables will change during an insertion into a NONEMPTY queue?
Q21.
The minimum number for multiplications and additions required to evaluate the polynomial
P-4x3+3x2-15x+45 is:
A. 4 & 2
B. 3 & 4
C. 3 & 3
D. 6 & 3
Q22.
The number of values that can be held by an array arr[-1….n,1…n] is:
A. n
B. n2
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 6/63
9/11/2019 Six Phrase - mySlate
C. n(n+1)
D. n(n+2)
Q23.
What will be the output of the following pesudocode?
1.Declare variable x,y,and i
2.Set x=0 and y=1
3.for(i=1;i<=4;i=i+1)
4. print x
5. x=x+y
6. y=x/y
7.End for loop
A.0 1 3 8
B.1 0 2 4
C.0 1 2 3
D.0 1 2 4
Q24.
What will be the output of the following pesudocode?
1.int a=1
2.while (++a <=5)
3.print a++
A.2 4 6
B.1 3 5
C.2
D.2 4
Q25.
What will be the output of the following pseudocode ?
1. Integer a,b,c
2. Set a=10,b=20
3. for(c=a;c<=b;c=c+2)
4. a=a+c
5. b=b-a+c
6. if(a > 10)
7. Print a
8. Else
9. Print b
10. End if
11. End for
A. 20
B. 20 32
C. 22
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 7/63
9/11/2019 Six Phrase - mySlate
D. 20 23
Q26.
What will be the output of the following pseudocode for a given array a[5]=3,4,6,1,2 and pos=2?
1.declare I,j,n,pos
2.Repeat for j=pos to n-1
3. Set a[j]=a[j+1]
4.End for loop
5.n=n-1;
6.Display the new array
7.End
A. 3 2 4 6 1 2
B. 3 4 1 2
C.3 6 1 2
D.3 4 2 1 2
Q27.
What will be the output of the following pseudocode for input 4?
1. Int sum(int num)
2. {
3. If(num is not equal to 0)
4. return num+num*sum(num-1)
5. Else
6. return num
7. }
A. 26
B. 15
C. 44
D. 64
Q28.
What will be the output of the following pseudocode for n = 2?
int fun( int n);
if( n EQUALS 4 )
return n;
else
return 2 * fun ( n + 1);
A. 8
B. 2
C. 4
D. 16
Q29.
What will be the output of the following pseudocode for the input x=22 and y=3?
1. Start
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 8/63
9/11/2019 2.. Declare x, y, m, n Six Phrase - mySlate
3. Set m = x and n = y
4. while m not equal to n then
5. if m greater than n
6.m = m - 1
7. otherwise
8.n = n - 1
9. End if
10. End while 1
11. Print n
A. 12
B. 3
C. 4
Q30.
What will be the output of the following pseudocode for x=11,y=5?
1.fun(int x,int y)
2.if(x==0)
3. return y
4.else
5. return fun(x-1,x-y)
A.71
B.17
D.23
Q31.
What will be the output of the following pseudocode?
int a = 15, b = 45, C = 9, i;
if ((o> (a + b )) OR a < (5* c)).
for(i = 1 to 3)
C = C* 2
End for loop
else
while (a > 6)
b=b+1
a=a-4
end while loop
Print b, C
A. 41,4
B. 45, 72
C. 48,9
D. 45,9
Q32.
What will be the output of the following pseudocode?
int n = 343, r, s=0, h;
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 9/63
9/11/2019 set m = n ; Six Phrase - mySlate
A.343 343
B.340 342
C.300 342
D.345 344
Q33.
What will be the output of the following pseudocode?
Integer a,b;
Set a = 125, b = 122;
if( (a + b) MOD 2 NOT EQUALS O )
while ( a > 0)
b = a + b;
a=a/5;
End ;
while
Print b;
else
a=a-b;
a = a / 2;
Print a ;
end if;
A.234
B.278
C.274
D.276
Q34.
What will be the output of the following pseudocode?
int i = 5, j = 7
if (i + j > 5)
j=i+2
if (j<5)
print i
else
print j
else
print i + 1
A. 6
B. 7
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 10/63
9/11/2019 Six Phrase - mySlate
C. 5
D. 12
Q35.
What will be the output of the following pseudocode?
1. char str[10] = "India", ch = 'n';
2. int ind[10], loop, j = 0 ;
3. for( loop = 0; str[loop] != '\0'; loop=loop+1)
4. if ( str[loop] == ch );
5. int d[j++] = loop ;
6. for( loop = 0; loop <j; loop=loop+1);
7. Print ind[loop];
[Note: j++ = j+1 and 10 = NULL]
A. 03
B. 1
C.0
D. 4
Q36.
What will be the output of the following pseudocode?
1. Declare Integer c, d,
2. Integer array[6]={23, 45, 67, 12, 13 25}
3. for(c=0; c < 5; C++)
4. for(d=0; d < 5-C-1 ; d++)
5. if(array[d]>array[d+1])
6. r = array[d];
7.array[d] = array[d+1]
8. array[d+1]=r
9.end if
10.end for
11.end for
12.for(C =0; c<5; C++)
13. print array[C]
14. end for
A. 67 45 23 13 12
B.12 13 23 45 67
C. 67 45 23 13
D. 45 67
Q37.
What will be the output of the following pseudocode?
1. int m = 3, n = 2, 0 = 4 ;
2.while (n > 0)
3. M = m*o+n;
4. n = n - 1
;5. end
while loop
6. O = 0 + M ;
7.print m, n, o;
A. 32 12 41
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 11/63
9/11/2019 Six Phrase - mySlate
B. 3 2 4
C. 57 0 62
D. 2 1 6
Q38.
What will be the output of the following pseudocode?
1. Integer a , b
2. Set a = 2, b = 50
3. while( b )
4. a = b MOD 2 + a
5.if ( a MOD 3 IS EQUAL TOO)
6.Print (a)
7.else
8.Print (b - 1)
9.Print (0 - 1) b = b / 5
10.a = a + 1
11. end while
A. 50 3 2
B. 49 3 1
C. 3 3 3
D. 50 10 2
Q39.
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
A.124
B.234
C.336
D.123
Q40.
What will be the output of the following pseudocode?
1. Int a=15,b=45,c=9,i
2. If((c>(a+b))OR a<(5*c))
3. for(i=1 to 3)
4. c=c*2
5. End for loop
6. Else
7. While(a>6)
8. b=b+1
9. a=a-4
10. End while loop
11. Print b,c
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 12/63
9/11/2019 Six Phrase - mySlate
A. 45 72
B. 41 4
C. 48 9
D. 45 9
Q41.
What will be the output of the following pseudocode?
1. Int a=3,b=2
2. If(a+b <7)
3. a=a*0+b
4. Else
5. for(i=1 to 4)
6. a=a+i
7. End for loop
8. Print a,b+1
A. 2 3
C. 4 3
D. 3 3
Q42.
What will be the output of the following pseudocode?
1. Integer a=1,b=2
2. for(int i=0;i<=6;i=i+2)
3. a=a+b+i
4. a=a+b
5. b= a-b
6. Print b
7. End for
A. 3 10 27 71
B. 3 10 27 70
C. 3 7 10
D. 3 9 23 70
Q43.
What will be the output of the following pseudocode?
1. Integer I,f,num
2. Set f=1,num=8
3. Repeat for i=1 to num
4. f=f*i
5. End loop
6. Print f
A. 0
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 13/63
9/11/2019 Six Phrase - mySlate
B. 40320
C. 8
D. 1
Q44.
What will be the output of the following pseudocode?
1.int p=2,q=6,r=9,i
2.if(6 > p + q)
3. for(i=1 t0 3)
4. p=p+q
5. q=q+1
6. end for loop
7.r=p-q
8.print p,q,and r
A.23 9 9
B.32 10 22
C.2 6 9
D.15 8 7
Q45.
What will be the output of the following pseudocode?
1.int p=2,q=6,r=9,i
2.if(r>p+q)
3. for(i=1 to 3)
4. p=p+q
5. q=q+1
6. end for loop
7.r=p-q
8.print p,q and r
A.32 10 22
B.23 9 9
C.15 8 7
D.23 9 14
Q46.
What will be the output of the following pseudocode?
1.integer i,j,sum,n
2.Set sum=0,n=7
3.Repeat for i=1 to n
4. sum=sum+(i * i)
5.End loop
6.print sum
A.104
B.64
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 14/63
9/11/2019 Six Phrase - mySlate
C.8
D.49
Q47.
what will be the output of the following pseudocode?
Input: Two n-bit integers x and y, where y > 1
if x=0 then
return (q,r)=(0,0)
else
set(q,r)=divide([x/2],y);
q=2*q,r=2 * r;
if x is odd then
r=r+1
end
if r > y then
r=r-y,q=q+1
end
return(q,r)
end
Q48.
What will be the output of the following pseudocode?
n=1
Integer a, b, c, ai, b1, c1, a2, b2, c2
Set a1 = 2, b1 = 45 and c1 = 36
Set a2 = 11, b2 = 26 and c2 = 30
C = C1 + c2
b = c/ 60
C = C mod 60
b = b + b1 + b2
a = b / 60
b = b mod 60
a = a + a1 + a2
Print a:b:C
A.14:12:1
B. 13:12:66
C.13:71:66
D.14:12:6
Q49.
What will be the output of the following pseudoocde?
1. Integer result and set num1=5,num2=7,num3=8
2. If(num1>num2)
3. If(num1>num3)
4. result=num1
5. Else
6. result=num3
7. Else if(num2>num3)
8. result =num2
9. Else
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 15/63
9/11/2019 10. result=num3 Six Phrase - mySlate
A. 4
B. 7
D. 5
Q50.
What will be the probability of selecting a random node from a given singly linked list
A.2(N-1)/N
B.2N-1
C.1/N
D.N/2(N-1)
3 24
23 4
2 16
1 05
Q52.
What will happen if there is no base criteria mentioned in a recursive program?
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 16/63
9/11/2019 Six Phrase - mySlate
Q53.
What will be the output of the following pseudocode for the input n=6745?
1.Start
2.Read n
3.Assign the given integer to a new variable q and set rn =0
4.r=q mod 10
5.rn = rn * 10 +r;
6.q=q/10
7.Repeat steps 4 to 6 while q > 0
8.Print rn
A. 7645
B. 5476
C. 4567
D. 3423
Q54.
What will be the output of the following pseudocode if we call fun1() and value of n is 5?
1.fun(int n, int a)
2. If(n == 0) return a
3. return fun (n -1,n * a)
4.fun1(int n)
5. return fun(n,1)
A. 120
B. 24
C. 16
D. 15
Q55.
What will be the output of the following pseudocode?
1. Integer i,j,sum,n
2.Set sum=0,n=7
3.Repeat for i=1 to n
4. Repeat for j=1 to n-i
5. sum=sum + j
6. End loop
7.End loop
8. Print sum
A. 147
B. 35
C. 56
D. 84
Q56.
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 17/63
9/11/2019 Which is the following is a direct search technique? Six Phrase - mySlate
A.Hashing
B.Tree search
C.Binary search
D.Linear search
Q57.
Which of the following applications use a stack?
Q58.
Which of the following data structure may give over ow error even though the current number fo elements in its less than its size?
A. Simple queue
B. Priority queue
D. Circular queue
Q59.
Which of the following data structure may give over ow error, even though the current number of elements in it is less than its
size?
B. Priority queue
C. Simple queue
D. Circular queue
Q60.
Which of the following graph analysis algorithms would be applied for nding shortest path in a weighted graph. Weights and can
also be used for nding transitive closure of a relation R?
A.Dijkistra’s Algorithm
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 18/63
9/11/2019 Six Phrase - mySlate
B.Prim’s Algorithm
C.Meshy’s Algorithm
D.Floyd’s Algorithm
Q61.
Which of the following statements is true regarding linked list implementation of a stack?
C.In a push operation ,if new nodes are inserted at the beginning of a linked
list then in operation ,nodes must be removed from at the end
Q62. The running time T(n). where "n" is the input size of a recursive algorithm is given as follows:
T(n) = c + T(n-1), if n>1 T(n) = d, if n <1
The order of this algorithm is:
n3
nn
n2
Q63. what will be the necessary condition to get the location of the desired element from a given array using the following algorithm?
I. IF LOC = -1 do ITEM NOT FOUND
2. Do_Something(DATA, N, ITEM, LOC)
3. 1. Initialize counter set LOC= , LOW=., HI= N-1
4. 2. [Search for Item] Repeat while LOWs HI
5. 2.1 MID=(LOW+HI)/2,
6. 2.2 IF ITEM= DATA[MID] do
7. 2.3 LOC=MID
8. 2.4 Return LOC
9. 2.5 IF ITEM < DATA [MID]
10. 2.5.1 HI = MID-1
11. 2.6 ELSE
12. 2.6.1. LOW= MID +I
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 19/63
9/11/2019 Six Phrase - mySlate
Q64. Which of the following is a type of sorting which relatively passes through a list to exchange the rst element with any element
less than it and then repeats with a new rst element?
Heap sort
Quick sort
Bubble sort
Merge sort
Pass
Fail
Q66. An implementation of a queue 0, using two stacks S1 and S2, is given below:
1. void Insert(Q,x)
2. {
3. push(S1,x);
4. }
5. void delete(Q,x)
6. {
7. If(stack-empty(S2)) then
8. if(stack-empty(S1)) then
9. {
10. print("Q is empty");
11. return;
12. }
13. else while(' stack-empty(S1))
14. {
15. x=pop(S1);
16. push(S2,x);
17. }
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 20/63
9/11/2019 18. x=pop(S2); Six Phrase - mySlate
19. }
Let "n" insert and "m (5 n)^ delete operations to be performed in an arbitrary order on an empty queue air. Let "x" and -r be the
number of push and pop operations performed respectively in the process. Which of the given options is I= for all on and n?
22,33,11,40,44,90,77,60,99,55,88,66
22,33,11,55,77,90,40,60,99,44,88,66
22,33,11,77,44,40,90,60,99,55,88,66
22,33,55,11,77,90,40,60,99,44,88,66
Q68. Consider following given algorithm and identify the task performed by this.
1. bstree(*tree)
2. {
3. while((tree->left 1=null)88 (tree->right !=null))
4. {
5. if(tree->left < tree->root)
6. bstree(tree->left);
7. else 8. return(!);
9. tf(tree->right > tree->root)
10. bstree(tree->right);
11. else
12. return(1);
13. }
14. return(0);
15. }
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 21/63
9/11/2019 Six Phrase - mySlate
Bubble sort
Prim's algorithm
Q69. Consider H as a hashing function which is used to hash n keys into a table of size m. where n<rm. the expected number of
collisions involving a particular key x is:
less than n
n less than 1
c less than m
F3<F2<F4<F1
F3<F2<F1<F4
F2<F3<F1<F4
Q71. Consider the main function and fun1() implementations. What will be the output of the following pseudocode?
1. Int a
2. Int main()
3. While(a)
4. fun1()
5. main()
6. Print ower
7. Int fun1()
8. Print lily
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 22/63
9/11/2019 Six Phrase - mySlate
Flower lily
Lily
In nite loop
Flower
y>z
x>z>y
z>x
x>y>z
Pre x
In x
Post x
Q74. How many edges are present in a complete binary tree with 16 leaf nodes?
14
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 23/63
9/11/2019 Six Phrase - mySlate
28
32
30
Q75. How much time will be required to generate all the connected components in an undirected graph G with ‘n’ vertices and ‘e’ edges
when the graph is represented by an adjacency list?
O(e2)
O(n)
O(e+n)
O(e)
Q76. If a node having two children is deleted from a binary tree it is replaced by its ?
in-order predecessor
in-order successor
Q77. If L is the left node, M is the root node and R is the right node of a binary tree then an L-M-R traversal can be termed as :
In – order traversal
Q78. If the address of A[1][1] are 1000 and 1010 respectively and each elements occupies 2 bytes then an array has been stored in
________order
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 24/63
9/11/2019 Six Phrase - mySlate
Matrix major
column major
row major
Q79. Information about which of the following options is not present in the adjacency matrix representation of a graph?
Parallel edges
Nodes
Direction of edges
Edges
Q80. Records are randomly distributed by a hash function in a space that can hold N number of records . The probability that the mth
record is the rst record to result in a collision is:
[(N-1)(N-2)…(N-(m-2))(m-1)]/Nm-1
[(N-1)(N-2)…(N-(m-1))(m-2)]/Nm
[(N-1)(N-2)…(N-(m-2))(m-1)]/N
[(N-1)(N-2)…(N-(m-1))(m-2)]/Nm-1
Q81. The complexity of the insertion sort algorithm in worst case is:
O(n2)
O(n log n)
O(n)
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 25/63
9/11/2019 Six Phrase - mySlate
O(n-1)
n(n+2)
n(n+1)
n2
Q83. The order of an internal node in B+ tree index is the maximum number of children it can have ,suppose that a child pointer takes 6
bytes, the search eld value takes 14 bytes, and the block size is 512 bytes.what is the order of an internal node ?
26
27
24
25
-/•^ACBDE
-A/B•C-DE
ABCD•^DE
-.A/BC•^DE
-+pq*rt
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 26/63
9/11/2019 Six Phrase - mySlate
-+pqr*t
+pq-*rt
Q86. what will be the output of the following code for the input a=5 and b=6?
function do Something(input a, input b)
{
if (b==1)
return 0;
else
return a + do something(a, b-1);
}
30
25
18
125
234
278
27
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 27/63
9/11/2019 Six Phrase - mySlate
0 12 24 25
12 24 36 48 60 61
0 12 0 12 13
Inside else
Inside else if
Inside if
16 82
150 12
69
no output
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 28/63
9/11/2019 Six Phrase - mySlate
Q91. what will be the output of the following pseudo code?
Integer a ,b
Set a = 10, b = 7
for(int i = 1; i<= 5; i++ )
a =a+i+ b
while ( a > 6 )
a=a+b
b=b-1
a=a–1
end while
Print a
End for
3 2 1 0 -3
3 -3 -8 -15
-6 -13 -19-24-28
3 -3 -8 -12 -15
7 11 17
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 29/63
9/11/2019 Six Phrase - mySlate
1 4 21
7 14 24
4 11 17
61206
60216 14
165
Q95. What will be the output of the following pseudo-code if we call fun()and the value of n is 5?
fun(int n, int a)
if ( n == 0) return a
return fun ( n- 1, n * a)
fun1( int n)
return fun( n, 1)
15
120
16
24
64
49
140
1 int p = 2, q = 6, r = 9, i
2
3 if ( r>p+ q)
4
5 for (i = 1 to 3 )
6
7 p=p+q
8
9 q=q+1
10
11 end for loop
12
13 r=p-q
14
15 print p, q and r
23 9 9
32 10 22
23 9 14
15 8 7
0138
0124
1024
0123
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 31/63
9/11/2019 Six Phrase - mySlate
Q99. What will be the output of the following pseudo-code?
Integer a = 1, b = 2
for ( int i = 0; i<= 6;i= i + 2
a =a+b+ i.
a=a+b
b=a–b
Print b
end for
3 10 27 70
3 10 27 71
3 9 23 70
3 7 10
12
1 void fun(int a)
2 if(a<l)
3 return;
4 else
5 print a
6 fun(a-2)
7 print a
8 return
9
210
3113
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 32/63
9/11/2019 Six Phrase - mySlate
12
2112
Q102. What will be the output of the following pseudocode for a given array a[5] = 3, 4, 6, 1, 2
and pos=2?
[Note: n = the size of the array i.e. 5 and starting array index is 0)
Declare i, j, n, pos
Repeat for j=pos to n-1
Set a[j] =a[j+1]
End for loop
n=n-1;
Display the new array
End
324612
3412
3612
34212
Q103. What will be the output of the following pseudocode for input 134?
1. 1. int funl (int num)
2. 2. static int a = 0
3. 3. if ( num > 0)
4. 4. ara+1
5.5. fungnum/10)
6. 6. else
7. 7. return a
Note:[ Static variables have a property of preserving their value even after they are out of their scope]
431
Q104. What will be the output of the following pseudocode for input 7?
1. Read the value of N
2. Set m=1,T=0
3. If m>N
4. Go to line no.9
5. Else
6. T=T+m
7. m=m+1
8. go to line no.3
9. Display the value of T
10. Stop
34
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 33/63
9/11/2019 Six Phrase - mySlate
72
56
28
Q105. What will be the output of the following pseudocode for input a = 8 and b = 9?
function(input a, input b)
if(a < b)
return function(b,a)
else if(b != 0)
return(a + function(a, b-1))
else
return 0
88
56
72
65
Q106. What will be the output of the following pseudocode for num=5456?
Start
Take a variable num, j, temp and an array digit[ ]
set k=0, len=0, n=num
Repeat while n is not equal to 0
digit[k]=n mod 10
set n=n/10
Set k=k+1
End While
len=k
Set k=0
Repeat for k to len-1
Check If digit[k] is greater than digit[k+1]
Set temp=digit[k]
Set digit[k]=digit[k+1]
Set digit[k+1]= temp
Repeat for j=0 to len
Set num= num+ (digit[j]* pow(10,k))
End for
End If
End For
Print num
Stop
7676
28787
5456
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 34/63
9/11/2019 Six Phrase - mySlate
Q107. What will be the output of the following pseudocode for the input x=22 and y=3?
Start
Declare x, y,m, n
Set m = x and n = y
while m not equal to n then
if m greater than n
m=m–1
Otherwise
n=n-1
End if
End while
Print n
12
Q108. What will be the output of the following pseudocode if n = 40 and LIMIT = 1000?
1. Integer fun2(1nteger n)
2. if( n < = 0)
3. return 1
4. end if 4
5. if ( n > LIMIT)
6. return 2
7. end if
8. Print n
9. fun2(2 * n)
10. Print n
11. End function fun2()
40,80,160,320,640
40,80,120,240,480,960
640
40,80,160,320,640,320,160,80,40
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 35/63
9/11/2019 Six Phrase - mySlate
204
49
64
Thankyou
Fine Thankyou
Fine
2 3 5 8 11 14 17 19 23
1 3 7 11 13 17 19 23 25
2 4 5 8 11 12 17 14 23
2 3 5 7 11 13 17 19 23
6. Print x, y
47
11 4
15 4
11
10
12
14
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 37/63
9/11/2019 Six Phrase - mySlate
16
18 18 4
7 11 17
7 14 21
7 14 24
4 11 17
1.Integer a,b,count=0,count1=0
2.Set a=1,b=1
3.while(a<=5)
4.b=1
5.while(b<=5)
6.b=b+1
7.count1 = count1 + 1
8.end while
9.a = a + 1
10.count = count + 1
5 25
24 5
55
25 5
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 38/63
9/11/2019 Six Phrase - mySlate
13
165
61206
60216
error at line 3
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 39/63
9/11/2019 Six Phrase - mySlate
Logical error
unsuccessful
successful
21
23
20
-6 -13-19-24-28
3 2 1 0 -3
3 -3-8-12-15
3-3-8-15
Q122. what will be the probability of selecting a random node from a given singly linked list?
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 40/63
9/11/2019 Six Phrase - mySlate
1/N
2N-1
N/2(N-1)
2(N-1)N
36 1
11
1 36
42 36
3 10 27 71
3 10 27 70
3 7 10
3 9 23 70
Q125. what will happen if there is no base criteria mentioned in a recursive program?
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 41/63
9/11/2019 Six Phrase - mySlate
11
12
2112
321123
Q127. Which of the following graph analysis would be applied for nding shortest paths it is a weighted graph and can also be used for
nding transitive closure of a relation R?
Meshy’s algorithm
Prim’s algorithm
Floyd’s algorithm
Dijikstra’s algorithm
Tree search
Linear search
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 42/63
9/11/2019 Six Phrase - mySlate
Hashing
Binary search
Q129. Which of the following is the correct pseudocode for validating the entered date is correct or not?
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 43/63
9/11/2019 Six Phrase - mySlate
Q130. Which of the following would store the information of an array which is used in a program?
Activation record
System table
Symbol table
Dope vector
Bitwise Operators
Cast Operators
37
14
12
A. 33
B. 23
C. 43
A. 49 31
B. 50 102
C. 3 33
D. 50 32
A. 14
B. 10
C. 16
D. 4
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 45/63
9/11/2019 Six Phrase - mySlate
Solution
No Solution
Q2
C. 2 1 1 2
Solution
No Solution
Q3
A. (N-1)(N-2)...(N-(m - 1)/(m - 2)]/NM-1
Solution
No Solution
Q4
D.10
Solution
No Solution
Q5
A.n
Solution
No Solution
Q6
B. Statement s1 will be executed
Solution
No Solution
Q7
A. One sixth of the product of the 3 consecutive integers
Solution
No Solution
Q8
B.3
Solution
No Solution
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 46/63
9/11/2019 Six Phrase - mySlate
Q9
C. 19000
Solution
No Solution
Q10
D. 2H-1 - 1
Solution
No Solution
Q11
A.All the mentioned options are correct
Solution
No Solution
Q12
A.All the mentioned options are correct.
Solution
No Solution
Q13
D.3
Solution
No Solution
Q14
C. Inorder successor
Solution
No Solution
Q15
D.row major
Solution
No Solution
Q16
A. Parallel edges
Solution
No Solution
Q17
D. 358
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 47/63
9/11/2019 Six Phrase - mySlate
Solution
No Solution
Q18
C. 3
Solution
No Solution
Q19
A.31
Solution
No Solution
Q20
B. Only the rear will change
Solution
No Solution
Q21
C. 3 & 3
Solution
No Solution
Q22
A. n
Solution
No Solution
Q23
D.0 1 2 4
Solution
No Solution
Q24
D.2 4
Solution
No Solution
Q25
A. 20
Solution
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 48/63
9/11/2019 Six Phrase - mySlate
No Solution
Q26
B. 3 4 1 2
Solution
No Solution
Q27
D. 64
Solution
No Solution
Q28
D. 16
Solution
No Solution
Q29
B. 3
Solution
No Solution
Q30
C. None of the mentioned option
Solution
No Solution
Q31
B. 45, 72
Solution
No Solution
Q32
A.343 343
Solution
No Solution
Q33
B.278
Solution
No Solution
Q34
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 49/63
9/11/2019 Six Phrase - mySlate
B. 7
Solution
No Solution
Q35
B. 1
Solution
No Solution
Q36
B.12 13 23 45 67
Solution
No Solution
Q37
C. 57 0 62
Solution
No Solution
Q38
B. 49 3 1
Solution
No Solution
Q39
C.336
Solution
No Solution
Q40
A. 45 72
Solution
No Solution
Q41
A. 2 3
Solution
No Solution
Q42
B. 3 10 27 70
Solution
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 50/63
9/11/2019 Six Phrase - mySlate
No Solution
Q43
B. 40320
Solution
No Solution
Q44
C.2 6 9
Solution
No Solution
Q45
D.23 9 14
Solution
No Solution
Q46
A.104
Solution
No Solution
Q47
B. The quotient and remainder of 'x divided by y' operation
Solution
No Solution
Q48
A.14:12:1
Solution
No Solution
Q49
B. 7
Solution
No Solution
Q50
C.1/N
Solution
No Solution
Q51
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 51/63
9/11/2019 Six Phrase - mySlate
1 05
Solution
No Solution
Q52
C.It will execute in nitely
Solution
No Solution
Q53
B. 5476
Solution
No Solution
Q54
A. 120
Solution
No Solution
Q55
C. 56
Solution
No Solution
Q56
C.Binary search
Solution
No Solution
Q57
D.All of the mentioned options
Solution
No Solution
Q58
A. Simple queue
Solution
No Solution
Q59
D. Circular queue
Solution
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 52/63
9/11/2019 Six Phrase - mySlate
No Solution
Q60
D.Floyd’s Algorithm
Solution
No Solution
Q61
D.None of the mentioned options
Solution
No Solution
Q62
nn
Solution
No Solution
Q63
The elements in the array should be sorted
Solution
No Solution
Q64
Quick sort
Solution
No Solution
Q65
Pass
Solution
No Solution
Q66
n + m< x < 2n and 2m< n + m
Solution
No Solution
Q67
22,33,11,40,44,90,77,60,99,55,88,66
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 53/63
9/11/2019 Six Phrase - mySlate
Solution
No Solution
Q68
Tests whether a Binary Tree is a Binary Search Tree
Solution
No Solution
Q69
n less than 1
Solution
No Solution
Q70
F3<F2<F4<F1
Solution
No Solution
Q71
In nite loop
Solution
No Solution
Q72
x>y>z
Solution
No Solution
Q73
In x
Solution
No Solution
Q74
32
Solution
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 54/63
9/11/2019 Six Phrase - mySlate
No Solution
Q75
O(e+n)
Solution
No Solution
Q76
in-order successor
Solution
No Solution
Q77
pre order traversal
Solution
No Solution
Q78
row major
Solution
No Solution
Q79
Edges
Solution
No Solution
Q80
[(N-1)(N-2)…(N-(m-1))(m-2)]/Nm-1
Solution
No Solution
Q81
O(n2)
Solution
No Solution
Q82
n(n+2)
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 55/63
9/11/2019 Six Phrase - mySlate
Solution
No Solution
Q83
26
Solution
No Solution
Q84
-A/B•C-DE
Solution
No Solution
Q85
-+pq*rt
Solution
No Solution
Q86
30
Solution
No Solution
Q87
278
Solution
No Solution
Q88
12 24 36 48 60 61
Solution
No Solution
Q89
Inside else
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 56/63
9/11/2019 Six Phrase - mySlate
Solution
No Solution
Q90
no output
Solution
No Solution
Q91
3 -3 -8 -12 -15
Solution
No Solution
Q92
7
Solution
No Solution
Q93
7 14 24
Solution
No Solution
Q94
165
Solution
No Solution
Q95
120
Solution
No Solution
Q96
140
Solution
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 57/63
9/11/2019 Six Phrase - mySlate
No Solution
Q97
23 9 14
Solution
No Solution
Q98
0124
Solution
No Solution
Q99
3 10 27 70
Solution
No Solution
Q100
7
Solution
No Solution
Q101
3113
Solution
No Solution
Q102
3412
Solution
No Solution
Q103
3
Solution
No Solution
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 58/63
9/11/2019 Six Phrase - mySlate
Q104
28
Solution
No Solution
Q105
72
Solution
No Solution
Q106
None of the mentioned options
Solution
No Solution
Q107
3
Solution
No Solution
Q108
40,80,160,320,640,320,160,80,40
Solution
No Solution
Q109
49
Solution
No Solution
Q110
Fine
Solution
No Solution
Q111
2 3 5 7 11 13 17 19 23
Solution
No Solution
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 59/63
9/11/2019 Six Phrase - mySlate
Q112
15 4
Solution
No Solution
Q113
10
Solution
No Solution
Q114
18 18 4
Solution
No Solution
Q115
7 14 24
Solution
No Solution
Q116
5 25
Solution
No Solution
Q117
0
Solution
No Solution
Q118
165
Solution
No Solution
Q119
Logical error
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 60/63
9/11/2019 Six Phrase - mySlate
Solution
No Solution
Q120
21
Solution
No Solution
Q121
3 -3-8-12-15
Solution
No Solution
Q122
1/N
Solution
No Solution
Q123
36 1
Solution
No Solution
Q124
3 10 27 70
Solution
No Solution
Q125
it will execute in nitely
Solution
No Solution
Q126
11
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 61/63
9/11/2019 Six Phrase - mySlate
Solution
No Solution
Q127
Floyd’s algorithm
Solution
No Solution
Q128
Hashing
Solution
No Solution
Q129
4. 4. If (dd>=1 and dd<=31) and (mm=1 or mm=3 or mm=5 or mm=7 or mm=8 or m=10 or mm=12))
10. 10. Else If(dd=29 and mm=2 and (yy%400=0 or (yy%4=0 and yy%100!=0))
Solution
No Solution
Q130
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 62/63
9/11/2019 Six Phrase - mySlate
Dope vector
Solution
No Solution
Q131
All of the mentioned options
Solution
No Solution
Q132
14
Solution
No Solution
Q133
D. None of the mentioned options
Solution
No Solution
Q134
A. 49 31
Solution
No Solution
Q135
C. 16
Solution
No Solution
https://admin.myslate.sixphrase.com/school/test/preview?test_id=c41a53d6-9022-434a-a520-830c07149f40&branch_id=c06873a3-d4df-49e9-ae9d-6f061f22a5a6&isprint=true 63/63