Search for

Filter By

Rating

Price in $

Computer Science

Here are the best study resources to pass Computer Science. Find Computer Science study guides, notes, assignments, and much more.

Explore Computer Science by Category

EXAM (2986) QUESTIONS & ANSWERS (1696) eBook[PDF] (425) STUDY GUIDE (285) TEST BANKS (185) EXAM REVIEW (173) SOLUTIONS MANUAL (170) Research Paper (96) EXAM PROCTORED (91) AQA QUESTION and MARK SCHEMES (81) FINAL EXAM (78) EXAM/TEST TEMPLATE (74) ESSAY (72) AQA (61) AQA Question Papers (48) MARK SCHEMES (46) Class Notes (42) A-Level Question Paper (40) Summary (37) Edexcel (37) Lab Report (32) QUESTIONS and ANSWERS (31) Quiz (31) Study Notes (29)

Browse all categories →

Computer Science > QUESTIONS & ANSWERS > Computer Science Engineering & Technology Software engineering another form of tree'. Our version will not quite be a quadtree for a few reasons that are mostly technical and not important, but the functionality... Share Question (All)

Computer Science Engineering & Technology Software engineering another form of tree'. Our version will not quite be a quadtree for a few reasons that are mostly technical and not important, but the functionality... Share Question

Question /** i need the code to the functions below please * * * This is the program file where you will implement your solution for * assignment 2. Please make sure you read through this...

$8.00 0 4 pages Read more

Computer Science > Research Paper > Georgia Institute Of Technology - CS 7638kalman_Filter2D.py (All)

Georgia Institute Of Technology - CS 7638kalman_Filter2D.py

#!/usr/bin/env python # Fill in the matrices P, F, H, R and I at the bottom # # This question requires NO CODING, just fill in the # matrices where indicated. Please do not delete or modify # any...

$6.00 0 4 pages Read more

Computer Science > STUDY GUIDE > Georgia Institute Of Technology - CS 7638studentMain2.py (All)

Georgia Institute Of Technology - CS 7638studentMain2.py

# ---------- # Part Two # # Now we'll make the scenario a bit more realistic. Now Traxbot's # sensor measurements are a bit noisy (though its motions are still # completetly noise-free and it sti...

$6.00 0 5 pages Read more

Computer Science > STUDY GUIDE > Georgia Institute Of Technology - CS 7638submit.py (All)

Georgia Institute Of Technology - CS 7638submit.py

###################################################################### # This file copyright the Georgia Institute of Technology # # Permission is given to students to use or modify this file (only...

$5.00 0 2 pages Read more

Computer Science > STUDY GUIDE > Georgia Institute Of Technology - CS 7638PDI-Control.py (All)

Georgia Institute Of Technology - CS 7638PDI-Control.py

# ----------- # User Instructions # # Implement a P controller by running 100 iterations # of robot motion. The steering angle should be set # by the parameter tau so that: # # steering = -tau_...

$7.00 0 3 pages Read more

Computer Science > STUDY GUIDE > University of Waterloo - CS 21soln-final (All)

University of Waterloo - CS 21soln-final

CS 21 Decidability and Tractability Winter 2014 Final Exam Solutions Posted: March 19 If you have not turned in the final, obviously you should not consult these solutions. 1. (a) L is in PSPACE v...

$7.00 0 5 pages Read more

Computer Science > QUESTIONS & ANSWERS > University of California, Santa Cruz - CSE 100Final Solution (All)

University of California, Santa Cruz - CSE 100Final Solution

Question 1: [10 points] Match the following functions to one or more layers of the TCP/IP protocol stack: (a) End-to-end error detection and correction: Transport (b) Flow control: Transport [dep...

$7.00 0 13 pages Read more

Computer Science > QUESTIONS & ANSWERS > University of Texas, Dallas - CS 6360MIDTERM 2016. (All)

University of Texas, Dallas - CS 6360MIDTERM 2016.

12/12/2016 Review Test Submission: MIDTERM – CS 6360.501 Database... https://elearning.utdallas.edu/webapps/assessment/review/review.jsp?attempt_id=_9834589_1&course_id=_86934_1&content_id=_1308088...

$7.00 0 14 pages Read more

Computer Science > STUDY GUIDE > Stanford University - CS 221HW 2 - Solutions (All)

Stanford University - CS 221HW 2 - Solutions

Sentiment Analysis – CS 221 SUNet ID: ylundia Name: Yash Lundia Problem 1: Building Intuition a. Given, Review = x, Classified label = y Training Data: 1 1 2 2 3 3 4 4 1 1 1 1 x pretty b...

$6.00 0 12 pages Read more

Computer Science > STUDY GUIDE > (PYTHON)Credit card number validation ProgramCredit card numbers f. (All)

(PYTHON)Credit card number validation ProgramCredit card numbers f.

(PYTHON)Credit card number validation Program Credit card numbers follow certain patterns: It must have between 13 and 16 digits, and the number must start with: 4 for Visa cards 5 for MasterCard...

$7.00 0 6 pages Read more

Computer Science > QUESTIONS & ANSWERS > Exam2 solution ECE 604 (All)

Exam2 solution ECE 604

Purdue University - Exam2 solution

$6.00 0 7 pages Read more

Computer Science > QUESTIONS & ANSWERS > Problem_Set_3_Q5 Georgia Institute Of Technology - CS 8803-O01 (All)

Problem_Set_3_Q5 Georgia Institute Of Technology - CS 8803-O01

Question5 : Write a function in the class robot called sense() that takes self as input and returns a list, Z, of the four bearings* to the 4 different landmarks. you will his. Bearing is defined in...

$6.00 0 3 pages Read more

Computer Science > Study Notes > Georgia Institute Of Technology - CS 8803-O0103-ParticleFilters (All)

Georgia Institute Of Technology - CS 8803-O0103-ParticleFilters

06/02/2019 03-ParticleFilters file:///D:/WorkBench/Finder/AI4R/03-ParticleFilters/03-ParticleFilters.html 1/37 Particle Filters * easiest to program * most flexible State Space * One of the bigg...

$7.00 0 37 pages Read more

Computer Science > STUDY GUIDE > Georgia Institute Of Technology - CS 7638robot.py (All)

Georgia Institute Of Technology - CS 7638robot.py

from math import * import random # helper function to map all angles onto [-pi, pi] def angle_trunc(a): while a < 0.0: a += pi * 2 return ((a + pi) % (pi * 2)) - pi class robot:

$6.00 0 2 pages Read more

Computer Science > STUDY GUIDE > Georgia Institute Of Technology - CS 7638PS0.py (All)

Georgia Institute Of Technology - CS 7638PS0.py

from typing import Dict, Tuple, List class Quiz1: def __init__(self): ''' Initialize the account balance to zero. ''' self.balance = 0 def deposit(self, amount: int): ''' :param amount: the a...

$5.00 0 4 pages Read more

Computer Science > STUDY GUIDE > Georgia Institute Of Technology - CS 7638matrix.py (All)

Georgia Institute Of Technology - CS 7638matrix.py

from math import * class matrix: # implements basic operations of a matrix class # ------------ # # initialization - can be called with an initial matrix # def __init__(self, value=[[]]): self...

$6.00 0 5 pages Read more

Computer Science > STUDY GUIDE > Irvine Valley College - CS 41DS_program2. (All)

Irvine Valley College - CS 41DS_program2.

#include <iostream> #include <string> #include <cstdlib> using namespace std; class Node { public: string name; double weight; Node *next; Node *prev

$6.00 0 3 pages Read more

Computer Science > STUDY GUIDE > Irvine Valley College - CS 41Program 2. (All)

Irvine Valley College - CS 41Program 2.

#include <iostream> #include <cstdlib> #include <ctime> using namespace std; class DLLNode { public: int weightdata; string namedata; DLLNode *weightptr; DLLNode *nameptr; // // Constructo...

$6.00 0 2 pages Read more

Computer Science > EXAM > Arizona State University - IFT 259Final Exam (Proctored)4 (All)

Arizona State University - IFT 259Final Exam (Proctored)4

Question 31 Not yet answered Marked out of 1.00 Assuming a data set with 2,306 training outcomes of which 895 are negatives, what is the Entropy? Round your answer to the nearest thousandths pla...

$5.00 0 6 pages Read more

Computer Science > SOLUTIONS MANUAL > Illinois State University - CS 473hw8-solutions (All)

Illinois State University - CS 473hw8-solutions

CS 473 Homework 8 Solutions Fall 2016 1. Suppose we are given an n × n grid, some of whose cells are marked; the grid is represented by an array M[1..n, 1..n] of booleans, where M[i, j] = True if an...