Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
42. Which code below can replace the missing code to select data that is less than the targetValue and even? Assume all variables have been properly initialized. IF < missing code > { DISPLAY ("Found it!") } (A) (num MOD 2=0) OR (targetValue num) AND (targetValue MOD 2=0) (C) (num MOD 2 = 0) AND (targetValue> num) (D) (targetValue> num) OR (NOT(num MOD 2 > 0)) 43. Which type(s) of statement is needed to find all records in a list that are positive? (A) Sequential and iterative (B) Selection and sequential (C) Selection (D) Iterative and selection 44. Grace and Ada write algorithms and test them with increasingly large datasets. Algorithm 1 is still run- ning while algorithm 2 completed before midnight. What can you determine about the algorithms? (A) One has an exponential efficiency and two has a polynomial efficiency. (B) One has a polynomial efficiency and two has an exponential efficiency. Q(C) +ne is unsolvable and two is decidable. (D) One is decidable and two is unsolvable.

42. Which code below can replace the missing code to select data that is less than the targetValue and even? Assume all variables have been properly initialized. IF < missing code > { DISPLAY ("Found it!") } (A) (num MOD 2=0) OR (targetValue num) AND (targetValue MOD 2=0) (C) (num MOD 2 = 0) AND (targetValue> num) (D) (targetValue> num) OR (NOT(num MOD 2 > 0)) 43. Which type(s) of statement is needed to find all records in a list that are positive? (A) Sequential and iterative (B) Selection and sequential (C) Selection (D) Iterative and selection 44. Grace and Ada write algorithms and test them with increasingly large datasets. Algorithm 1 is still run- ning while algorithm 2 completed before midnight. What can you determine about the algorithms? (A) One has an exponential efficiency and two has a polynomial efficiency. (B) One has a polynomial efficiency and two has an exponential efficiency. Q(C) +ne is unsolvable and two is decidable. (D) One is decidable and two is unsolvable.

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
Answer this three questions explain and show work why the answers are right!
42. Which code below can replace the missing code to select data that is less than the targetValue and even? Assume all variables have been properly initialized. IF < missing code > { DISPLAY ("Found it!") } (A) (num MOD 2=0) OR (targetValue <num) (B) (targetValue> num) AND (target Value MOD 2=0) (C) (num MOD 2 = 0) AND (targetValue> num) (D) (targetValue> num) OR (NOT(num MOD 2 > 0)) 43. Which type(s) of statement is needed to find all records in a list that are positive? (A) Sequential and iterative (B) Selection and sequential (C) Selection (D) Iterative and selection 44. Grace and Ada write algorithms and test them with increasingly large datasets. Algorithm 1 is still run- ning while algorithm 2 completed before midnight. What can you determine about the algorithms? (A) One has an exponential efficiency and two has a polynomial efficiency. (B) One has a polynomial efficiency and two has an exponential efficiency. Q(C) +ne is unsolvable and two is decidable. (D) One is decidable and two is unsolvable.
Transcribed Image Text:42. Which code below can replace the missing code to select data that is less than the targetValue and even? Assume all variables have been properly initialized. IF < missing code > { DISPLAY ("Found it!") } (A) (num MOD 2=0) OR (targetValue <num) (B) (targetValue> num) AND (target Value MOD 2=0) (C) (num MOD 2 = 0) AND (targetValue> num) (D) (targetValue> num) OR (NOT(num MOD 2 > 0)) 43. Which type(s) of statement is needed to find all records in a list that are positive? (A) Sequential and iterative (B) Selection and sequential (C) Selection (D) Iterative and selection 44. Grace and Ada write algorithms and test them with increasingly large datasets. Algorithm 1 is still run- ning while algorithm 2 completed before midnight. What can you determine about the algorithms? (A) One has an exponential efficiency and two has a polynomial efficiency. (B) One has a polynomial efficiency and two has an exponential efficiency. Q(C) +ne is unsolvable and two is decidable. (D) One is decidable and two is unsolvable.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
File Input and Output Operations
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
SEE MORE TEXTBOOKS