In a file-oriented information system, a work file ____. stores relatively permanent data about an entity is created and saved for backup and recovery purposes stores records that contain day-to-day business and operational data is a temporary file created by an information system for a single task

Answer:

Both B and C

Explanation:

In order to use methods from another class (library) in your code, the class library will have to be added or imported into your code.

This is implemented in different ways across different programming languages, for example;

Java uses the keyword import followed by the class library name

C++ uses the key word #include

C# Uses the keyword using

Answer:

Both b and c.

Explanation:

In my opinion, I think the IDE determines how to use the class. While you import some, some have to be added to your project

Answer:

A Syntax error because web browsers and IDEs provide helpful error messages

Explanation:

A Syntax error occurs when an aspect of a code don't completely  conform to the syntax of the programming language. They are mistakes in the source code, such as the misspelling of an instruction  or failure to declare a label before using it in the program. This   can be easily corrected by going back to the code to trace where the error and correcting it.

Answer:

Transference

Explanation:

According to carr

Answer:

The Tp value 0.03 micro seconds as calculated in the explanation below is negligible. This would lead to a similar value of time delay for both persistent HTTP and non-persistent HTTP.

Thus, persistent HTTP is not faster than non-persistent HTTP with parallel downloads.

Explanation:

Given details are below:

Length of the link = 10 meters

Bandwidth = 150 bits/sec

Size of a data packet = 100,000 bits

Size of a control packet = 200 bits

Size of the downloaded object = 100Kbits

No. of referenced objects = 10

Ler Tp to be the propagation delay between the client and the server, dp be the propagation delay and dt be the transmission delay.

The formula below is used to calculate the total time delay for sending and receiving packets :

d = dp (propagation delay) + dt (transmission delay)

For Parallel downloads through parallel instances of non-persistent HTTP :

Bandwidth = 150 bits/sec

No. of referenced objects = 10

For each parallel download, the bandwith = 150/10

  = 15 bits/sec

10 independent connections are established, during parallel downloads,  and the objects are downloaded simultaneously on these networks. First, a request for the object was sent by a client . Then, the request was processed by the server and once the connection is set, the server sends the object in response.

Therefore, for parallel downloads, the total time required  is calculated as:

(200/150 + Tp + 200/150 + Tp + 200/150 + Tp + 100,000/150 + Tp) + (200/15 + Tp + 200/15 + Tp + 200/150 + Tp + 100,000/15 + Tp)

= ((200+200+200+100,00)/150 + 4Tp) + ((200+200+200+100,00)/15 + 4Tp)

= ((100,600)/150 + 4Tp) + ((100,600)/15 + 4Tp)

= (670 + 4Tp) + (6706 + 4Tp)

= 7377 + 8 Tp seconds

Thus, parallel instances of non-persistent HTTP makes sense in this case.

Let the speed of propogation  of the medium be 300*106 m/sec.

Then, Tp = 10/(300*106)

               = 0.03 micro seconds

The Tp value 0.03 micro seconds as calculated above is negligible. This would lead to a similar value of time delay for both persistent HTTP and non-persistent HTTP. Thus, persistent HTTP is not faster than non-persistent HTTP with parallel downloads.

Answer:

The answer to these questions can be defined as below:

Explanation:

Question 1:

In the best case big-oh the bubble and selection sort is used, where bubble style simply swaps the items, whereas the sort of sorting takes place by choosing the element.

Question 2:

In the worst case, the merge and selection is used, where Merge-sort splits the list into two sub-lists equally and incessantly names itself in the sublists to still be sorted, whereas Heap-sort is an anti-recursive type.  

Question 3:

In the worst case of swapping the bubble sort algorithm is used.

Question 4:

In sorts of swap selection, bubble, and quick sort is used.

Question 5:

Insertion sorts provide the shift sorts.

Question 6:

The best big-oh is o(n), in the worst case, best case complexity of different sorts are different.

Answer:

Stories

Explanation:

Storytelling is regarded as being on the core of culture. Stories is a way of passing history down generations after generations, and how customs are being shared. It also denotes how people adopt a tradition and these traditions never change. The stories told by a group indicates the values of its culture. In the question, informing employees about founders is like telling them stories to pass customs, values, and tradition.

