31. Which code segment will correctly add a nar to a team roster? Assume all variables and lists are appropriate initialized. Block 1 REPEAT UNTIL (x <= 0) ( } Block 2 APPEND (roster, name) x+x+1 FOR EACH nane IN roater ( APPEND (roster, nane) DISPLAY (name) } (A) Block 1 (B) Block 2 (C) Both Block 1 and Block 2 (D) Neither Block 1 or Block 2 32. Which algorithm will determine if a number even? (A) num INPUT ( ) IF (num MOD 2 = 0) } (D) num DISPLAY (num, is even") (B) Assume list is initialized with integers. FOR Each nun IN list IF (num/ 2 = 0) ( } DISPLAY (num, is even") num INPUT( ) IF ((num 21. num - num) DISPLAY (num, is even") INPUT( ) IF (NOT (num MOD 2 - 0)) ( DISPLAY(num, is even")

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
icon
Concept explainers
Question
Please answer this three questions and show work and explanations of how you got the answer
31. Which code segment will correctly add a nar
to a team roster?
Assume all variables and lists are appropriate
initialized.
Block 1
x+1
REPEAT UNTIL (x <= 0)
(
}
Block 2
APPEND (roster, name)
x-x+1
FOR EACH nane IN roster
(
APPEND (roster, nane)
DISPLAY (name)
}
(A) Block 1
(B) Block 2
(C) Both Block 1 and Block 2
(D) Neither Block 1 or Block 2
32. Which algorithm will determine if a number
even?
(A) num INPUT ( )
IF (num MOD 2 = 0)
DISPLAY (num, is even")
}
(B) Assume list is initialized with integers.
FOR Each num IN list
(
}
(D) num
IF (num/ 2 = 0)
(
}
DISPLAY (num, is even")
}
(C) num INPUT( )
IF ((num / 2) num- num)
{
DISPLAY (num, is even")
INPUT()
IF (NOT (num MOD 2
(
DISPLAY( num,
0))
is even")
Transcribed Image Text:31. Which code segment will correctly add a nar to a team roster? Assume all variables and lists are appropriate initialized. Block 1 x+1 REPEAT UNTIL (x <= 0) ( } Block 2 APPEND (roster, name) x-x+1 FOR EACH nane IN roster ( APPEND (roster, nane) DISPLAY (name) } (A) Block 1 (B) Block 2 (C) Both Block 1 and Block 2 (D) Neither Block 1 or Block 2 32. Which algorithm will determine if a number even? (A) num INPUT ( ) IF (num MOD 2 = 0) DISPLAY (num, is even") } (B) Assume list is initialized with integers. FOR Each num IN list ( } (D) num IF (num/ 2 = 0) ( } DISPLAY (num, is even") } (C) num INPUT( ) IF ((num / 2) num- num) { DISPLAY (num, is even") INPUT() IF (NOT (num MOD 2 ( DISPLAY( num, 0)) is even")
Al
33. Why is a binary search the most effective way to
search a sorted dataset?
(A) The item searched for bubbles to the
beginning of the dataset after one pass.
(B) It uses machine learning with each pass of
the data to learn where the data is located
in the file.
(C) It eliminates half the dataset with each
iteration of the search.
(D) It merges sections of data to only have to
search one section with each iteration.
Transcribed Image Text:Al 33. Why is a binary search the most effective way to search a sorted dataset? (A) The item searched for bubbles to the beginning of the dataset after one pass. (B) It uses machine learning with each pass of the data to learn where the data is located in the file. (C) It eliminates half the dataset with each iteration of the search. (D) It merges sections of data to only have to search one section with each iteration.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps

Blurred answer
Knowledge Booster
Types of Linked List
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.
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