Differentiate between a Test Plan and a Use Case.                                                                  

Provide the optimal Solution to the problems below using java code and include Time Complexity Analysis!

1. Peaks and Valleys

In an Array of integers, a “peak” is an element which is greater than or equal to the adjacent integers and a “valley” is an element which is less than or equal to the adjacent integers. For example, the array {5, 8, 6, 2, 3, 4, 6}, {8, 6} are peaks and {5, 2} are valleys. Give an array of integers, sort the array into an alternating sequence of peaks and valleys.

EXAMPLE

INPUT:

                                {5, 3, 1, 2, 3}

                OUTPUT:

{5, 1, 3, 2, 3}

2. Build Order

You are given a list of projects and a list of dependencies (Which is a list of pairs of projects, where the second project is dependent on the first project). All of a project’s dependencies must be built before the project is. Find a build order that will allow the projects to be built. If there is no valid build order, return an error.

EXAMPLE

                INPUT:

                                Projects: a, b, c, d, e, f

                                Dependencies: (a, d), (f ,b), (b, d), (f, a), (d, c)

                OUTPUT:

f, e, a, b, d, c

(I need java code with explanation of algorithms and time complexity)

Assume that you are given a task to design a system for a vehicular network (or any cloud computing system). Briefly discuss security requirements for such a system. Outline a security architecture that could achieve the specified security goals in the scenario. You must include in your discussion of the security limitations of your approach. Note that this is intended to be an open-ended problem and your alternative security architecture may or may not exist as a specific product or system, so you are expected to think creatively about this solution. It is likely that you will need to undertake some research to assist in answering this part of the problem.

3) Consider the following IA32 assembly language code fragment. Assume that a, b and c are integer variables declared in the data segment.

                        movl    a, %eax
                        movl    b, %ebx
                        cmpl    %ebx, %eax
                        jge     L1
                        movl    %eax, %ecx
                        jmp     L2 
                L1:     movl    %ebx, %ecx
                L2:     movl    %ecx, c 

Write the C code which is equivalent to the above assembly language code. You don't need to include the variable declarations, a function or anything like that, just show the 1 to 4 lines of code in C that express what the above assembly code is doing:

An independent testing team is beneficial for test quality and comprehensiveness. Why?

C++ On linux

Write a C++ program using the IPC. Declare two variables a=5 and b=6 in writer process. Now their product (a*b) will be communicated to the reader process along with your name. The reader process will now calculate the square root of the number and display it along with your name.

2) Draw a line between each of the IA32 assembler routines on the left and its equivalent C function on the right. (If there is no matching C function, do not draw a line.):

        pushl   %ebp
        movl    %esp, %ebp
        movl    8(%ebp), %edx
        movl    12(%ebp), %eax
        cmpl    %edx, %eax
        jle     .L1
        movl    %edx, %eax
.L1:
        leave
        ret

        pushl   %ebp
        movl    %esp, %ebp
        movl    8(%ebp), %edx
        movl    (%edx), %edx
        movl    12(%ebp), %eax
        movl    (%eax), %eax
        cmpl    %edx, %eax
        jle     .L1
        movl    %edx, %eax
.L1:
        leave
        ret

        pushl   %ebp
        movl    %esp, %ebp
        movl    8(%ebp), %eax
        movl    12(%ebp), %edx
        cmpl    %edx, %eax
        jge     .L1
        subl    %edx, %eax
.L1:
        leave
        ret

        pushl   %ebp
        movl    %esp, %ebp
        movl    8(%ebp), %edx
        movl    12(%ebp), %eax
        cmpl    %edx, %eax
        jge     .L1
        movl    %edx, %eax
.L1:
        leave
        ret

int fun1(int a, int b)
{
   if (a < b)
      return a-b;
   else
      return a;
}

int fun2(int a, int b)
{
   if (a > b)
      return a;
   else
      return b;
}

int fun3(int *a, int *b)
{
   if (*a < *b)
      return *a;
   else
      return *b;
}

int fun4(int a, int b)
{
   if (a < b)
      return a;
   else
      return b;
}

(b) Consider the following IA32 assembly language code fragment:

       .data
       .align 4
A:     .long 10, 20, 30, 40, 50
       .text
main: <code>

Determine the decimal value stored in register %eax if <code> in the above code fragment is replaced by each of the following:

i) movl $A, %ebx
   movl 4(%ebx), %eax

ii) movl $2, %ecx
   movl A(,%ecx, 4), %eax

iii)  movl $24, %eax
   sarl $2, %eax

iv) movl $4, %ecx
   leal 4(%ecx,%ecx,4), %eax

OBJECT ORIENTED PROGRAMMING

Design two grid based games or two block based games in c++

In some cases, the bulk of the project lies in producing a nice user interface, probably using the FLTK graphical library, while the algorithmic content is quite simple. In other cases, the bulk of the work is in devising and implementing the algorithms. Some projects are more difficult than others, but a good policy is to choose one which allows extensibility if you have more time, or a suitable half-way stopping point if it proves to be difficult.

