Solve please Determine which of the programming codes has less time (perform algorithmic complexity calculationfor this)Code 1Code 2#include #include #include #include int main()int main(){int mes;int mes;printf ("\n Introduzca mes del año: ", mes);scanf("%d", &mes);printf("\n Introduzca mes del año: ", mes);scanf("%d", &mes);If (mes= "Enero")switch (mes){case 1: printf ("\n Enero");break;case 2: printf ("\n Febrero");break;case 3: printf ("\nMarzo");break;case 4: printf ("\n Abril");break;case 5: printf ("\n Mayo");break;case 6: printf ("\n Junio");break;case 7: printf ("\n Julio");break;case 8: printf ("\n Agosto");break;case 9: printf ("\n Septiembre");break;case 10: printf ("\n Octubre");break;case 11: printf ("\n Noviembre");break;case 12: printf ("\n Diciembre");break;default: printf ("\n ERROR: Mes incorrecto.");printf ("\n Enero");}else;if (mes= "Febrero){printf ("\n Febrero");elseIf (mes= "Marzo"){printf ("\n Marzo");}else;if (mes- "Abril){printf ("\n Abril");}else;If (mes "Mayo"){printf ("\n Mayo");}else;if (mes- "Junio")printf ("\n Junio");}else;If (mes "Julio"){printf ("\n Julio");else;(printf ("\n ERROR: Mes incorrecto.");}}

Solution: Code 1, has less time.

Determine which of the programming codes has less time (perform algorithmic complexity calculation for this) Code 1 Code 2 #include #include #include #include int main() int main() { { int mes; int mes; printf ("\n Introduzca mes del año: ", mes); scanf("%d", &mes); printf ("\n Introduzca mes del año: ", mes); scanf("%d", &mes); If (mes= "Enero") switch (mes) { printf ("\n Enero"); { } case 1: printf ("\n Enero"); else; break; if (mes= "Febrero) case 2: printf ("\n Febrero"); { printf ("\n Febrero"); break; } case 3: printf ("\n Marzo"); else break; If (mes= "Marzo") case 4: printf ("\n Abril"); { printf ("\n Marzo"); break; } case 5: printf ("\n Mayo"); else; break; if (mes- "Abril) { case 6: printf ("\n Junio"); printf ("\n Abril"); break; } case 7: printf("\n Julio"); else; break; If (mes - "Mayo") case 8: printf ("\n Agosto"); break; case 9: printf ("\n Septiembre"); break; case 10: printf ("\n Octubre"); break; case 11: printf("\n Noviembre"); break; case 12: printf ("\n Diciembre"); break; default: printf ("\n ERROR: Mes incorrecto.""); printf ("\n Mayo"); } else; if (mes= "Junio") { printf ("\n Junio"); } else; If (mes- "Julio") ( printf ("\n Julio"); } else; { printf ("\n ERROR: Mes incorrecto.");

Determine which of the programming codes has less time (perform algorithmic complexity calculation for this) Code 1 Code 2 #include #include #include #include int main() int main() { { int mes; int mes; printf ("\n Introduzca mes del año: ", mes); scanf("%d", &mes); printf ("\n Introduzca mes del año: ", mes); scanf("%d", &mes); If (mes= "Enero") switch (mes) { printf ("\n Enero"); { } case 1: printf ("\n Enero"); else; break; if (mes= "Febrero) case 2: printf ("\n Febrero"); { printf ("\n Febrero"); break; } case 3: printf ("\n Marzo"); else break; If (mes= "Marzo") case 4: printf ("\n Abril"); { printf ("\n Marzo"); break; } case 5: printf ("\n Mayo"); else; break; if (mes- "Abril) { case 6: printf ("\n Junio"); printf ("\n Abril"); break; } case 7: printf("\n Julio"); else; break; If (mes - "Mayo") case 8: printf ("\n Agosto"); break; case 9: printf ("\n Septiembre"); break; case 10: printf ("\n Octubre"); break; case 11: printf("\n Noviembre"); break; case 12: printf ("\n Diciembre"); break; default: printf ("\n ERROR: Mes incorrecto.""); printf ("\n Mayo"); } else; if (mes= "Junio") { printf ("\n Junio"); } else; If (mes- "Julio") ( printf ("\n Julio"); } else; { printf ("\n ERROR: Mes incorrecto.");

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

Related questions

Q: Let the universe of discourse be the set of negative integers. By selecting True or False, give the…

A: The universe of discourse is the set of negative integers. We need to determine if there exists a…

Q: o Each of the following are formulas for the number of operations in some algorithm. Give the…

A: To find the smallest value of the integer K for each formula so that it is O(n^k), we can follow…

Q: 1. Use mathematical induction to solve the following: 1 1 (a) Find a formula for 1 by examining the…

A: a) f(n) = 11.2+12.3+...+1n(n+1)f(1) = 11.2 is TrueLet f(k) is truef(k) = 11.2+12.3+...+1k(k+1) =k…

