CSE 143X * We aren't endorsed by this school

CSE 143X COMPUTER PROGRAMMING II

  • 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 50%

    • Hard 50%

  • Top Course Tags

    Many Small Assignments

    Always Do the Reading

    Competitive Classmates

* We aren't endorsed by this school

COMPUTER PROGRAMMING II Questions & Answers

COMPUTER PROGRAMMING II Flashcards

COMPUTER PROGRAMMING II Advice

COMPUTER PROGRAMMING II Documents

Showing 1 to 27 of 27

Sort by:
{[$select.selected.label]}
  • 5 pages Lecture Notes on Arrays, And Producing An External Output File
    • Lecture Notes on Arrays, And Producing An External Output File
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • This assignment will give you practice with input files, arrays, and producing an external output file. You are going to write a program that processes an input file of data for a personality test known as the Keirsey Temperament Sorter. The Keirsey perso
    • Register Now

    Lecture Notes on Arrays, And Producing An External Output File

  • 2 pages GroceryList.cpp
    • GroceryList.cpp
    • University of Washington
    • CSE 143X - Fall 2015
    • #include "GroceryList.h" GroceryList:GroceryList() cfw_ size = 0; /list = new GroceryItemOrder[CAPACITY]; for (int i = 0; i < CAPACITY; i+) cfw_ list[i] = GroceryItemOrder(); /* list[i].setItemName(NULL); list[i].setPrice(0.0); list[i].setQuantity(0); */
    • Register Now

    GroceryList.cpp

  • 2 pages GroceryItemOrder.cpp
    • GroceryItemOrder.cpp
    • University of Washington
    • CSE 143X - Fall 2015
    • #include "GroceryItemOrder.h" /Default Constructor of the GroceryItemOrder class GroceryItemOrder:GroceryItemOrder() cfw_ strcpy(this->name, "); this->quantity = 0; this->price = 0.0; /This function take 3 parameters and set it to it's fields. GroceryIte
    • Register Now

    GroceryItemOrder.cpp

  • 1 pages test.cpp
    • test.cpp
    • University of Washington
    • CSE 143X - Fall 2015
    • #include <cstdlib> #include <fstream> #include <iostream> #include <string> using namespace std; void date2016(int); int main() cfw_ int month, day_of_month, days_after; fstream fin; fin.open("sample.txt"); if (fin.fail() cfw_ cout < "Error Open File!" <
    • Register Now

    test.cpp

  • 2 pages test.cpp
    • test.cpp
    • University of Washington
    • CSE 143X - Fall 2015
    • #include "calculator.h" date2016:date2016() cfw_ d = 1; m = 1; date2016:date2016(int dd) cfw_ int counter = 0; if (dd > 1 & dd < 365) cfw_ while (counter < 12) cfw_ dd = dd - DAYS_IN_MONTH[counter]; if (dd < DAYS_IN_MONTH[counter+1])cfw_ d = dd; m = coun
    • Register Now

    test.cpp

  • 2 pages calculator.cpp
    • calculator.cpp
    • University of Washington
    • CSE 143X - Fall 2015
    • /Class and function Definition #include "calculator.h" /set default constructor to day = 1 and month = 1 date2016:date2016() cfw_ d = 1; m = 1; /The overload constructor compute the day and month of year from given input day date2016:date2016(int dd) cfw
    • Register Now

    calculator.cpp

  • 1 pages main.cpp
    • main.cpp
    • University of Washington
    • CSE 143X - Fall 2015
    • / / / / / / Hao Le TCES 203 Assignment #4 10/31/2016 This program will compute the next day and month of the year 2016 from user input file that includes current day and month and days after. /*NOTE: Some of my outputs are different from the assignment be
    • Register Now

    main.cpp

  • 3 pages main.cpp
    • main.cpp
    • University of Washington
    • CSE 143X - Fall 2015
    • /* *Name: Hao Le *Intructor: Samah Saeed *Date: 10/15/16 *TCES 203 *Assignment #5 *This assignment we created the GroceryList that represent a person's list of order items * and another class called GroceryItemOrder that represents a request purchase a pa
    • Register Now

    main.cpp

  • 2 pages calculator.cpp
    • calculator.cpp
    • University of Washington
    • CSE 143X - Fall 2015
    • /Class and function Definition #include "calculator.h" /set the default month = 1 and day = 1 date2016:date2016() cfw_ d = 1; m = 1; /The overload constructor compute the day and month of year from given input day date2016:date2016(int dd) cfw_ int count
    • Register Now

    calculator.cpp

  • 1 pages GroceryItemOrder.h
    • GroceryItemOrder.h
    • University of Washington
    • CSE 143X - Fall 2015
    • / The header file of the GroceryItemOrder class / Includes all the function and constructor phototypes #ifndef GroceryItemOrder_h #define GroceryItemOrder_h #include<iostream> #include<cstring> using namespace std; class GroceryItemOrder cfw_ private: cha
    • Register Now

    GroceryItemOrder.h

  • 1 pages sample
    • sample
    • University of Washington
    • CSE 143X - Fall 2015
    • 1 1 201 1 31 2 1 01 1 32 4 5 02 1 281 1 596 10 100 7 20 300 12 20 2
    • Register Now

    sample

  • 1 pages sample
    • sample
    • University of Washington
    • CSE 143X - Fall 2015
    • 1 1 201 1 31 2 1 01 1 32 4 5 02 1 281 1 596 10 100 7 20 300 12 20 2 12 20 15
    • Register Now

    sample

  • 1 pages main.cpp
    • main.cpp
    • University of Washington
    • CSE 143X - Fall 2015
    • / / / / Assignment #4 This program will compute the next day and month of the year 2016 from user input file that includes current day and month and days after. /*NOTE: Some of my outputs are different from the assignment because the output of the date an
    • Register Now

    main.cpp

  • 1 pages Exam on Primitive types int, double, char, boolean
    • Exam on Primitive types int, double, char, boolean
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • CSE143X Midterm Cheat Sheet Primitive types: int, double, char, boolean Math Method Description - Math.abs(n) absolute value of n Math.max(x, y) maximum of x and y Math.min(x, y) minimum of x and y String Method Description - charAt(index) character at a
    • Register Now

    Exam on Primitive types int, double, char, boolean

  • 10 pages CSE143X Sample Final
    • CSE143X Sample Final
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • CSE143X Sample Final, Autumn 2016 1. Binary Tree Traversals, 6 points. / +-+ | 3 | +-+ +-+ | 0 | +-+ Consider the following tree. \ / / / +-+ | 2 | +-+ \ \ +-+ | 9 | +-+ \ +-+ | 4 | +-+ / / +-+ | 1 | +-+ / / +-+ | 6 | +-+ \ \ \ +-+ | 7 | +-+ \ +-+ | 5 | +
    • Register Now

    CSE143X Sample Final

  • 3 pages Exam Solutions on Course Title
    • Exam Solutions on Course Title
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • Key to CSE143X Midterm, Fall 2013 1. handout #9 Expression Value -3 * (5 - 2) - 3 - 2 * 2 2 4 * 7 % 8 + 132 % 10 + 3 % 4 9 27 / 5 / 2 + 3.4 * 2 - 1.1 * 2 6.6 9 + 9 + "9 + 9" + 9 + 9 "189 + 999" 19 / 2 / 2.0 + 2.5 * 6 / 2 + 0.5 * 4 14.0 2. Parameter Myster
    • Register Now

    Exam Solutions on Course Title

  • 1 pages Lecture Notes on Arrays & Files
    • Lecture Notes on Arrays & Files
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • SE143X Program Example: Arrays & Files handout #6 Input file section.txt -1111111111 1110101101 1011110111 0110110111 1101101000 1110010001 1010010011 1010100101 Output file section.out - 3 3 3 3 3 3 2 0 0 0 3 3 3 0 3 0 3 3 0 2 3 0 33330320033033033233033
    • Register Now

    Lecture Notes on Arrays & Files

  • 1 pages Lecture Notes on Input file section
    • Lecture Notes on Input file section
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • CSE143X Program Example: Arrays & Files handout #6 Input file section.txt -1111111111 1110101101 1011110111 0110110111 1101101000 1110010001 1010010011 1010100101 Output file section.out - 3 3 3 3 3 3 2 0 0 0 3 3 3 0 3 0 3 3 0 2 3 0 3333032003303303323303
    • Register Now

    Lecture Notes on Input file section

  • 5 pages Lecture Notes on Linked Lists
    • Lecture Notes on Linked Lists
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • his assignment will give you practice with linked lists. You are to write a class called AssassinManager that allows a client to manage a game of assassin. Each person playing assassin has a particular target that he/she is trying to assassinate. One of t
    • Register Now

    Lecture Notes on Linked Lists

  • 3 pages Lecture Notes on Loops, Value Parameters, And Graphics
    • Lecture Notes on Loops, Value Parameters, And Graphics
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • This assignment will give you practice with for loops, value parameters, and graphics. You will be using a special class called DrawingPanel written by Stuart and his coauthor Marty Stepp. Part A: Doodle.java (2 points) For the first part of the assignmen
    • Register Now

    Lecture Notes on Loops, Value Parameters, And Graphics

  • 3 pages Lecture Notes on Static Methods And Println Statements
    • Lecture Notes on Static Methods And Println Statements
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • CSE143XComputer Programming I & II Programming Assignment #1 due: Monday, 9/30/13, 11 pm Your first program will require the use of static methods and println statements. This assignment is worth 10 points instead of the normal 20 points. You are going to
    • Register Now

    Lecture Notes on Static Methods And Println Statements

  • 7 pages Lecture Notes on Defining Classes
    • Lecture Notes on Defining Classes
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • This assignment will give you practice with defining classes. It is worth 18 points instead of the normal 20 points. You are to write a set of classes that define the behavior of certain animals. You will be given a program that runs a simulation of a wor
    • Register Now

    Lecture Notes on Defining Classes

  • 5 pages Lecture Notes on If-Else Simulation
    • Lecture Notes on If-Else Simulation
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • CSE143X Sample Midterm handout #7 1. Expressions, 10 points. For each expression in the left-hand column, indicate its value in the right-hand column. Be sure to list a constant of appropriate type (e.g., 7.0 rather than 7 for a double, Strings in quotes)
    • Register Now

    Lecture Notes on If-Else Simulation

  • 4 pages Lecture Notes on While Loops, Strings, And Pseudorandom Numbers
    • Lecture Notes on While Loops, Strings, And Pseudorandom Numbers
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • This assignment will give you practice with if/else constructs, while loops, strings, and pseudorandom numbers. You are going to write a program that allows the user to play the game Bagels, a variant of the board game Mastermind. In this game, the comput
    • Register Now

    Lecture Notes on While Loops, Strings, And Pseudorandom Numbers

  • 8 pages C1501_hints_activities_2016
    • C1501_hints_activities_2016
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • COS1501/Hints & Activities HINTS AND ACTIVITIES Theoretical Computer Science 1 COS1501 2 COS1501/105 Dear Student, This document provides hints and activities that will help you to avoid making common errors when solving questions. More hints are provided
    • Register Now

    C1501_hints_activities_2016

  • 2 pages cse143Xsyllabus
    • cse143Xsyllabus
    • University of Washington
    • COMPUTER PROGRAMMING II
    • CSE 143X - Fall 2013
    • CSE 143X: Accelerated Computer Programming I/II Syllabus, Autumn 2015 Information At-A-Glance Instructor: Name: E-mail: Office: Office Hours: Adam Blank [email protected] CSE 444 Mon: 4:00pm 5:30pm Tue: 10:30am 11:30am Fri: 11:00am 12:00pm Course Website: L
    • Register Now

    cse143Xsyllabus

  • 1 pages GroceryList.h
    • GroceryList.h
    • University of Washington
    • CSE 143X - Fall 2015
    • #ifndef GroceryList_h #define GroceryList_h #include"GroceryItemOrder.h" const int CAPACITY = 10; class GroceryList: public GroceryItemOrder cfw_ private: GroceryItemOrder list[CAPACITY]; int size; / GroceryItemOrder *list; public: GroceryList(); void add
    • Register Now

    GroceryList.h

COMPUTER PROGRAMMING II Questions & Answers

Showing 1 to 7 of 7

View all

COMPUTER PROGRAMMING II Advice

Showing 1 to 2 of 2

View all
    • Profile picture
    Dec 22, 2016
    | Would highly recommend.

    Not too easy. Not too difficult.

    Course Overview:

    The class as a whole was incredibly enthusiastic about the subject, which created an amazing atmosphere to learn in.

    Course highlights:

    One of the greatest highlights was that Connor was a great instructor, and was open to anyone who wanted to discuss the subject regardless of what level they were at.

    Hours per week:

    6-8 hours

    Advice for students:

    If you have experience in 142-level content but don't think you'd be able to do 143 in half the time, definitely go with 143 instead. If you're willing to do the course combination at a faster pace and a more energetic environment, 143x is probably right for you!

    • Fall 2016
    • Connor Moore
    • Many Small Assignments Competitive Classmates Great Discussions
    • Profile picture
    Apr 25, 2016
    | Would recommend.

    This class was tough.

    Course Overview:

    I would recommend this course to anyone who has taken an advanced placement programming class in high school because 1) you already should have the credit for 142, and 2) this course covers material at a much quicker pace and will be perfect for a crash course in programming at the University of Washington

    Course highlights:

    This course covered basic programming aspects from arrays to objects, and delved into deeper and more advanced topics like Huffman coding and Binary Search Trees.

    Hours per week:

    6-8 hours

    Advice for students:

    Go on the Practice-it! site and do practice problems about a week before the midterm and final. Yes, yes, I know, you're a super smart coding genius who aced all the homework. Don't care. Do the practice problems. The major enemy on both the midterm and the final is not the problems, but the time you are given to do them in. You'll already be pressed for time just to write out solutions, if you can understand how to solve them the second you see them, you'll be a lot better off for it. Also, if you're struggling on the homework, go to the IPL and get help from the TA's, they know what they're doing.

    • Fall 2015
    • AdamBlank
    • Yes
    • Go to Office Hours Always Do the Reading Many Small Assignments
Back to Department

Related Courses

Ask a homework question - tutors are online