Data structures and algorithms in C++
Data structures and algorithms in C++
2nd Edition
ISBN: 9780470460443
Author: Goodrich
Publisher: WILEY
Expert Solution & Answer
Book Icon
Chapter 1, Problem 5C

Explanation of Solution

Program code:

//include the required header files

#include<iostream>

#include<cstdlib>

//use std namespace

using namespace std;

//function that takes an array

//it will generate random integers

void Random_Order(int arr[],int n)

{

    //variable for counting random integers between 1 to 52

    int count=0;

   //while loop will iterate till count will equal to 52

    while(count<n)

    {

//flag to check random number is already generated or not

        int flag=0;

        //built in function to generate random number

        int random_number=(rand()%n)+1;

//for loop for checking if random number is exist in the array or not

        for(int i=0;i<count;i++)

        {

//if number is exist in the array, make flag as 1

            if(random_number==arr[i])

            {

                //set flag as 1

                flag=1;

            }

        }

        //if flag is 0, add into array

        if(flag==0)

        {

            //add number to the array

   arr[count]=random_number;

            //increment the count by 1

            count++;

        }

    }

    //create a variable c

    int c=0;

    //print the statement

    cout<<"52 Random Numbers:\n\n";

    //displaying numbers

    //10 integers in each row

    for(int i=0;i<n;i++)

    {

        //print the values

        cout<<arr[i]<<"\t";

        //increment c by 1

        c++;

        //if the value ...

Blurred answer
Students have asked these similar questions
Payroll Flowchart Analysis Discuss the risks depicted by the following payroll system flowchart. Describe the internal control improvements to the system that are needed to reduce these risks with specific explanations. An illustration of the above flowchart: It is represented in six columns and the column header reads: supervisor; payroll; data processing; accounts payable; cash disbursement; general ledger. In supervisor column, timekeeper enters into time cards and that leads to “Review Time cards and prepares Personnel Action Form” that further leads to two source documents “time cards, per action form.” Per action, form enters into prepare payroll in payroll column. Prepare payroll enters into paychecks and two source documents “payroll register, payroll register.” Payroll register leads to inverted triangle and payroll leads to A. Paycheck enters into review and distribute in supervisor column leads to paycheck and that further leads to employees. In data processing column,…
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…

Chapter 1 Solutions

Data structures and algorithms in C++

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education