Software Engineering Online Test

What does the following pseudo code print?

Here are three pseudocodes for calculating the Nth Fibonacci number. Which of the following statements about these codes are true?

A: Time complexity/efficiency of CODE 1, CODE 2, CODE 3 is the same.
B: CODE 2 is more space-efficient than CODE 3.
C: CODE 3 is more space-efficient than CODE 2.
D: CODE 2 is more time-efficient than CODE 1.
E: CODE 3 is more time-efficient than CODE 1.

Go through the following faulty palindrome detection pseudocode and test cases. For which of the test cases would the code return true?

Testcases
A: a
B: aba
C: aaa
D: aac

A new popular app tracks the activities performed by its users and grants them rewards based on each individual's total activities performed in a year. This data is maintained in a database table (activitesinfo), with the following columns: userid, totalactivities, reward. This year, due to fundraising activity, the company has decided to further reward its users by enhancing the reward as per the following formula: If reward < = 4000, increase it by 2%, If 4000 < reward <= 8000, increase it by 4%, If reward > 8000, increase it by 6%.
The tech team has written three different scripts to calculate increment for each slab, each script is to run as a separate transaction. Here are the three scripts:

Script 1:
For users with reward <= 4000, set reward = reward * 1.02

Script 2:
For users with reward > 4000 and reward <= 8000, set reward = reward * 1.04

Script 3:
For users with reward > 8000, set reward = reward * 1.06

Each script is to be executed separately. Which of the following options will update the rewards as expected:

A: Execute Script 1 followed by Script 2 followed by Script 3
B: Execute Script 2 followed by Script 3; Script 1 running concurrently throughout
C: Execute Script 3 followed by Script 2; Script 1 running concurrently throughout
D: Execute Script 3 followed by Script 2 followed by Script 1
E: Execute Script 2 followed by Script 3 followed by Script 1

Consider the following pseudo code implementing a specific graph traversal algorithm:

What is the order in which the nodes are processed, and which data structure best represents the graph `G` for efficient traversal?

You are tasked with implementing the "Back" button functionality in a web browser. This feature allows users to return to previously visited web pages in the order they were viewed. The browser maintains a history of URLs in a data structure. Considering the nature of web browsing, where users can go back multiple steps and then navigate to a new page (at which point the future history should be cleared), which data structure and algorithm would best implement this functionality?

A: Use a heap, add the current URL when navigating to a new page, and remove the top element when the back button is used.
B: Use a queue, enqueue the current URL when navigating to a new page, and dequeue when the back button is used.
C: Use a single stack, push the current URL when navigating to a new page, and pop when the back button is used.
D: Use an array, add the current URL to the end when navigating to a new page, and remove the last URL when the back button is used.
E: Use a linked list, add the current URL to the head when navigating to a new page, and move backwards when the back button is used.
F: Use two stacks, push the current URL to the first stack when navigating to a new page, and use the second stack to store the pages when the back button is used.

Consider a singly linked list where each node contains an integer value. Write a function `removeElement` that removes all occurrences of a specific value from the linked list. The function should return the head of the modified linked list.

Pseudo code:

What will be the content of the linked list referred to by `result` after executing the above pseudo code?

We want to register students for the next semester. All students have a receipt which shows the amount pending for the previous semester. A positive amount (or zero) represents that the student has paid extra fees, and a negative amount represents that they have pending fees to be paid. The students are in a queue for the registration. We want to arrange the students in a way such that the students who have a positive amount on the receipt get registered first as compared to the students who have a negative amount. We are given a queue in the form of an array containing the pending amount.

For example, if the initial queue is [20, 70, -40, 30, -10], then the final queue will be [20, 70, 30, -40, -10]. Note that the sequence of students should not be changed while arranging them unless required to meet the condition.

⚠️⚠️⚠️ Note:
- The first line of the input is the length of the array. The second line contains all the elements of the array.
- The input is already parsed into an array of "strings" and passed to a function. You will need to convert string to integer/number type inside the function.
- You need to "print" the final result (not return it) to pass the test cases.

For the example discussed above, the input will be:
5
20 70 -40 30 -10

Your code needs to print the following to the standard output:
20 70 30 -40 -10

A manager hires a staff member to keep a record of the number of men, women, and children visiting the museum daily. The staff will note W if any women visit, M for men, and C for children. You need to write code that takes the string that represents the visits and prints the count of men, woman and children. The sequencing should be in decreasing order. 

Example:

Input:
WWMMWWCCC

Expected Output: 
4W3C2M

Explanation: 
‘W’ has the highest count, then ‘C’, then ‘M’. 

⚠️⚠️⚠️ Note:
- The input is already parsed and passed to a function.
- You need to "print" the final result (not return it) to pass the test cases.
- If the input is- “MMW”, then the expected output is "2M1W" since there is no ‘C’.
- If any of them have the same count, the output should follow this order - M, W, C.