1,181 Answered Questions for the topic computer science

Computer Science

2d

Discrete structures

Consider the following relation R on the set A = {1, 2, 3, 4}: R = {(1, 2), (2, 3), (3, 1), (4, 1)} Find the transitive closure of this relation.
Computer Science C Computer Programming

6d

Need assistance with C code, not running

#include <stdio.h>struct students{ //struct studentchar FirstName; //String to store first namechar secondName; //string to store second nameint ID; //student IDfloat GPA; //student gpachar... more
Computer Science Math Physics

6d

The acceleration due to gravity at the surface of Moon is 1.67 m/s^2. If a stone is thrown upward with a speed of 10 m/s, find

1) the time required to reach the highest point2) the maximum height reached by the stone3) the speed of the stone at t = 8 s4) the displacement of the stone at t = 8 s.
Computer Science Linear Algebra

17d

Question regarding neural networks and least squares using NumPy. How do I start?

You are asked to implement a data-fitting classifier that can predict the label of an input vector. Specifically, in the context of hand-written digit classification, the label is an integer number... more
Computer Science Linear Algebra

17d

Question regarding neural networks and least squares using NumPy. How do I start?

You are asked to implement a data-fitting classifier that can predict the label of an input vector. Specifically, in the context of hand-written digit classification, the label is an integer number... more
Computer Science Computer Engineering

20d

I need help with the following question

Hi, I need help with the following questionProve the program is correct using Hoare logic inference rules where a and b are any two arbitrary numbers.and it is using repeated addition{b>=0} w :=... more
Computer Science Computer Logic

21d

Hoare logic rules

using repeated addition, where a and b are any two arbitrary numbers. Prove the program is correct using Hoare logic inference rules (precondition and postcondition have been given).{b>=0}x:=... more
Computer Science

23d

Wants to know logic how to convert it into code (C lan)

Mr. Sam was born on XX-YY-ZZZZ which happened to be a Saturday. If he died on AA-BB-CCCC, how many birthdays would he celebrate that fall on a Monday?Assume, the year which is divisible by 4 are... more
Computer Science Hoare Logic

24d

Hoare Logic inference

which corresponds to the series 0+1+2+3+ … +n with 0 being the 0th triangular number, 1 being the 1st, 3 being the 2nd, 6 being the 4th and so on. Prove the program is correct using Hoare logic... more
Computer Science Math

26d

Password combinations

Can be 5 or 6-character long passwords. The characters must be from lowercase letters or digits. Each password must contain at most two lowercase-letters and contains no repeated digits. How many... more
Computer Science Cs161

05/25/22

CS161, File List Analysis, Image File Parser, C++

Instructions:Write a program that extracts information from a text file containing information about images on a website.Your program should read from a file called "Images.txt" which will consist... more

05/23/22

Find the expansion base 7 of 67 and Compute (37^15 + 27 × 43) mod 6 using modular arithmetic.

Find the expansion base 7 of 67Compute (3715 + 27 × 43) mod 6 using modular arithmetic (without the use of a calculator). Show all your work.

05/23/22

Check whether the following integers are multiplicative inverses of 3 mod 5.

Check whether the following integers are multiplicative inverses of 3 mod 5. a) 6 b) 7

05/23/22

We want to find 8 in the following list: 2, 6, 5, 1, 11, 18, 8, 0.

We want to find 8 in the following list: 2, 6, 5, 1, 11, 18, 8, 0.a) Can we use Binary Search Algorithm? Justify your answer. b) If a Linear Search Algorithm is used to find 8, how many comparison... more

05/23/22

Look at the following algorithm:

Look at the following algorithm:Input: n: real numberOutput: undisclosed procedure x(n) t := 1 For i := 3 to n t := t + n End-for Return(t) What is returned by the algorithm on the input 7, i.e. n... more

05/23/22

Determine which statements are false or true. Justify your answer.

Determine which statements are false or true. Justify your answer.(a) {0, 1} ∈ {0, {0}, {1}, 1} (b) {a, b, c} ⊂ {a, {a, b}, c, {a, c}, {{{a, b, c}}}} (c) ∅ ⊆ {a, b, c} (d) {1} ∈ {{1}, 0, {{1}}}

05/23/22

Let f(x) = 4x - 7 and g(x) = 6 - 2x where f(x) : R → R, and g(x) : R → R. Find (f ◦ g)(x).

Let f(x) = 4x - 7 and g(x) = 6 - 2x where f(x) : R → R, and g(x) : R → R. Find (f ◦ g)(x).

05/23/22

Determine whether the function f(x) = 8 − 2x^2 , where f(x) : R → R, is bijective and explain why.

Determine whether the function f(x) = 8 − 2x2 , where f(x) : R → R, is bijective and explain why.

05/23/22

For the sets A = {a, b, c, d, e}, B = {a, c, e, g, n}, C = {b, c, d, e, n, w} and the universal set is U = {a, b, c, d, e, g, n, w}. Find

For the sets A = {a, b, c, d, e}, B = {a, c, e, g, n}, C = {b, c, d, e, n, w} and the universal set is U = {a, b, c, d, e, g, n, w}. Find (a) |A ∩ B ∩ C| (b) C¯(c) A¯∪(B − C)

05/23/22

Rewrite the statement ¬∃x (∀y∃tS(x, y, t) ∧ ∃tR(x, t)) so that negations appear only within predicates.

Rewrite the statement ¬∃x (∀y∃tS(x, y, t) ∧ ∃tR(x, t)) so that negations appear only within predicates.
Computer Science Cs161

05/23/22

CS161, C++ using QTCreator, Assignment 8: Stock Statistics

You will be writing various functions to help calculating information about the stock and its performance, as well as to read in data about a stock. These functions need to be able to work on... more

05/17/22

please can you check my answers to these questions regarding RStudio?

Which of the following must be part of each layer in a ggplot2 object? There may be more than one correct answer. limits grouping variable(s) facet tick aesthetic... more

05/16/22

How to find Mod of a large number (Fermat's Little Theorem)

How do you find the modulus of a large number? For example:12345678901234567890^{98765432109876543210} mod 1234567?or 38232701^2897310 mod 11What does this have to do with Fermat's little theorem
Computer Science Computer Programming

05/14/22

Haskell - I am not sure how to use the pairs function with list comprehension to solve this question in Haskell

The function pairs :: [a] -> [(a,a)] returns the list of pairs of adjacent elements of a list. For instance, pairs [3,4,5,6] = [(3,4),(4,5),(5,6)]. Use the function pairs and a list... more

Still looking for help? Get the right answer, fast.

Ask a question for free

Get a free answer to a quick problem.
Most questions answered within 4 hours.

OR

Find an Online Tutor Now

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.