Answer:

The answer is "Worm"

Explanation:

Worm is a kind of malware, which primarily infects certain machines whereas remaining on compromised devices. It replicates the malware, which itself to uninfected by computers, and certain options were wrong which can be defined as follows:

Answer: Insertion Sort is more efficient , stable and faster than quick sort in writing sorting algorithms.

Insertion sort saves space without moving blocks of data and ensuring data stability.

Explanation:

Insertion Sort involves sorting given items in an algorithm by taking unsorted items, inserting them in sorted order in front of the other items and repeating until all items are in order.

Insertion sort process is relatively stable and faster compared to both quick sort and merge sort in algorithm manipulation since we are only moving smaller items in front without moving blocks of items.

On the other hand, Quick Sort is an algorithm that involves or chooses a random pivot and sort items smaller than the chosen pivot to the left and items bigger than the chosen pivot to the right till all items are in sorted order.

Quick Sort is a space sorting algorithm with extra stack frame space and has a risk of an unbalanced pivoting point which may cause extra running time and may also be highly unstable compared with Insertion sort method.

Answer:

False.

Explanation:

Representatives of the following team must answer, examine, as well as report that evidence in even the most timely way possible throughout the examination through the circumstance . They should not be conducting the counter attack to defend CBFs. They defend this in a different way.

So that is the reason by which the following statement is false.

Answer:

Complete code is given below:

Explanation:

addi $t0, $zero, 12 # x = 12

addi $t1, $zero, 21    # y = 21

addi $t2, $zero, 32    # z = 32

addi $t3, $zero, 3

mul $t3, $t3, $t0

mul $t3, $t3, $t0  # $t3 = 3x^2

addi $t4, $zero, 10

mul $t4, $t4, $t1  # $t4 = 10y

addi $t5, $zero, 5

mul $t5, $t5, $t2  # $t5 = 5z

add $a0, $t3, $t4

add $a0, $a0, $t5  # $a0 = 3x^2 + 10y + 5z

addi $v0, $zero, 1

syscall

Answer:

The initial program was not provided.

I'll answer the question base on the following assumptions.

1. I'll declare a rate of payment for hours more than 60 and a different rate of payment for hours between 40 and 60.

2. Gross payment is calculated by rates of payment * hours worked.

# Program starts here

# Comments are used for explanatory purpose

def main():

#accept input for hours

x= input ("Enter Hours Worked per week")

#convert to integer

hours = int(x)

#accept input for rate of payment

y= input ("Enter Rate of payment per week")

#convert to integer

Rate = int(y)

#test the range of values of hours

if(hours>60):

st= "double time for hours more than 60"

elif(hours>=40 && hours<=60):

st= "one-half time more than 40 and less than or equal to 60"

print(st)

Gross = Rate * hours

print(Gross)

Answer:

See the attached pictures for detailed answer.

Explanation:

The cache contain 8K number of blocks.each block has 16 Byte worth of data. Each of these bytes are addressable by block offset. Now, each of these blocks are addressable and their address is provided by line offset or set offset. If block number is given in Decimal format then the block to which that block will be mapped is given by expression

mappedToBlock = (bNumber)mod2​​​13

TAG and valid but consititues something called cache controller. TAG holds the physical address information because the TAG in physical address get divided into TAG and line offset in cache address. Valid bit tells status of blocks. If it is 1 then data blocks are referred by CPI else not.

Answer:

See attached picture for heap creation steps.

10 comparisons were used.

Explanation:

See attached pictures.

Answer:

Bill is building a project network that involves testing a prototype. he must design the prototype (activity 1), build the prototype (activity 2), and test the prototype (activity 3). activity 1 is the predecessor for activity 2 and activity 2 is the predecessor for activity 3. if the prototype fails testing, bill must redesign the prototype; therefore, activity 3 is a predecessor for activity 1. this is an example of

b. looping

Explanation:

Answer:

#include<iostream>

using namespace std;

void stats(double [],int);  

int main()

{

int totalElements,i;

cout<<"Enter total elements:"<<endl;

cin>>totalElements;

double array[totalElements];

cout<<"Enter the elements in array:"<<endl;

for(i=0;i<totalElements;i++)

cin>>array[i];

stats(array,totalElements);  

}

