essay

cs61a homework 1 solutions

CS61A-Spring2022

Homework 1 solution, q2: k in num.

hw01/parsons_probs/k_in_num.py

Q3: A Plus Abs B

hw01/hw01.py

Q4: Two of Three

Q5: largest factor, running tests.

Homework 1 Solutions hw01.zip

Solution files.

You can find the solutions in hw01.py .

Required Questions

Welcome forms, q1: welcome forms.

Please fill out both the Syllabus Quiz , which is based off of our policies found on the course syllabus , as well as the optional Welcome Survey .

Parsons Problems

To work on these problems, open the Parsons editor:

Q2: k in Num

Write a function k_in_num which takes in two integers, k and num . k_in_num returns True if num has the digit k and returns False if num does not have the digit k . 0 is considered to have no digits.

Code Writing Problems

Q3: a plus abs b.

Python's operator module defines binary functions for Python's intrinsic arithmetic operators. For example, calling operator.add(2,3) is equivalent to calling the expression 2 + 3 ; both will return 5 .

Fill in the blanks in the following function for adding a to the absolute value of b , without calling abs . You may not modify any of the provided code other than the two blanks.

Use Ok to test your code:

If b is positive, we add the numbers together. If b is negative, we subtract the numbers. Therefore, we choose the operator add or sub based on the sign of b .

Q4: Two of Three

Write a function that takes three positive numbers as arguments and returns the sum of the squares of the two smallest numbers. Use only a single line for the body of the function.

Hint: Consider using the max or min function: >>> max(1, 2, 3) 3 >>> min(-1, -2, -3) -3

We use the fact that if x>y and y>0 , then square(x)>square(y) . So, we can take the min of the sum of squares of all pairs. The min function can take an arbitrary number of arguments.

Alternatively, we can do the sum of squares of all the numbers. Then we pick the largest value, and subtract the square of that.

Q5: Largest Factor

Write a function that takes an integer n that is greater than 1 and returns the largest integer that is smaller than n and evenly divides n .

Hint: To check if b evenly divides a , you can use the expression a % b == 0 , which can be read as, "the remainder of dividing a by b is 0."

Iterating from n-1 to 1, we return the first integer that evenly divides n . This is guaranteed to be the largest factor of n .

Make sure to submit this assignment by running:

Q1: A Plus Abs B

Fill in the blanks in the following function for adding a to the absolute value of b, without calling abs.


2
3
4
5
6
7
8
9
10
11
12
13
14
15
 operator import add, sub

def a_plus_abs_b(a, b):
"""Return a+abs(b), but without calling abs.

>>> a_plus_abs_b(2, 3)
5
>>> a_plus_abs_b(2, -3)
5
"""
if b < 0:
f = a - b
else:
f = a + b
return f(a, b)

Q2: Two of Three

Write a function that takes three positive numbers and returns the sum of the squares of the two largest numbers. Use only a single line for the body of the function.


2
3
4
5
6
7
8
9
10
11
12
13
14
15
 two_of_three(a, b, c):
"""Return x*x + y*y, where x and y are the two largest members of the
positive numbers a, b, and c.

>>> two_of_three(1, 2, 3)
13
>>> two_of_three(5, 3, 1)
34
>>> two_of_three(10, 2, 8)
164
>>> two_of_three(5, 5, 5)
50
"""
return max(a * a + b * b, a * a + c * c, b * b + c * c)
# return a ** a + b ** b + c ** c - min(a, b, c) ** 2

Q3: Largest Factor

Write a function that takes an integer n that is greater than 1 and returns the largest integer that is smaller than n and evenly divides n.


2
3
4
5
6
7
8
9
10
11
12
13
14
15
 largest_factor(n):
"""Return the largest factor of n that is smaller than n.

>>> largest_factor(15) # factors are 1, 3, 5
5
>>> largest_factor(80) # factors are 1, 2, 4, 5, 8, 10, 16, 20, 40
40
>>> largest_factor(13) # factor is 1 since 13 is prime
1
"""
d = n - 1
while d > 0:
if n % d == 0:
return d
d -= 1

Q4: If Function vs Statement

Let’s try to write a function that does the same thing as an if statement.


2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
 if_function(condition, true_result, false_result):
"""Return true_result if condition is a true value, and
false_result otherwise.

>>> if_function(True, 2, 3)
2
>>> if_function(False, 2, 3)
3
>>> if_function(3==2, 3+2, 3-2)
1
>>> if_function(3>2, 3+2, 3-2)
5
"""
if condition:
return true_result
else:
return false_result

