DI DS LR Test 15

Operation: Remove non-letters. Input: "R@1se-IT_2025". Output? Operation: Remove non-letters. Input: "R@1se-IT_2025". Output?

2 Mark(s)

RseIT RseIT
RiseIT RiseIT
RseIT2025 RseIT2025
RseIT_ RseIT_

Operation: Convert to prefix sums. Input: [2,1,3,2]. Output? Operation: Convert to prefix sums. Input: [2,1,3,2]. Output?

2 Mark(s)

[2,3,6,8] [2,3,6,8]
[2,3,4,6] [2,3,4,6]
[2,1,3,2] [2,1,3,2]
[1,3,6,8] [1,3,6,8]

Operation: Replace each number by its double. Input: [3,0,-2,5]. Output? Operation: Replace each number by its double. Input: [3,0,-2,5]. Output?

2 Mark(s)

[6,0,-4,10] [6,0,-4,10]
[3,0,2,5] [3,0,2,5]
[9,0,-6,15] [9,0,-6,15]
[6,0,4,10] [6,0,4,10]

Operation: Sort by last digit ascending; ties keep order. Input: [51, 24, 13, 32, 40]. Output? Operation: Sort by last digit ascending; ties keep order. Input: [51, 24, 13, 32, 40]. Output?

2 Mark(s)

[40,51,32,13,24] [40,51,32,13,24]
[40,51,32,24,13] [40,51,32,24,13]
[51,13,24,32,40] [51,13,24,32,40]
[24,32,40,51,13] [24,32,40,51,13]

Rule: double each letter (AA, BB…). “BAT” → ? Rule: double each letter (AA, BB…). “BAT” → ?

2 Mark(s)

BBAATT BBAATT
BBA T T BBA T T
BAATT BAATT
BBAAT BBAAT

Operation: Sort words by increasing length; ties keep original order. Input: {"on","house","a","blue"}. Output? Operation: Sort words by increasing length; ties keep original order. Input: {"on","house","a","blue"}. Output?

2 Mark(s)

{a,on,blue,house} {a,on,blue,house}
{on,a,blue,house} {on,a,blue,house}
{a,blue,on,house} {a,blue,on,house}
{blue,house,a,on} {blue,house,a,on}

Operation: Merge two lists alternately starting with A. A=[1,3,5], B=[2,4,6,8]. Output? Operation: Merge two lists alternately starting with A. A=[1,3,5], B=[2,4,6,8]. Output?

2 Mark(s)

[1,2,3,4,5,6,8] [1,2,3,4,5,6,8]
[1,2,3,4,5,6] [1,2,3,4,5,6]
[2,1,4,3,6,5,8] [2,1,4,3,6,5,8]
[1,3,5,2,4,6,8] [1,3,5,2,4,6,8]

Operation: Remove vowels (a,e,i,o,u). Input: "education". Output? Operation: Remove vowels (a,e,i,o,u). Input: "education". Output?

2 Mark(s)

dctn dctn
edctn edctn
ducatn ducatn
eduton eduton

Rule: keep only vowels in order. “MANAGEMENT” → ? Rule: keep only vowels in order. “MANAGEMENT” → ?

2 Mark(s)

AAEE AAEE
AAE E AAE E
AAEEA AAEEA
AAEIE AAEIE

Operation: Sort words alphabetically. Input: {"pear","apple","grape","mango"}. Output? Operation: Sort words alphabetically. Input: {"pear","apple","grape","mango"}. Output?

2 Mark(s)

{apple,grape,mango,pear} {apple,grape,mango,pear}
{pear,apple,grape,mango} {pear,apple,grape,mango}
{grape,apple,mango,pear} {grape,apple,mango,pear}
{mango,grape,apple,pear} {mango,grape,apple,pear}

Rule: remove vowels, keep consonants. “LANGUAGE” → ? Rule: remove vowels, keep consonants. “LANGUAGE” → ?

2 Mark(s)

LNGG LNGG
LNGG G LNGG G
LNGG (no spaces) LNGG (no spaces)
LNGGGE LNGGGE

Operation: For each number, if odd square it, if even halve it. Input: [8,3,6,5]. Output? Operation: For each number, if odd square it, if even halve it. Input: [8,3,6,5]. Output?

2 Mark(s)

[4,9,3,25] [4,9,3,25]
[16,9,3,25] [16,9,3,25]
[4,9,6,25] [4,9,6,25]
[4,3,9,25] [4,3,9,25]

Operation: Swap case of alphabets. Input: "aBcD1$". Output? Operation: Swap case of alphabets. Input: "aBcD1$". Output?

2 Mark(s)

