Case Study; The FBI T

his is a case about the virtual case file system, which has caused FBI IT leaders many problems.

a) What do you think were the real reasons why the VCF system failed?

Need 300 words discussion,Don't rewrite already existing chegg answers

Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is:

As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1)

x = x / 2

Note: The above algorithm outputs the 0's and 1's in reverse order.

The code needs to be in Java

Python Code:

1. Write a program to prompt the user to enter a first name, last name, student ID, number of hours completed and GPA for 5 students. Use a loop to accept the data listed below. Save the records in a text file.
2. Write a second program that reads the records from your new text file, then determines if the student qualifies for Dean’s list or probation. Display the records read from the file on screen with appropriate headings above the data being displayed. Save screenshot for submission.

If the GPA is >= 3.5, display 'Dean’s List'

If the GPA is < 2.0, display 'Dismissed’

If the GPA is < 3.5 and >= 2.0, display 'Regular Standing'

The data is as follows:

Mohammed James   012345 94 3.2  

Priya Jones 112245 45 3.9

George Wayne   013265 18 1.9

Jennifer Fulton   121378 30 2.0

Ayesha Smith       043245 64 3.5

1. Describe when to use cursor:

•     implicit cursor
•      explicit  cursor

2. Please give one example for each of below statement:

•    TCL -- Transaction Control statement
•    DML -- Data Manipulation statement
•    Implicit Cursor Attributes --  PL/SQL statement

In this assignment you will write a PHP program that reads from a data file, creates an associative array, sorts the data by key and displays the information in an HTML table.

Create a PHP file called hw4.php that will do the following:

- Display your name.
- Read text data from a file. The data file is hw3.txt.

The file hw3.txt will hold the following text:

PQRParrot, Quagga, Raccoon
DEFDo statements, Else statements, For statements
GHIGeese, Hippos, If statements
YZ Yak, Zebra
JKLJelly Fish, Kudu, Lynx
MNOManatee, Nautilus, Octopus
ABCApples, Boas, Cats
VWXVulture, While statements, Xmen
STUSea Horse, Tapir, Unicorn

- Take the first three characters of each line read as the key and the rest of the line as the value or data.
- Create an associative array with the key and data.- Once all the data is in the array, sort the array by the key.
- Display the data as an HTML table. Below is what your finished table should look like.

- Use repetition to complete this assignment.

Question 3: C-Strings and pointers (10 pts)

1. [5] The following function appends C-string str2, to C-string str1. Complete the function using array access, i.e. str1[i], but no pointer access.

Note: For both part a) and part b) you may not use any library function calls (e.g. you cannot use strlen, strcat, etc.)

// Append strt2 to str1

void my_strcat(char str1[], char str2[])

{

//YOUR CODE HERE  

}

// example of using my_strcat()

#include <stdio.h>

int main(void)

{

char my_str1[50] = “hello ”;

char my_str2[] = “world”;

my_strcat(my_str1, my_str2);

// Printf should print: hello world.

printf(“%s \n”, my_str1);

}

2. [5] Rewrite the above function, this time using pointer access, i.e. *str, but no array access.

Note: In general, a function’s parameter declarations “char str[]” and “char *str” are equivalent (i.e. they are interchangeable)

// Append strt2 to str1

void my_strcat(char* str1, char* str2)

{

// YOUR CODE HERE  

}

// example of using my_strcat()

#include <stdio.h>

int main(void)

{

char my_str1[50] = “hello ”;

char my_str2[] = “world”;

my_strcat(my_str1, my_str2);

// Printf should print: hello world.

printf(“%s \n”, my_str1);

}

Is there any idea that which of the below is true regarding data preparation and integration thing? 1. Due to data silos exist for the organization and the data must be integrated to reduce data inconsistency often 2. For increasing decision efficiency & data security it must be isolated in separate information systems anyway 3. Actually, vertical data integration enriches existing information and on the other hand horizontal data integration merges tables that hold the same information most of the time. Figure out.

