CS 108 * We aren't endorsed by this school

CS 108

  • Average Course Rating (from 2 Students)

    4.5/5
    Overall Rating Breakdown
    • 2 Advice
    • 5
      50%
    • 4
      50%
    • 3
      0%
    • 2
      0%
    • 1
      0%

  • Course Difficulty Rating

    • Easy 0%

    • Medium 100%

    • Hard 0%

  • Top Course Tags

    A Few Big Assignments

    Go to Office Hours

    Background Knowledge Expected

* We aren't endorsed by this school

CS 108 Questions & Answers

CS 108 Flashcards

CS 108 Advice

CS 108 Documents

Showing 1 to 30 of 101

Sort by:
{[$select.selected.label]}
  • 1 pages CS108_HW4
    • CS108_HW4
    • San Diego State
    • CS 108 - Fall 2014
    • HW#4 SPECS CS108, FALL 2014 Create a "Rectangle" class that defines a rectangle as follows: Properties (Instance Variables), can assume all are "public": x represents x coordinate of its upper-left point, can assume "double" y represents y coordinate of i
    • Register Now

    CS108_HW4

  • 17 pages CS108_HW
    • CS108_HW
    • San Diego State
    • CS 108 - Fall 2014
    • -HW#1 SPECS - Write a program that performs the following tasks. (You can either use non-generics ArrayLists, or generics ArrayLists.) * The program should ask the user to input String items, one at a time, until the user types STOP. For each inputted dat
    • Register Now

    CS108_HW

  • 166 pages CS108_Lectures
    • CS108_Lectures
    • San Diego State
    • CS 108 - Fall 2014
    • CS108, FALL 2014 LECTURE NOTES WEEKS 1-3 - -* Read syllabus. * Recap of CS107: arrays, etc. * Intro, Summary, of CS108. -MULTI-DIMENSIONAL ARRAYS = import java.util.*; public class prog1 cfw_ public static void main(String args[]) cfw_ Scanner scan = new
    • Register Now

    CS108_Lectures

  • 1 pages QueueInts.java
    • QueueInts.java
    • San Diego State
    • CS 108 - Fall 2009
    • import java.util.*; public class QueueIntscfw_ public static void main(String[] args) cfw_ PriorityQueue<Integer> q = new PriorityQueue<>(); String expression = "(2+4)-8 * (3-1)"; String symbols = "()+-*/% "; for (int i = 0; i < expression.length(); i+) c
    • Register Now

    QueueInts.java

  • 2 pages prog1.s
    • prog1.s
    • San Diego State
    • CS 108 - Fall 2009
    • *-* Programmer: Ruth Wu * Class Account: masc0809 * Assignment or Title: Assignment 1 * Filename: prog1.s * Date completed: March 8, 2016 *-* Problem statement: Print a number in Latin * Input: One number * Output: The number in latin * Error conditions t
    • Register Now

    prog1.s

  • 8 pages CS108 Final Practice - Exam A_SOLUTIONS
    • CS108 Final Practice - Exam A_SOLUTIONS
    • San Diego State
    • CS 108 - Fall 2009
    • Name: RedID: CS108 Final Practice SOLUTIONS Exam A Section A Multiple Choice 1) The performance of an algorithm is most closely related to what? a) The total number of element visits b) The total number of elements c) The type of elements d) The number of
    • Register Now

    CS108 Final Practice - Exam A_SOLUTIONS

  • 5 pages Assignment 2
    • Assignment 2
    • San Diego State
    • CS 108 - Fall 2009
    • Assignment 2 The Bloom Filter This assignment is due Monday April 11th at Midnight (at the end of the day). The Bloom filter is a rapid way of determining whether something is in a hash. Named after its inventor, Burton Howard Bloom, it provides rapid loo
    • Register Now

    Assignment 2

  • 7 pages CS 108 Final Practice Arrays KEY
    • CS 108 Final Practice Arrays KEY
    • San Diego State
    • CS 108 - Fall 2009
    • CS 108 Final Practice Test Arrays and ArrayList There are gaps in the numbering. 2. What does the following statement do? double[] array1 = new double[10]; a. b. c. d. Declares array1 to be a reference to an array of double values Creates an instance of a
    • Register Now

    CS 108 Final Practice Arrays KEY

  • 3 pages BigDataInstructions
    • BigDataInstructions
    • San Diego State
    • CS 108 - Fall 2009
    • Project instructions for Eclipse Make new Java project called QuakeWatcher Using Explorer/Finder navigate to the folder where the project is and at the level where bin and src folders are, make a new folder called lib and copy the simpleearthquake.jar fil
    • Register Now

    BigDataInstructions

  • 2 pages Assignment 3
    • Assignment 3
    • San Diego State
    • CS 108 - Fall 2009
    • Assignment 3 Country look-up from IP address. This assignment is due at Midnight on Monday May 2nd. Every machine connected to the internet has an IP address - it is a unique address that is used to locate the machine. IP addresses are provided by the Int
    • Register Now

    Assignment 3

  • 4 pages CS108_Lab8_F15
    • CS108_Lab8_F15
    • San Diego State
    • CS 108 - Fall 2009
    • Name_ CS 108 Due: 08-Dec-2015 60 points Lab Assignment 8 Objectives 1) Examine a running algorithm to measure its run time and compare the outcome with its expected growth rate using Big O notation. 2) Use a classic search algorithms represented by an arr
    • Register Now

    CS108_Lab8_F15

  • 5 pages Problem Set 1 Solutions

    Problem Set 1 Solutions

  • 2 pages Problem Set 2
    • Problem Set 2
    • San Diego State
    • CS 108 - Fall 2009
    • Problem Set 2: 2D Kinematics 1) A toy car is launched off of a ramp. It starts at rest, 5 m away from the edge of the ramp, and accelerates at a = 2 m/s2 up until the moment it launches off of the ramp (even while its driving up the ramp). a) What is the
    • Register Now

    Problem Set 2

  • 3 pages Assignment 1
    • Assignment 1
    • San Diego State
    • CS 108 - Fall 2009
    • Introduction: We use Java primitives to hold data, but the problem with the primitives is that they are limited. 63 18 These are quite big numbers: 2 -1 is 9,223,372,036,854,775,807, nine quintillion, or 910 , but sometimes we need even bigger numbers! Fo
    • Register Now

    Assignment 1

  • 5 pages CS108_Midterm_Practice_Part_B
    • CS108_Midterm_Practice_Part_B
    • San Diego State
    • CS 108 - Fall 2009
    • Section B. For Questions on this page, write your answer in the BOX provided. (4 pts. each) 33. In the following code, assume that inputFile references a Scanner object that has been successfully used to open a file: double totalIncome = 0.0; while (input
    • Register Now

    CS108_Midterm_Practice_Part_B

  • 19 pages 310 tests with answers
    • 310 tests with answers
    • San Diego State
    • CS 108 - Fall 2009
    • C8310 Fall 2012 Midterm Exam #2 cfw_50 points Exam is closed book; no notes, texts or demonic equipment allowed 1. (24 pts.) Give the best, average, and worst complexities ( O or O ) for the sort algorithms in the table below, giving the lightest possible
    • Register Now

    310 tests with answers

  • 1 pages BinarySearch.java
    • BinarySearch.java
    • San Diego State
    • CS 108 - Fall 2009
    • public class BinarySearch cfw_ /* Use binary search to find the key in the list */ public static int binarySearch(int[] list, int key) cfw_ int low = 0; int high = list.length - 1; while (high >= low) cfw_ int mid = (low + high) / 2; if (key < list[mid])
    • Register Now

    BinarySearch.java

  • 1 pages CheckingAccount.java
    • CheckingAccount.java
    • San Diego State
    • CS 108 - Fall 2009
    • package prog5; public class CheckingAccount extends Account cfw_ private double rate; / number of checks (default value 100) / constructors public CheckingAccount() cfw_ super(); public CheckingAccount(String name, double balance, double rate) cfw_ super
    • Register Now

    CheckingAccount.java

  • 1 pages TestLinearSearch.java
    • TestLinearSearch.java
    • San Diego State
    • CS 108 - Fall 2009
    • / TestLinearSearch.java: Search for a number in public class TestLinearSearch cfw_ /* Main method */ public static void main(String[] args) cfw_ int[] list = cfw_1, 4, 4, 2, 5, -3, 6, 2; int i = LinearSearch.linearSearch(list, 4); int j = LinearSearch.lin
    • Register Now

    TestLinearSearch.java

  • 1 pages QueueOfIntegers.java

    QueueOfIntegers.java

  • 1 pages MyStack.java
    • MyStack.java
    • San Diego State
    • CS 108 - Fall 2009
    • import java.util.ArrayList; public class MyStack cfw_ private ArrayList<Object> list = new ArrayList<>(); public boolean isEmpty() cfw_ return list.isEmpty(); public int getSize() cfw_ return list.size(); public Object peek() cfw_ return list.get(getSiz
    • Register Now

    MyStack.java

  • 1 pages Prog6d.java
    • Prog6d.java
    • San Diego State
    • CS 108 - Fall 2009
    • /* * Prog6d * @author Tyler Kistler * */ public class RecursiveFactorial cfw_ private static final int N = 5; public static int factorial(int N) cfw_ if (N = 0) cfw_ System.out.println("factorial(0) = factorial(1)"); return 1; System.out.printf("factoria
    • Register Now

    Prog6d.java

  • 1 pages TestArrayAndLinkedList.java
    • TestArrayAndLinkedList.java
    • San Diego State
    • CS 108 - Fall 2009
    • import java.util.*; public class TestArrayAndLinkedList cfw_ public static void main(String[] args) cfw_ List<Integer> arrayList = new ArrayList<>(); arrayList.add(1); / 1 is autoboxed to new Integer(1) arrayList.add(2); arrayList.add(3); arrayList.add(1)
    • Register Now

    TestArrayAndLinkedList.java

  • 1 pages Prog6b.java
    • Prog6b.java
    • San Diego State
    • CS 108 - Fall 2009
    • /* * Prog6b * @author Tyler Kistler * */ public class RecursiveReverse cfw_ public static int reverseDigits(int num) cfw_ if(num < 1) cfw_ return 0; int temp = num % 10; num = (num - temp)/10; System.out.print(temp); return reverseDigits(num); public st
    • Register Now

    Prog6b.java

  • 1 pages IntegerExpressions.java
    • IntegerExpressions.java
    • San Diego State
    • CS 108 - Fall 2009
    • public class IntegerExpressions cfw_ public static void main(String[] args) cfw_ StackOfIntegers st = new StackOfIntegers(); String expression = "(2+4)-8 * (3-1)"; /String result = "; String symbols = "()+-*/% "; for (int i = 0; i < expression.length();
    • Register Now

    IntegerExpressions.java

  • 2 pages Problem Set 3
    • Problem Set 3
    • San Diego State
    • CS 108 - Fall 2009
    • Newtons Laws 1) Say two blocks are stacked on top of each other, with static friction between the two blocks. If the lower block is pushed to the right, what is the direction of the static friction force applied to the top block? You may want to draw free
    • Register Now

    Problem Set 3

  • 16 pages CS108_Exams
    • CS108_Exams
    • San Diego State
    • CS 108 - Fall 2014
    • - MIDTERM #1 STUDY SHEET CS108, FALL 2014 - Note: answers to the sample problems are included at the end of this Study Sheet. Note: this practice exam's questions are similar to, but NOT identical to, the actual exam's questions. * For Midterm#1, you will
    • Register Now

    CS108_Exams

  • 1 pages CS108_Wk2_Lec2
    • CS108_Wk2_Lec2
    • San Diego State
    • CS 108 - Fall 2014
    • CS108 Fall 2014 Week 2: Lecture 2: Recursion and factorials Normal Approach: public class p1 cfw_ public static void main(String args[]) cfw_ System.out.println(fact(5); /120 System.out.println(fact(10); /3628800 System.out.println(fact(11); /39916800 /m
    • Register Now

    CS108_Wk2_Lec2

  • 4 pages CS108_Wk9_Lec1

    CS108_Wk9_Lec1

  • 2 pages Prog2c.java
    • Prog2c.java
    • San Diego State
    • Intermediate Programming(Java)
    • CS 108 - Spring 2017
    • import java.util.Scanner; import java.io.IOException; import java.io.PrintWriter; public class Prog2c cfw_ /*create three CellPhone objects and print the lowest price one */ public static void main(String[] args) cfw_ CellPhone cellp1 = initCellPhone(); C
    • Register Now

    Prog2c.java

CS 108 Questions & Answers

Showing 1 to 8 of 8

View all

CS 108 Advice

Showing 1 to 2 of 2

View all
    • Profile picture
    Jul 31, 2017
    | Would recommend.

    Not too easy. Not too difficult.

    Course Overview:

    He is very transparent about his tests which I appreciated.

    Course highlights:

    He gave very vivid examples of programs.

    Hours per week:

    6-8 hours

    Advice for students:

    Make sure you practice the code, writing it in hand and on the computer.

    • Fall 2017
    • BAJIC
    • Yes
    • Background Knowledge Expected Go to Office Hours A Few Big Assignments
    • Profile picture
    Sep 12, 2016
    | Would highly recommend.

    Not too easy. Not too difficult.

    Course Overview:

    It is more challenging than CS 107, but enjoyable none the less.

    Course highlights:

    We learned a lot about OOP, and took programming to a deeper level.

    Hours per week:

    3-5 hours

    Advice for students:

    Do not slack off. There will be some very challenging project, but go to office hours, start early, and you will be fine.

    • Fall 2015
    • KRAFT
    • Yes
    • Go to Office Hours Many Small Assignments A Few Big Assignments
Back to Department

Related Courses

Ask a homework question - tutors are online