GradePack

    • Home
    • Blog
Skip to content
bg
bg
bg
bg

GradePack

When crafting an online ad strategy, how could the selection…

When crafting an online ad strategy, how could the selection of keywords contribute to a problem known as ad safety if not done properly?

Read Details

If you have a luxury ecommerce or mobile app and you want pe…

If you have a luxury ecommerce or mobile app and you want people to think that the products that you are offering are exclusive, what is an strategy that you could use to nudge mobile users’ perceptions and subsequent behaviors?

Read Details

Potpourri_3 TS-Linux   3. [2 points] (True/False with justif…

Potpourri_3 TS-Linux   3. [2 points] (True/False with justification) Consider a TS-Linux system where the throughput-oriented background tasks are guaranteed a 1/4th proportion of a CPU time period T. There is a time-sensitive task that is guaranteed a 1/3rd proportion of a CPU time period T. A user tries to add another time-sensitive task to the system that requests a ½ proportion of a CPU time period T. Since TS-L is designed to decrease the latency of time-sensitive tasks, the proportion scheduled to the background tasks is decreased to 1/6th of the CPU time period T.

Read Details

Failures_and_Recovery_1c LRVM   The context for this questio…

Failures_and_Recovery_1c LRVM   The context for this question is the same as the previous question. 1. A service that uses the LRVM library is in the middle of an LRVM transaction. There is a power failure before the transaction completes.   (c) [2 points] (True/False with justification) After the crash recovery, the service will start execution exactly from the beginning of the failed transaction.

Read Details

Security_3 AFS   3. [3 points] Georgia Tech has decided to i…

Security_3 AFS   3. [3 points] Georgia Tech has decided to implement AFS in its original form as a thought experiment. You are a part of a Red Team exercise called on to evaluate the safety of Andrew File System. Highlight 3 different ways in which you could mount a denial of service attack against AFS. (You are free to assume that you have legitimate user access to the system for the scope of the question.)

Read Details

Security_2 AFS   2. [3 points] Consider the bind process in…

Security_2 AFS   2. [3 points] Consider the bind process in AFS listed below. Explain how ClientIdent is generated and further explain its significance.

Read Details

Potpourri_1 Giant-Scale Services   1. [2 points] (True/False…

Potpourri_1 Giant-Scale Services   1. [2 points] (True/False with justification) Admission control in Giant-scale services is a way of maintaining yield while reducing harvest. 

Read Details

Failures_and_Recovery_1b LRVM   The context for this questio…

Failures_and_Recovery_1b LRVM   The context for this question is the same as the previous question. 1. A service that uses the LRVM library is in the middle of an LRVM transaction. There is a power failure before the transaction completes.   (b) [2 points] Upon crash recovery what will be the state of the data segment that was being modified within the transaction at the time of the power failure?

Read Details

Real_time_and_Multimedia_1b TS-Linux   The context for this…

Real_time_and_Multimedia_1b TS-Linux   The context for this question is the same as the previous question. 1. Assume that you are playing a game (G) on a version of TS-Linux in which the scheduler strictly follows the born priority of all the processes in making its scheduling decisions. The game uses ONE-SHOT timer with an overshoot parameter of To. The timer event goes off at time 0. Assume the following: When the timer goes off, the kernel has just started a critical section of duration Tk. For taking the necessary gaming action for the timer event, the video game application (G) has a processing time of Tg and priority P1. In addition to Tg, the application will need to make a blocking call to a Window Manager process (W) has a processing time of Tw and priority P3. When the timer goes off, the scheduling queue is empty. The priorities are ordered as P1 > P2 > P3 > P4 > …. With P1 being the highest priority. There are no periodic timers in the system. Duration of the scheduling time and interrupt handing time are negligible. Note that the given image is simply for your reference, and that the time Th has nothing to do with the solution. Only use the variables given in the text in your solutions.   (b) [2 points] In the middle of W’s execution, another application process (S) whose duration is Ts and priority P2 becomes runnable. Does this change your calculation in the previous part of the question?

Read Details

Potpourri_5 PTS   5. [2 Points] Imagine multiple producers p…

Potpourri_5 PTS   5. [2 Points] Imagine multiple producers putting items into the same channel in PTS.  Do the threads need to use mechanisms like pthread’s mutex lock to avoid stepping on one another?  Why or why not?

Read Details

Posts pagination

Newer posts 1 … 43,472 43,473 43,474 43,475 43,476 … 82,752 Older posts

GradePack

  • Privacy Policy
  • Terms of Service
Top