Despite the doctests above, this function actually does not do the same thing as an if statement in all cases. To prove this fact, write functions c, t, and f such that with_if_statement prints the number 2, but with_if_function prints both 1 and 2.


2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
 with_if_statement():
"""
>>> result = with_if_statement()
2
>>> print(result)
None
"""
if c():
return t()
else:
return f()

def with_if_function():
"""
>>> result = with_if_function()
1
2
>>> print(result)
None
"""
return if_function(c(), t(), f())

def c():
return False

def t():
print(1)

def f():
print(2)

Remeber that when we call a function, we must evaluate every operand as parameter in the function, so anyway, c function, t function and f function must be called regardless of the return value(True or False) by c function, while in if statement, the true clause can not be called if evaluated value is False. So the two is not exactly the same.

Q5: Hailstone

Douglas Hofstadter’s Pulitzer-prize-winning book, Gödel, Escher, Bach, poses the following mathematical puzzle.

Pick a positive integer n as the start. If n is even, divide it by 2. If n is odd, multiply it by 3 and add 1. Continue this process until n is 1. The number n will travel up and down but eventually end at 1 (at least for all numbers that have ever been tried – nobody has ever proved that the sequence will terminate). Analogously, a hailstone travels up and down in the atmosphere before eventually landing on earth.

This sequence of values of n is often called a Hailstone sequence. Write a function that takes a single argument with formal parameter name n, prints out the hailstone sequence starting at n, and returns the number of steps in the sequence:


2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
 hailstone(n):
"""Print the hailstone sequence starting at n and return its
length.

>>> a = hailstone(10)
10
5
16
8
4
2
1
>>> a
7
"""
steps = 1
while n != 1:
print(n)
if n % 2 == 0:
n //= 2
else:
n = n * 3 + 1
steps += 1
print(n)
return steps

Write a one-line program that prints itself, using only the following features of the Python language:

  • Number literals
  • Assignment statements
  • String literals that can be expressed using single or double quotes
  • The arithmetic operators +, -, *, and /
  • The built-in print function
  • The built-in eval function, which evaluates a string as a Python expression
  • The built-in repr function, which returns an expression that evaluates to its argument
  • You can concatenate two strings by adding them together with + and repeat a string by multipying it by an integer.
  • Semicolons can be used to separate multiple statements on the same line. E.g.,

2
3
a
bcc

Hint: Explore the relationship between single quotes, double quotes, and the repr function applied to strings.

A program that prints itself is called a Quine. Place your solution in the multi-line string named quine.

Homework 1 | CS 61A Spring 2024

Homework 1: functions, control ​.

Due by 11:59pm on Thursday, January 25

Instructions ​

Download hw01.zip .

Submission: When you are done, submit the assignment by uploading all code files you've edited to Gradescope. You may submit more than once before the deadline; only the final submission will be scored. Check that you have successfully submitted your code on Gradescope. See Lab 0 for more instructions on submitting assignments.

Using Ok: If you have any questions about using Ok, please refer to this guide.

Readings: You might find the following references useful:

  • Section 1.1
  • Section 1.2
  • Section 1.3
  • Section 1.4
  • Section 1.5

Grading: Homework is graded based on correctness. Each incorrect problem will decrease the total score by one point. This homework is out of 2 points.

Getting Started Videos ​

These videos may provide some helpful direction for tackling the problems on this assignment.

To see these videos, you should be logged into your berkeley.edu email. YouTube link

Required Questions ​

Q1: a plus abs b ​.

Python's operator module contains two-argument functions such as add and sub for Python's built-in arithmetic operators. For example, add(2, 3) evalutes to 5, just like the expression 2 + 3 .

Fill in the blanks in the following function for adding a to the absolute value of b , without calling abs . You may not modify any of the provided code other than the two blanks.

Use Ok to test your code:

