1. Make an algorithm for the given program2. Illustrate a Flowchart #include#include#include#includeint i;char n=1,username[16],password[ 30],ch;void welcome(){system ("@cls||clear");printf("\t\tWECOME TO MY SITE\n");}int main(){while(n<=3){welcome();printf("\n\NLOGIN HERE!");printf("\n\nUSERNAME : ");scanf ("%s",&username);printf("PASSWORD: ");for (i=0;i<16;i++){ch = getch();if(ch==13){password[i]='\0';break;password[i]=ch;printf("*");password[i]='\0';printf("\n\n");system("pause");if(strcmp(username, "rolan")==0)if(strcmp(password, "12345")==0){welcome();printf("\n\NYOU'VE LOGIN SUCCESSFULLY!");break;elsewelcome();printf("\n\nWRONG PASSWORD. You have %d attempt/s left...",3-n);elsewelcome();printf("\n\NUSER DOESN'I EXIST. You have %d attempt/s left...",3-n);getch();n++;if(n==4){welcome();printf("\nSORRY! YOU CAN'T LOGIN.");break;getch();}}

welcome(): Clear screen Display WELCOME TO MY SITE main(): Start Initialize n to 1 Loop if…

Answered: Make an algorithm for the given program…

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

Similar questions

c++complete and change #include <iostream>using namespace std; int sumbyrow(int* m, int ncol, int row){int total = 0;for (int i = 0 i < ncol; i++) {total += m[row * ncol + i];}return total; } int sumBCol(int* m, int nrow, int ncol, int col){int total = 0;for (int j = 0; < j nrow; j++) {total += m[j * ncol + col]; }return total;}int sumBYLeftDiag(int* m, int ncol){int total = 0;for (int i = 0, j = ncol - 1; i < ncol && j >= 0; i++, j--) {total += m[i * ncol + j];}return total;}bool hasDuplicates(int* m, int row) {int flatArray[row * row];int k = 0for (int i = 0; i < row; i++) {for (int j = 0; j < row; j++) {flatArray[k++] = m[i * row + j]; }}for (int i = 0; i < (row * row); i++) {for (int j = i + 1; j < (row * row); j++) {if (flatArray[i] == flatArray[j])return true; }}return flase;} bool isMagicMatrix(int* m, int nrow, int ncol) { if (hasDuplicate(m, nrow), int ncol{return false; }if (sumByleftDiag(m, nrow) != sumByRightDiag(m, nrow)) {return…
def small_index(items: list[int]) -> int:"""Return the index of the first integer in items that is less than its index,or -1 if no such integer exists in items.>>> small_index([2, 5, 7, 99, 6])-1>>> small_index([-5, 8, 9, 16])0>>> small_index([5, 8, 9, 0, 1, 3])3"""
C programming: Stacks. Help fully understand the code below by putting comments. THanks! ... #include<stdio.h> #include<stdlib.h> #include<ctype.h> #include<string.h> int numbers[500], tn=-1, to=-1; char ops[500]; void pushNum(int n) { numbers[++tn] = n; } void pushOp(char ch) { ops[++to]=ch; } int popNum() { return numbers[tn--]; } char popOp() { return ops[to--]; } int precedence(char op){ if(op == '+'||op == '-') return 1; if(op == '*'||op == '/') return 2; return 0; } // this function will perform arithmetic operations. int applyOp(int a, int b, char op){ switch(op){ case '+': return a + b; case '-': return a - b; case '*': return a * b; case '/': return a / b; default: return 0; } } int isOperator(char ch) { return(ch=='+'||ch=='-'||ch=='*'||ch=='/'||ch=='^'); } int evaluate(char exp[200]){ int i,num,output,r; char c; for(i=0;exp[i]!='\0';i++) { c = exp[i];…
using this c++ code add these improvements -want to ignore whitespace -allow number #include <stdio.h> #include <ctype.h> #include <stdlib.h> int lookahead; void expr(void); void rest(void); void term(void); void match(int); void error(void); int main(void) { lookahead = getchar(); expr(); putchar('\n'); /* adds trailing newline character */ } void term(void) { if (isdigit(lookahead)) { putchar(lookahead); match(lookahead); } else error(); } void match(int t) { if (lookahead == t) lookahead = getchar(); else error(); } void error(void) { printf("syntax error\n"); /* print error message */ exit(1); /* then halt */ } void expr(void) { term(); while ( 1) { if (lookahead == '+') { match('+'); term(); putchar('+'); } else if (lookahead == ' - ') { match(' - '); term(); putchar(' - '); } else break; } }
In c++. Please need rescurive arrays such as in picture from level 0 to level 1 to level 2. split into recursive functions. Using argumentmanger.h. here it is. #include <map> #include <string> #include <iostream> #include <sstream> using namespace std; // This is a class that can parse the commnad line arguments we use in COSC 2430 homework. class ArgumentManager { private: map<string, string> m_argumentMap; public: ArgumentManager() { } ArgumentManager(int argc, char *argv[], char delimiter=';'); ArgumentManager(string rawArguments, char delimiter=';'); void parse(int argc,char*argv[],char delimiter=';'); void parse(string rawArguments,char delimiter=';'); string get(string argumentName); string toString(); friend ostream&operator<<(ostream &out, ArgumentManager &am); }; void ArgumentManager::parse(string rawArguments, char delimiter) { stringstream currentArgumentName; stringstream currentArgumentValue; bool argumentNameFinished…
#include <stdio.h>#include <stdlib.h> typedef struct Number_struct { int num;} Number; void Swap(Number* numPtr1, Number* numPtr2) { /* Your code goes here */} int main(void) { Number* num1 = NULL; Number* num2 = NULL; num1 = (Number*)malloc(sizeof(Number)); num2 = (Number*)malloc(sizeof(Number)); int int1; int int2; scanf("%d", &int1); scanf("%d", &int2); Thank you so much but i forgot to put this how i would fit in into this. num1->num = int1; num2->num = int2; Swap(num1, num2); printf("num1 = %d, num2 = %d\n", num1->num, num2->num); return 0;}
c++ computer language what is the output of the following code segment? int main() { int myarray[]={-200, 33, 89, 50, 44}; sub(myarray, 5); for(int i =0; i<5; i++) cout<<myarray[i]<<" "; cout<<endl; system("pause"); return 0; }; void sub(int arr[], int z) { for(int i =0; i<z; i++) arr[i] = arr[i] - i; }
Topic: pointers, dynamic array and command line arguments Write a complete C++ program named “showHelp” that accepts command line arguments. It checks whether there is a command line argument of “/help” or“/?” or “-help” followed by a topic number. It will print out “yes, topic number(<number>) if there is one. Otherwise, it prints out “no, topic number(N/A) For example, if you run this program with correct arguments as follows, it willprint out yes and its associated topic number respectivelyshowHelp /? 101showHelp /debug /help 102showHelp /print /help 103 /verboseshowHelp -verbose -debug -help And if you run the program with invalid arguments, it will print no, in all casesshowHelp -helpshowHelp 101 /?showHelp 101 102 /help /verboseshowHelp /? /help -helpNote: command line arguments are simply an array of pointers to C-string. example code: #include <iostream> using namespace std; int main(int argc, char** argv){...}
C++; In all different cases please create a const int SIZE_EX_1 = 10; // type of declaration. Do not hard code numbers into. #2) Seed the random number generator with 3579 #2B) Create an integer array of 10 elements #2C) Roll dice and place the value into each element. #2D) what is the sum? Caution you need to convert ints to doubles. Hint double numerator = static_cast<double> ( sumOfElements); double divisor = static_case<double> ( 10 ); // do not use 10 use the value in your const int SIZE_EX_5 = 10; statement #2E) Display the average value of the dice rolls. #2F) How many rolls do you need to do before things match what you think they should be. Hint modify the array size and run again.
Following code is for 4×4 tic toc toe game covert this code in to 3×3 players. Code #include <iostream> using namespace std; class Board { char board[4][4]; public: Board() { for(int i=0;i<4;i++) { for(int j=0;j<4;j++) { board[i][j]='_'; } } } void printBoard() { for(int i=0;i<4;i++) { for(int j=0;j<4;j++) { cout<<board[i][j]<<'|'; } cout<<endl; } cout<<endl; } int setPosition(char choice) { while(1) { int row,column; cout<<"Please enter the row and column"<<endl; cin>>row>>column; if(board[row][column]=='_') { board[row][column]=choice; break; } else { cout<<"Position is taken"<<endl; } } } char getPosition() { for(int i=0;i<4;i++) { for(int j=0;j<4;j++) { return board[i][j]; } } } int checkHorizontal(char choice) { int count; for(int i=0;i<4;i++) {…
getEvens public static int getEvens(int[] array, int[] result) Initializes the out parameter result with even values found in array Parameters: array - integer array result - integer array Returns: Number of even values found Throws: java.lang.IllegalArgumentException - if array or result (or both) are null, or if result's length is less than array's length. Any error message is fine (e.g., "Invalid parameters(s)")
#include <iostream>#include<iomanip>using namespace std; int main(){ const int ROW_HOURS=6; //declare variables const int CL_PAYRATE=2; double total_payout=0; double hours[ROW_HOURS][CL_PAYRATE]={ //declare array {0,12.85}, {0,12.85}, {0,12.85}, {0,11.75}, {0,11.75}, {0,11.15} }; cout<<fixed; cout<<setprecision(2); //setprecision of double values upto 2 decimal point for(int i=0;i<6;i++) //using loop get input from user { cout<<"Enter the hours worked by employee "<<i+1<<": "; cin>>hours[i][0]; //store values into hours } for(int i=0;i<6;i++) { double payout=hours[i][0]*hours[i][1]; //calculate payout of emplyee total_payout=total_payout+payout;…

SEE MORE QUESTIONS

Recommended textbooks for you

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

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

SEE MORE TEXTBOOKS

Make an algorithm for the given program 2. Illustrate a Flowchart