Introduction to Programming Using Visual Basic (10th Edition)
10th Edition
ISBN: 9780134542782
Author: David I. Schneider
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 3.1, Problem 35E
In Exercises 33 through 40, determine the output displayed in the list box by the lines of code.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Q4
Based on Figure Q4, answer the following questions.
This program draws a triangle on the screen
My name is
My matric no is
I want to print triangle so wiii select no 1 = 1
Please enter 'y' to continue : y
Figure Q4
3
Algorithm Steps Fig 2: (I have provided an algorithm and fewer code hints)
1. Set coordinates for NORTH, SOUTH, WEST, and EAST each 100pixels away from center (0,0)
2. Set outer circle size = 40 and inner circle size = 20
3. Set window size 600x600
4. Draw y-axis by connecting NORTH and SOUTH
5. Draw x-axis by connecting WEST and EAST
6. Display name of coordinates
7. Position point to draw circle
8. Set angle 90 degree
9. Set color to red
10. Draw outer circle
11. Draw inner circle and fill red
PYTHON PROGRAMMING ASSIGNMENT
PYTHON PROGRAMMING LANGUAGE ASSIGNMENT
Create a new text document called names.txt (this is done by hand - not using programming) with the following names: Adam, Bryan, Charlie. Each name should be followed by a hard return (do not store them in a list).
Main Function. Write a program where the user enters a name. Using the read function, check to see if the name is in the text document. If it is, respond back to the user the name is found within the list.
Read Function. The read function should return the contents of the text document as a list.
Write Function. The write function should take the list and override the file with the new names list in reverse alphabetical order with a hard return after each name.
Chapter 3 Solutions
Introduction to Programming Using Visual Basic (10th Edition)
Ch. 3.1 - Prob. 1ECh. 3.1 - Prob. 2ECh. 3.1 - Prob. 3ECh. 3.1 - Prob. 4ECh. 3.1 - Prob. 5ECh. 3.1 - Prob. 6ECh. 3.1 - Prob. 7ECh. 3.1 - Prob. 8ECh. 3.1 - Prob. 9ECh. 3.1 - Prob. 10E
Ch. 3.1 - Prob. 11ECh. 3.1 - Prob. 12ECh. 3.1 - Prob. 13ECh. 3.1 - Prob. 14ECh. 3.1 - Prob. 15ECh. 3.1 - Prob. 16ECh. 3.1 - Prob. 17ECh. 3.1 - Prob. 18ECh. 3.1 - Prob. 19ECh. 3.1 - Prob. 20ECh. 3.1 - Prob. 21ECh. 3.1 - Prob. 22ECh. 3.1 - Prob. 23ECh. 3.1 - Prob. 24ECh. 3.1 - Prob. 25ECh. 3.1 - Prob. 26ECh. 3.1 - Prob. 27ECh. 3.1 - Prob. 28ECh. 3.1 - Prob. 29ECh. 3.1 - Prob. 30ECh. 3.1 - In Exercises 31 and 32, complete the table by...Ch. 3.1 - In Exercises 31 and 32, complete the table by...Ch. 3.1 - Prob. 33ECh. 3.1 - Prob. 34ECh. 3.1 - In Exercises 33 through 40, determine the output...Ch. 3.1 - Prob. 36ECh. 3.1 - Prob. 37ECh. 3.1 - In Exercises 33 through 40, determine the output...Ch. 3.1 - Prob. 39ECh. 3.1 - In Exercises 33 through 40, determine the output...Ch. 3.1 - Prob. 41ECh. 3.1 - In Exercises 41 through 46, identify the...Ch. 3.1 - In Exercises 41 through 46, identify the...Ch. 3.1 - Prob. 44ECh. 3.1 - In Exercises 41 through 46, identify the errors....Ch. 3.1 - In Exercises 41 through 46, identify the...Ch. 3.1 - Prob. 47ECh. 3.1 - Prob. 48ECh. 3.1 - Prob. 49ECh. 3.1 - Prob. 50ECh. 3.1 - Prob. 51ECh. 3.1 - In Exercises 49 through 54, find the value of the...Ch. 3.1 - In Exercises 49 through 54, find the value of the...Ch. 3.1 - In Exercises 49 through 54, find the value of the...Ch. 3.1 - In Exercises 55 through 60, find the value of the...Ch. 3.1 - In Exercises 55 through 60, find the value of the...Ch. 3.1 - Prob. 57ECh. 3.1 - In Exercises 55 through 60, find the value of the...Ch. 3.1 - In Exercises 55 through 60, find the value of the...Ch. 3.1 - In Exercises 55 through 60, find the value of the...Ch. 3.1 - In Exercises 61 through 66, rewrite the statements...Ch. 3.1 - In Exercises 61 through 66, rewrite the statements...Ch. 3.1 - In Exercises 61 through 66, rewrite the statements...Ch. 3.1 - Prob. 64ECh. 3.1 - In Exercises 61 through 66, rewrite the statements...Ch. 3.1 - Prob. 66ECh. 3.1 - Prob. 67ECh. 3.1 - Prob. 68ECh. 3.1 - Prob. 69ECh. 3.1 - Prob. 70ECh. 3.1 - Prob. 71ECh. 3.1 - Prob. 72ECh. 3.1 - Prob. 73ECh. 3.1 - Prob. 74ECh. 3.1 - Prob. 75ECh. 3.1 - Prob. 76ECh. 3.1 - Prob. 77ECh. 3.1 - Prob. 78ECh. 3.1 - Prob. 79ECh. 3.1 - Prob. 80ECh. 3.1 - Prob. 81ECh. 3.1 - Prob. 82ECh. 3.1 - Prob. 83ECh. 3.1 - Prob. 84ECh. 3.1 - Prob. 85ECh. 3.1 - Prob. 86ECh. 3.2 - Prob. 1ECh. 3.2 - Prob. 2ECh. 3.2 - Prob. 3ECh. 3.2 - Prob. 4ECh. 3.2 - Prob. 5ECh. 3.2 - Prob. 6ECh. 3.2 - Prob. 7ECh. 3.2 - Prob. 8ECh. 3.2 - Prob. 9ECh. 3.2 - Prob. 10ECh. 3.2 - Prob. 11ECh. 3.2 - Prob. 12ECh. 3.2 - Prob. 13ECh. 3.2 - In Exercises 1 through 22, determine the output...Ch. 3.2 - Prob. 15ECh. 3.2 - Prob. 16ECh. 3.2 - Prob. 17ECh. 3.2 - Prob. 18ECh. 3.2 - Prob. 19ECh. 3.2 - Prob. 20ECh. 3.2 - Prob. 21ECh. 3.2 - In Exercises 1 through 22, determine the output...Ch. 3.2 - Prob. 23ECh. 3.2 - Prob. 24ECh. 3.2 - (True or False) If is the length of str, then is...Ch. 3.2 - (True or False) If n is the length of str, then ...Ch. 3.2 - Prob. 27ECh. 3.2 - Prob. 28ECh. 3.2 - Prob. 29ECh. 3.2 - Prob. 30ECh. 3.2 - Prob. 31ECh. 3.2 - Prob. 32ECh. 3.2 - Prob. 33ECh. 3.2 - In Exercises 27 through 34, identify any errors....Ch. 3.2 - Prob. 35ECh. 3.2 - Prob. 36ECh. 3.2 - Prob. 37ECh. 3.2 - Prob. 38ECh. 3.2 - Prob. 39ECh. 3.2 - Prob. 40ECh. 3.2 - Prob. 41ECh. 3.2 - In Exercises 39 through 44, write a program to...Ch. 3.2 - Prob. 43ECh. 3.2 - Prob. 44ECh. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - Prob. 56ECh. 3.2 - Prob. 57ECh. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.2 - In the following exercises, write a program to...Ch. 3.3 - Prob. 1ECh. 3.3 - Prob. 2ECh. 3.3 - Prob. 3ECh. 3.3 - Prob. 4ECh. 3.3 - Prob. 5ECh. 3.3 - Prob. 6ECh. 3.3 - Prob. 7ECh. 3.3 - Prob. 8ECh. 3.3 - Prob. 9ECh. 3.3 - Prob. 10ECh. 3.3 - Prob. 11ECh. 3.3 - Prob. 12ECh. 3.3 - Prob. 13ECh. 3.3 - Prob. 14ECh. 3.3 - Prob. 15ECh. 3.3 - Prob. 16ECh. 3.3 - Prob. 17ECh. 3.3 - Prob. 18ECh. 3.3 - Prob. 19ECh. 3.3 - Prob. 20ECh. 3.3 - Prob. 21ECh. 3.3 - Prob. 22ECh. 3.3 - Prob. 23ECh. 3.3 - Prob. 24ECh. 3.3 - Prob. 25ECh. 3.3 - Prob. 26ECh. 3.3 - In Exercises 1 through 52, determine the output...Ch. 3.3 - Prob. 28ECh. 3.3 - Prob. 29ECh. 3.3 - Prob. 30ECh. 3.3 - Prob. 31ECh. 3.3 - Prob. 32ECh. 3.3 - Prob. 33ECh. 3.3 - Prob. 34ECh. 3.3 - Prob. 35ECh. 3.3 - Prob. 36ECh. 3.3 - Prob. 37ECh. 3.3 - Prob. 38ECh. 3.3 - In Exercises 1 through 52, determine the output...Ch. 3.3 - Prob. 40ECh. 3.3 - Prob. 41ECh. 3.3 - Prob. 42ECh. 3.3 - Prob. 43ECh. 3.3 - Prob. 44ECh. 3.3 - In Exercises 1 through 52, determine the output...Ch. 3.3 - Prob. 46ECh. 3.3 - Prob. 47ECh. 3.3 - Prob. 48ECh. 3.3 - In Exercises 1 through 52, determine the output...Ch. 3.3 - In Exercises 1 through 52, determine the output...Ch. 3.3 - Prob. 51ECh. 3.3 - Prob. 52ECh. 3.3 - In Exercises 53 through 56, determine the output...Ch. 3.3 - In Exercises 53 through 56, determine the output...Ch. 3.3 - Prob. 55ECh. 3.3 - In Exercises 53 through 56, determine the output...Ch. 3.3 - In Exercises 57 through 64, identify any errors....Ch. 3.3 - Prob. 58ECh. 3.3 - In Exercises 57 through 64, identify any...Ch. 3.3 - Prob. 60ECh. 3.3 - Prob. 61ECh. 3.3 - Prob. 62ECh. 3.3 - Prob. 63ECh. 3.3 - Prob. 64ECh. 3.3 - Prob. 65ECh. 3.3 - Prob. 66ECh. 3.3 - Prob. 67ECh. 3.3 - Prob. 68ECh. 3.3 - Prob. 69ECh. 3.3 - Prob. 70ECh. 3.3 - Prob. 71ECh. 3.3 - In Exercises 71 and 72, write a statement to carry...Ch. 3.3 - Prob. 73ECh. 3.3 - Prob. 74ECh. 3.3 - Prob. 75ECh. 3.3 - Prob. 76ECh. 3.3 - Prob. 77ECh. 3.3 - Prob. 78ECh. 3.3 - Prob. 79ECh. 3.3 - Prob. 80ECh. 3.3 - Prob. 81ECh. 3.3 - Prob. 82ECh. 3.3 - Prob. 83ECh. 3.3 - How Old Would You Be on Mercury? The length of a...Ch. 3.3 - Change in Salary A common misconception is that if...Ch. 3.3 - Prob. 86ECh. 3.3 - Prob. 87ECh. 3.3 - Marketing Terms The markup of an item is the...Ch. 3 - Calculator Write a program that allows the user to...Ch. 3 - Repair Bill Suppose automobile repair customers...Ch. 3 - Prob. 3PPCh. 3 - Length Conversion Write a program to convert a...Ch. 3 - Car Loan If A dollars are borrowed at r interest...Ch. 3 - Prob. 6PPCh. 3 - Bond Yield One measure of a bond's performance is...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Modify Problem and Exercise 6-60 so that the list includes the number of products each customer bought in each ...
Modern Database Management (12th Edition)
Write nested if statements that perform the following tests: If amount1 is greater than 10 and amount2 is less ...
Starting Out with Java: From Control Structures through Objects (6th Edition)
Recall the Rectangle and Cube classes discussed earlier, as shown in Figure 10-18.
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
3.12 (Date Create a class called Date that includes three pieces Of information as data
members—a month (type ...
C++ How to Program (10th Edition)
Identify and fix the errors in the following code: 1. public class Test { 2. public void main(string[] args) { ...
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Introduction Some number of teams are participating in a race. You are not told how many teams are participating but you do know that: Each team has a name, which is one of the uppercase letters A-Z. No two teams have the same name, so there are a maximum number of 26 teams. Each team has the same number of members. No two runners cross the finish line at the same time – i.e. there are no ties. At the end of the race we can write the results as a string of characters indicating the order in which runners crossed the finish line. For example: ZZAZAA We can see there were two teams: A and Z. Team A’s runners finished in 3rd, 5th and 6th place. Team Z’s runners finished in 1st, 2nd and 4th place. Scoring the race Each runner is assigned a score equal to their finishing place. In the example above team Z’s runners achieved scores of 1, 2 and 4. Team A’s runners scores were 3, 5, and 6 respectively. The team’s score is the sum of the members score divided by the number of people on…arrow_forward# Segmentation Questionarrow_forwarduse numbers in second picture rather than first pleasearrow_forward
- Include the IPO chart and algorithm.arrow_forwardMultiple Choice Identify the choice that best completes the statement or answers the question. 1. A list of numbers has n elements, indexed from 1 to n. The following algorithm is intended to display the number of elements in the list that have a value greater than 100. The algorithm uses the variables count and position. Steps 3 and 4 are missing. Step 1: Set count to 0 and position to 1. Step 2: If the value of the element at index position is greater than 100, increase the value of count by 1. Step 3: (missing step) Step 4: (missing step) na viliog dbod cour pot Step 5: Display the value of count. Which of the following could be used to replace steps 3 and 4 so that the algorithm works as intended? Step 3: Repeat step 2 until the value of count is greater than 100. Step 3: Repeat step 2 until the value of position is greater than n. a. c. Step 4: Increase the value of position by Step 4: Increase the value of count by 1. 1. b. Step 3: Increase the value of position by d. Step 3:…arrow_forwardvisual basic2010arrow_forward
- Chapter 10: Improve number and string formatting Update the program to improve the formatting of the numbers and the strings. Console MENU OPTIONS 1 2 3 4 5 6 7 Display lineup Add player Remove player Move player Edit player position Edit player stats Exit program POSITIONS C, 1B, 2B, 3B, SS, LF, CF, RF, P Menu option: 1 Player 1 Tommy La Stella 2 Mike Yastrzemski 3 Donovan Solano Baseball Team Manager 4 Buster Posey 5 Brandon Belt 6 Brandon Crawford 7 Alex Dickerson 8 Austin Slater 9 Kevin Gausman Menu option: 7 Bye! ============================== POS 3B RF 2B с 1B SS LF CF P AB H 1316 360 0.274 563 168 0.281 1473 407 0.276 0.302 4575 1380 3811 1003 4402 1099 160 147 2 586 569 56 AVG 0.263 0.250 0.273 0.274 0.036 Specifications Use the repetition operator to make sure that horizontal separator lines use 64 characters. • Use spaces, not tabs, to align columns. This should give the program more control over how the columns are aligned. • Make sure the program always displays the batting…arrow_forwardPrice-to-Earnings Ratio Request a company’s earnings-per-share for the year and the price of one share of stock as input, and then display the company’s price-to-earnings ratio (that is, price/earnings). See Fig. 3.25.arrow_forwardCreate IPO, pseudocode, and flow chartarrow_forward
- 9. All employees at Kranston Sports Inc. are paid based on an annual salary rather than an hourly wage. However, some employees are paid weekly, while others are paid every other week (biweekly). Employees paid weekly receive 52 paychecks; employees paid biweekly receive 26 paychecks. The algorithm shown in Figure 1-15 should calculate and display the gross pay for each employee; however, some of the instructions are missing from the algorithm. Complete the algorithm. repeat (for each employee) enter the employee's payment schedule and annual salary if (the employee's payment schedule is weekly) calculate gross pay calculate gross pay Figure 1-15arrow_forwardActivity 7 Guessing Game There is list of word, the interpreter will choose a word randomly. The user has to input his names and then, he will be asked to guess the word by accepting any alphabet. If the random word contains accepted character, it will be shown as the output (with correct placement) else the program will ask you to guess another alphabet. User will be 50% of the total number of characters to guess the complete word. Requirements 1. There must be 10 words of different length. 2. The words must be in random. 3. It should accept lower case and upper case letter 4. The number of turns left must be display 5. All wrong characters are also displayarrow_forward(Misc. application) Four experiments are performed, and each experiment has six test results. The results for each experiment are given in the following list. Write a program using a nested loop to compute and display the average of the test results for each experiment. 1stexperimentresults:23.23116.92725.428.62ndexperimentresults:34.845.227.936.833.439.43rdexperimentresults:19.416.810.220.818.913.44thexperimentresults:36.93949.245.142.750.6arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Computational Software for Intelligent System Design; Author: Cadence Design Systems;https://www.youtube.com/watch?v=dLXZ6bM--j0;License: Standard Youtube License