Use Ok to run the local syntax checker (which checks that you didn't modify any of the provided code other than the two blanks):

Q2: Two of Three ​

Write a function that takes three positive numbers as arguments and returns the sum of the squares of the two smallest numbers. Use only a single line for the body of the function.

Hint: Consider using the max or min function: >>> max(1, 2, 3) 3 >>> min(-1, -2, -3) -3

Use Ok to run the local syntax checker (which checks that you used only a single line for the body of the function):

Q3: Largest Factor ​

Write a function that takes an integer n that is greater than 1 and returns the largest integer that is smaller than n and evenly divides n .

Hint: To check if b evenly divides a , use the expression a % b == 0 , which can be read as, "the remainder when dividing a by b is 0."

Q4: Hailstone ​

Douglas Hofstadter's Pulitzer-prize-winning book, Gödel, Escher, Bach , poses the following mathematical puzzle.

  • Pick a positive integer n as the start.
  • If n is even, divide it by 2.
  • If n is odd, multiply it by 3 and add 1.
  • Continue this process until n is 1.

The number n will travel up and down but eventually end at 1 (at least for all numbers that have ever been tried -- nobody has ever proved that the sequence will terminate). Analogously, a hailstone travels up and down in the atmosphere before eventually landing on earth.

This sequence of values of n is often called a Hailstone sequence. Write a function that takes a single argument with formal parameter name n , prints out the hailstone sequence starting at n , and returns the number of steps in the sequence:

Hailstone sequences can get quite long! Try 27. What's the longest you can find?

Note that if n == 1 initially, then the sequence is one step long. Hint: If you see 4.0 but want just 4, try using floor division // instead of regular division / .

Curious about hailstones or hailstone sequences? Take a look at these articles:

  • Check out this article to learn more about how hailstones work!
  • In 2019, there was a major development in understanding how the hailstone conjecture works for most numbers!

Check Your Score Locally ​

You can locally check your score on each question of this assignment by running

This does NOT submit the assignment! When you are satisfied with your score, submit the assignment to Gradescope to receive credit for it.

Submit this assignment by uploading any files you've edited to the appropriate Gradescope assignment. Lab 00 has detailed instructions.

In addition, all students who are not in the mega lab must complete this attendance form . Submit this form each week, whether you attend lab or missed it for a good reason. The attendance form is not required for mega section students.

If you completed all problems correctly, you should see that your score is 6.0 in the autograder output by Gradescope. Each homework assignment counts for 2 points, so in this case you will receive the full 2 points for homework. Remember that every incorrect question costs you 1 point, so a 5.0/6.0 on this assignment will translate to a 1.0/2.0 homework grade for this assignment.
  • Homework 1: Functions, Control
  • Instructions
  • Getting Started Videos
  • Q1: A Plus Abs B
  • Q2: Two of Three
  • Q3: Largest Factor
  • Q4: Hailstone
  • Check Your Score Locally

CS 61A: Structure and Interpretation of Computer Programs

Fall 2024: Mon, Wed, Fri 1pm in 150 Wheeler

Announcements: Friday, September 13

Hog is due Thursday 9/19 @ 11:59pm.

Midterm 1 is Monday 9/16 8pm-10pm.

  • You may bring a double-sided 8.5x11 sheet of notes that you create yourself.
  • We will provide the Midterm 1 Study Guide and scratch paper.
  • Complete the alteration request form by Wednesday, 9/11 at 11:59pm for any seating/timing requests (including DSP students).
  • Past exams are in the Resources menu above.
  • No lecture on Monday 9/16.
  • No lab on Monday 9/16 or Tuesday 9/17.

Announcements: Wednesday, September 11

  • Homework 2 is due Thursday 9/12 @ 11:59pm.
  • Checkpoint due Thursday 9/12.
  • You can sign up to attend a TA-led lecture-style review of this week's discussion worksheet.

Announcements: Monday, September 9

Homework 1 is due Monday 9/9 @ 11:59pm.

  • Come to office hours in Warren 101B for help.
  • Seat assignments will be emailed to you before the exam (probably Sunday)
  • Arrive by 8pm to find your seat; the exam will start at 8:10pm.
  • The exam covers material in the videos through Monday 9/9 (Environments).

Announcements: Friday, September 6

Announcements: wednesday, september 4.

Lab 0 and Lab 1 are due Wednesday 9/4 @ 11:59pm.

  • You're meant to complete lab assignments during lab.
  • It's ok to share your lab code with others.
  • Recommended: Finish by Thursday 9/5.
  • It's not ok to share your homework code with others.
  • There's an experimental AI tutor called "61a-bot" that gives help on your code.
  • If you need more time, you can request an extension.
  • Come to staff office hours in Warren 101B starting Wed 9/4 5pm-8pm.
  • See Ed for: changing sections, lecture questions, external announcements, etc.

Announcements: Friday, August 30

  • Monday labs are rescheduled to Friday 8/30 for this week only (due to the holiday).

First work on Lab 0 (setting up your computer) and then on Lab 1.

  • Try Lab 0 before you come to lab if you have time.

There are many optional problems on Lab 1 that are useful practice. We recommend:

  • Complete the required Lab 1 problems (about Lecture 2: Functions).
  • Watch the videos for Lecture 3: Control early, perhaps on Monday.
  • Complete the optional Lab 1 problems (about Lecture 3: Control).

Homework 1 deadline extended to Monday 9/9 @ 11:59pm. We recommend:

  • Complete all the optional Lab 1 problems before working on Homework 1.
  • Finish the homework by Thursday 9/5 so you can focus on Homework 2 & the Hog project starting 9/6.

Announcements: Monday, August 26

  • Welcome to CS 61A!

Current Assignments

Week Date Lecture Textbook Lab & Discussion Links Homework & Project
1 Wed
8/28
Fri
8/30
2 Mon
9/2		 No Lecture: Labor Day
Wed
9/4
Fri
9/6
3 Mon
9/9
Wed
9/11
Fri
9/13
4 Mon
9/16		 Midterm 1 (8pm-10pm)
Wed
9/18		 Disc 03: Recursion
Fri
9/20		 HW 03: Recursion
5 Mon
9/23		 Lab 03: Recursion, Python Lists
Wed
9/25		 Disc 04: Tree Recursion Cats
Fri
9/27
6 Mon
9/30		 Lab 04: Tree Recursion, Data Abstraction
Wed
10/2		 Disc 05: Trees
Fri
10/4		 HW 04: Sequences, Trees
7 Mon
10/7		 Lab 05: Iterators, Mutability
Wed
10/9		 Disc 06: Iterators, Generators
Fri
10/11		 HW 05: Generators
Ants
8 Mon
10/14		 Lab 06: Object-Oriented Programming
Wed
10/16		 Disc 07: OOP
Fri
10/18		 HW 06: Object-Oriented Programming, Linked Lists
9 Mon
10/21		 Lab 07: Linked Lists, Inheritance
Wed
10/23		 Disc 08: Linked Lists, Efficiency
Fri
10/25
10 Mon
10/28		 TBD (Optional) Lab 08: Mutable Trees
Wed
10/30		 TBD (Optional)
Fri
11/1		 Midterm 2 (7pm-9pm)
11 Mon
11/4		 HW 07: Scheme
Wed
11/6
Fri
11/8		 HW 08: Scheme Lists
12 Mon
11/11		 No Lecture: Veterans Day Lab 09: Scheme
Wed
11/13		 Disc 09: Scheme, Scheme Lists Scheme
Fri
11/15		 HW 09: Programs as Data, Macros
13 Mon
11/18		 Lab 10: Interpreters
Wed
11/20		 SQL Disc 10: Interpreters
Fri
11/22		 Tables HW 10: SQL
14 Mon
11/25		 Aggregation Lab 11: Programs as Data, Macros
Wed
11/27		 No Lecture: Thanksgiving Disc 11: SQL
Fri
11/29		 No Lecture: Thanksgiving
15 Mon
12/2		 Databases (Optional) Lab 12: SQL
Wed
12/4		 Disc 12: Final Review
Fri
12/6		 Conclusion HW 11: Finale
16 Mon
12/9		 No Lecture: RRR Week
Wed
12/11		 No Lecture: RRR Week
Fri
12/13		 No Lecture: RRR Week
17 Wed
12/18		 Final (7pm-10pm)

Navigation Menu

Search code, repositories, users, issues, pull requests..., provide feedback.

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly.

To see all available qualifiers, see our documentation .

  • Notifications You must be signed in to change notification settings

my solution to the labs, homework, projects and exams of the CS61A course(2020 summer)

lc4337/CS61A

Folders and files.

NameName
37 Commits

Repository files navigation

What's is cs61a .

The CS 61 series is an introduction to computer science, with particular emphasis on software and on machines from a programmer's point of view.

  • CS 61A concentrates on the idea of abstraction, allowing the programmer to think in terms appropriate to the problem rather than in low-level operations dictated by the computer hardware.
  • CS 61B deals with the more advanced engineering aspects of software, such as constructing and analyzing large programs.
  • CS 61C focuses on machines and how they execute programs.

In CS 61A, we are interested in teaching you about programming, not about how to use one particular programming language. We consider a series of techniques for controlling program complexity, such as functional programming, data abstraction, and object-oriented programming.

CS 61A primarily uses the Python 3 programming language. Python is a popular language in both industry and academia. It is also particularly well-suited to the task of exploring the topics taught in this course. It is an open-source language developed by a large volunteer community that prides itself on the diversity of its contributors. We will also use two other languages in the latter half of the course: the Scheme programming language and the Structured Query Language (SQL).

Mastery of a particular programming language is a very useful side effect of CS 61A. However, our goal is not to dictate what language you use in your future endeavors. Instead, our hope is that once you have learned the concepts involved in programming, you will find that picking up a new programming language is just a few days' work.

Useful links

Course Website (2020 summer)

Textbook (SICP for python)

Online editor (support scheme, SQL and python)

If you are a fresher in coding, this lesson will be a fantastic tour for you to learn the core ideas in programming. Even if you already have some experience in programming, you will certainly learn something that you've never thought of before. What's more, the python tutor will help you clearly understand the logic behind program frame and variable bindings.

By the way, I also highly recommend you to read the textbook written for this lesson(the link is above). It is adapted from the legendary book ----《SICP》. If you feel painful to read 《SICP》from head to tail, this book may be a good alternative.

At last, all the start codes and test program for homework, labs and projects are on the course website. You can download them for free. This repository contains my solution specified to the 2020 summer course. Hope this can help you.

Wanna Learn More ?

Check out this repository which contains all my self-learning materials : )

  • Python 53.1%
  • JavaScript 45.0%