public class GroceryCart {

private static final int DEFAULT_CAPACITY = 10;

/*

* Default constructor with zero arguments. This constructs a grocery

* cart with a default capacity of ten items.

*/

public GroceryCart() {

}

/*

* Alternate constructor which takes in a maxCapacity. This maxCapacity

* determines how many items can fit inside of this groceryCart.

*/

public GroceryCart(int maxCapacity) {

}

/*

* Adds an item to the grocery cart. Returns true if the item was added

* successfully (i.e. there was still room in the cart to add it.

*/

public boolean addItem(String item, Double cost) {

return false;

}

/*

* Removes the specified item from the cart. Returns true if the item was

* successfully removed (i.e. the item existed in the cart).

*/

public boolean removeItem(String item) {

return false;

}

/*

* Empties the cart of all contents.

*/

public void emptyCart() {

}

/*

* Returns a string representation of the carts contents. The contents

* should be printed out in alphabetical order. It should be of

* the form, "item:price, item:price, item:price". An example:

* "Green Beans:2.99, Milk:41.99, Rolled Oats:1.99, Zucchini:2.67"

*/

public String toString() {

return "";

}

}

Select a building. Go to at 3 locations. At each location, record the information in the networks window. Also, do a connection and speed test. Write a brief report describing what you learned about Wi-Fi service in the building, referring to the data you collected

In Java

INSTRUCTIONS Write a java program called InputValidation.java that will use Scanner to ask the computer user to enter his/her: • Name: a string representing the user’s first name • month of birthday: an integer representing the month of the user’s birthday • day of birthday: an integer representing the day of the user’s birthday • year of birthday: an integer representing the year of the user’s birthday Consider the following aspects that your program shall perform: VALIDATE USER’S INPUT • Validate user’s data: Every time your program request information from the user the month must be between 1 –12 o Certain months have 30 days and others have 31 days. Your program must check for these cases o the day must be a number between 1 – 31 depending on the month provided previously USER INTERACTION AND CASE HANDLING • The user is allowed to make five mistakes in total while entering his/her information. • Notice that the user will continue entering his/her information in a repeatable fashion. • if the user had five mistakes in total, a comment shall be displayed as follows: Hi , you entered five mistakes. Please contact your official ID and try again later. And your program shall terminate immediately1 . • If the user successfully provided the data correctly, then your program shall display a message: Thank you for entering correct data • Design a flowchart that represents the flow of information in your entire program. You can use Microsoft Visio to develop this diagram. 1 You can use the System.exit() to terminate your program. PROGRAM OUTPUT AND RESULTS • Based on the user’s input for his/her year, check if the year provided is considered to be a leap year or not. If the year the user entered is leap, then you should write a message specifying that this person was born in a leap year. • Finally write an output message based on the decision on the leap year or not. If the year provided was leap, your message shall have “were” if the year was not, it should be “were not”, as follows: FYI , you born in a leap year

USING C++ ONLY.

Please study the code posted below.

the goal is to rewrite the code implementing a template class using a linked list instead of an array. Note: The functionality should remain the same.

/**
* Queue implementation using linked list C style implementation ( no OOP).
*/

#include <cstdio>
#include <cstdlib>
#include <climits>
#include <iostream>

#define CAPACITY 100 // Queue max capacity

using namespace std;
/** Queue structure definition */
struct QueueType
{
int data;
struct QueueType * next;
};
/** Queue size */
unsigned int size = 0;

int enqueue(QueueType * &rear, QueueType * &front, int data);
int dequeue(QueueType * &front);
int getRear(QueueType * &rear);
int getFront(QueueType * &front);
void display(QueueType * front);
int isEmpty();
int isFull();
string prepMenu();

int main()
{
int option, data;

QueueType *rear, *front;

rear = NULL;
front = NULL;
string menu = prepMenu();
cout << menu << endl;
cin >> option;
while (option !=7)
{

switch (option)
{
case 1:
cout << "\nEnter data to enqueue (-99 to stop): ";
cin >> data;
while ( data != -99)
{
/// Enqueue function returns 1 on success
/// otherwise 0
if (enqueue(rear, front, data))
cout << "Element added to queue.";
else
cout << "Queue is full." << endl;
cout << "\nEnter data to enqueue (-99 to stop): ";
cin >> data;
}

break;

case 2:
data = dequeue(front);

/// on success dequeue returns element removed
/// otherwise returns INT_MIN
if (data == INT_MIN)
cout << "Queue is empty."<< endl;
else
cout << "Data => " << data << endl;

break;

case 3:

/// isEmpty() function returns 1 if queue is emtpy
/// otherwise returns 0
if (isEmpty())
cout << "Queue is empty."<< endl;
else
cout << "Queue size => "<< size << endl;

break;

case 4:
data = getRear(rear);

if (data == INT_MIN)
cout << "Queue is empty." << endl;
else
cout << "Rear => " << data << endl;

break;

case 5:

data = getFront(front);

if (data == INT_MIN)
cout <<"Queue is empty."<< endl;
else
cout <<"Front => " << data << endl;

break;

case 6:
display(front);
break;

default:
cout <<"Invalid choice, please input number between (0-5).\n";
break;
}

cout <<"\n\n";
cout << menu<< endl;
cin >> option;
}
}

