DO NOT OPEN THIS TEST BOOKLET UNTIL YOU ARE ASKED TO DO SO

Te8tHerieB T. a. C. : OTE -11/2023

TEST BOOKLET
COMPUTER SCIENCE & ENGINRERING
PAPER-II si.INo. 209333

Time Allowed : 3 Hours Marimum Marks : 200

: INSTRUCTIONS TO CANDIDATES :
1. IMMEDIATELY AFTER THE COMMENCEMENT OF THE EXAMINATION, YOU SHOULD
CHECK THAT THIS TEST BOOKLET DOES NOT HAVE ANY UNPRINTED OR TORN
OR MISSING PAGES OR ITEMS ETC. IF` SO, GET IT REPIACED BY A COMPLETE
TEST BOOKLET OF` THE SAME SERIES ISSUED TO YOU.
2. ENCODE CLEARLY THE TEST BOOKLET SERIES A, I, C OR D, AS THE CASE MAY
BE, IN THE APPROPRIATE PLACE IN THE ANSWER SHEET USING BALL POINT PEN
(BLUE OR BLACK).
3. You have to enter your Roll No. on the Test Booklet
in the Box provided alongside. DO NOT write
cz7tgthz-ng ezse on the Test Booklet.
4.. YOU ARE REQUIRED TO FILL UP & DARKEN ROI,L NO., TEST BOOKLET /
QursTION BOOKLET sERIEs IN THE ANswER SHEET As wet,L As FII,L up
TEST BOOKLET / QUESTION BOOKLET SERIES AND SERIAI, NO. AND ANSWER
SHEET SERIAI, NO. IN THE ATTENDANCE SHEET CAREFULI,Y. WRONGI,Y
FIE,LED up ANswER sllEETs ARE LIABI,B FOR REOEc'rloN AT THE RISK oF
THE CANDIDATE.
5. This Test Booklet contains loo items (questions). Each item (question) comprises
of four responses (answers). You have to select the correct response (answer)
which you want to mark (darken) on the Answer Sheet. In case, you feel that there
is more than one correct response (answer), you should mark (darken) the response
(answer) which you consider the best. In any case, choose ONLY ONE response
(answer) for each item (question).
6. You have to mark (darken) all your responses (answers) ONLY on the Separate
Answer Sheet provided by u8itlg BALL POINT PEN (BLUE OR BLACK|. See
instructions in the Answer Sheet.
7. All items (questions) carry equal marks. All items (questions) are compulsory. Your
total marks will depend only on the number of correct responses (answers) marked
by you in the Answer Sheet. There shall be negative marking of 25% weightage.
8. Before you proceed to mark (darken) in the Answer Sheet the responses (answers) to
various items (questions) in the Test Booklet, you have to fiiill in some particulars in
the Answer Sheet as per the instructions sent to you with your Adml88ion Certificate.
9. After you have completed filling in all your responses (answers) on the Answer
Sheet and after conclusion of the examination, you should hand over to the Invigilator
the Ariszuer Sheet issued to you. You are allowed to take with you the candidate's
copy / second page of the Answer Sheet along with the Test Booklet, after
completion of the examination, for your reference.
10.Sheets for rough work are appended in the Test Booklet at the end.

DO NOT OPEN THIS TEST BOOKLET UNTIL YOU ARE ASKED T0 D0 SO

/20-A
 1. What will be the output of the 4. What will be the output of following
following code? code?
#include<stdio.h>
#include<stdio.h>
int main()
( int getMax(int* arr, int size)
char arr[100];
(
printf("%d", scanf("%s", air));
return 1; int max = arr[0];

for (int i = 1; i < size; i++)

if (max < arr[i])

(
2. What will be the output of the
following code?
mar = arr[i];
#include<stdio.h>
int main() )

(
)
printf("%d", 1 << 2 + 3 << 4);
return 0; return max;

112 )

int main()
512
(

3. What will be the output of following int arr|lo]={135,165,I,16, 511,

code? 65, 654, 654,169, 4};
#include<stdio.h>
printf("Largest Number in the
int main() Array: %d", getMax(arr, 10));
(
int i = 5, j = 10, k=15; retu- 0;
printf("%d", sizeof(k /= i + j));
)
printf("%d», k);
return 0; (A) 654

(a) 569

415
(C) 558

Compiler error (D) 777

/20-A 2
 5. What will be the output of following (8) a structure of 2 fields, each
code? field being a pointer to an array
of 10 elements
#include<stdio.h>
const int M = 3; (C) a structure of 3 fields: an
integer, a float and an a]Tay of
const int N = 3; 10 elements
void print(int arr[M][N])
(D) an array, each element of
( which is a structure of type
node
int i, j;

for (i - 0; i < M; i++)

7. The number of tokens in
for ti - 0; j < N; j++)
printfl("i - %d, & i - %x", i, & i);
printf("%d", arr[i]0]);

)
(A)3

int main() (8) 10

(
(C) 25
int arr[][3] = {{1, 2, 3}, {4, 5, 6},
(7, 8, 9)); (D) 22

print(arr);
8. Assume that objects of the type
retu- 0; short, float and long occupy 2 bytes,
)
4 bytes and 8 bytes respectively.
The memory requirement for
(A) 123456789 variable t, ignoring alignment
struct (
(a) 2 5 8 9 6 3 7 5 6
(C) 148987889 short s [5];

(D) 1 1 1 1 1 1 1 1 1 union (

6. struct node float y;

( long z;
int i;
float j;
)t
);

struct node *s[10]; (A) 22 bytes

The above C declaration defines (a) 18 bytes

(A) an array, each element of (C) 14 bytes

which is pointer to a structure
of type node (D) 10 bytes

/20-A I P.T.O.
 9. Consider the given three C 11. The output of the following C
functions : progran is
[Pll int * g (void)
void fl (int a, int b)
(

int x - 10; (

return (&x);
int c;
)

[P2] int * g (void) c=a; a=b; b=c;

(
)
int * px;
*px - 10;
void f2(int *a, int *b)
return px;
(
)

[P3] int * g (void) int c;

(
c=*a; *a=*b; *b=c;
int * px

px = (int *) malloc (sizeof(int));

)
*px - 10;

retu- px; int main()

)
(
l^rhich of the above three functions
are likely to cause problems? int a=4, b=5, c=6;
(A) Only Pl and P2
fl (a,b) ;
(a) Only P3
(C) Only Pl and P3 f2(&b, &c);
(D) P1, P2 and P3
printf("%d",c-a-b);
10. What does the given program print?
char c[ ] = "GATE2011" )

char *p - c;
(A) -5
printf("%s",p + p[3] -p[1]);

(A) GATE2011 (a)6

(a) 2011
(C) -6
(C) E2011

(D) Oil (D)0

/20-A
 12. The following program prints 14. The output of the following C
#include<stdio.h> program is
#include<stdio.h>
void i(int *p, int *q)
void mystery(int *ptra, int *ptrb)
(
(
P=q;
int *temp;
*p = 2;
temp = ptrb;
)
ptrb - ptra;
int i = 0, j -1;
ptra - temp;
int main()
)
( int main()
f(&i, &j);
(
printf("%d %d \n", i, j); int a=2016, b=0, c=4, d=42;
retu- 0; mystery(&a, &b);
) if (a < c)

(A) 2 2 mystery(&c, &a);

(8) 2 1 mystery(&a, &d);
(C) 0 1 printf("%d\n", a);
(D) 0 2 )

(A) 2016
13. Consider the following C program
(a) 2018
void f(int, short);
(C) 016
void main()
(D) 16
(

int i = 100;
15. The most appropriate matching for
the following pairs
short s = 12;
X: m=malloc(5); m= NULL;
short *p = &s;
Y: free(n); nivalue = 5;
_., I I call to f() Z: char *p; *p=`a';
) 1 : using dangling
Which one of the following 2: using uninitialized pointers
expressions, when placed in the
blank above, will not result in a type 3: lost memory
checking error? is
(A) f(s,*s) (A) X~1 Y-3 Z-2

(8) i = f(i,s) (a) X-2 Y-1 Z-3

(C) f(i,*s) (C) X-3 Y-2 Z-1

(D) f(i,"p) (D) X-3 Y-1 Z-2

/20-A I P.T.O.
16. A queue follows 20. We can use a self-balancing binary
search tree for implementing the
(A) LIFO principle (A) hash table

(8) FIFO principle (8) priority queue

(C) heap sort and priority queue
(C) Linear tree
(D) heap sort
(D) Ordered array
21. Which of the following statements
about binary tree is correct?
17. The time complexity used for
(A) Every binary tree is either
inserting a node in a priority queue complete or full
on the basis of key is
(8) Every complete binary tree is
also a full binary tree
(A) O(n)
(C) Every full binary tree is also a
(a) O(n2) complete binary tree
(D) A binary tree cannot be both
(C) O(nlogn) complete and full

(D) O(1ogn)
22. Suppose we have numbers between
1 and 1000 in a binary search tree
18. Which data structure do we use for and want to search for the number
testing a palindrome? 363. Which of the following
sequences cot(Zd not be the
sequence of the node examined?
(A) Heap
(A) 2, 252, 401, 398, 330, 344, 397,
(8) Tree 363
(a) 924, 220, 911, 244, 898, 258,
(C) Priority queue 362, 363

(D) Stack (C) 925, 202, 911, 240, 912, 245,

258, 363

(D) 2, 399, 387, 219, 266, 382, 381,

19. Which of these will form an 278, 363
inversion in this given array?
23. Suppose a complete binary tree has
arr= {2,8,5,3}
height h > 0. The minimum number
of leaf nodes possible in term of h
(A) (2,8) is

(8) (8,5), (8,3) (A) 2h-1

(a) 2h-1 + I
(C) (2,8), (2,5), (1,3)
(c) 2h-1
(D) (8,5), (8,3), (5,3) (D) 2h+ 1

/20-A
 24. The Breadth First Search traversal 27. What is an internal sorting
of a graph will result into algorithm?

(A) linked list (A) Algorithm that uses tape or disk

during the sort
(8) tree
(8) Algorithm that uses main
memory during the sort
(C) graph with back edges
(C) Algorithm that involves
(D) arrays swapping

(D) Algorithm that is considered in

25. A person wants to visit some places.
place'
He starts from a vertex and then
wants to visit every place connected
to this vertex and so on. What 28. The balance factor of a node in a
algorithm should he use? binary tree is defined as

(A) Depth F`irst Search (A) addition of heights of left and

rigbt subtrees
(a) Breadth F`irst Search
(8) height of right subtree minus
height of left subtree
(C) Trim's algorithm
(C) height of left subtree minus
(D) Kniskal's algorithm height of right subtree

(D) height of right subtree minus

26. Consider a complete undirected One
graph with vertex set {0, 1, 2, 3, 4}.
matrix TV below is
tEhne¥ei#:fThee edge {; j}. What is 29. Which of the following tree data
the minimum possible weight of a structures is not a balanced binary
spanning tree I in this graph such tree?
that vertex 0 is a leaf node in the
(A) AVL tree
tree I?
(8) Red-black tree

(C) Splay tree

W= (D) B-tree

30. A B-tree of order 4 and of height 3

will have a maximum of _ keys.
(A) 255

(a) 63

(C) 127

(D) 188

/20-A 7 I P.T.O.
31. Which of the following refers to the 34. After groups have been established,
degree (or arity) of relation in SQL applies predicates in the
relational database systems? clause, allowing aggregate
functions to be used.
(A) Number of attributes of its (A) Where
relation schema
(a) Having
(8) Number of tuples stored in the (C) Groupby
relation
(D) With
(C) Number of entries in the
relation 35. What is the function of the following
command?
(D) Number of distinct domains of
its relation schema Delete from R where P;
(A) Clears entries from relation
32. Which one of the following is used (8) Deletes relation
to represent the supporting many-
(C) Deletes particular tuple from
one relationships of a weak entity relation
set in an entity-relationship
diagram? (D) AIl of the above

(A) Diamonds with double/bold 36. The logical design and the snapshot
border of the data at a given instant in time
is known as
(a) Rectangles with double/bold
border (A) Instance and Relation
(8) Relation and Schema
(C) Ovals with double/bold border
(C) Domain and Schema
(D) Ovals that contain underlined (D) Schema and Instance
identifiers
37. For designing a normal RDBMS,
33. Given the basic ER and relational which of the following normal forms
models, which of the following is is considered adequate?
incoFTect?
(A) 4NF

(A) An attribute of an entity can (a) 3NF

have more than one value (C) 2NF`

(8) An attribute of an entity can be (D) 5NF

composite
38. Which level of RAID refers to disk
(C) In a row of a relational table, mirroring with block striping?
an attribute can have more
than one value (A) RAID level 1
(8) RAID level 2
(D) In a row of a relational table,
an attribute can have exactly (C) RAID level 0
one value or a NULL value (D) FEND level 3

/20-A
 39. A unit of storage that can store one 43. Banker's algorithm is used
or more records in a hash file
organization is denoted as (A) to prevent deadlock
(8) to deadlock recovery
(A) buckets
(C) to solve the deadlock
(8) disk pages (D) None of the above
(C) blocks
44. What is the fence register used for?
(D) nodes
(A) Disk protection

40. A unit of storage that can store one (8) CPU protection
or more records in a hash file (C) Memory protection
organization is denoted as
(D) None of the above
(A) buckets
45. A process which is copied from main
(8) disk pages memory to secondary memory on
the basis of requirement is known
(C) blocks as
(D) nodes (A) demand paging
(a) segmentation
41. A counting semaphore was
(C) pagin8
initialized to 10. Then 6 P (wait)
operations and 4 V (signal) (D) threads
operations were completed on this
semaphore. The resulting value of 46. Which of the following scheduling
the semaphore is algorithms is preemptive
scheduling?
(A)0
(A) FCFS scheduling
(a)8
(8) SUF` scheduling
(C) 10 (C) Network scheduling
(D) 12 (D) SRTF scheduling

42. A critical section is a program 47. A process executes the code

segment fork();
fork();
(A) which should run in a certain
specified amount of time fork();
The total number of child processes
(8) which avoids deadlocks
created is
(C) where shared resources are (A)3
accessed
(8)4
(D) which must be enclosed by a
(C)7
pair of semaphore operations,
P and V (D)8

/20-A I P.T.O.
48. Consider the set of 5 processes 51. Which of the following are examples
(FCFS) whose arrival time and burst of stateful application layer
time are given below : protocols?

Proc e 8s Arrival Burst /i' HITP

ld time time (it) FTP

PI 3 4 (Zii) TCP

3 /!L,/ POP3
P2 5
(AL) (i) and (iv)
P3 0 2
(8) (it) and (iit)
P4 5 1
lc) (ii) and (iv)
P5 4 3
(D' (iit) tlnd (iv)
What is average waiting time?
52. Which one of the following uses
(A) 2.3 units UDP as the transport protocol?

(a) 3.2 units (A) TELNET

(C) 4.9 units (a) ARP

(C) HITP
(D) 3.9 units
(D) DNS
49. UNIX is written in which language?
53. Protocol where each frame begins
(A) C++ with at least two SYN characters is

(B)C (A) HDLC

(C) C#
(a) BISYNC

(C) DHCP
(D) .NET
(D) SMTP
50. A system program that combines
the separately compiled modules of 54. An organization has a class 8
a program into a form suitable for network and wishes to form subnets
execution is known as for 64 departments. The subnet
mask would be
(A) assembler
(A) 255.255.0.0
(8) linking loader
(8) 255.255.64.0
(C) cross compiler (C) 255.255.128.0

(D) load and go (D) 255.255.252.0

/20-A 10
 55. Choose the best match between 57. Error detection at data link layer
Group-1 and Group-2 is achieved by

Group -1 Group -2 (A) Stuffing

P. Data Link 1. Ensures reliable (8) Cyclic redundancy code

Layer transport of data
over a physical point- (C) Humming code
to-point link
(D) Equalization
Q. Network 2. Encoder/Decoder
Layer data for physical
transmission 58. q3AUD' rate means

R. Transport 3. Allows end-to-end (A) the number of bits transmitted

Laye r communication per unit time
between two processes
(B) the number of bytes
S. Session 4. Routes data from transmitted per unit time
Layer one network node to
the next (C) the rate at which the signal
changes per second
(A) P-1, Q-4, R-3
(D) None of the above
(a) P-2, Q-4, R-1
59. A is a networking device that
(C) P-2, Q-3, R-1 connects all of the devices on the
network to transport data to
(D) P-1, Q-3, R-2 another device.

(A) switch
56. What is split horizon?
(a) hub
(A) Information about a route
should not be sent back in the
(C) router
direction from which the
original update came
(D) modem

(8) It splits the traffic when you

have a large bus (horizon) 60. The data link layer consists of how
physical network many sub layers?

(C) It holds the regular updates (A)2

from broadcasting to a downed
link (a)3

(D) It prevents regular update (C)4

messages from reinstating a
route that has gone down (D)5

/20-A 11 I P.T-O.
61.Why is the complexity of 64. Which of the following is the
Bresenham's line drawing purpose of the error term in the
algorithm less than that of DDA line DDA algorithm?
drawing algorithm?
(A) To ensure that the line is drawn
(A) It uses floating point operations correctly
over integer addition and
subtraction (8) To improve the accuracy of the
line
(8) It considers only selected
ranged inputs
(C) To reduce the computational
cost of drawing the line
(C) It uses integer addition and
subtraction over floating point
(D) To determine the next pixel to
operations be plotted

(D) None of the above

65. What is rotation in 2-D
transformation?
62. Which of the following is not a
limitation of the DDA algorithm?
(A) Moving an object without
changing its position or size
(A) It cannot draw lines with slopes
greater than 1
(8) Turning an object around a
fixed point
(8) It cannot draw lines with slopes
less than -1
(C) Increasing or decreasing the
size of an object
(C) It cannot draw lines with slopes
between 0 and 1
(D) Changing the shape of an object
(D) It cannot draw lines with slopes
between -1 and 0
66. What is a joystick used for in
computer graphics?
63. Which of the following is the most
commonly used graphic input (A) Simulating movement in games
device for drawing and manipulating and simulations
graphical objects?
(8) Controlling the camera in
(A) Mouse
virtual environments

(8) Touchscreen (C) Providing haptic feedback in

virtual environments
(C) .Joystick
(D) Navigating through menus and
options in graphical applications
(D) Stylus
/20-A 12
 67. Which of the following is the most 71. What is the purpose of the
common hidden line and surface requirements gathering phase of
removal algorithm? the SDLC?

(A) Painter's algorithm (A) To identify the needs of the

users
(8) Z-buffer algorithm

(C) ESP tree algorithm (8) To design the software

(D) Octree algorithm (C) To write the code

68. In reflection transformation, the (D) To test the software

size of the object does not change.

(A) True 72. What are the challenges of

managing a software project that is
(a) False using an agile methodology?
(C) Can be true or false
(A) Agile projects are often more
(D) Cannot say difficult to plan and manage
than traditional waterfall
projects
69. Which of the following is the
purpose of the error term in the (8) Agile projects often require
DDA algorithm? more communication and
collaboration between team
(A) To ensure that the line is drawn members
correctly

(a) To improve the accuracy of the (C) Agile projects are often more
line susceptible to change

(C) To reduce the computational (D) AIl of the above

cost of drawing the line

(D) To detemine the next pixel to 73. What are the three main types of
be plotted system analysis?

70.What is scaling, in 2-D (A) Structured analysis, object-

transformation? oriented analysis and data-
oriented analysis
(A) Moving an object without
changing its position or (8) Functional analysis, non-
orientation functional analysis and
performance analysis
(8) Rotating an object around a
fixed point
(C) Requirements analysis, design
(C) Increasing or decreasing the
analysis and testing analysis
size of an object
(D) Data flow analysis, decision
(D) Changing the shape of an object analysis and risk analysis
/20-A 13 I P.T.O.
74. What is the purpose of a Data Flow 77. What is the difference between
Diagram (DFD)? testing and validation?

(A) Testing is the process of finding

(A) To represent the flow of data defects in software, while
through a system
validation is the process of
ensuring that software meets
(8) To identify the entities and its requirements
processes in a system
(8) Testing is a technical activity,
(C) To define the relationships while validation is a
between entities and processes management activity
in a system
(C) Testing is typically performed by
testers, while validation is
(D) To document the requirements typically performed by
of a system developers

(D) All of the above

75. What is the first step in the
Software Development Life Cycle
(SDLC)? 78. What are some of the common test
case design techniques?
(A) F`easibility study
(A) Equivalence partitioning,
boundary value analysis and
(8) Preliminary investigation and decision tables
analysis
(8) Exploratory testing, pairwise
(C) System design testing and user acceptance
testing
(D) Coding
(C) Smoke testing, sanity testing
and regression testing
76. What are the different techniques (D) All of the above
that can be used for system
analysis?
79. What are the different types of
CASE tools?
(A) Data Flow Diagrams (DFDs),
entity-relationship diagrams
(A) Upper CASE tools, lower CASE
(ERDs) and use cases tools and integrated CASE tools

(8) Interviews, questionnaires and (8) Forward CASE tools, reverse

observation CASE tools and reengineering
CASE tools
(C) Brainstorming, prototyping and
modeling (C) Static CASE tools and dynamic
CASE tools

(D) All of the above (D) AIl of the above

/20-A 14
80. Which of the following is a good 83. What is the purpose of software
example of a module with high testing?
cohesion?
(A) To find bugs in the software
(A) A module that performs
multiple unrelated tasks (8) To ensure that the software
meets its requirements
(8) A module that has a lot of global (C) To make sure that the software
variables
is easy to use

(C) A module that is tightly coupled (D) To improve the quality of the
to other modules software

(D) A module that performs a single

well-defined task 84. Which property of software
modularity is incorrect with
respect to benefits software
81. What is the difference between a modularity?
module and a component?
(A) Modules are robust
(A) A module is a software unit that
(8) Module can use other modules
performs a specific task, while
a component is a physical unit
(C) Modules can be separately
that can be plugged into a compiled and stored in a library
system
(D) Modules are mostly dependent
(8) A module is a static entity,
while a component is a dynamic
entity 85. _ is/are a measure/measures
of the degree of interdependence
between modules.
(C) A module is a high-level
concept, while a component is
a low-level concept (A) Cohesion

(8) Coupling
(D) There is no difference between
a module and a component (C) None of the above

(D) AIl of the above

82. Which of the following is not a
phase of the Software Development
Life Cycle (SDLC)? 86. What are the input and output of
an NLP system?
(A) Requirements Gathering
(A) Speech and noise
(a) Implementation (8) Speech and written text
(C) Deployment (C) Noise and written text

(D) Testing (D) Noise and value

/20-A 15 I P.T.O.
87. Which of the following is used for 91. What is the space complexity of
mapping sentence plan into Greedy search?
sentence structure?
(A) O(b)
(A) Text planning
(8) O(bl)
(8) Sentence planning
(C) O(in)
(C) Text realization

(D) None of the above (D) O(bin)

88. A* algorithm is based on 92. Which of the following is not

Capabilities of Expert Systems?
(A) Breadth-First Search
(A) Advising
(8) Depth-First Search
(a) Demonstrating
(C) Best-First Search

(D) Hill climbing (C) Explaining

(D) Expanding
89. Best-First Search is a type of
informed search, which uses
to choose the best next node for 93. Which of the following is not the
expansion. commonly used programming
language for Artificial Intelligence?
(A) evaluation function returning
lowest evaluation
(A) Perl

(8) evaluation function returning

highest evaluation (a) Java

(C) evaluation function returning (C) PROLOG

lowest and highest evaluations
(D) LISP
(D) None of the above

94. Which of the following produces

90. Heuristic function h(n) is hypotheses that are easy to read
for humans?
(A) lowest path cost
(A) Machine learning
(8) cheapest path from root to goal
node
(B) ILP
(C) estimated cost of cheapest path
from root to goal node (C) First-order logic

(D) average path cost (D) Propositional logic

/20-A 16
 95. Which of the following is not a 98. The process of removing detail from
type of Artificial Intelligence a given state representation is
agent? called

(A) Learning AI agent (A) extraction

(8) Goal-based AI agent (8) abstraction

(C) Simple reflex AI agent (C) information retrieval

(D) Unity-based AI agent (D) mining of data

96. When will Hill climbing algorithm 99. What is/are the major component/
terminate? components for measuring
the performance of problem
(A) Stopping criterion met solving?

(8) Global Min/Max is achieved (A) Completeness

(C) No neighbor has higher value (a) Optimality

(D) AI of the above (C) Time and Space complexity

(D) AIl of the above

97. Hill climbing is sometimes
called because it grabs a
good neighbor state without loo. Which search method takes less
thinking ahead about where to go
memory?
next.

(A) Depth-First Search

(A) needy local search

(8) Breadth-First Search

(8) heuristic local search

(C) Linear Search

(C) greedy local search

(D) optimal local search (D) Optimal Search

/20-A 17 I P.T-0.
 SPACE FOR ROUGH WORK

/20-A 18
 SPACE F`OR ROUGH WORK

/20-A 19 I P.T.O.
 SPACE FOR ROUGH WORK

***
OTE-11/2023/20-A 20 PPP24/ 1 (082L130x4