Browse All
Alphabetical listing with fast deep pagination.
1197283 items • Page 6 / 23946
# include # include #include using namespace std;
# include <iostream> # include <conio.h> #include<stdlib.h> using namespace std; int main() { //clrscr(); int a[50],size; int p,c; cout<<"Enter the Size of…
# include # include using namespace std; /* * Node Declarat
# include <iostream> # include <cstdlib> using namespace std; /* * Node Declaration */ struct node { int info; struct node *left; struct node *right; }*r; /* …
# include using namespace std; int main () { char name[60]; int adult
# include <iostream> using namespace std; int main () { char name[60]; int adult; int child; int a=6; int c=3; int gross = (adult*6)+ (child * 3) ; int …
# include # include \" sthread .h\" static void go( int n); # define
# include <stdio .h> # include " sthread .h" static void go( int n); # define NTHREADS 10 static sthread_t threads [ NTHREADS ]; int main ( int argc , char ** argv ) { int i…
# include int main() ( int number, sum, choice, total_numbers; printf(
# include <stdio.h> int main() ( int number, sum, choice, total_numbers; printf("Welcome to the integer sum program! "); choice = 0; total numbers = 0; sum = 0; while (choic…
# include \"stdafx.h\" # include #include using namespace std
# include "stdafx.h" # include<iostream> #include <string> using namespace std; int main() { string str,s1,s3,s; cout<<"Enter string:"; getline(cin, str); s=str;…
# include \"stdafx.h\" # include #include using namespace std
# include "stdafx.h" # include<iostream> #include <string> using namespace std; int main() { string str,s1,s3,s; cout<<"Enter string:"; getline(cin, str); s=str;…
# include \"stdafx.h\" # include #include using namespace std
# include "stdafx.h" # include<iostream> #include <string> using namespace std; int main() { string str,s1,s3,s; cout<<"Enter string:"; getline(cin, str); s=str;…
# include using namespace std;//Write a function to return a string composed of
# include using namespace std;//Write a function to return a string composed of the most//frequent lowercase letter found in each row of a 10 times 10//array of lowercase alphabet…
# include void Maximum (int m[][20],int n); void count (int s); main(){ i
# include<conio> void Maximum (int m[][20],int n); void count (int s); main(){ int i ,j,n,avr,sum,s=0; int m[5][20]; int t[20]; cout<<" Welcome to my programe "<<…
# include int n_i = 0, n_d = 0; in int no_i[984]; double no_d[984]; voi
#include<stdio.h> int n_i = 0, n_d = 0; in int no_i[984]; double no_d[984]; void printValues(); int main() { int choice, I, j, temp; do{ printf(“1)Print author info 2)Print …
# of Rain jackets produced Total Cost 40 $11,750 100 $18,985 180 $28,500 260 $38
# of Rain jackets produced Total Cost 40 $11,750 100 $18,985 180 $28,500 260 $38,000 310 $44,000 360 $50,000 The same athletics company does some market research and finds the fol…
# of purchase orders $400,000 overhead cost # of shipments $100,000 # of setups
# of purchase orders $400,000 overhead cost # of shipments $100,000 # of setups $300,000 Direct labor hrs$125,000 # of inspections $75,000 During the year, 1000 purchase orders, 3…
# pascal.py: takes an integer n as command-line argument and writes # Pascal\'s
# pascal.py: takes an integer n as command-line argument and writes # Pascal's triangle P_n. import stdarray import stdio import sys # Get n from command line, as an int. n = int(…
# sqrt.py import stdio import sys # Accept float c as a command-line argument. W
# sqrt.py import stdio import sys # Accept float c as a command-line argument. Write to standard # output the square root of c to 15 decimal places of accuracy # Use Newton's meth…
# there are different rules ofconcentration in the calculation of homeopathic me
# there are different rules ofconcentration in the calculation of homeopathic medicine. Ahomeopathic doctor would like to prescribe a dose of medication toa patient. The doctor ha…
# units Unit $ Beginning Inventory 1-1 200 15 Purchase 1-15 125 14 Purchase 1-16
# units Unit $ Beginning Inventory 1-1 200 15 Purchase 1-15 125 14 Purchase 1-16 180 13 Purchase 1-18 200 12 Purchase 1-24 80 11 Sale 1-13 175 Sale 1-17 100 Sale 1-19 240 Sale 1-2…
# work and upload your solutions. If you get # stuck on a problem, go on to the
# work and upload your solutions. If you get # stuck on a problem, go on to the next; however, # if you leave n problem completely blank I can't give you # any partial credit. # P…
# workers total product marginal product 0 0 -- 1 8 8 2 10 3 25 4 30 5 3 6 24 wh
# workers total product marginal product 0 0 -- 1 8 …
# years FCF WACC G Period 1 2 45 million 14.5% 12% Period 2 3 56.5 million 13.5%
# years FCF WACC G Period 1 2 45 million 14.5% 12% Period 2 3 56.5 million 13.5% 8% Period 3 perpetuity 65.9 million 12.5% 6% ABC Corp has been determined to be coming out of a gr…
#!/bin/bash clear echo \"Enter your oligonucleotide sequence: \" read SEQ if [[
#!/bin/bash clear echo "Enter your oligonucleotide sequence: " read SEQ if [[ "$SEQ" == [ATCGatcg] ]]; then echo "Your entered oligonucleotide sequence is $SEQ" else echo "E…
#!/bin/bash clear echo \"Enter your oligonucleotide sequence: \" read SEQ if [[
#!/bin/bash clear echo "Enter your oligonucleotide sequence: " read SEQ if [[ "$SEQ" == [ATCGatcg] ]]; then echo "Your entered oligonucleotide sequence is $SEQ" else echo "Error! …
#!/bin/bash count=1 while [ $count -lt 200 ] do echo \"Please gues the random nu
#!/bin/bash count=1 while [ $count -lt 200 ] do echo "Please gues the random number between 0 and 60 computer has chosen for you:" read number RANGE=60 num=$RANDOM let "num %= $…
#!/bin/bash echo -n \"Enter a string: \" read st if [ $st = \"CS ] then echo $st
#!/bin/bash echo -n "Enter a string: " read st if [ $st = "CS ] then echo $st else echo "IT" fi n=5 if [ $n < 0 ] then echo -n "Solution 1:" echo $n fi if [ $n == 5 ] then echo…
#!/bin/bash if [ $# -eq 0 ] then echo \"Three args required - need an infile, ou
#!/bin/bash if [ $# -eq 0 ] then echo "Three args required - need an infile, outfile, thirdfile" exit 1 fi ts=$(date +%s%N) openssl enc -e -des-cbc -salt -in $1 -out $2 -k nightha…
#!/bin/bash wordcount=$(wc -w \'pizza\') wordcountday=[$wordcount/20] wordcountd
#!/bin/bash wordcount=$(wc -w 'pizza') wordcountday=[$wordcount/20] wordcountdaypid=[$wordcountday/29447] echo $wordcountdaypid This is my script right now. I am trying to read a …
#!/bin/python3 import math import os import random import re import sys # # Comp
#!/bin/python3 import math import os import random import re import sys # # Complete the 'powerJump' function below. # # The function is expected to return an INTEGER. # The funct…
#!/usr/bin/perl -w use strict; my @primes = (2,3,5,7,11,13,17,19,23,29,31,37,41,
#!/usr/bin/perl -w use strict; my @primes = (2,3,5,7,11,13,17,19,23,29,31,37,41,43,47); sub listprimes { my $n = shift; my $i = 0; my $answer = ""; while ($primes[$i]<=$n) { $a…
## Binary search trees Implement a [binary search tree](https://en.wikipedia.org
## Binary search trees Implement a [binary search tree](https://en.wikipedia.org/wiki/Binary_search_tree) that supports insert, search, and [traversal](https://en.wikipedia.org/wi…
## Homework #1 Basic commands of R and dataset management install.packages(\"nyc
## Homework #1 Basic commands of R and dataset management install.packages("nycflights13") #Install first #then add this line #library(nycflights13) ### Problem 5 The dataset AllC…
## IN C LANGUAGE ## Create a program that accepts and formats a paragraph from t
## IN C LANGUAGE ## Create a program that accepts and formats a paragraph from the user as follows: Ask the user for the length of the paragraph in characters. Repeatedly ask the …
## Question: ## Write a function \"findpat\" that takes a ## long binary pattern
## Question: ## Write a function "findpat" that takes a ## long binary pattern in $a0 and a smaller ## binary pattern in $a1, and returns true ## if the long binary pattern contai…
## Start of file funct2.a ## ## MIPSMARK 1.1 21/4/99 Copyright 1998 J. Waldron.
## Start of file funct2.a ## ## MIPSMARK 1.1 21/4/99 Copyright 1998 J. Waldron. ## All Rights Reserved. See the file README for ## a full copyright notice. ## ## Question: ## Writ…
## Start of file stack2.a ## ## MIPSMARK 1.1 21/4/99 Copyright 1998 J. Waldron.
## Start of file stack2.a ## ## MIPSMARK 1.1 21/4/99 Copyright 1998 J. Waldron. ## All Rights Reserved. See the file README for ## a full copyright notice. ## ## Question: ## The …
## This is the modulized wheelfortune program ## I provide you the main function
## This is the modulized wheelfortune program ## I provide you the main function and data section ## you need write the following functions ## READ CAREFULLY BEFORE YOU ATTEMPT TH…
## This is the modulized wheelfortune program ## I provide you the main function
## This is the modulized wheelfortune program ## I provide you the main function and data section ## you need write the following functions ## READ CAREFULLY BEFORE YOU ATTEMPT TH…
## This is the modulized wheelfortune program ## I provide you the main function
## This is the modulized wheelfortune program ## I provide you the main function and data section ## you need write the following functions ## the 5 functions below right under .d…
## This is the modulized wheelfortune program ## I provide you the main function
## This is the modulized wheelfortune program ## I provide you the main function and data section ## you need write the following functions ## the 5 functions below right under .d…
## This is the modulized wheelfortune program ## you need write the following fu
## This is the modulized wheelfortune program ## you need write the following functions ## I have not posted the main function because it is already written ## and when i post it …
## palindrome.asm -- get some text and test if it is a palindrome. ## Register u
## palindrome.asm -- get some text and test if it is a palindrome. ## Register usage (simple collection): ## $t1 - A. ## $t2 - B. ## $t3 - the character at address A. ## $t4 - the…
### 8.15 Program: Playlist (C++) You will be building a linked list. Make sure t
### 8.15 Program: Playlist (C++) You will be building a linked list. Make sure to keep track of both the head and tail nodes. (1) Create three files to submit. Playlist.h - Class …
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that the relation stars in discussed in example 8.14 required 100 pages rather than 10, but all other a…
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that the relation stars in discussed in example 8.14 required 100 pages rather than 10, but all other a…
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that the relation stars in discussed in example 8.14 required 100 pages rather than 10, but all other a…
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that the relation stars in discussed in example 8.14 required 100 pages rather than 10, but all other a…
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that the relation stars in discussed in example 8.14 required 100 pages rather than 10, but all other a…
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that the relation stars in discussed in example 8.14 required 100 pages rather than 10, but all other a…
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that the relation stars in discussed in example 8.14 required 100 pages rather than 10, but all other a…
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that the relation stars in discussed in example 8.14 required 100 pages rather than 10, but all other a…
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that
### Database Systems The CompleteBook (2nd Edition) Exercise 8.4.1: suppose that the relation stars in discussed in example 8.14 required 100 pages rather than 10, but all other a…