/**
* Enqueues/Insert an element at the rear of a queue.
* Function returns 1 on success otherwise returns 0.
*/
int enqueue(QueueType * &rear, QueueType * &front, int data)
{
QueueType * newNode = NULL;

/// Check queue out of capacity error
if (isFull())
{
return 0;
}

/// Create a new node of queue type
newNode = new QueueType;

/// Assign data to new node
newNode->data = data;

/// Initially new node does not point anything
newNode->next = NULL;

/// Link new node with existing last node
if ( (rear) )
{
rear->next = newNode;
}

/// Make sure newly created node is at rear
rear = newNode;

/// Link first node to front if its NULL
if ( !( front) )
{
front = rear;
}

/// Increment quque size
size++;

return 1;
}

/**
* Dequeues/Removes an element from front of the queue.
* It returns the element on success otherwise returns
* INT_MIN as error code.
*/
int dequeue(QueueType * &front)
{
QueueType *toDequque = NULL;
int data = INT_MIN;

// Queue empty error
if (isEmpty())
{
return INT_MIN;
}

/// Get element and data to dequeue
toDequque = front;
data = toDequque->data;

/// Move front ahead
front = (front)->next;

/// Decrement size
size--;

/// Clear dequeued element from memory
free(toDequque);

return data;
}

/**
* Gets, element at rear of the queue. It returns the element
* at rear of the queue on success otherwise return INT_MIN as
* error code.
*/
int getRear(QueueType * & rear)
{
// Return INT_MIN if queue is empty otherwise rear.
return (isEmpty())
? INT_MIN
: rear->data;
}

/**
* Gets, element at front of the queue. It returns the element
* at front of the queue on success otherwise return INT_MIN as
* error code.
*/
int getFront(QueueType * &front)
{
// Return INT_MIN if queue is empty otherwise front.
return (isEmpty())
? INT_MIN
: front->data;
}

/**
* Checks, if queue is empty or not.
*/
int isEmpty()
{
return (size <= 0);
}

/**
* Checks, if queue is within the maximum queue capacity.
*/
int isFull()
{
return (size > CAPACITY);
}
string prepMenu()
{

string menu = "";

menu+= " \n-------------------------------------------------------------------\n";
menu+= "1.Enqueue 2.Dequeue 3.Size 4.Get Rear 5.Get Front 6.Display 7.Exit\n";
menu+= "----------------------------------------------------------------------\n";
menu+= "Select an option: ";
return menu;
}
void display(QueueType * front)
{
for ( QueueType *t = front; t !=NULL; t = t->next)
cout <<t->data << " ";
cout << endl << endl;
}

please provide comments in the code where appropriate, thank you!

3.There is two types of communications network write them. What is the main Characteristic of WANs , Write the main use LANs Network

Design two function templates as follows: -

First function template will be used to sort arrays of different data types in either descending or ascending order. This function template is required to have the following parameters: an array of a generic type, an integer representing the size of the array, and a character representing the order of sorting (i.e., ascending or descending). The last argument (i.e., the order of sorting) is required to be a default argument. The default order of sorting should be ascending.

- Second function template will be used to display an array. This function template is required to have two parameters: an array of a generic type and an integer representing the size of the array.

Design the main program that can be used to test both function templates above. The program should create the two dynamic arrays one of which will store integer values, while the other array will store character values. The size of both arrays will be determined at run time, i.e. entered by the user. The requested order of sorting (i.e., ascending or descending) for each array will also be obtained from the user at run time. The values stored in both arrays will be generated by the random numbers generator (i.e., srand() and rand() library functions could be used). Please note that the random characters' ASCII values should be in the range from 33 to 126, while the random integer numbers should be in the range from 1 to 100. The program will call both templates to sort arrays in the requested order and display both arrays before and after sorting. It is required to include all necessary error checking which includes the code to prevent any "garbage input" from the user as well as the code to prevent the memory allocation error.