# Computer Science

## Perform the following operations. Express your answer in Hexadecimal notation NOT( NOT(0xf00) OR NOT (0x084) ) 0xcdab + 0x4321

Perform the following operations. Express your answer in Hexadecimal notation NOT( NOT(0xf00) OR NOT (0x084) ) 0xcdab + 0x4321   EXPERT ANSWER To perform the given operations and express the answers in hexadecimal notation, let’s calculate each step: NOT(NOT(0xf00) OR NOT(0x084)): First, let’s find the negation of each operand: NOT(0xf00) = 0x0ff NOT(0x084) = 0xf7b …

## The above Round Robin policy does not care about the process priority. In your homework, we will update our previous emulator to support preemptive Priotity algorithms.

The above Round Robin policy does not care about the process priority. In your homework, we will update our previous emulator to support preemptive Priotity algorithms.To achieve this goal, you have to complete these requirements:1. Include an additional priority field as the third column in the input.txt asdescribed below.2 40 7 12 4 24 1 …

## You have network distributed into 10 sites and each site need at least a 100 computers, as a network you are requested to design the IP addresses by using private address. Answer the following: 1- What is the address class you will be used and the subnet mask 2- List the network addresses 3-List the range of computer addresses 4-List the broadcast address for each network

EXPERT ANSWER Answer:1. The default class of given address is B. The reason behind that is Class B IP Addresses range from 128.0.x.x to 191.255.x.x.2. The subnet mask is 255.255.0.0 because the default subnet mask for Class B is 255.255.x.x.3. The custom subnet mask is 255.255.2244. Total number of subnets needed are 2.

## Implement the ID3 algorithm in C/C++ or Java. The program should ask the user to enter the name of the text file containing set of examples (training set) and other related data and should display the decision tree on screen as described below.

Implement the ID3 algorithm in C/C++ or Java. The program should ask the user to enter the name of the text file containing set of examples (training set) and other related data and should display the decision tree on screen as described below. Input text file format n //an integer representing number of attributes A1 m1//string …

## Q1. Given that totient( 527 ) is 480 , what is 526 ∧ 959(mod527) ? Q2. You agreed to use a Caesar cipher with a key of k=5 with a friend. While sitting in a group, the friend hands you over a message that says “QNGWFWD”. Decrypt the message? Q3. Suppose you actually forgot the key. How many decryption computations of

EXPERT ANSWER Q.2: You agreed to use a Caesar cipher with a key of k = 5 with a friend. While sitting in a group, the friend hands you over a message that says “QNGWFWD”. Decrypt the message? Here, the encrypted text is “QNGWFWD” and value of the key is 5. So, we need to …

## Implement the Linked List using head pointer only (you are not allowed to use tail pointer). Interface (abstract class) of LinkedList class is given below. Your task is to provide the complete implementation for this question (a child class having name myLL is required, this myLL class will provide the complete implementation of the LinkedList class)

C++ Implement the Linked List using head pointer only (you are not allowed to use tail pointer). Interface (abstract class) of LinkedList class is given below. Your task is to provide the complete implementation for this question (a child class having name myLL is required, this myLL class will provide the complete implementation of the …

## There are N cities, and you want to send trucks from your factory (in city 1) to the other cities, the taller the better. There are M two-way roads connecting pairs of cities. Each road has a maximum truck height, determined by bridges and tunnels along the way. For each city V , you want to work out the maximum height of a truck that can travel from city 1 to city V . You do not care about the length of the route, just the best height. Input Format The first line is “N M “, where N is the number cities, and M is the number of roads. Each of the next M lines is ” UVH ′′ . It describes a road between cities U and V , with max truck height H . Constraints All inputs are positive integers. 1≤N≤50000 1≤M≤200000 1≤U≤N 1≤V≤N 1≤H≤1000 ​

Sample Input 0 4 3 1 2 72 1 4 96 2 4 80 Sample Output 0 80 0 96 Explanation 0 The best path to city 2 is via city 4. There is no path to city 3. Sample Input 1 5 6 1 2 70 1 3 75 2 3 80 2 5 …