The problem requires character-wise transformation of a string where each alphabet is shifted by one position in the alphabet. This is commonly known as a Caesar cipher with shift 1.

Logic:

Each character is checked individually. If it is 'z', it wraps to 'a'. If it is 'Z', it wraps to 'A'. Otherwise, ASCII value is incremented by 1.

Pseudocode:

FUNCTION shiftString(S)
 RESULT = "
 FOR EACH character c IN S
 IF c == 'z' THEN
 RESULT = RESULT + 'a'
 ELSE IF c == 'Z' THEN
 RESULT = RESULT + 'A'
 ELSE
 RESULT = RESULT + (c + 1)
 END IF
 END FOR
 RETURN RESULT
END FUNCTION

Conclusion: This algorithm runs in O(n) time complexity where n is the length of the string.

We are given two relations: Student(sid, name, dept) and Course(sid, cid, cname, marks). The common attribute sid is used to join both tables.

1. Students with marks greater than 80:

This query retrieves high-performing students by applying a selection condition on marks.

SELECT S.name, S.dept, C.cname, C.marks
FROM Student S
JOIN Course C ON S.sid = C.sid
WHERE C.marks > 80;

2. Department-wise and subject-wise students (marks ≥ 30):

This query filters moderately passed students and organizes output by department and course.

SELECT S.dept, C.cname, S.name, C.marks
FROM Student S
JOIN Course C ON S.sid = C.sid
WHERE C.marks >= 30;

Conclusion: JOIN operation is essential to combine student identity with course performance data.

The system faces scalability limitations due to increased concurrent users. Since full cloud migration is restricted, an alternative architecture must be proposed.

Proposed Solution: Hybrid scalability model using optimized on-prem infrastructure.

Components:

• Load balancing across multiple servers
• Horizontal scaling using additional on-prem servers
• Microservices architecture for modular scaling
• CDN for static content delivery
• Database replication and caching layers

Reason: This ensures scalability, cost efficiency, and compliance with data sovereignty policies.

Conclusion: Hybrid architecture provides near-cloud scalability without violating organizational constraints.

The given network is 192.198.10.0/22, which provides 1024 IP addresses (from 192.198.8.0 to 192.198.11.255). VLSM is used to allocate different subnet sizes based on host requirements.

Step 1: Sort requirements (descending)

250, 250, 125, 120, 60 hosts

Step 2: Required subnet sizes

• 250 hosts → /24 (256 addresses)
• 250 hosts → /24
• 125 hosts → /25 (128 addresses)
• 120 hosts → /25
• 60 hosts → /26 (64 addresses)

Step 3: Subnet allocation

Finance: 192.198.8.0/24
Mask: 255.255.255.0
Valid hosts: 192.198.8.1 – 192.198.8.254

Loan: 192.198.9.0/24
Mask: 255.255.255.0
Valid hosts: 192.198.9.1 – 192.198.9.254

Admin: 192.198.10.0/25
Mask: 255.255.255.128
Valid hosts: 192.198.10.1 – 192.198.10.126

IT: 192.198.10.128/25
Mask: 255.255.255.128
Valid hosts: 192.198.10.129 – 192.198.10.254

HR: 192.198.11.0/26
Mask: 255.255.255.192
Valid hosts: 192.198.11.1 – 192.198.11.62

Conclusion: VLSM minimizes wastage by allocating IPs according to requirement.

Determine whether the logical statement:

(P → Q) → (P' → Q')

Apply implication rules

P → Q ≡ ¬P ∨ Q
P' = ¬P
Q' = ¬Q

Therefore,
P' → Q' = ¬P → ¬Q

Construct the Truth Table

Conclusion

Final column values: T, T, F, T

Since the statement is true in some cases and false in one case, it is neither a tautology nor a contradiction.

Therefore, the logical statement (P → Q) → (P' → Q') is a Contingency.

In discrete mathematics, a contingency is a compound proposition whose truth value is neither always true (a tautology) nor always false (a contradiction). Its final outcome depends entirely on the specific truth values of its individual variables, meaning its truth table contains at least one True (T) and at least one False (F).

When CPU and RAM utilization are low but system latency is high, the bottleneck is not compute or memory, but input/output performance.

Step 1: Identify bottleneck

• Low CPU usage → not compute-bound
• Low memory usage → not memory-bound
• High latency → likely I/O-bound system

Step 2: Root cause

Slow disk storage (HDD), high I/O wait time, and limited throughput are common causes.

Solution:

Upgrade storage subsystem to SSD or NVMe and optimize I/O scheduling.

Conclusion: I/O subsystem is the critical bottleneck, not CPU or RAM.

A zero-day vulnerability refers to an exploit that is unknown to vendors and has no available patch at the time of attack. During patch deployment, systems often experience temporary exposure.

Scenario Impact:

• Attackers exploit unpatched vulnerabilities
• Security controls may be partially disabled during updates
• Financial systems become high-value targets

Possible Consequences:

• Unauthorized transactions and fraud
• Leakage of sensitive financial data
• System downtime and integrity loss
• Regulatory penalties and trust damage

Conclusion: A simultaneous zero-day attack can lead to critical financial breach and operational collapse.

This is a conditional probability problem using the law of total probability and Bayes' theorem.

Given:
P(X)=0.6, P(Y)=0.4
P(L|X)=0.02, P(L|Y)=0.04

Step 1: Total probability of latency

P(L) = P(X)P(L|X) + P(Y)P(L|Y)
= 0.6×0.02 + 0.4×0.04
= 0.012 + 0.016 = 0.028

Step 2: Conditional probability

P(X|L) = (P(X)P(L|X)) / P(L)
= 0.012 / 0.028 = 3/7 ≈ 0.4286

Conclusion: Overall latency probability is 2.8%, and delayed request is more likely from Server Y.