Data structures and algorithms in C++
2nd Edition
ISBN: 9780470460443
Author: Goodrich
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 1, Problem 2C
Explanation of Solution
Program code:
//include the required header files
#include<iostream>
//define the main() method
int main()
{
//declare an integer variable
const int size=3;
//declare an integer array
int arr[size],count=0;
//prompt the array elements
std::cout<<"\nEnter the contents of the array below\n";
//iterate a for loop
for(int i=0;i<size;i++)
//scan for the array values
std::cin>>arr[i];
//print the statement
std::cout<<"\nNOTE:It would not count pairs like (1,1) or (2,2)";
//print the pairs using for loop
std::cout<<"\nThese are the Pairs\n";
for(int i=0;i<size;i++)
{
//int temp=arr[i];
for(int j=0;j<size;j++)
{
//if i and j are equal
if(i==j)
std::cout<<"";
//if i and j are not equal
else
{
//if the condition is true
if(arr[i]*arr[j]%2==0)
{
//print the pairs
;&#...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Using the following execution shown below, explain what is done in each of the ARIES recovery algorithm phases:
LSN
LOG
00
begin_checkpoint
10
end_checkpoint
20
update: T1 writes P1
30
update: T2 writes P2
40
update: T3 writes P3
50
T2 commit
60
update: T3 writes P2
70
T2 end
80
update: T1 writes P5
90
T3 abort
CRASH, RESTART
In addition to the execution shown here, the system crashes during recovery after writing two log records to stable storage and again after writing another two log records
A new application is being developed and will be using a database that includes a relation about items: Item (item_id:integer, item_name:string, color:string, price:real).
Both the purchasing department in charge of obtaining raw material and the manufacturing department in charge of manufacturing the items can change the price of manufactured items according to changes that may happen in the raw material cost or production cost. The two departments use different transactions to update the price of items. The new application uses the following sequences of actions, listed in the order they are submitted to the DBMS:
Sequence S1: T1:R(X), T2:W(X), T2:W(Y), T3:W(Y), T1:W(Y), T1:Commit, T2:Commit, T3:Commit
Sequence S2: T1:R(X), T2:W(Y), T2:W(X), T3:W(Y), T1:W(Y), T1:Commit, T2:Commit, T3:Commit
For each of the following concurrency control mechanisms, describe how they will handle each of the sequences (S1 & S2).
Strict 2PL with timestamps used for deadlock prevention.
Conservative…
As a database administrator of a large manufacturing organization, you are in charge of their website database that handles suppliers, parts, catalog, customers, and payments of delivered items. The following relations are part of the large database:
Supplier(SID, Sname, Saddress, Stelephone)Customer(CID, Cname, Caddress, Ctelephone)Part(PID, Pname, Pmodel, Pcolor)Catalog(SID, PID, Price)
(The Catalog relation lists the prices charged for parts by Suppliers).
Because the application is web-based and the database is accessed by many users, you want to increase the concurrency usage without compromising the data quality. For each of the following transactions, state the minimum SQL isolation level you would use in order to avoid any conflict problems in them. Please explain your choice.
A transaction that adds a new part to a supplier’s catalog.
A transaction that increases the price that a supplier charges for a part.
A transaction that determines the total number of items for a given…
Chapter 1 Solutions
Data structures and algorithms in C++
Ch. 1 - Prob. 1RCh. 1 - Prob. 2RCh. 1 - Give a C++ definition of a struct called Pair that...Ch. 1 - Prob. 4RCh. 1 - Prob. 5RCh. 1 - Prob. 6RCh. 1 - Prob. 7RCh. 1 - Write a short C++ function, isMultiple, that takes...Ch. 1 - Write a C++ function printArray(A, m, n) that...Ch. 1 - What (if anything) is different about the behavior...
Ch. 1 - Write a C++ class, Flower, that has three member...Ch. 1 - Modify the CreditCard class from Code Fragment 1.3...Ch. 1 - Modify the CreditCard class from Code Fragment 1.2...Ch. 1 - Modify the CreditCard class from Code Fragment 1.2...Ch. 1 - Modify the CreditCard class from Code Fragment 1.2...Ch. 1 - Prob. 16RCh. 1 - Write a short C++ function, isMultiple, that takes...Ch. 1 - Write a short C++ function, isTwoPower, that takes...Ch. 1 - Write a short C++ function that takes an integer n...Ch. 1 - Write a short C++ function that takes an integer n...Ch. 1 - Write a short C++ function that takes a positive...Ch. 1 - Write a pseudo-code description of a method that...Ch. 1 - Prob. 2CCh. 1 - Prob. 3CCh. 1 - Prob. 4CCh. 1 - Prob. 5CCh. 1 - Write a short C++ program that outputs all...Ch. 1 - Write a short C++ program that takes all the lines...Ch. 1 - Prob. 8CCh. 1 - Prob. 9CCh. 1 - Write an efficient C++ function that takes any...Ch. 1 - The greatest common divisor, or GCD, of two...Ch. 1 - A common punishment for school children is to...Ch. 1 - Write a C++ program that, when given a starting...
Knowledge Booster
Similar questions
- Please no AI! Or if you do use AI, Check the work please! Thank you!arrow_forward(Dynamic Programming.) Recall the problem presented in Assign- ment 3 where given a list L of n ordered integers you're tasked with removing m of them such that the distance between the closest two remaining integers is maxi- mized. See Assignment 1 for further clarification and examples. As it turns out there is no (known) greedy algorithm to solve this problem. However, there is a dynamic programming solution. Devise a dynamic programming solution which determines the maximum distance between the closest two points after removing m numbers. Note, it doesn't need to return the resulting list itself. Hint 1: Your sub-problems should be of the form S(i, j), where S(i, j) returns the maximum distance of the closest two numbers when only considering removing j of the first i numbers in L. As an example if L [3, 4, 6, 8, 9, 12, 13, 15], then S(4, 1) = 2, since the closest two values of L' = [3,4,6,8] are 6 and 8 after removing 4 (note, 8-6 = = 2). = Hint 2: For the sub-problem S(i, j),…arrow_forward
- (Greedy Algorithms) Describe an efficient algorithm that, given a set {x1, x2, . . ., xn} of points on the real line, determines the smallest set of unit-length closed intervals that contains all of the given points. Argue that your algorithm is correct.arrow_forwardWhat does the value of the top variable indicate in this ArrayStack implementation? What will happen if we call pop on this stack? What value will be returned, and what changes will occur in the array and the top variable? 3. If we push the value "echo" onto the stack, where will it be stored in the array, and what will be the new value of top? 4. Explain why index 0 contains the string "alpha" even though top is currently 3. 5. What would the state of the stack look like (values in the array and value of top) after two consecutive pop 0 operations?arrow_forwardPlease solve and show all work. Suppose there are four routers between a source and a destination hosts. Ignoring fragmentation, an IP datagram sent from source to destination will travel over how many interfaces? How many forwarding tables will be indexed to move the datagram from the source to the destination?arrow_forward
- Please solve and show all work. When a large datagram is fragmented into multiple smaller datagrams, where are these smaller datagrams reassembled into a single large datagram?arrow_forwardPlease solve and show all steps. True or false? Consider congestion control in TCP. When the timer expires at the sender, the value of ssthresh is set to one-half of the last congestion window.arrow_forwardPlease solve and show all work. What are the purposes of the SNMP GetRequest and SetRequest messages?arrow_forward
- Please solve and show all steps. Three types of switching fabrics are discussed in our course. List and briefly describe each type. Which, if any, can send multiple packets across the fabric in parallel?arrow_forwardPlease solve and show steps. List the four broad classes of services that a transport protocol can provide. For each of the service classes, indicate if either UDP or TCP (or both) provides such a service.arrow_forwardPlease solve and show all work. What is the advantage of web caches, and how does it work?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education