Q: nin!, log Cn), n2" e in increasing order according to their logn soblem@ Given:- arrange growth. Po…

A: Answer : The increasing order of the growth are : n ^ 2^n , n! , n ^ 2 , log(n^5) , ( 2 )…

Q: The number of permutations of a set of n items taken r at a time is given by the following…

A: Program code: //include the required header file #include<iostream> using namespace std;…

Q: Let the universe of discourse be the set of real numbers. By selecting True or False, give the truth…

A: Take x = -2 and y= 1, x + y = -1Given that x+y = z2=> z2 = -1 square of any real number cannot be…

Q: Order the following in big O : n², 1.01n, log n², n √n, n log n, n0.1, 1000

A: Big O complexity: It is used to analyze how complex to solve the program. Using the this complexity…

Q: n², n, 1, log₂ n, (3/2), n³, n log₂ n, 2n

A: The question has been answered in step2

Q: Is the following true or false? If f(n) 0 (g (n)), then f(n) = O(g(n)). O True O False

A: Option a is correctCorrect Answer:a. True

Q: Do you know what means about NP problem? 單選: O a. It is a No answer Problem. O b. It is a problem…

A: NP Problem: The Knapsack Problem is an optimization problem in which items of different weights and…

Q: using python complete this table with the following inputs Team1 5 25 30 23 22 21 endTeam1 Team2 3…

A: Here's a possible algorithm for this task: Define a function called "turkey_bowl_table()" that…

Q: Find the quotient machine of the following DFA. Please use a different marker for each iteration of…

A: Algorithm:- Algorithm is defined as set of steps that can perform a specific task.

Q: 4. For each of the following functions, indicate the class (g(n)) the function belongs to. a) √(10n²…

Q: Algorithm Prime2 (n: integer):{T,F}; prime = T; d=2; while d < n/2 and prime = T do…

A: In this given question there is an algorithm named prime2 and you have to how many times n mod d…

Q: You can use the __________ property to determine whether an item is selected in a ListBox. a. Index…

A: A “ListBox” control permits the user to select one or more items based on the “SelectionMode”…

Concept explainers

Declaring and Defining the function

A set of statements, which performs a particular task is called a function. The program gains modularity by using function. The application is quite easy to understand, read, and edit when they are created with functions. The developer/programmer creates a function and uses main() to call the function. Once the function gets executed, the control is transferred to the main program.

Question

100%

Solve please

Determine which of the programming codes has less time (perform algorithmic complexity calculation
for this)
Code 1
Code 2
#include <conio.h>
#include <stdio.h>
#include <conio.h>
#include <stdio.h>
int main()
int main()
{
int mes;
int mes;
printf ("\n Introduzca mes del año: ", mes);
scanf("%d", &mes);
printf("\n Introduzca mes del año: ", mes);
scanf("%d", &mes);
If (mes= "Enero")
switch (mes)
{
case 1: printf ("\n Enero");
break;
case 2: printf ("\n Febrero");
break;
case 3: printf ("\n
Marzo");
break;
case 4: printf ("\n Abril");
break;
case 5: printf ("\n Mayo");
break;
case 6: printf ("\n Junio");
break;
case 7: printf ("\n Julio");
break;
case 8: printf ("\n Agosto");
break;
case 9: printf ("\n Septiembre");
break;
case 10: printf ("\n Octubre");
break;
case 11: printf ("\n Noviembre");
break;
case 12: printf ("\n Diciembre");
break;
default: printf ("\n ERROR: Mes incorrecto.");
printf ("\n Enero");
}
else;
if (mes= "Febrero)
{
printf ("\n Febrero");
else
If (mes= "Marzo")
{
printf ("\n Marzo");
}
else;
if (mes- "Abril)
{
printf ("\n Abril");
}
else;
If (mes "Mayo")
{
printf ("\n Mayo");
}
else;
if (mes- "Junio")
printf ("\n Junio");
}
else;
If (mes "Julio")
{
printf ("\n Julio");
else;
(
printf ("\n ERROR: Mes incorrecto.");
}
}

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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.

Similar questions

Suppose that Q(x) is "x+1 = 2x", where x is a real number. How many of the following statements are TRUE? • Q(2) is true • there exists x such that Q(x) is true • for every x, Q(x) is true O O 0 1 02 0 3
Algorithm Prime2 (n: integer):{T,F}; prime = F; d=2; while d < n/2 and prime = F do if n mod d = 0 then prime = T else d = d+1 return prime; How many times is the operation "n mod d" performed, when the input for Algorithm Prime 2 is n=123? Group of answer choices 1 4 3 2 None of these.
n! is in theta(2n) true or false?
Which of the following is logically equivalent to 3xvy (S(y) v R(x)) ? \x³y(S(y)¬R(x)) (S(y)¬R(x)) vx³ (S(y) v¬R(x)) x³ (S(y) R(x)) ^
computes and returns the smallest positive integer n for which 1+2+3+...+n equals or exceeds the value of "goal".