Here are some basic Computer Science questions, can someone answer these?

 \\

CSE 101: Introduction to ComputersFall 2015Homework 4Submission Information:This assignment is due, on paper, within the frst 10 minutes o± classonWednesday, December 2. Please type or writeNEATLY; submissions that cannot be readwillNOTbe graded! Be sure to include your name and SBU ID # onALLpages that you submit.This assignment consists o± 5 questions, and is worth a total o± 15 points.1. Classi±y each o± the ±ollowing algorithms as linear, polynomial (but slower than linear), orexponential. Consider the algorithmic growth relative to N: as N grows, how does thealgorithm's time requirements grow? (3 points)1. Surveying N people in a room to fnd out the political a±fliation o± each.2. Recording each score ±or a round-robin tournament o± N teams (in a round-robintournament, each team must play against every other team)3. Counting how many credit cards (in a collection o± N credit cards) have a negativebalance.2.A particular Turing Machine is defned by the ±ollowing set o± rules:(1, 1, 1, 2, L)(2, b, 0, 3, L)(3, b, 1, 4, R)(4, 0, 1, 5, R)Describe how this Turing Machine will behave on the tape ... b 1 b ...That is, the tape consists o± a single 1 with an infnite number o± blanks on each side. Youmay assume that the machine starts in state 1, with the read/write head positioned over the(single) 1. (3 points)3. Translate the ±ollowing bit pattern into (base 10) numeric dotted-quad IP address (be sure toshow your work!). Use your Web browser to fnd out where this address leads. What Website does this address correspond to? (3 points)00010111 01001100 10001011 100101014. The table below lists a series o± specifc mitigation strategies. For each o± the threatscenarios described below, listallo± the mitigation strategies below that can signifcantlyimprove security. (3 points)Stony Brook University

Attachments:

• 1496024993-CSE 101 Homework 4.pdf