AbCd1$ AbCd1$
aBCd1$ aBCd1$
ABCD1$ ABCD1$
abcd1$ abcd1$

Operation: Transpose a 2×3 matrix. Input: [[1,2,3],[4,5,6]]. Output? Operation: Transpose a 2×3 matrix. Input: [[1,2,3],[4,5,6]]. Output?

2 Mark(s)

[[1,4],[2,5],[3,6]] [[1,4],[2,5],[3,6]]
[[1,2],[3,4],[5,6]] [[1,2],[3,4],[5,6]]
[[1,2,3,4,5,6]] [[1,2,3,4,5,6]]
[[1,4,2,5,3,6]] [[1,4,2,5,3,6]]

A stack starts empty. Do: PUSH A, PUSH B, PUSH C, POP, PUSH D. What is the stack top? A stack starts empty. Do: PUSH A, PUSH B, PUSH C, POP, PUSH D. What is the stack top?

2 Mark(s)

Operation: Rotate the list right by 2. Input: [1,2,3,4,5,6]. Output? Operation: Rotate the list right by 2. Input: [1,2,3,4,5,6]. Output?

2 Mark(s)

[5,6,1,2,3,4] [5,6,1,2,3,4]
[3,4,5,6,1,2] [3,4,5,6,1,2]
[2,3,4,5,6,1] [2,3,4,5,6,1]
[6,5,1,2,3,4] [6,5,1,2,3,4]

Operation: Replace number by sum of its digits. Input: [305, 49, 1002]. Output? Operation: Replace number by sum of its digits. Input: [305, 49, 1002]. Output?

2 Mark(s)

[8,13,3] [8,13,3]
[8,13,4] [8,13,4]
[7,13,3] [7,13,3]
[8,4,3] [8,4,3]

Operation: Rotate string left by 3. Input: "ALGORITHM". Output? Operation: Rotate string left by 3. Input: "ALGORITHM". Output?

2 Mark(s)

ORITHMALG ORITHMALG
ORITHMALG (with wrap) ORITHMALG (with wrap)
RITHMALGO RITHMALGO
LGORITHMA LGORITHMA

Operation: Reverse the string. Input: "MANAGER". Output? Operation: Reverse the string. Input: "MANAGER". Output?

2 Mark(s)

REGANAM REGANAM
REGANAM REGANAM
MANAGER MANAGER
MANGER MANGER

Operation: Stable-partition so that even numbers come first, odds later (relative order preserved). Input: [7,4,9,2,6,5]. Output? Operation: Stable-partition so that even numbers come first, odds later (relative order preserved). Input: [7,4,9,2,6,5]. Output?

2 Mark(s)

[4,2,6,7,9,5] [4,2,6,7,9,5]
[2,4,6,7,9,5] [2,4,6,7,9,5]
[4,6,2,5,7,9] [4,6,2,5,7,9]
[7,9,5,4,2,6] [7,9,5,4,2,6]

A queue starts empty. Perform ENQ 4, ENQ 7, ENQ 2, DEQ, ENQ 5. What is the queue (front→rear)? A queue starts empty. Perform ENQ 4, ENQ 7, ENQ 2, DEQ, ENQ 5. What is the queue (front→rear)?

2 Mark(s)

[7,2,5] [7,2,5]
[4,7,2] [4,7,2]
[2,5,7] [2,5,7]
[4,7,2,5] [4,7,2,5]

Alternate letters +1, next −1. “PYTHON” → ? Alternate letters +1, next −1. “PYTHON” → ?

2 Mark(s)

QX UIGM QX UIGM
QXSIGN QXSIGN
QXSIPM QXSIPM
QW TIGM QW TIGM

Operation: Remove duplicates, keep first occurrence. Input: [4,2,4,3,2,4,5]. Output? Operation: Remove duplicates, keep first occurrence. Input: [4,2,4,3,2,4,5]. Output?

2 Mark(s)

[4,2,3,5] [4,2,3,5]
[2,3,4,5] [2,3,4,5]
[4,3,2,5] [4,3,2,5]
[5,4,3,2] [5,4,3,2]

Operation: Replace each number by 1 if odd else 0. Input: [7, 12, 3, 4, 5]. Output? Operation: Replace each number by 1 if odd else 0. Input: [7, 12, 3, 4, 5]. Output?

2 Mark(s)

[1,0,1,0,1] [1,0,1,0,1]
[0,1,0,1,0] [0,1,0,1,0]
[1,1,1,0,1] [1,1,1,0,1]
[1,0,1,1,0] [1,0,1,1,0]

DI DS LR Test 15 : Question 1 of 24