Blog

Coursehelp
April 16, 2019
QUESTION : No Comments

(Solved) : Work Ccl Group Forensic Investigator Asked Contact Local Company Suspect Employee Breachin Q26203623 . . .

You work for CCL Group as a forensic investigator and have beenasked to contact a local company who suspect an employee ofbreaching company policies. You visit the company and meet with thesystem administrator and manager who explain that an employeeappears to have used a P2P program to download full length moviesonto their work computer. It is thought that they have alsodownloaded a Trojan virus which has resulted in not only theemployee’s computer system failing to boot, but also caused issueswith the entire network.
The employee has been suspended pending the investigation and youwill be provided with full access to the computer system andnetwork. The system administrator and manager have confirmed thatthe employee’s computer system has been left ‘in situ’ and nottampered with, but that the network issue had to be resolved due tothe business needing to function as normal.
You are required to plan and carry out an investigation of theemployee’s computer system and present your findings as a reportfor the system administrator and manager. You have a timescale oftwo weeks to plan and conduct your investigation, completing allrelevant documentation as well as preparing the final report.

Tasks 1 You are required to produce a documented plan of how youare going to approach your computer forensic investigation, whichwill be approved by your supervisor. The plan must include thefollowing:

A documented plan for the computer forensic investigation of theemployee’s system to include: a An annotated diagram of theevidence lifecycle b An explanation of the admissibility ofevidence providing four examples of good practice c Identificationof the types of evidence that could be gathered for thisinvestigation including a justification of the types of evidence tobe collected d Explanation of the precautions that will be taken topreserve the state of each type of evidence e Identification of thehardware and software tools that will be selected to analyse theevidence with a justification of the tools selected f Explanationof the importance of the chain of custody process g Explanation ofthe evidence handling procedures that will be used. 2 After yoursupervisor approves your plan, you can now carry out your computerforensic investigation of the employee’s computer system. Ensurethat you document the investigation process thoroughly to include:a date and time of action b activity type c personnelcollecting/accessing evidence d computer description information edisk drive descriptive information f handling procedure g completedescription of action: • procedure followed • tools used •step-by-step description of analysis and results h reasons foraction taken i notes j collection of evidence k review of evidencel analysis and interpretation of evidence m documentation ofevidence (printouts, photographs etc) and Chain of Custodyrecord.

Expert Answer


. . .

OR
OR

Have a Comment on this Question?