1. Grid based games, ranging from the simple such as Noughts and Crosses through more complex games such as Minesweeper and Battleships. See Levy Computer Gamesmanship pp. 30-39
2. Block based games, such as Snake or Tetris.
3. You can design hangman, pong , tic tac toe

Tool: Dev++, Visual Studio or any of your choice.

Assume a project to install 200 Desktop with an approved budget of SR800 each and 200 Laptop with an approved budget of SR 1200 each, in the period of 12 months. The total project budget is SR 400000. After six months, it is found that 80 Desktop & 80 Laptops have been installed, at a cost of SR176000. According to the plan, 100 Desktop & 100 Laptops should have installed in a period of six months. According to this progress how much extra cost and time need to complete the project.

1. BCWS :

2. BCWP :

3. ACWP :

4. Time :

5. Cost :

write a method in java for a binary search tree that receives a node as input and returns the successor node.

In JAVA

A. A Java applet is a stand-alone program that does not require a web browser. True or False

B.Which of the following are valid identifiers in java? (will the identifier compile?)

1.   Object#Count
2.   $money
3.   Late_Fee
4.   __$__

C.What is the decimal (base 10) equivalent of 162 in octal?

D.Which of these identifiers obey the naming convention for object names?

1. Isthisokay
2. goodName
3. C3PO
4. ThisIsReallyOkay
5. areallygreatname
6. anotherBadOne

note (Please solve the questions in the language of operating systems)

[1] Briefly, what is the difference between:

1- Buffering & Spooling.

2- Synchronous & Asynchronous I/O.

3- CPU-bound & I/O-bound jobs.

4- Multiprogramming & Timesharing.

5- Logical & Physical addresses.

6- User & Monitor modes in Operating System.

[2] (i) Define Timesharing.

    (ii) In a one processor system, there is an interrupt clock which is set to a “time slice Q”, that is, every Q an interrupt occurs to stop the process. There is only one I/O device in the system    which is interrupted when the process needs an I/O. There are 3 processes A, B, C.

     Process A executes an I/O interrupt every T units of time.

     Process B executes an I/O interrupt every 2T units of time.

     Process C executes an I/O interrupt every 3T units of time.

(a) Which of the above processes will benefit the most and which is not when Q = T.

      Explain your answer

(b) Which of the above processes will benefit the most and which is not when Q = 2T.

      Explain your answer

(a) Which of the above processes will benefit the most and which is not when Q = 3T.

      Explain your answer

What is the best value should Q takes for good performance ? explain your answer in full.

[3] (a) Define DMA (Direct Memory Access).

      (b) An input device can transmit 100 characters every 4 mils 10 , if the CPU needs 2 mics to service the

            Interrupt. How much time is left for asynchronous I/O. What if it can transmit 1000 characters

            every 4 mils and the CPU also needs 2 mics for the service routine.

            What do you think? Explain your answer in details.

[4] (a) What is the interrupt types? Give examples.

       (b) What type of interrupt the following pieces of code in C might generate. Explain your answer.

(i)

int n = 0;

while (n = 0)

  printf(“Hello”);

            (ii)

            int n = 1 , m = 0, x = 10;

            while (n/!x<0.001)

                 { m +=x;

                   n++;

                 }

       [5] Draw clearly explaining briefly what is happening the following:

1. Interrupt Vector
2. Instruction Cycle with instruction cash register.
3. System Queues and Scheduling.

Describe the step-by-step protocol that PGP/GPG takes to simultaneously sign a message with the sender’s private key and encrypt it with the receiver’s public key.

#include <stdio.h>

void printDistinct(int arr[], int c)
{
int i, j;
printf("\nArray:\n");
// Picking all elements one by one
for (i = 0; i < c; i++)
{
// Checking if the picked element is already printed
for (j = 0; j <= i; j++)
{
// If current element is already there in the array, break from j loop
if (arr[i] == arr[j])
{
break;
}
}
// If it is not printed earlier and is within 10-100, then we print it
if (i == j && arr[i] > 10 && arr[i] < 100)
printf("%d ", arr[i]);
}

}

int main()
{
// to test above function
int arr[20], i;
printf("Enter 20 numbers between 10-100\n");
for (i = 0; i < 20; i++)
{
scanf("%d", &arr[i]);
}
int c = sizeof(arr) / sizeof(arr[0]);
printDistinct(arr, c);

int a[20], j, k, t, n = 20;
  
//-------------------------------------------------------------------------------------
for (i = 0; i < n; i++) //Sort array in ascending order
{
for (j = i + 1; j < n; j++)
{
if (a[j] < a[i]) //Check jth element smaller than ith element
{
t = a[i]; //if yes,assign the ith value to a temporary variable
a[i] = a[j]; //Assign the value of jth element to i.
a[j] = t; //Then assign value of temporary variable to j.
}
}
}
printf("\nSorted array is: "); //Finally print sorted array
for (i = 0; i < n; i++)
{
printf("%d ", a[i]);
}
return 0;
}

and the output for sorted is this

-858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460 -858993460

what i need to do to make sure that the numbers are sorted properly.