Deloitte NLA Previous Year Coding Questions
Deloitte NLA (National Level Assessment) is an online, fully proctored screening test used by Deloitte for off-campus and campus hiring of fresh graduates. The assessment evaluates language ability, reasoning, quantitative skills, data interpretation, and coding aptitude. The test is timed and designed to screen candidates for entry level roles across Deloitte's businesses.
Eligibility
- Primarily for the graduating batch of 2026.
- Open to freshers applying through global off-campus hiring channels and university campus drives.
- Typical requirements: degree in relevant stream, no or limited prior full-time experience depending on the role and drive rules. Always check the specific Deloitte job posting for exact eligibility criteria.
Hiring Process (high level)
- Application submission via Deloitte careers portal or campus/off-campus partner platform.
- Deloitte NLA online assessment (screening).
- Technical interviews and/or coding interviews for shortlisted candidates.
- HR / behavioral interview and offer stage.
Note: Some hiring drives may include an online coding round (platform-dependent), or a technical take-home task in addition to interviews.
Exam Pattern (summary)
- Mode: Online, fully proctored. Camera and microphone must be ON. Tab switching and external help are disallowed. AI tools are banned during the test.
- Total duration: 90 minutes.
- Total questions: 65 MCQs + 2 coding questions (format may vary by year).
- Common sections and counts (subject to official variation):
- English Language Skills: approx 10 questions
- Logical Reasoning: 10-15 questions
- Quantitative Ability: 15-20 questions
- Data Interpretation: 10-12 questions
- Computer Science / Professional Knowledge: 8-12 questions
- Coding: 2 problems (online IDE)
Quick Tips for Deloitte NLA Coding Round:
- Languages allowed: C, C++, Java, Python, C#
- Platform: HirePro (focus on clean input/output handling)
- Most repeated topics: Arrays (move zeros, sort 0-1-2), Bit manipulation (toggle, set bits), Strings (LCS, alternation), Math/logic (sum of primes, perfect numbers), Basic DSA (inversions, subarray sums)
- Time yourself: Solve 2 questions in 30–40 mins
- Practice similar problems on LeetCode (Easy-Medium) + PrepInsta Deloitte section
Deloitte NLA Previous Year Coding Questions
Question 1: Move Zeros to the End (Chocolate Factory)
A chocolate factory packs chocolates into packets represented by an array of N integers. Find all empty packets (0) and push them to the end of the array while maintaining the relative order of non-zero elements.
Input Format
- First line: integer N (array size)
- Next N lines: array elements
Output Format
- Single line with N space-separated integers (non-zeros first, then zeros)
Constraints
- 1 ≤ N ≤ 10⁵
Example
Input:
8
4
5
0
1
9
0
5
0
Output:
4 5 1 9 5 0 0 0
Question 2: Toggle Bits After the Most Significant Bit
Given a positive integer N, convert it to binary, toggle all bits starting from the most significant bit (including it), and return the resulting integer.
Input Format
- Single integer N
Output Format
- Single integer (toggled value)
Constraints
- 1 ≤ N ≤ 100
Example
Input: 10
Output: 5
Explanation: Binary 1010 toggled to 0101 (5).
Question 3: Count Elements Within a Difference
Implement int findCount(int arr[], int length, int num, int diff) to return the count of elements in arr where |arr[i] - num| ≤ diff. Return -1 if none.
Input Format
- First line: length
- Next length lines: array elements
- Next: num
- Next: diff
Output Format
- Single integer (count or -1)
Example
Input:
7
12
3
14
56
77
13
13
2
Output: 3
Explanation: 12, 13, 14 are within 2 of 13.
Question 4: Difference of Sums (Divisible vs Non-Divisible)
Compute the absolute difference between the sum of numbers from 1 to m divisible by n and those not divisible by n.
Input Format
- Integer n
- Integer m
Output Format
- Single integer (absolute difference)
Constraints
- n > 0, m > 0
Example
Input: 4, 20
Output: 90
Question 5: Sort Array of 0, 1, 2 (Risk Severity)
Sort an array of N integers consisting only of 0, 1, or 2 in ascending order.
Input Format
- First line: N
- Next N lines: elements (0,1,2)
Output Format
- Single line with sorted elements
Example
Input:
7
1
0
2
0
1
0
2
Output: 0 0 0 1 1 2 2
Question 6: Class Monitor
Given a sequence of ranks, count how many times a new minimum rank appears after the first (i.e., how many names are cut).
Input Format
- First line: N
- Second line: N ranks
Output Format
- Single integer (count - 1 for the first)
Constraints
- N ≤ 10⁹, ranks ≤ 10,000
Example
Input:
6
4 3 7 2 6 1
Output: 2 (3-1)
Question 7: Corona for Computer (Binary Virus - Right Shift)
A virus with n spikes removes the n least significant bits from each number in an array (right shift by n).
Input Format
- N
- N numbers
- n (spikes)
Output Format
- Shifted numbers
Example
Input:
5
1 2 3 4 5
2
Output: 0 0 0 1 1
Question 8: Help of Prepsters (Count with K Set Bits)
Count integers < N with exactly K set bits in binary.
Input Format
- N K
Output Format
- Count
Constraints
- 1 ≤ N ≤ 10,000, 1 ≤ K ≤ 10
Example
Input: 7 2
Output: 3 (3,5,6)
Question 9: Momentum LinkedList
Compute total momentum (sum mass * velocity) for n particles.
Input Format
- n
- n lines: mass velocity
Output Format
- Total momentum
Constraints
- 1 ≤ n ≤ 10,000, 1 ≤ m,v ≤ 100
Example
Input:
4
1 3
2 4
2 3
4 5
Output: 37
Question 10: Lazy String (Lex Smallest LCS)
Find the lexicographically smallest longest common subsequence of two strings.
Input Format
- Two strings (capital letters)
Output Format
- Smallest LCS string
Example
Input:
ABCD
BACD
Output: ACD
Question 11: Number of Subarrays with Odd Sum
Count subarrays with odd sum.
Input Format
- N
- N integers
Output Format
- Count
Constraints
- 1 ≤ N ≤ 10⁵, |arr[i]| ≤ 1000
Question 12: Length of Longest Palindromic Substring
Find the length of the longest palindromic substring.
Input Format
- String S
Output Format
- Length
Constraints
- 1 ≤ |S| ≤ 1000
Example
Input: babad
Output: 3
Question 13: Merge K Sorted Arrays
Merge k sorted arrays into one sorted array.
Input Format
- k
- k arrays
Output Format
- Merged array
Question 14: Kth Largest Element
Find the kth largest in an unsorted array.
Input Format
- N k
- N integers
Output Format
- Kth largest
Question 15: Count Inversions
Count inversions (pairs i<j where arr[i]>arr[j]).
Input Format
- N
- N integers
Output Format
- Count
Constraints
- 1 ≤ N ≤ 10⁵
Question 16: Numbers with Even Digits
Find numbers with even number of digits (mentioned in YouTube as common).
Note: Full statement not detailed, but involves counting or finding such numbers in a range.
Question 17: Job Scheduling
Given jobs with ID, deadline, profit, maximize profit by scheduling (one per day, meet deadlines).
Input Format
- Array of jobs
Output Format
- Sequence of IDs and max profit
Question 18: String Alternation
Alternate characters from two strings, append remaining if unequal length.
Example
Input: HackerRank, Mountain
Output: HMaMaOcKeRnTnaiak
Question 19: Sum of Two Primes
Express a number as sum of two primes.
Input Format
- Number
Output Format
- Pair or message
Example
Input: 34
Output: 3 and 31
Question 20: Perfect Number Check
Check if a number is perfect (sum of proper divisors equals number).
Example
Input: 28
Output: Perfect
Deloitte NLA Previous Year MCQs
Deloitte NLA MCQs repeat patterns heavily, practice these for 70–90% coverage.
Sections Overview (2025–2026 Pattern):
- Quants + Logical Aptitude → 80 MCQs (50 Quants + 30 Logical – combined practice set, actual test often 40–50+ combined)
- English Verbal → 20 MCQs
- Technical Skills → 20 MCQs
No negative marking | 90 mins total | Focus on speed + accuracy.
Quantitative Aptitude (1–50)
HCF of 18, 108, 264?
A) 4
B) 3
C) 6
D) 8
Answer: C) 6Smallest 4-digit number divided by 7,9,11 leaves remainders 3,5,7?
A) 1355
B) 1366
C) 1377
D) 1382
Answer: B) 1366Pipe A fills in 10 hrs, B empties in 15 hrs. Together time?
A) 20 hrs
B) 30 hrs
C) 25 hrs
D) 6 hrs
Answer: B) 30 hrsBoat downstream 30 km in 2 hrs, upstream 20 km in 4 hrs. Stream speed?
A) 5 km/h
B) 10 km/h
C) 15 km/h
D) 7.5 km/h
Answer: A) 5 km/h43322K divisible by 72. Find K?
A) 4
B) 8
C) 0
D) 6
Answer: B) 8Petrol:kerosene = 2:1 in 120 L. Add kerosene X L to make 3:2. X?
A) 12 L
B) 24 L
C) 40 L
D) 60 L
Answer: A) 12 LWays to make ₹100 with 1 & 2 rupee coins?
A) 51
B) 50
C) 49
D) 52
Answer: A) 51Series: 2, 5, 10, 17, 26, ?
A) 37
B) 39
C) 40
D) 35
Answer: A) 37CP ₹400, SP ₹500. Profit %?
A) 20%
B) 25%
C) 30%
D) 15%
Answer: B) 25%A 12 days, B 18 days, A+B+C finish in 4 days. C alone?
A) 6 days
B) 9 days
C) 12 days
D) 18 days
Answer: B) 9 daysSI on ₹8000 @5% p.a. 3 years?
A) ₹1200
B) ₹1400
C) ₹1000
D) ₹1600
Answer: A) ₹1200CI on ₹10000 @10% p.a. 2 years annual?
A) ₹2100
B) ₹2000
C) ₹2200
D) ₹2300
Answer: A) ₹2100Ages A:B = 4:5. After 5 yrs = 5:6. A age?
A) 20
B) 25
C) 30
D) 15
Answer: A) 20Train 150 m crosses pole in 5 sec. Speed?
A) 108 km/h
B) 90 km/h
C) 72 km/h
D) 54 km/h
Answer: A) 108 km/hTrains 120 m & 180 m opposite 54 & 72 km/h. Cross time?
A) 10 sec
B) 12 sec
C) 15 sec
D) 18 sec
Answer: A) 10 secLCM of 12, 18, 24?
A) 72
B) 48
C) 96
D) 144
Answer: A) 72Marked 40% above cost, 10% discount. Profit %?
A) 26%
B) 30%
C) 24%
D) 28%
Answer: A) 26%3 men or 4 women 43 days. 6 men + 8 women time?
A) 12 days
B) 10 days
C) 15 days
D) 18 days
Answer: A) 12 daysAverage first 10 natural numbers?
A) 5.5
B) 6
C) 5
D) 10
Answer: A) 5.55% of x = 3% of y. y:x?
A) 5:3
B) 3:5
C) 15:1
D) 1:15
Answer: A) 5:3Article 20% profit. ₹60 more → 50% profit. CP?
A) ₹400
B) ₹300
C) ₹500
D) ₹200
Answer: A) ₹400Ratio 3:4. Add 5 each → 4:5. Smaller number?
A) 15
B) 20
C) 12
D) 18
Answer: A) 15Boat still 10 km/h, stream 2 km/h. 24 km down & back?
A) 5 hrs
B) 4.8 hrs
C) 5.5 hrs
D) 6 hrs
Answer: B) 4.8 hrsPipes A,B,C 10,15,30 hrs. All 2 hrs, C closed. Remaining time?
A) 4 hrs
B) 5 hrs
C) 6 hrs
D) 3 hrs
Answer: A) 4 hrsHCF of 36, 48, 72?
A) 12
B) 6
C) 24
D) 18
Answer: A) 1220% of 500 is what % of 250?
A) 40%
B) 50%
C) 60%
D) 80%
Answer: A) 40%Two pipes fill in 12 & 15 min. Together time?
A) 6.67 min
B) 7 min
C) 6 min
D) 8 min
Answer: A) 6.67 minProfit 25% on CP ₹800. SP?
A) ₹1000
B) ₹900
C) ₹1100
D) ₹1200
Answer: A) ₹1000Series: 3, 8, 15, 24, 35, ?
A) 48
B) 50
C) 46
D) 52
Answer: A) 48Boat downstream 18 km/h, upstream 12 km/h. Still water speed?
A) 15 km/h
B) 14 km/h
C) 16 km/h
D) 13 km/h
Answer: A) 15 km/h
LCM of 8, 12, 18?
A) 72
B) 36
C) 144
D) 24
Answer: A) 72A:B = 5:7, B:C = 7:9. A:B:C?
A) 5:7:9
B) 35:49:63
C) 5:9:7
D) 49:35:63
Answer: A) 5:7:9Train 120 m crosses platform 180 m in 15 sec. Speed?
A) 72 km/h
B) 54 km/h
C) 90 km/h
D) 60 km/h
Answer: A) 72 km/h15% increase on ₹400. New value?
A) ₹460
B) ₹450
C) ₹440
D) ₹470
Answer: A) ₹460Average of 5 numbers 42. One number 38. Average of remaining?
A) 43
B) 42.5
C) 44
D) 41
Answer: A) 43A & B together 8 days, B alone 12 days. A alone?
A) 24 days
B) 20 days
C) 16 days
D) 18 days
Answer: A) 24 daysSelling price of 10 articles = cost price of 12. Profit %?
A) 20%
B) 25%
C) 15%
D) 12%
Answer: A) 20%25% discount on marked price ₹800. SP?
A) ₹600
B) ₹650
C) ₹700
D) ₹550
Answer: A) ₹600Boys:girls 3:4. 40% boys & 25% girls fail. Passing ratio?
A) 13:14
B) 14:13
C) 12:15
D) 15:12
Answer: A) 13:14Two numbers sum 50, difference 10. Numbers?
A) 30, 20
B) 25, 25
C) 35, 15
D) 40, 10
Answer: A) 30, 20Speed 60 km/h. Time for 240 km?
A) 4 hrs
B) 5 hrs
C) 3 hrs
D) 6 hrs
Answer: A) 4 hrs1/3 of number is 15. Number?
A) 45
B) 50
C) 40
D) 60
Answer: A) 45CI at 10% for 2 years on ₹5000?
A) ₹1050
B) ₹1100
C) ₹1000
D) ₹1200
Answer: A) ₹1050Pipe A fills 6 hrs, B empties 8 hrs. Together time?
A) 24 hrs
B) 48 hrs
C) 12 hrs
D) 36 hrs
Answer: A) 24 hrs15 men 20 days. 10 men how many days?
A) 30 days
B) 25 days
C) 35 days
D) 40 days
Answer: A) 30 daysSeries: 4, 9, 16, 25, 36, ?
A) 49
B) 64
C) 81
D) 100
Answer: A) 4920% loss on CP ₹500. SP?
A) ₹400
B) ₹450
C) ₹600
D) ₹350
Answer: A) ₹400LCM & HCF two numbers 120 & 8. Possible numbers?
A) 8 & 120
B) 16 & 60
C) 24 & 40
D) 32 & 30
Answer: A) 8 & 120Car covers 360 km in 6 hrs. Speed?
A) 60 km/h
B) 50 km/h
C) 70 km/h
D) 80 km/h
Answer: A) 60 km/h2x + 3y = 12, x + y = 5. Value of x?
A) 3
B) 2
C) 4
D) 1
Answer: A) 3
Logical Reasoning (51–80)
A left of B, right of C. D between B & E. Extreme left?
A) C
B) A
C) D
D) E
Answer: A) C"His mother is only daughter of my mother." Relation?
A) Mother
B) Sister
C) Daughter
D) Grandmother
Answer: A) MotherAll cats animals. Some animals dogs. Some cats dogs?
A) True
B) False
C) Possibly
D) Cannot say
Answer: D) Cannot say"APPLE" → "ZKKOV". "ORANGE"?
A) PSBOHF
B) NRZMFH
C) QSBPHG
D) Variant
Answer: A) PSBOHFWalk 5N, right 3, left 4, right 3. Distance?
A) 5 km
B) 7 km
C) 9 km
D) 12 km
Answer: B) 7 kmSeries: 7, 10, 16, 25, 37, ?
A) 52
B) 50
C) 48
D) 55
Answer: A) 52"She is sister of my father's only son." Relation?
A) Daughter
B) Sister
C) Mother
D) Aunt
Answer: A) DaughterCoding operators swapped: 8 × 4 – 2 + 3 ÷ 1?
A) 10
B) 12
C) 9
D) 11
Answer: A) 10X brother Y. Y daughter Z. Z wife W. W to X?
A) Father
B) Uncle
C) Brother
D) Grandfather
Answer: A) Father6 people row, U not next V, W left X, Z not end. Possible?
A) U in 2
B) V in 3
C) Z in 5
D) Variants
Answer: Puzzle type
Man walks 10 m south, right 15 m, left 20 m. Final direction?
A) North
B) South
C) East
D) West
Answer: B) South (net displacement south)Syllogism: All roses flowers. Some flowers fade quickly. Some roses fade quickly?
A) True
B) False
C) Possibly
D) Cannot say
Answer: D) Cannot sayCoding: "MANGO" → "NBOHP". "APPLE"?
A) BQQMF
B) ZKKOV
C) CQQLF
D) BQQME
Answer: A) BQQMF (+1 shift)Data sufficiency: Is x > y? (I) x-y=5 (II) y=10
A) I alone sufficient
B) II alone sufficient
C) Both needed
D) Neither
Answer: A) I alone sufficientDirections: From A, 10 m south, right 15 m, left 20 m, right 15 m. Final position?
A) 10 m south, 30 m east
B) 10 m south, 15 m east
C) 20 m south
D) 10 m north
Answer: B) 10 m south, 15 m east (variant)Series: 1, 4, 9, 16, 25, ?
A) 36
B) 49
C) 64
D) 81
Answer: A) 36Blood relation: Pointing to girl, man said "She is mother of my son's wife". Relation?
A) Mother-in-law
B) Sister
C) Daughter
D) Wife
Answer: A) Mother-in-lawPuzzle: 5 friends A B C D E seating. A opposite C, B next D. Possible?
A) Circular arrangement
B) Linear
C) Both
D) Variants
Answer: Puzzle typeInput-output: Machine input "23 45 12 67 89". Step 1 "89 23 45 12 67". Pattern?
A) Largest first
B) Smallest first
C) Alternate
D) Sum based
Answer: A) Largest first (common pattern)Inequalities: A > B ≥ C = D < E. Which true?
A) A > D
B) B = E
C) C < E
D) Variants
Answer: A) A > DClock: Angle between hands at 3:30?
A) 75°
B) 90°
C) 60°
D) 105°
Answer: B) 90° (variant)Calendar: What day was 15 Aug 1947?
A) Friday
B) Saturday
C) Thursday
D) Sunday
Answer: A) Friday (historical)Data sufficiency: Is triangle possible? (I) sides 3,4,5 (II) angles 60,60,60
A) I alone
B) II alone
C) Both
D) Neither
Answer: A) I aloneCoding: "BOOK" = "CPPL". "PAGE"?
A) QBHG
B) QBHF
C) QAHF
D) PBHG
Answer: A) QBHG (+1 shift)Seating: 8 people circular. A opposite D, B next C. Questions on positions.
A) A left of B
B) D opposite B
C) Variants
D) Puzzle type
Answer: Puzzle typeSyllogism: Some pens blue. All blue good. Conclusion?
A) Some pens good
B) All good blue
C) Some good pens
D) Variants
Answer: A) Some pens goodDirection: A walks 20 m east, turns left 30 m, turns right 40 m. Distance from start?
A) 50 m
B) 70 m
C) √(20² + 30²)
D) 60 m
Answer: A) 50 m (net)Blood relation: A is B's sister. B is C's brother. C is D's mother. A to D?
A) Aunt
B) Mother
C) Sister
D) Grandmother
Answer: A) AuntSeries: 5, 10, 20, 40, 80, ?
A) 160
B) 120
C) 100
D) 200
Answer: A) 160 (×2)Puzzle: Box stacking or floor based with conditions (common in Deloitte).
A) Person A on 3rd floor
B) Variants
C) Puzzle type
D) Multiple questions
Answer: Puzzle type
English Verbal (81–100)
The project was _ successfully within the given time frame.
A) completed
B) ended
C) finished
D) close
Answer: A) completedSynonym of "MUTABLE"?
A) Changeable
B) Stable
C) Fixed
D) Permanent
Answer: A) ChangeableError spotting: He go to school everyday.
A) go → goes
B) everyday → every day
C) No error
Answer: A) goesShe is afraid _ dogs.
A) of
B) from
C) with
D) to
Answer: A) ofAntonym of "RECKLESS"?
A) Careful
B) Bold
C) Fast
D) Dangerous
Answer: A) CarefulSynonym of "RECKLESS"?
A) Careful
B) Bold
C) Cautious
D) Prudent
Answer: B) BoldFill blank: He is good _ mathematics.
A) at
B) in
C) on
D) with
Answer: A) atError: The childrens are playing in the park.
A) childrens → children
B) are → is
C) No error
D) Variants
Answer: A) childrens → childrenSentence improvement: He is knowing the answer.
A) knows
B) knew
C) is known
D) No improvement
Answer: A) knowsPara jumble: P: silent in lake city. Q: ugly turn around noon. R: mobs arrived. S: protesters.
A) P Q R S
B) Q P R S
C) P R S Q
D) Variants
Answer: A) P Q R S (common order)
One word substitution: Fear of water.
A) Hydrophobia
B) Claustrophobia
C) Agoraphobia
D) Acrophobia
Answer: A) HydrophobiaIdiom: "Break a leg" means?
A) Good luck
B) Bad luck
C) Injury
D) Run fast
Answer: A) Good luckSynonym "EPHEMERAL"?
A) Short-lived
B) Permanent
C) Eternal
D) Long
Answer: A) Short-livedAntonym "GENEROUS"?
A) Stingy
B) Kind
C) Charitable
D) Liberal
Answer: A) StingyFill blank: The book is _ the table.
A) on
B) in
C) at
D) over
Answer: A) onError: Neither the teacher nor the students is present.
A) is → are
B) No error
C) students → student
D) Variants
Answer: B) No error (rule of proximity)Sentence correction: Running fastly, he won the race.
A) Running fast
B) Fast running
C) He ran fastly
D) No correction
Answer: A) Running fastComprehension assumption: "Two-wheeler drivers reckless on low-traffic roads". Assumption?
A) Higher speeds on low-traffic roads
B) All drivers reckless
C) No traffic police
D) Variants
Answer: A) Higher speeds on low-traffic roadsOne word: Study of birds.
A) Ornithology
B) Entomology
C) Zoology
D) Botany
Answer: A) OrnithologyIdiom: "Piece of cake" means?
A) Easy task
B) Sweet dish
C) Difficult
D) Expensive
Answer: A) Easy task
Technical MCQs (101–120)
Mutable data type in Python?
A) Tuple
B) List
C) String
D) Integer
Answer: B) ListDeadlock in OS?
A) Processes wait forever for resources
B) High CPU usage
C) Memory overflow
D) File corruption
Answer: A)Inheritance in OOP provides?
A) Code reusability
B) Data hiding
C) Polymorphism only
D) Dynamic binding
Answer: A) Code reusabilityNormalization in DBMS reduces?
A) Redundancy
B) Data size increase
C) Query speed only
D) Encryption
Answer: A)IaaS full form?
A) Infrastructure as a Service
B) Information as a Service
C) Internet as a Service
D) Integration as a Service
Answer: A)Bubble Sort worst-case complexity?
A) O(n²)
B) O(n log n)
C) O(n)
D) O(1)
Answer: A) O(n²)Encapsulation in C++ achieved by?
A) Access specifiers (private/public)
B) Inheritance
C) Polymorphism
D) Templates
Answer: A)Document-based database?
A) MySQL
B) MongoDB
C) Oracle
D) SQL Server
Answer: B) MongoDBTCP vs UDP difference?
A) TCP connection-oriented, UDP connectionless
B) Both connectionless
C) UDP reliable
D) TCP faster
Answer: A) TCP connection-oriented, UDP connectionlessOSI model layer 3?
A) Network
B) Transport
C) Data Link
D) Physical
Answer: A) NetworkPrimary key in DBMS?
A) Unique identifier
B) Duplicate allowed
C) Null allowed
D) Variants
Answer: A) Unique identifierPaging vs Segmentation?
A) Paging fixed size, Segmentation variable
B) Both fixed
C) Segmentation fixed
D) Variants
Answer: A) Paging fixed size, Segmentation variableDeadlock prevention method?
A) Banker's algorithm
B) High CPU
C) Memory leak
D) Variants
Answer: A) Banker's algorithmSaaS example?
A) Google Docs
B) AWS EC2
C) Azure VM
D) Variants
Answer: A) Google DocsPointer in C used for?
A) Memory address
B) Value storage
C) Array only
D) Variants
Answer: A) Memory addressStack follows?
A) LIFO
B) FIFO
C) Random
D) Variants
Answer: A) LIFOQueue follows?
A) FIFO
B) LIFO
C) Random
D) Variants
Answer: A) FIFOOOP pillar "Polymorphism" means?
A) Many forms
B) Single form
C) Data hiding
D) Reusability
Answer: A) Many formsSQL JOIN type for matching records?
A) INNER JOIN
B) LEFT JOIN
C) RIGHT JOIN
D) FULL JOIN
Answer: A) INNER JOINCPU scheduling algorithm FCFS?
A) First Come First Serve
B) Shortest Job First
C) Round Robin
D) Priority
Answer: A) First Come First Serve