Questions viewed by other students


  • QUESTION : (Solved) : Code Written Java Declare Class Cobbolock Works Like Combination Lock Gym Locker Shown Lo Q27364931 . . .

    code should be written in java
    Declare a class CobboLock that works like the combination lock in a gym locker, as shown here. The lock is constructed with a combination-three numbers between 0 and 39. The reset method resets the dial so that it points to O. The turnLeft and trunRight methods turn the dial by a given number of ticks to the left or right. The open method attempts to open the lock. The lock opens if the user first turned it right to the first number in the combination, then left to the second, and then right to the third. Write a client program/code to thoroughly test the dlass. Take snapshots of your tests and include those with submission.Declare a class CobboLock that works like the combination lock in agym locker, as shown here.The lock is constructed with acombination – three numbers between 0 and 39. The reset methodresets the dial so that it points to 0. The turnLeft and trunRightmethods turn the dial by a given number of ticks to the left orright. The open method attempts to open the lock. The lock opens ifthe user first turned it right to the first number in thecombination, then left to the second, and then right to thethird.Write a client program/code tothoroughly test the class. Take snapshots of your tests and includethose with submission.Declare a class CobboLock that works like the combination lock in a gym locker, as shown here. The lock is constructed with a combination-three numbers between 0 and 39. The reset method resets the dial so that it points to O. The turnLeft and trunRight methods turn the dial by a given number of ticks to the left or right. The open method attempts to open the lock. The lock opens if the user first turned it right to the first number in the combination, then left to the second, and then right to the third. Write a client program/code to thoroughly test the dlass. Take snapshots of your tests and include those with submission. Show transcribed image text Declare a class CobboLock that works like the combination lock in a gym locker, as shown here. The lock is constructed with a combination-three numbers between 0 and 39. The reset method resets the dial so that it points to O. The turnLeft and trunRight methods turn the dial by a given number of ticks to the left or right. The open method attempts to open the lock. The lock opens if the user first turned it right to the first number in the combination, then left to the second, and then right to the third. Write a client program/code to thoroughly test the dlass. Take snapshots of your tests and include those with submission.

    Expert Answer


    . . .


    view full answer
  • QUESTION : (Solved) : Code Works Sure Organize Everything Calling Mainc Header File Pic Works Correctly Please H Q35037088 . . .

    Write a C program that computes Pi with the approximation algorithm that I introduced in class. I want you to write the progr

    The code works but not sure how to organize everythingso calling from main.c to the header file andpi.c works correctly. Please help.

    # include <stdlib.h>
    # include <stdio.h>
    # include <limits.h>

    # define threshold 0.00000000000001

    int main(void)
    {
       // Version 2.0
      
       double pi = 0;
       unsigned long index = 1;
      
       double temp = 0;
      
       while (temp – threshold)
       {
          
           temp += ((4.0/index) -(4.0/index+2));
          
           index += 4;  
       }
       pi = temp;
       printf (“%f”, pi);
       return EXIT_SUCCESS;
      

       // Version 1.0
       /*
       double pi = 0;
       unsigned long index = 1;
      
       int sign = 1;
      
       while (index < 28284277)
       {
          
           pi += 4.0/index * sign;
           sign *= -1;
           index += 2;
       }
       printf(“%f”, pi);
       return EXIT_SUCCESS;
       */
    }

    Write a C program that computes Pi with the approximation algorithm that I introduced in class. I want you to write the program in two different ways: The first version will add up the first 28284277 elements of the approximation series in a simple for loop. I ask you to put the code into a function with this signature: float get_pi_for(void); The second version will break out of a while loop depending on whether a pair of adjacent elements (remember that we always consider a positive element and its adjacent negative right neighbor) is smaller than a certain threshold. I ask you to use the threshold 0.00000000000001. Please put the code of this version into a function with the signature float get_pi_while(void); Put both functions into a file called pi.c. Also write a corresponding header file that has symbolic constants for both the number of LOOPS to be run as well as for the THRESHOLD value Finally, write a file main.c that contains the driver, which will print out pi twice calling the two different functions. I want you to call get_pi for) first, then call get_pi_while). Show transcribed image text

    Expert Answer


    . . .


    view full answer
  • QUESTION : (Solved) : Code Works Shell Doesn T Work Pico C Editor Cpp Compiler Errors Get Topdivarraycpp 81 71 M Q27656741 . . .

    so my code works in shell but doesn’t work in pico c++ editor.cpp compiler

    these are the errors i get:

    top_div_array.cpp:81:71: missing terminating ” character
    top_div_array.cpp:82:2: missing terminating ” character
    top_div_array.cpp: In function `void print_result(float*,std::string*, int)’:
    top_div_array.cpp:82: error: syntax error before stringconstant
    gen242@cs04:~>

    and this is my code:

    //poonam patel
    //cs 102 spring
    //calculates highest divisions sales using array and prototypesfunction

    //libraries
    #include <iostream>
    #include <string>
    #include <iomanip>
    using namespace std;
      
    //function prototypes
    void populate_div_sales(float[], string[], int);
    int findHighest (float[], int);
    void print_result(float[], string[], int);

    int main()
    {
    int top_div_index = 0;
    float div_sales[4];
    string div_regions[4];

    //arrays for regioons
    div_regions[0] = “Northeast”;
    div_regions[1] = “Southeast”;
    div_regions[2] = “Northwest”;
    div_regions[3] = “Southwest”;

    //function
    populate_div_sales(div_sales,div_regions,4);
    //debug
    cout<<“debug print for arraydiv_sales_array”<<endl;
    for (int i=0; i<4; i++)
    {
    cout<<div_sales[i]<<endl;
    }
    top_div_index = findHighest(div_sales,4);
    cout<<“debug fortop_div_index:”<<top_div_index<<endl;

    print_result(div_sales, div_regions, 4);

    return 0;
    }
    //division sales
    void populate_div_sales(float f_div_sales[], stringf_div_regions[], int size)
    {
    float sale;
    cout<<“Enter Division Sales for 4 regionsn”;
    for(int i=0;i<size; i++)
    {
    while(true)

    cout<<f_div_regions[i]<<“:$”;
    cin>>sale;
    if(sale>=0)
    {
    f_div_sales[i]=sale;
    break;
    }
    else
    {
    cout<<“sale should be positive integer, please tryagain…n”;
    }
    }
    }
    }
    //findinghighest
    int findHighest(float sales[], int size)
    {
    float greatestSalesAmount=0;
    int save_index=0;

    greatestSalesAmount=sales[0];
    for(int i=0; i<size; i++)
    {
    if(sales[i]>greatestSalesAmount)

    {

    greatestSalesAmount=sales[i];
    save_index=i;
    }
    }
    return save_index;  
    }

    //printresults
    void print_result(float f_sales[], string f_divisions[], intsize)
    {
    int highest=findHighest(f_sales,4);
    cout<<fixed<<setprecision(2)<<“Highestsale:”<<f_divisions[highest]<<“division whicchmade
    $”<<f_sales[highest];
    }

    Expert Answer


    . . .


    view full answer
  • QUESTION : (Solved) : Coded Matlab Task Find Minimum Cost Shipping Sets Items Also Positioning Allocation Items Q31219193 . . .

    To be coded in Matlab.

    The task is to find the minimum cost of shipping sets of items,and also the positioning and allocation of items on craft for eachof these sets. Determine the optimal solution for the Sample Mixeslisted in Table 2, but also give consideration to your solutionbeing applied to generic, and larger problems (such as more items,different item types, and different craft sizes.

    Assume there are 4 different types of item (Table 1), and themixes of these items needing to be shipped are in Table 2.

    Item Width Length 2 欠 13 3 TABLE 1. Items types and sizes.

    A standard craft is width 3 units and length 7 units, where thenumber of craft will be limited cost is expensive so this needs tobe minimised also.

    Formulate the problem as an ILP (Integer Linear Program)
    (a) Solving the relaxed problem, what (if anything) does this tellyou about the actual solution? How does the running time changewhen the sample Mix is changed?
    (b) Solve the exact problem. Consider the running time as youchange the Sample Mix. Compare to your results from (a).
    (c) Consider re-formulating so some items might be rotatable.

    Reformulate the problem where a priority is given to certainitems (there may be a benefit from some items arriving beforeothers)
    (d) Formulate your problem as an ILP where item Ii has priorityvalue vi associated; discuss the priority value and number of craftused trade-off when determining an objective function.
    (e) Let vi = i for i = 1, . . . , 4. Solve the ILP. How does thissolution change from parts a, b and c?
    (f) To find an approximate (or exact) solution to the generalproblem, propose a heuristic method and implement and compare withprevious results.

    Item Width Length 2 欠 13 3 TABLE 1. Items types and sizes. Show transcribed image text

    Expert Answer


    . . .


    view full answer
  • QUESTION : (Solved) : Coded Java Doubly Linked List Class Public Class Dllist Private Dnode Head Public Dllist H Q36282856 . . .

    a) Write additional member method for Linked List class called buildFromTexFile(String filename), then the method creates a lIt should coded with java.

    //Doubly Linked List class
    public class DLList {
       private DNode head;
       public DLList(){
           head=null;
       }
       private DNode findeNode(int pos){
           int cnt=1;
           DNode walk=head;
           while(walk!=null){
              
              if(pos==cnt)
                  break;
              walk=walk.getNext();
               cnt++;
           }
           return walk;
          
       }
       public void deleteAt(int pos){
           if(head==null)
               return;
           if(pos==1){
              if(head.getNext()==null){ //if there is only one node
                  head=null;
               }else{
                  head=head.getNext();
                  head.setPrev(null);
               }
           }
           else if(pos>1){
               DNodedeletionNode=findeNode(pos);
              if(deletionNode==null)
                  return;
               elseif(deletionNode.getNext()==null){
                 
                  deletionNode.getPrev().setNext(null);
               }
               else {
                 deletionNode.getPrev().setNext(deletionNode.getNext());
                 deletionNode.getNext().setPrev(deletionNode.getPrev());
               }
           }
       }
      
       public void insertFront(int data){
           DNode newNode=newDNode(data);
           if(head==null)
              head=newNode;
           else{
              newNode.setNext(head);
              head.setPrev(newNode);
              head=newNode;
           }
       }
       //this method will reutrn null reference if pos is notvalid
       private DNode locateNode(int pos){
           int cnt=0;
           DNode walk=head;
           pos–;
           while(walk!=null){
               cnt++;
              if(pos==cnt)
                  break;
              walk=walk.getNext();
           }
           return walk;
          
       }
       public void insertAt(int pos,int data)throwsInvalidPosException{
           if(pos==1){//pos 1 means insertfront
               DNodenewNode=new DNode(data);
              if(head==null)
                  head=newNode;
               else{
                  newNode.setNext(head);
                  head.setPrev(newNode);
                  head=newNode;
               }
           }
           else {
               DNodeinsertionPoint=locateNode(pos);//insertion will be performed afterthis point
              if(insertionPoint==null)
                  throw new InvalidPosException(“InvalidPostion”);
               else{
                  DNode newNode=new DNode(data);
                  if(insertionPoint.getNext()==null){
                     insertionPoint.setNext(newNode);
                     newNode.setPrev(insertionPoint);
                  }
                  else{
                     newNode.setNext(insertionPoint.getNext());
                     insertionPoint.getNext().setPrev(newNode);
                     newNode.setPrev(insertionPoint);
                     insertionPoint.setNext(newNode);
                  }
               }
           }
          
       }
       public void append(int data){
           DNode newNode=newDNode(data);
           DNode walk=head;
           DNode prev=null;//at the end ofwhile loop this ref will be pointing to the last node
           if(head==null){
              head=newNode;
           }else{
              while(walk!=null){
                  prev=walk;
                  walk=walk.getNext();
               }
              prev.setNext(newNode);
              newNode.setPrev(prev);
           }
       }
       @Override
       public String toString(){
           String str=”head->”;
           DNode walk=head;
           while(walk!=null){
              str+=walk.getData()+”->”;
              walk=walk.getNext();
           }
           return str+”null”;
       }
       public static void main(String []s){
           DLList l1=new DLList();
           l1.append(33);
           l1.insertFront(12);
           l1.insertFront(22);
           l1.append(55);
           System.out.println(l1);
           l1.insertAt(1, 42);
           System.out.println(“after insert at1 ,42 :”+l1);
           l1.insertAt(6, 666);
           System.out.println(“after insert at6 ,66 :”+l1);
           l1.insertAt(4, 444);
           System.out.println(“after insert at4 ,444 :”+l1);
          //head->42->22->12->444->33->55->666->null
           l1.deleteAt(3);//delete node 3(value of node is 12)
           System.out.println(l1);//head->42->22->444->33->55->666->null
           l1.deleteAt(6);
          System.out.println(l1);//head->42->22->444->33->55->null
           l1.deleteAt(1);
          System.out.println(l1);//head->22->444->33->55->null
       }

    }

    public class InvalidPosException extends RuntimeException {
       public InvalidPosException(String str){
           super(str);
       }

    }

    a) Write additional member method for Linked List class called buildFromTexFile(String filename), then the method creates a linked list by reading double values from a text file called filename Your program must create a linked list in a way that the first number in the text file must be the first node and the second number will be the second node and so forth, the rest of the numbers will be placed accordingly b) Write a member method that will count and return negative numbers in the linked list c) In older personal computers, the largest integer is 32,767 and the largest long integer is 2,147,483,647. Some applications, such as cryptography and security algorithms, may require an unbounded integer. One way to store and manipulate integers of unlimited size is by using a linked list. Each digit is stored in a node of the list. Following figure shows how we could store a five-digit number in a list. Although the list in Figure is represented as moving from right to left, there is no physical direction in a list. (We represent it in this way to clarify the problem.) carry 0 carry 0carry1 carry0 h1 4 3 3 4 3 3 0 To add two numbers, we simply add the corresponding digit in the same location in their respective lists with the carry from the previous addition. Write a static method for adding two numbers (in the form of linked list) that will take two linked lists as input and returns new linked list which is the result of sum. LinkedList add(LinkedList 11, LinkedList 12) Show transcribed image text a) Write additional member method for Linked List class called buildFromTexFile(String filename), then the method creates a linked list by reading double values from a text file called filename Your program must create a linked list in a way that the first number in the text file must be the first node and the second number will be the second node and so forth, the rest of the numbers will be placed accordingly b) Write a member method that will count and return negative numbers in the linked list c) In older personal computers, the largest integer is 32,767 and the largest long integer is 2,147,483,647. Some applications, such as cryptography and security algorithms, may require an unbounded integer. One way to store and manipulate integers of unlimited size is by using a linked list. Each digit is stored in a node of the list. Following figure shows how we could store a five-digit number in a list. Although the list in Figure is represented as moving from right to left, there is no physical direction in a list. (We represent it in this way to clarify the problem.) carry 0 carry 0carry1 carry0 h1 4 3 3 4 3 3 0 To add two numbers, we simply add the corresponding digit in the same location in their respective lists with the carry from the previous addition. Write a static method for adding two numbers (in the form of linked list) that will take two linked lists as input and returns new linked list which is the result of sum. LinkedList add(LinkedList 11, LinkedList 12)

    Expert Answer


    . . .


    view full answer