. Suppose a computer program has been initialized such that the following sets have been stored for use in any algorithm: A = {1, 2, 3, ..., 45} B = {-7, -6, -5, ..., 27} Consider the following algorithm, which represents one part of the whole computer program (comments may occur after the # symbol on any line and are not used in computations): #Part 1: computes A - B and its cardinality AminusB = set() for element in A:   # this line runs through every element in A     if not(element in B): #A - B is the set of elements that are in A and are not in B         AminusB.add(element) # Add to AminusB every element in A if the element is also not in B n = len(AminusB) #len() returns the number of elements in the array print(n)    What value is printed as a result of executing this algorithm       Answer                     Q10A. Consider the following algorithm: g1 = 3 g2 = 6 for k > 2:     gk = (k-1)·gk-1 - gk-2 What is term g6 of the recursive sequence generated as a result of executing this algorithm?   Your Answer: Question 4 options:       Answer                   Q9A. Consider the following algorithm: sum = 0 for j in range(1,12):     sum = sum + (6*j - 2)      print(sum) What is printed as a result of executing this algorithm?

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Q20. Suppose a computer program has been initialized such that the following sets have been stored for use in any algorithm:

A = {1, 2, 3, ..., 45}
B = {-7, -6, -5, ..., 27}

Consider the following algorithm, which represents one part of the whole computer program (comments may occur after the # symbol on any line and are not used in computations):

#Part 1: computes A - B and its cardinality

AminusB = set()
for element in A:   # this line runs through every element in A
    if not(element in B): #A - B is the set of elements that are in A and are not in B
        AminusB.add(element) # Add to AminusB every element in A if the element is also not in B

n = len(AminusB) #len() returns the number of elements in the array
print(n) 

 

What value is printed as a result of executing this algorithm

 
 
 
Answer
 

 

 
 
 
 
 
 
 
 

Q10A. Consider the following algorithm:

g1 = 3

g2 = 6

for k > 2:

    gk = (k-1)·gk-1 - gk-2

What is term g6 of the recursive sequence generated as a result of executing this algorithm?

 
Your Answer:
Question 4 options:
 
 
 
Answer
 
 
 
 
 
 
 
 
 

Q9A. Consider the following algorithm:

sum = 0

for j in range(1,12):
    sum = sum + (6*j - 2)
    
print(sum)

What is printed as a result of executing this algorithm?

 
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Computational Systems
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education