IMAGES

  1. GitHub

    cs61a homework 1 solutions

  2. cs61a-fa21-midterm2 solution it is as solution it is as a solution it

    cs61a homework 1 solutions

  3. CS61A Hog solution part1

    cs61a homework 1 solutions

  4. GitHub

    cs61a homework 1 solutions

  5. GitHub

    cs61a homework 1 solutions

  6. UCB CS61a

    cs61a homework 1 solutions

VIDEO

  1. PHY 211- Algebra Review & 1D Kinematics (Homework 1 Part 1)

  2. CompTIA A+ 1101 Chapter #1 Motherboards, Processors, and Memory Review Questions

COMMENTS

  1. Homework 1 Solution

    The course of UCB CS 61A. def k_in_num (k, num): """ Complete k_in_num, a function which returns True if num has the digit k and returns False if num does not have the digit k. 0 is considered to have no digits. >>> k_in_num(3, 123) # .Case 1 True >>> k_in_num(2, 123) # .Case 2 True >>> k_in_num(5, 123) # .Case 3 False >>> k_in_num(0, 0) # .Case 4 False """ "*** YOUR CODE HERE ***" while num ...

  2. ","Homework 1 Solutions

    {"payload":{"allShortcutsEnabled":false,"fileTree":{"Solutions":{"items":[{"name":".DS_Store","path":"Solutions/.DS_Store","contentType":"file"},{"name":"released ...

  3. Homework 1 Solutions

    Homework 1 Solutions hw01.zip; Solution Files. You can find the solutions in hw01.py. Required Questions Welcome Forms Q1: Welcome Forms. Please fill out both the Syllabus Quiz, which is based off of our policies found on the course syllabus, as well as the optional Welcome Survey. Parsons Problems. To work on these problems, open the Parsons ...

  4. cs61a-hw01

    cs61a-hw01 | Hexo. Fill in the blanks in the following function for adding a to the absolute value of b, without calling abs. Write a function that takes three positive numbers and returns the sum of the squares of the two largest numbers. Use only a single line for the body of the function. """Return x*x + y*y, where x and y are the two ...

  5. GitHub

    UCB CS61A fall 2020 Solutions for All Discussions, Labs, Projects, and Homeworks - FyisFe/UCB-CS61A-20Fall ... Homework. Hw01; Hw02; Hw03; Hw04; Hw05; Hw06; Hw07; Hw08; Hw09; Project. Hog; Cats; Ants; Scheme; Acknowledgements. Really appreciate being able to tag along and study this course, it is very kind of them to make this available for ...

  6. HobbitQia/CS61A-Fall-2020: My solutions for CS61A Fall 2020.

    My solutions for CS61A Fall 2020. Contribute to HobbitQia/CS61A-Fall-2020 development by creating an account on GitHub. ... homework, project, Q&A等等让你从学习知识到真正掌握知识。而且四个project中前三个都是做游戏，且为你写好了gui的图形化界面，在你每完成一个部分之后就可以打开游戏 ...

  7. Homework 1 Solutions

    Write a function that takes three positive numbers as arguments and returns the sum of the squares of the two smallest numbers. Use only a single line for the body of the function. def two_of_three(i, j, k): """Return m*m + n*n, where m and n are the two smallest members of the. positive numbers i, j, and k. >>> two_of_three(1, 2, 3)

  8. Homework 1

    Homework 1: Functions, Control hw01.zip; Due by 11:59pm on Monday, September 9. Instructions. Download hw01.zip.. Submission: When you are done, submit the assignment by uploading all code files you've edited to Gradescope. You may submit more than once before the deadline; only the final submission will be scored.

  9. Homework 1

    Section 1.5; Important: The lecture on Monday 8/30 will cover readings 1.3-1.5, which contain the material required for questions 4, 5, and 6. Grading: Homework is graded based on correctness. Each incorrect problem will decrease the total score by one point. There is a homework recovery policy as stated in the syllabus. This homework is out of ...

  10. Lab 1 Solutions

    Lab 1 Solutions lab01.zip; Solution Files Required Questions Review Using Python. Here are the most common ways to run Python on a file. Using no command-line options will run the code in the file you provide and return you to the command line. ... >>> 1 / 5 0.2 >>> 25 / 4 6.25 >>> 4 / 2 2.0 >>> 5 / 0 ZeroDivisionError

  11. cs61a/homework/hw1.py at master · kfei/cs61a · GitHub

    UC Berkeley CS61A, Fall 2014. Contribute to kfei/cs61a development by creating an account on GitHub. UC Berkeley CS61A, Fall 2014. Contribute to kfei/cs61a development by creating an account on GitHub. ... Solutions By size. Enterprise Teams Startups By industry. Healthcare ... cs61a / homework / hw1.py. Top.

  12. Homework 1 Functions, Control

    Homework 1 | CS 61A Spring 2024 Homework 1: Functions, Control . hw01.zip; Due by 11:59pm on Thursday, January 25. Instructions . Download hw01.zip.. Submission: When you are done, submit the assignment by uploading all code files you've edited to Gradescope. You may submit more than once before the deadline; only the final submission will be scored.

  13. CS 61A Fall 2024

    Complete the optional Lab 1 problems (about Lecture 3: Control). Homework 1 deadline extended to Monday 9/9 @ 11:59pm. We recommend: Complete all the optional Lab 1 problems before working on Homework 1. Finish the homework by Thursday 9/5 so you can focus on Homework 2 & the Hog project starting 9/6. Announcements: Monday, August 26.

  14. Solved Scrabble Algorithm Create a requirements

    Our expert help has broken down your problem into an easy-to-learn solution you can count on. See Answer See Answer See Answer done loading Question: Scrabble Algorithm Create a requirements features list for a possible computer-based solution for the game scrabble using the MoSCoW requirements prioritisation technique.

  15. GitHub

    CS 61A - Spring 2024. Update: 2024--06--20. This is my repository for lab, homeworks and project when going through the course, CS 61A, Spring 2024, from U.C. Berkeley. Since the course page change to summar 2024. Some of halfway learners have to stop learning for unable to access to the spring 2024 website. Hope this repository will help you.

  16. Your solution's ready to go!

    Transcribed image text: Problem 2.11 Question Help Walker Accounting Software is marketed to small accounting firms throughout the U.S. and Canada. Owner George Walker has decided to outsource the company's help desk and is considering three providers: Manila Call Center (Philippines), Delhi Services (India), and Moscow Bell (Russia).

  17. Your solution's ready to go!

    Enhanced with AI, our expert help has broken down your problem into an easy-to-learn solution you can count on. See Answer See Answer See Answer done loading Question: Answering any following questions regarding MoSCoW1.

  18. GitHub

    What's is CS61A ? The CS 61 series is an introduction to computer science, with particular emphasis on software and on machines from a programmer's point of view. CS 61A concentrates on the idea of abstraction, allowing the programmer to think in terms appropriate to the problem rather than in low-level operations dictated by the computer hardware.

  19. Your solution's ready to go!

    Richard Bartlett is a citizen of the United States.He owns an automobile manufacturing company in Moscow, Russia. The production from the factory Group of answer choices None of the answers are correct would be included in U.S. GDP but not in Russian GDP would be included in both Russian GDP and U.S. GDP Would be included in Russian GDP but not ...