void stats(double array[],int totalElements)

{

int i;

double minimum,maximum;

double Sum=0.0,average=0.0;

minimum=array[0],maximum=array[0];

for(i=0;i<totalElements;i++)

{

if(array[i]>maximum)

maximum=array[i];

if(array[i]<minimum)

minimum=array[i];

Sum+=array[i];

}

average=Sum/totalElements;

cout<<"Test: ";

for(i=0;i<totalElements;i++)

cout << fixed << setprecision(2) <<array[i]<<" ";

cout<<endl;

cout <<"minimum:"<< fixed << setprecision(2) <<minimum<<endl;

cout <<"maximum:"<< fixed << setprecision(2) <<maximum<<endl;

cout <<"average:"<< fixed << setprecision(2) <<average<<endl;

}

Explanation:

Final answer:

The 'stats' function calculates and prints the minimum, maximum, and average values from a given array with two-digit precision.

Explanation:

The function named stats is designed to compute statistical values such as the minimum value, maximum value, and the average value of elements in an array. The function takes two parameters: an array of type double and the number of elements in the array of type int. It then proceeds to calculate the required statistics and prints them with a precision of two decimal places. This function does not return any value as its primary purpose is to print out the calculated statistics.

Answer:

(define (delete-atom list atom )

(cond ((null? list) '()) ;;if list is empty returns empty

((equal? (car list) atom) (delete-atom (cdr list) atom)) ;;checking fiest element of element of list with item

(else (cons (car list) (delete-atom (cdr list) atom))))) ;;recursively check for rest of the elements

Explanation:

atom is first compared with first element of list, if both are equal it recursively calls that function with deleting first element. if both are not equal it cons the first element and recursively calls rest of the elements.

Obeserve that if list is nested list for ex '((1 2) 2 3) and if we want to delete 2 it returns ((1 2) 3) becuase it deletes top level of 2 only. when (car list) i., (2 3) compared with 2, both are not equal and it cons the entire sublist ((2 3) and recursively calls delete-atom function. so it doesn't deletes the element inside and deletes top level only.

Consider a simple list '( 1 2 3). Here deleting 1 is just a simple deletion and returns (2 3)

consider deleting 1 from top level of a nested list '(1 2 3 (1 3) 1 3 4) returns (2 3 (1 3) 3

Answer:

Terminal services

Explanation:

Terminal services are multiuser, lean client environment from Microsoft which was built for Windows servers. It was first launched on the Windows NT 4.0 in 1996, as of the 2009 the launch of Windows Server 2008 R2, it became part of Remote Desktop Services (RDS), and exclusively, the "shared sessions" method in RDS.

Just like in the old times of mainframes, Terminal Services supports numerous users connected to a central computer. The user's device can be a compact PC, bare-bones PC or a dedicated terminal, and all of them are to function as input/output (I/O) terminals and use the same OS and applications running in the server. Terminal Services utilizes the Microsoft's Remote Desktop Protocol (RDP) to govern mouse, keyboard and screen transfer.

Answer:

The sample output is been attached below

Explanation:

//main.cpp

#include <iostream>

using namespace std;

#include "IntList.h"

int main() {

//tests constructor, destructor, push_front, pop_front, display

cout << "\nlist1 constructor called";

IntList list1;

cout << "\npushfront 10";

list1.push_front(10);

cout << "\npushfront 20";

list1.push_front(20);

cout << "\npushfront 30";

list1.push_front(30);

cout << "\nlist1: ";

list1.display();

cout << "\npop";

list1.pop_front();

cout << "\nlist1: ";

list1.display();

cout << "\npop";

list1.pop_front();

cout << "\nlist1: ";

list1.display();

cout << "\npop";

list1.pop_front();

cout << "\nlist1: ";

list1.display();

cout << endl;

cout << "list1 destructor called" << endl;

return 0;

}

=============================================================

//IntList.cpp

#include <iostream>

#include "IntList.h"

using namespace std;

IntList::IntList() : head(NULL), tail(NULL) { }

IntList::~IntList() {

while(!empty()){

pop_front();

}

}

void IntList::push_front(int value) {

/*Creates a temporary pointer of type IntNode, assigning a memory address (block of memory)

to temp_ptr of type IntNode and then initializing with a constructor. */

IntNode* temp_ptr = new IntNode(value);

/*Then we assign the current address of head (if just empty list, this is NULL) to the

dereferenced temporary pointer's next memory address */

(*temp_ptr).next = this->head;

/*Assign the memory address of temporary pointer (which points to the newly created block of memory) to head. */

this->head = temp_ptr;

return;

}

void IntList::display() const {

/* If empty list, exit out of display function */

if(empty()) {

return;

}

//Since the list is not empty, print the data which the dereferenced head points to

cout << (*head).data;

//Initialize a new pointer, which is assigned to the next pointer in the linked list

IntNode* plc_ptr = (*head).next;

// Create a while loop that checks whether the pointer points to anything.

// This checks to see whether it is the end of the linked list

while(plc_ptr != NULL) {

// Prints the dereferenced pointers data

cout << " " << (*plc_ptr).data;

/*Updates the memory address which the temporary pointer points to,

going through the list each time it goes through the while loop */

plc_ptr = (*plc_ptr).next;

}

return;

}

bool IntList::empty() const {

//The linked list is empty if the head doesn't point to any memory addres/is NULL

if(head == NULL) {

return true;

}

return false;

}

void IntList::pop_front() {

//First check to see if the linked list is empty/if there is a first item that needs to be deleted

if(empty()) {

return;

}

//Set a temporary pointer to the next of the first item, which is the memory address of the second item

IntNode* temp_ptr = (*head).next;

//Delete the memory address for head

delete head;

//Reassign to head the memory address of what was the memory address of the second item

head = temp_ptr;

return;

}

===============================================================================

//IntList.h

#ifndef _INTLIST_H

#define _INTLIST_H

struct IntNode {

int data;

IntNode* next;

IntNode(int data) : data(data), next(NULL) {}

};

class IntList {

public:

IntList();

~IntList();

void display() const;

void push_front(int);

void pop_front();

bool empty() const;

private:

IntNode* head;

IntNode* tail;

};

#endif

=========================================================================

Answers

Explanation:

In short explanation,the Computer Architecture specifically deals with whatever that's going on in the hardware part of the computer system while the Operating System is the computer program which has been program to execute at some instances depending on the programming instructions embedded in it. An example is the MS Office.

Answer:

Explanation:

Firstly import Scanner and Random libraries which will be used to get input number and to generate random value (Line 1 -2).

Next declare all the necessary variables as given in pseudo-code (Line 7 - 8)

Then use nextInt method to randomly generate integer and assign them to rand1 and rand 2, respectively (Line 10 - 11). Next, sum up the two random values and assign it to variable ans (Line 12).

Display the two random numbers (Line 14) and create a Scanner object and prompt user input for answer (Line 16- 18).

Create an if-else condition to check if the input answer (ans) is equal to the real answer (sum) and display the appropriate message accordingly (Line 20 - 24).

Answer:

F= in1'.in2' + (in1.in2)' + in1'. in2+ in1.in2'

Explanation:

See the truth table in the attachment

I have used apostropy (') to write complement

Answer:

The SUID bit is a type of permission files that is previously granted to a file. In Linux when you run a program, these special permissions are inherited to the user who is working. The SUID grants permissions to a user temporarily.

Explanation:

If the time lengthens, it is possibly due to a security breach. A change of the password is recommended, through the passwd command. Through this command, some files cannot be opened or seen by the user, only by the user who has root permissions. By configuring the passwd through the SUID we can grant root user permissions to any type of user, so that in such case update, use the shadow and files.

Monitoring setuid root programs helps spot security risks. These programs have high privileges and can be exploited if compromised. A sudden increase might indicate a new risky program or a malicious attack. But it's not the only sign, so stay familiar with your system's programs.

You're right on track! Monitoring the number of setuid programs owned by root is a good security practice. Here's why:

Setuid programs have elevated privileges: The `setuid` bit allows a program to run with the permissions of the file's owner, even if the user running it doesn't have those permissions themselves. This is useful for some programs that need to access resources or perform actions that normal users can't.

Root ownership implies high privilege: Programs owned by `root` have the highest level of permissions on the system.  

Security vulnerabilities in setuid root programs are critical: If a program with `setuid` and root ownership has a security vulnerability, an attacker can exploit it to gain complete control of the system. This is because the program is already running with the most powerful privileges.

By monitoring the number of `setuid root` programs, you can potentially detect:

Accidental addition:*A new program might have been incorrectly given `setuid` privileges, creating an unnecessary risk.

Malicious activity: An attacker might try to add a malicious program with `setuid root` permissions to gain access.

However, it's important to note that a sudden increase isn't the only indicator of a security breach. Here are some additional points to consider:

Some legitimate programs require setuid root: There are valid reasons for some system programs to be `setuid root`. You'll need to be familiar with the expected setuid programs on your system.  

Look for changes in specific programs: A program that wasn't previously `setuid root` becoming so is more suspicious than a known program remaining setuid.  

In conjunction with monitoring the number of `setuid root` programs, consider these security practices:

Keep your system updated: This includes patching the kernel and all installed software.

Minimize the number of setuid root programs: If a program doesn't strictly need `setuid` privileges, remove them.

Use tools for a more comprehensive security check:  There are system security scanners that can help identify vulnerabilities in setuid programs.

Answer:

(b) When irrelevant attributes have been removed from the data.

Explanation:

A nearest neighbor approach -

It refers to the method of searching where the nearest point from the given set can be determined with respect to some specific point , is referred to as the nearest neighbor approach .

The method is used for the purpose of finding soe data in order to replace , edit , remove or add some data .

Hence , from the given question ,

The correct answer about nearest neighbor approach is b.

A Nearest Neighbor approach is best used when irrelevant attributes have been removed from the data. This algorithm works best when the dataset is clean and free of irrelevant, misleading, or noisy data. It is less effective with large data sets, and doesn't provide a generalized model or easy explanation of results.

A Nearest Neighbor approach in machine learning is typically best used when irrelevant attributes have been removed from the data. This type of algorithm generally works well when the dataset is clean and free of irrelevant, misleading, or noisy data that could interfere with finding the nearest neighbors. Notably, it does not work as effectively with large data sets due to computational demands. Furthermore, it does not provide a generalized model of the data or an easy explanation of the results, which eliminates options (a), (c), and (d).

To illustrate, consider a dataset used for predicting house prices. Irrelevant attributes including the house color, name of the owner, etc., have to be removed for the Nearest Neighbor algorithm to be effective as they do not have a direct impact on the house price. The algorithm then identifies the 'neighbor' house prices that are most similar to the house price we're trying to predict.

https://brainly.com/question/34725560

#SPJ11

Answer:

The code above tries to read a file using the scanner class in java programming language.

But it was done properly.

First, the scanner class library is not imported to the program.

Second,the syntax used in this program is an invalid way of reading a file in java programming language using the scanner class.

Lastly, "String s = file.nextLine();" is not a proper way of reading each line

To correct this problem; use the following code;

import java.util.Scanner;

import java.io.File;

import java.io.FileNotFoundException;

public class ReadFileWithScanner {

try

{

public static void main(String args[]) throws FileNotFoundException {

File text = new File("data.txt");

Scanner file = new Scanner(text);

int lines = 1;

while(file.hasNextLine()){

String line = filw.nextLine();

System.out.println("line " + lines + " :" + line);

lines++;

}

catch (ArithmeticException ae)

{

System.out.println(ae.getMessage());

}

}

}

Answer:

Advantage symmetric cryptography

Explanation:

1. The same key is used to both encrypt and decrypt messages.  

2. Symmetric key algorithms are widely applied in various types of computer systems to improve data security.

3. The security of symmetric encryption systems is based on the difficulty of randomly guessing the corresponding key to force them.

4. The Advanced Encryption Standard (AES) widely used in both secure messaging applications and cloud storage is a prominent example of symmetric encryption.

5. For every bit added to the length of a symmetric key, the difficulty of decrypting encryption using a brute force attack increases exponentially.

Answer:

data security and user privacy

Explanation:Symmetric algorithms provide a fairly high level of security while at the same time allowing for messages to be encrypted and decrypted quickly. The relative simplicity of symmetric systems is also a logistical advantage, as they require less computing power than the asymmetric ones. In addition, the security provided by symmetric encryption can be scaled up simply by increasing key lengths. For every single bit added to the length of a symmetric key, the difficulty of cracking the encryption through a brute force attack increases exponentially.

Answer: D. Turing conceived the structure of a programmable computer.

Explanation: The passage describes how Alan M. Turing described the theoretical aspect of a programmable computer. There is no reference to a physical machine or Turing working on an actual (physical) computer.

The Turing machine, although it does sound like a physical computer was an abstract idea, conceived in mathematical form of what a programmable machine would be like. Alan Turing is considered one of the founding fathers of theoretical computer science.

The correct answer is D. Turing conceived the structure of a programmable computer.The passage indicates that Alan Turing conceived the theoretical structure of a programmable computer in 1936. He did not physically build or analyze an actual computer.

Thus The correct answer is D. Turing conceived the structure of a programmable computer.

Answer:

No, the receiver cannot be absolutely certain that no bit errors have occurred. This is because of the manner in which the checksum for the packet is calculated. If the corresponding bits (that would be added together) of two 16-bit words in the packet were 0 and 1 then even if these get flipped to 1 and 0 respectively, the sum still remains the same. Hence, the 1s complement the receiver calculates will also be the same. This means the checksum will verify even if there was transmission error

Explanation:

No, the receiver cannot be confident that there haven't been any bit mistakes.

UDP stands for user data protocol. UDP is defined as a messaging protocol that makes it easier for computers to communicate with one another via a network. A communications protocol called User Datagram Protocol (UDP) is largely used to provide low-latency, loss-tolerant connections between internet-based applications. UDP allows data to be transferred before the receiving party provides an agreement, which speeds up transfers.

A checksum field on UDP allows for the detection of IP header errors; if a checksum error is found, the IP header checksum is recalculated before the IP packet is delivered. Therefore, it cannot ensure that your package will reach the receiver. However, UDP does guarantee that if it is delivered, it will be error-free.

Thus, no, the receiver cannot be confident that there haven't been any bit mistakes.

To learn more about UDP, refer to the link below:

https://brainly.com/question/16984740

#SPJ6

Answer:

The solution code is written in Python 3:

Explanation:

Firstly, we need to import keyword module so that we can use its iskeyword method to check if a string is registered as Python keyword (Line 1).

Next, we create a function checkValidVariable that takes one input string (Line 3). Within the function body, we use iskeyword method to check if the input string is keyword. Please note the "not" operator is used here. So, if iskeyword return True, the True value will be turned to False by the "not" operator or vice versa (Line 4-5).

We test the function by passing two input string (Line 9-10) and we shall get the sample output as follows:

True

False

Answer:

We will ned (4) four tables.

Explanation:

For the given scenario we will have to build a relational database. The database will have four tables i.e. Competation, Collage, Team and student.

For each table the database fields are mention below. Note that foreign keys are mentioned in itallic.

Competition:

Competition_ID, Competition_Name, Competition_Data, Competition_Name _of_Branch, College_ID

Collage:

Collage_ID, Collage_Name, Collage_Contact, Collage_address

Team:

Name, Color, Team_ID, College_ID, Competition_ID

College:

Student_ID, First_Name, Last_Name, Date_of_Birth, Major, Expected_Gradiuation_Date, Collage_ID, Team_ID, Competation_ID

To organize the required data for your firm's case competitions, you would need to create four tables: Competitions, Colleges, Teams, and Students. These tables would store competition details, college contact information, team names and colors, and student demographics, respectively.

Databases organize information into tables that are composed of rows and columns where each row is a record for an entity and each column is an attribute of the entity. For your case competition database, you will need different tables to store related data without redundancy. The goal here is consistency, efficiency, and comprehensibility. Let's break down the tables you would require:

By designing your database with these four tables, you ensure data is grouped logically and related information is linked appropriately to eliminate the need for repeated data entry and promote efficient data management.

Answer:

Disable the network port and install a network card in an expansion slot.

Explanation:

The best and least expensive solution will be to disable the network port, once that is done, you install a network card in the card expansion slot.

This way you can still connect wireless devices to your computer and the network issue will be solved.

Answer: Update the Motherboard Drivers

Explanation:  I would try update the motherboard drivers 1st.