OOAD (Object Oriented Analysis Design) Test

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?

You are given the following state machine diagram. 

What is the value of x after the occurrence of the event chain e4 e5 e1 e4?

Consider the scenario: A fair is visited by atleast one visitor. A visitor visits atleast one one fair. 

How do you model the scenario with a class diagram?

How would you model the following situation with a use case UML diagram?

A doctor does a patient consultation together with the nurse. The nurse always has to write the notes during the consultation.

Review the following activity diagram:

Which of the following action sequences are possible during one execution of the activity diagram?

A: 1 → 2 → 4
B: 1 → 3 → 2 → 4
C: 1 → 2 → 4 → 3
D: 1 → 2 → 3 → 4

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