int t1 = 0, t2 = 1; // initialize the next term (3rd term) int nextTerm = t1 + t2; // get no. of terms from user printf("Enter the number of terms: "); scanf("%d", &n); // print the first two terms t1 and t2 printf("Fibonacci

int t1 = 0, t2 = 1; // initialize the next term (3rd term) int nextTerm = t1 + t2; // get no. of terms from user printf("Enter the number of terms: "); scanf("%d", &n); // print the first two terms t1 and t2 printf("Fibonacci

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter8: Advanced Method Concepts

Section: Chapter Questions

Problem 7RQ

See similar textbooks

Similar questions

Instruction: Answer question 4 (a,b & c) only (1) Create a C++ project for your assignment 3, with the name format prescribed in the Information section. Add a source file and name it SwapCount. In this file, write the C++ program that will perform the tasks specified in question 2.(2) Declare and implement a function called sortSwapCount that passes three parameters, the array, the size and the reference of proportion, and returns the count. The functiondeclaration is int sortSwapCount(int data[], int size, double& proportion) (i) The function sorts the integers in data[] in ascending order using the bubble sort method. The purpose is to count or determine the number of exchanges (swaps) made by the bubble sort algorithm. (ii) The expected number of sorting swaps (expectedSwapCount) is size * (size - 1) if the array was unsorted. Calculate the proportion of the array status by first converting (or casting) the integers, swapCount and expectedSwapCount into floating-point,…
Write in C for STM32F446RE microcontroller on the Nucleo-64 dev board uncluding proper header files Write a source library that contains the with the following public functions: void keypadInit(void); /Initiallized the GPIO to read the keypad. uint16_t readKeypad(void); //Returns the state of all of the keypad buttons in the return value at the moment the function is called. void decodeKeypad(uint16_t, char *); //Takes the state of the keypad and returns (by reference) an array of the key's pressed. The library should work with the following main: int main (void) { uint16_t key; char carray[17]; keypadInit(); while(1) { while(!(key = readKeypad())); /*Get which keys pressed*/ decodeKeypad(key, carray); /*What are those keys*/ printf("%s\n",carray); /*Print those keys to screen*/ while(readKeypad() == key); /*Wait for the keypad to change*/ }} Problem 1: Write a library that works with the following…
in python “c” represents a crop and “w” represents a water source. Each water source hydrates the eight tiles around it (including itself) Input the number of rows and columns in the crop field:ROWS> 4COLUMNS> 4Input each row of the crop field.ROW0> c c c wROW1> w c c cROW2> c c c cROW3> c w c cNot all crops are watered!OUTPUT FalseThe following crops are not watered:OUTPUT [(2, 3), (3, 3)] Input the number of rows and columns in the crop field:ROWS> 7COLUMNS> 1Input each row of the crop field.ROW0> cROW1> wROW2> cROW3> cROW4> wROW5> cROW6> wAll crops are watered!OUTPUT True
Write a program in C that creates a simplified railways network. The program starts byoffering the user the following list of options :1. Please enter 1 to add a new record of stations .2. Please enter 2 to add a new record of tracks.3. Please enter 3 to sort and print the tracks according to their lengths in descendingorder .4. Please enter 4 to find and print the station that has the maximum number ofconnected tracks .5. Please enter 5 to exit the program.Notes about the program:1. The information about each station is composed of the following attributes:Number and Capacity.2. The information about each track is composed of the following attributes:Number, Length, StStation, and EnStation.3. After accomplishing any of the tasks (1, 2, 3, and 4) or entering an invalid value,the program will show the list of options again.
please code in pythonthe below code has alot of errors .. please make it error free import numpy as np import randomimport sys import osfrom datetime import datetimeimport string import subprocess from subprocess import callfrom subprocess import check_output if len(sys.argv) < 3: print('Usage: maintest.py Nm Ns R \n') exit() Ns = sys.argv[1] #sort size R = sys.argv[2] #number of repetitions w = open('BubbleSortResult.txt', 'w')#BubbleSort1: No Split Input = np.random.rand(Ns) Itmp = list (Input) def sort (numbers): sorted = False while not sorted: sorted = True for i in range (len (numbers)-1): if numbers [1] > numbers [i + 1]: sorted = False numbers [i + 1], numbers [i] = numbers[i], numbers [ i + 1]Te = datetime. now () for i in range (R): #Run R-time Itmp = list (Input) # Get fresh Input #print (Itmp) sort (Itmp) # This is in-place sort. Input will be altered. Te = datetime. now () - Te Totalus…
GENERATE THE CODE BELOW FROM THE UNIX ENVIRONMENT #include <stdio.h>#include <stdlib.h>#include <time.h> // Function to display the game boardvoid displayBoard(char board[3][3]) { printf("\n"); printf(" %c | %c | %c \n", board[0][0], board[0][1], board[0][2]); printf(" ---|---|---\n"); printf(" %c | %c | %c \n", board[1][0], board[1][1], board[1][2]); printf(" ---|---|---\n"); printf(" %c | %c | %c \n", board[2][0], board[2][1], board[2][2]); printf("\n");} // Function to check if the game is over (i.e., if someone has won or if there are no more moves)int isGameOver(char board[3][3]) { // Check rows for a win for (int i = 0; i < 3; i++) { if (board[i][0] != ' ' && board[i][0] == board[i][1] && board[i][1] == board[i][2]) { return 1; } } // Check columns for a win for (int i = 0; i < 3; i++) { if (board[0][i] != ' ' && board[0][i] == board[1][i] && board[1][i]…
Computer Science Your dev lead wants to plan a celebration for the 100th code war event that we have as a team. Since we only do code wars on the 5th Friday of the month what date will the 100th event fall on? Include 4/29/22 as the first event day. USE C# implement this code for the solution: using System; using System.Diagnostics; namespace September { /// <summary> /// April Code War /// </summary> class Program { /// <summary> /// Main method /// </summary> static void Main() { // Accuracy Test Console.WriteLine(Calculate100thFifthFriday()); Console.WriteLine(Calculate100thFebruaryFifthFriday()); Console.Out.WriteLine(); Console.Out.WriteLine(); // Speed Test Console.Out.WriteLine("Hit enter to start speed test");…
Write code for below problem. The input below is just an example and you should implement independent from the input. You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below; 1. You will start from the top and move downwards to an adjacent number as in below. 2. You are only allowed to walk downwards and diagonally. 3. You can only walk over NON PRIME NUMBERS. 4. You have to reach at the end of the pyramid as much as possible. 5. You have to treat your input as pyramid. According to above rules the maximum sum of the numbers from top to bottom in below example is 24. *1 *8 4 2 *6 9 8 5 *9 3 As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9 1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the maximum sum.
Create a Student class in C++ language to read and print N student's details. The output shall be like the following: Enter name: Ahmad Enter ID number: 101 Enter total marks out of 500: 456 Enter details of student 2: Enter name: Ali Enter ID number: 102 Enter total marks outof 500: 398 ...... until student number 10 Details of student 1: Student details: Name:Ahmed,Roll Number:101,Total:456,Percentage:91.2 Details of student 2: Student details: Name:Ali,Roll Number:102,Total:398,Percentage:79.6 ....... until student number 10 Enter total number of students: 10 Enter details of student 1:
Can you put the Average Waiting Time and Turnaround Time in the code? Thank you! Code: #include <iostream>#include <queue>#include <string>#include <vector>#include <functional> struct Process { int arrivalTime; // Added arrivalTime int processId; int burstTime; int priority;}; void print_gantt_chart(const std::vector<std::pair<int, int>>& gantt_chart) { std::cout << "Gantt Chart:" << std::endl; std::cout << "---------------------------------------------" << std::endl; std::cout << "| "; for (const auto& process : gantt_chart) { std::cout << "P" << process.first << " | "; } std::cout << std::endl; std::cout << "---------------------------------------------" << std::endl; std::cout << "0"; int currentTime = 0; for (const auto& process : gantt_chart) { currentTime += process.second; if…
What will be displayed in the screen after the following program executes, provided the formal parameter denoted with & will be transferred by: a. value b.value/result c. reference d. name CODE: int a[5]; int i,X=1; void swap (int&a, int&b,int&c) int t; { c++; t = a+X+c; a = b; b = t; } void main() { for (i=0;i<5;i++) a[i] = 6 – i; i = 2; swap(i, a[i],X); printf(“%d%d%d%d%d%d”,i,a[0], a[1], a[2], a[3], a[4]); }
zyDE 6.2.1: Amusement park ride reservation system. The following (unfinished) program implements a digital line queuing system for an amusement park ride. The system allows a rider to reserve a place in line without actually having to wait. The rider simply enters a name into a program to reserve a place. Riders that purchase a VIP pass get to skip past the common riders up to the last VIP rider in line. VIPs board the ride first. (Considering the average wait time for a Disneyland ride is about 45 minutes, this might be a useful program.) For this system, an employee manually selects when the ride is dispatched (thus removing the next riders from the front of the line). Complete the following program, as described above. Once finished, add the following commands: The rider can enter a name to find the current position in line. (Hint: Use the list.index() method.) The rider can enter a name to remove the rider from the line. riders_per_ride = 3 # Num riders per ride to dispatch…