4/3/24, 12:40 PM LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at Exampyq.

at Exampyq.Com & Doorsteptutor.…

Examrace: Downloaded from examrace.com [https://www.examrace.com/]

For solved question bank visit doorsteptutor.com [https://www.doorsteptutor.com] and for free video lectures visit
Examrace YouTube Channel [https://youtube.com/c/Examrace/]
AAI (Airport Authority of India) Junior Executive (JE) Airport Operations (AO) Coaching Programs

🎯 143 MCQs (& PYQs) with Detailed Explanations (2023-2024)

Click Here to View & Get Complete Material [https://www.exampyq.com/AAI/AO/Questions/]

Rs. 150.00

3 Year Validity (Multiple Devices)

LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at
ExamPYQ. Com & DoorstepTutor. Com
Q 1. What is the minimum number of NAND gates required to get the function of an OR gate?
a. 1
b. 2
c. 3
d. 4
Q 2. A NAND gate is equivalent to a/an ________ gate.
a. inverted-input OR
b. inverted-input AND
c. XOR
d. XNOR
Q 3. Two NOT gates in series are equivalent to a/an________, because they cancel each other as (A″) ″ = A.
a. Inverter
b. Buffer
c. NAND gate
d. NOR gate
Q 4.
Which of the following logic gates has the following Truth Table?

X Y Output

0 0 1

0 1 0

1 0 0

1 1 1

Table Supporting: LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at ExamPYQ. Com & DoorstepTutor. Com

a. NAND
b. NOR
c. XOR
d. XNOR
Q 5. What should come in place of the blanks in the binary number (10_1001_11)2, to make its decimal value 715?
a. 0,0
b. 0,1
c. 1,0
d. 1,1
Q 6. What is the 10՚s compliment of the decimal number 246700?
a. 753299
b. 864399
c. 753300
d. 999900
1 of 11
4/3/24, 12:40 PM LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at Exampyq.Com & Doorsteptutor.…

Q 7. Which of the following is valid for Boolean algebra but NOT for ordinary algebra?
a. X. (Y + Z) = (X. Y) + (X. Z)
b. X + (Y. Z) = (X + Y) . (X + Z)
c. X + Y = Y + X
d. X. Y = Y. X
Q 8.
Match the following.

List - 1 List – 2

I. Register A. Sequential circuit

II. Decoder B. XY

III. X + XY C. Combinational circuit

IV. X (X″ + Y) D. X

Table Supporting: LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at ExamPYQ. Com & DoorstepTutor. Com

a. I – A, II – C, III – D, IV - B
b. I – C, II – A, III – D, IV - B
c. I – A, II – C, III – B, IV - D
d. I – C, II – A, III – B, IV - D
Q 9.
State whether True or False.
I. An AND gate is equivalent to an inverted-input NOR gate.
II. An OR gate is equivalent to an inverted-input NAND gate.
a. I – True, II - True
b. I – True, II - False
c. I – False, II - True
d. I – False, II - False
Q 10.
What is the addressing mode illustrated by the following figure?

2 of 11
4/3/24, 12:40 PM LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at Exampyq.Com & Doorsteptutor.…

3 of 11
4/3/24, 12:40 PM LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at Exampyq.Com & Doorsteptutor.…

4 of 11
4/3/24, 12:40 PM LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at Exampyq.Com & Doorsteptutor.…

a. Immediate
b. Direct
c. Indirect
d. Register
Q 11. The register addressing is similar to the ________ addressing, except the fact that the address field refers to a register rather than a
main memory address.
a. direct
b. indirect
c. immediate
d. displacement
Q 12. In the context of an instruction set, orthogonality indicates that other elements of an instruction are ________ of/by the opcode.
a. independent
b. dependent
c. determined
d. executed
Q 13. The main memory, the unit of transfer is the number of ________ read out of or written into memory at a time.
a. words
b. bits
c. nibbles
d. characters
Q 14. Which of the following memory access mechanisms enables to retrieve a word based on a portion of its contents, rather than its
address?
a. Direct access
b. Sequential access
c. Random access
d. Associative
Q 15. If ‘m’ is the number of bits in a memory address and ‘n’ is the number of addressable units, then which of the following represents
the correct relationship between ‘m’ and ‘n’ ?
a. n = 2m
b. m = 2n
c. m = 2n - 1
d. n = 2m + 1
Q 16. Which of the following memory needs periodic refreshing?
a. SRAM
b. DRAM
c. Cache memory
d. Flash memory
Q 17. The process in which the DMA controller puts the CPU on hold for each byte of data to be transferred is called ________
a. Page-fault
b. Cycle stealing
c. Buffering
d. Paging
Q 18. Like EPROM, flash memory uses only ________ transistor (s) per bit, and so achieves the high density (compared with EEPROM) of
EPROM.
a. one
b. two
c. three
d. four
Q 19. A ________ is an ordered collection of finite, homogeneous data elements.
a. Linked List

5 of 11
4/3/24, 12:40 PM LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at Exampyq.Com & Doorsteptutor.…

b. Graph
c. Tree
d. Hash Table
Q 20. Which of the following programming languages supports the concept of pointer?
a. BASIC
b. FORTRAN
c. C ++
d. JAVA
Q 21.
What is the value of the following ‘C’ language expression?

a. 16
b. 1
c. 32
d. 64
Q 22. Which of the following data structures is generally used to implement priority queue?
a. Heap tree
b. Graph
c. Stack
d. Table
Q 23. In which of the following data structures, both insertion and deletion operations can take place at either end of the structure?
a. Deque
b. Priority queue
c. Stack
d. Queue
Q 24. What is the total number of Binary Trees possible with ‘n’ nodes?

a.

b. ×2 nCn

c.

d. ×4 nC2 n

Q 25.
Which of the following sequence of ‘C’ statements will print the output given below?
1
12
123
1234
12345
a.
for (x = 1; x < 5; x ++) {
for (y = 1; y < x; y ++)
printf ( “% d” , y) ;
printf ( “⧵n” ) ;
}
b.
for (x = 1; x < 5; x ++) {
for (y = 1; y < = x; y ++)
printf ( “% d” , y) ;
printf ( “⧵n” ) ;
}
6 of 11
4/3/24, 12:40 PM LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at Exampyq.Com & Doorsteptutor.…

c.
for (x = 1; x < = 5; x + +) {
for (y = 1; y < x; y ++)
printf ( “% d” , y) ;
printf ( “⧵n” ) ;
}
d.
for (x = 1; x < = 5; x + +) {
for (y = 1; y⇐x; y ++)
printf ( “% d” , y) ;
printf ( “⧵n” ) ;
}
Q 26.
What is the postfix representation of the following infix expression?
(A + B) ⚹ C – D ⚹

a. A B + C ⚹ D E ⚹ F -/
b. A B ⚹ C + D E ⚹ F/-
c. A B + C – D E ⚹ F/⚹
d. A B + C ⚹ D E ⚹ F/-
Q 27.
Which of the following statements about the execution of the segment of ‘C’ language code given below is TRUE?
#include < stdio. h >
void main () {int x = 1; for (; ;) printf ( “% d” , x) ;}
a. It will terminate without printing any value of x
b. It will print the value of x exactly once
c. It will go to infinite loop and it will never print the value of x
d. It will go to infinite loop and it will keep on printing the value of x as 1.
Q 28.
What is the sequence of nodes when applying in-order traversal on the binary tree given below?

7 of 11
4/3/24, 12:40 PM LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at Exampyq.Com & Doorsteptutor.…

8 of 11
4/3/24, 12:40 PM LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at Exampyq.Com & Doorsteptutor.…

a. A, B, C, D, E, F, I, H, G
b. A, C, D, E, B, F, G, H, I
c. A, B, C, D, E, F, G, H, I
d. I, H, G, F, E, D, C, B, A
Q 29. What is the associativity of the arithmetic operators?
a. Left-to-Right
b. Top-to-Bottom
c. Right-to-Left
d. Bottom-to-Top
Q 30. Which of the following is NOT a valid storage class in ‘C’ language?
a. static
b. Dynamic
c. Register
d. Auto
Q 31.
Considering the size of char (character) variables as one byte, what will be the size of the array declared below?
char array [] = “programming language” ;
a. 11 Bytes
b. 8 Bytes
c. 20 Bytes
d. 21 Bytes
Q 32.
Consider the following declaration of an array in ‘C’ language:
int A [6] = {1,2, 3,5} ;
Which of the following statements is true?
a. Both A [2] and 2 [A] represent the value 2.
b. Both A [2] and 2 [A] represent the value 3
c. A [2] is the correct way to access an element of A, but 2 [A] will give an error
d. The last two elements of the array A are 3 and 5
Q 33. Which of the following statements is TRUE?
a. In a binary tree, each node must have at least one child node.
b. In a binary tree, a node cannot have single child node
c. A binary tree must have at least one node with two child nodes
d. In a binary tree, a node can have at most two child nodes.
Q 34. What is the order of the adjacency matrix corresponding to a graph with ‘n’ nodes and ‘m’ edges?
a. n × m
b. n × n
c. m × m
d. n × 2 m
Q 35. What is the best-case time complexity of the Linear search?
a. O (n)
b. O (1)
c. O (n log n)
d. O (n2)
Q 36. What is the worst-case and average-case time complexity of the Binary search?
a. O (n2)
9 of 11
4/3/24, 12:40 PM LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at Exampyq.Com & Doorsteptutor.…

b. O (1)
c. O (n log n)
d. O (log n)
Q 37. Which of the following is NOT a comparison sort?
a. Insertion sort
b. Bubble sort
c. Bucket sort
d. Selection sort
Q 38. Shell sort is an example of ________.
a. out-place, comparison sort
b. in-place, non-comparison sort
c. in-place, comparison sort
d. out-place, non-comparison sort
Q 39.
Consider a hash table of size 7, with hash function H (k) = k % 7, and pseudo random i = (i + 5) % 7. We want to insert the following keys
one by one from left to right.
15, 11, 25, 16,9, 8,12
What will be the position of the key 25, if we use random probing?
a. 4
b. 5
c. 1
d. 2
Q 40. Which of the following is TRUE of the time complexity of the insertion sort algorithm to sort a list of ‘n’ integers?
a. Ω (n2)
b. Ω (n)
c. O (n)
d. O (n log (n) )
Q 41. What is the worst-case time complexity of the Quick Sort algorithm to sort a list of ‘n’ values?
a. O (n)
b. O (n2)
c. O (n log2n)
d. O (n3)
Q 42. Which of following problems cannot be solved using greedy approach?
a. Minimum spanning tree problem
b. Single source shortest path problem
c. Huffman code problem
d. 0 - 1 knapsack problem
Q 43. Let ‘m’ and ‘n’ be the number of edges and vertices in a graph G, respectively. Which of the following is the time complexity of the
Kruskal՚s algorithm to find minimum spanning tree of G?
a. O (n log n)
b. O (m log m)
c. O (n2)
d. O (m2)
Q 44. A finite automata is defined as a ________.
a. 3 - Tuple
b. 4 - Tuple
c. 5 - Tuple
d. 6 - Tuple
Q 45. Which of the following regular expressions represents the language of strings ending in aa?
a. (a, ba) ⚹ b
b. (a, b) ⚹ aa
c. (a, b) + aa
10 of 11
4/3/24, 12:40 PM LMRC Assistant Manager IT/CS: 2018 Official Paper: Answers, Solutions, & Explanations at Exampyq.Com & Doorsteptutor.…

d. (aa, ab) ⚹ a

11 of 11