Browse All
Alphabetical listing with fast deep pagination.
1197283 items • Page 33 / 23946
#define CRT SECURE NO WARNINGS #include : scanf %c\", cmd) switch (cmd) Add rect
#define CRT SECURE NO WARNINGS #include : scanf %c", cmd) switch (cmd) Add rectangle case 'A' case 'a' if (nRect 10) List is full. printf ("No room in list of rectangles "): else …
#define DATABASENAME \"database.bin\" int main() { if (loadDatabase(DATABASENAME
#define DATABASENAME "database.bin" int main() { if (loadDatabase(DATABASENAME)) { struct _record tmp; if (getRecord(DATABASENAME, 0, &tmp)) showRecord(&tmp); if (getRecor…
#define H_LinkedListType #include #include using namespace
#define H_LinkedListType #include <iostream> #include <cassert> using namespace std; //Definition of the node template <class Type> struct nodeType { Type info; …
#define MAX_DIM 100 #define MAX_ITER 500 #define TOLERANCE 1.e-6 void gauss_seid
#define MAX_DIM 100 #define MAX_ITER 500 #define TOLERANCE 1.e-6 void gauss_seidel (double a[][MAX_DIM], double b[], double x[], int n); void main () { int i, j, n; int violation_…
#define PI 3.14 //REQUIRED FUNCTIONS DECLARED. double cos_N (double x, int N); d
#define PI 3.14 //REQUIRED FUNCTIONS DECLARED. double cos_N (double x, int N); double cos_delta(double x, double delta ); int factorial (int n ); double power ( double x, int n); …
#define SIZE 10 #include using namespace std; char list[SIZE] = {\'A\
#define SIZE 10 #include <iostream> using namespace std; char list[SIZE] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'}; // recursively search the array list for key /…
#define STACK_SIZE 100 #include typedef intStackElement; /* External
#define STACK_SIZE 100 #include <stdlib.h> typedef intStackElement; /* External Variables:*/ StackElement contents[STACK_SIZE]; int top = -1; void make_empty(void) { top = -…
#define _CRT_SECURE_NO_WARNINGS #include #include #include #include #define MAX_
#define _CRT_SECURE_NO_WARNINGS #include #include #include #include #define MAX_STRING_LENGTH 80 using namespace std; int main() { string userInput; cout<<"Please enter a se…
#define _CRT_SECURE_NO_WARNINGS #include #include #include
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <fstream> #include <string> #include <cctype> #include <cstdlib> #include <algorithm&…
#define _CRT_SECURE_NO_WARNINGS #include #include #include
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct { int *array; int effectiveSize; int maximumSize; } Dyn…
#define _CRT_SECURE_NO_WARNINGS #include #include \"prog5_functions.h\
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include "prog5_functions.h" #include <math.h> double low_point, high_point, result, hp, lp, result2, x, change_in_x…
#electrochemistry solve the following with some explnation if you can and thanks
#electrochemistry solve the following with some explnation if you can and thanks in advance .. :) In an electrochemical cell, the anode is the a. neutral electrode. b. electrode a…
#electrochemistry solve the following with some explnation if you can and thanks
#electrochemistry solve the following with some explnation if you can and thanks in advance .. :) For electricity to flow in a voltaic cell, the two half-cells must be a. connecte…
#example of using a dictionary to store words and translations from tkinter impo
#example of using a dictionary to store words and translations from tkinter import filedialog from tkinter import * root = Tk() root.withdraw() root.filename = filedialog.askopenf…
#ifndef ARRAYLIST_H_ #define ARRAYLIST_H_ #define DEFAULT_CAPACITY 5 #define TRU
#ifndef ARRAYLIST_H_ #define ARRAYLIST_H_ …
#ifndef ARRAYLIST_H_ #define ARRAYLIST_H_ #define DEFAULT_CAPACITY 5 #define TRU
#ifndef ARRAYLIST_H_ #define ARRAYLIST_H_ …
#ifndef ARRAY_H_INCLUDED #define ARRAY_H_INCLUDED #include #include
#ifndef ARRAY_H_INCLUDED #define ARRAY_H_INCLUDED #include <iostream> #include <string> using namespace std; /* error codes 0 -- no error 1 -- non-positive size for co…
#ifndef AVLTREE_H #define AVLTREE_H #include \"Data.h\" template cl
#ifndef AVLTREE_H #define AVLTREE_H #include "Data.h" template <typename T> class AVLTree { private: struct AVLNode { AVLNode* leftChild; AVLNode* rightChil…
#ifndef BAKERCHRISTOPHER_H #define BAKERCHRISTOPHER_H #include using na
#ifndef BAKERCHRISTOPHER_H #define BAKERCHRISTOPHER_H #include <string> using namespace std; class ResistorClass { private: double nominalResistance; double tolerance; strin…
#ifndef BASEPLUS_H #define BASEPLUS_H #include // C++ standard string c
#ifndef BASEPLUS_H #define BASEPLUS_H #include <string> // C++ standard string class class BasePlusCommissionEmployee { public: BasePlusCommissionEmployee( const std::string…
#ifndef BATTLESHIP_H_ #define BATTLESHIP_H_ // coordinates (location) of the shi
#ifndef BATTLESHIP_H_ #define BATTLESHIP_H_ // coordinates (location) of the ship and shots class location{ public: location(void); // void constructor, assigns -1 to X void pick(…
#ifndef BIGINTEGER_H #define BIGINTEGER_H #include using namespace::std; const i
#ifndef BIGINTEGER_H #define BIGINTEGER_H #include using namespace::std; const int NUMDIGITS = 50; // A non-negative integer with NUMDIGITS // Leading zeores are stored in the num…
#ifndef BIGINTEGER_H #define BIGINTEGER_H #include using namespace::std; const i
#ifndef BIGINTEGER_H #define BIGINTEGER_H #include using namespace::std; const int NUMDIGITS = 50; // A non-negative integer with NUMDIGITS // Leading zeores are stored in the num…
#ifndef BST_H #define BST_H // Representation of an element in the tree struct N
#ifndef BST_H #define BST_H // Representation of an element in the tree struct Node { int val; // Value of the node Node *left; // Pointer to the left node Node *right; // Pointer…
#ifndef BST_H #define BST_H // Representation of an element in the tree struct N
#ifndef BST_H #define BST_H // Representation of an element in the tree struct Node { int val; // Value of the node Node *left; // Pointer to the left node Node *right; // Pointer…
#ifndef CARD_H #define CARD_H #include using namespace std; class Card
#ifndef CARD_H #define CARD_H #include <string> using namespace std; class Card { public: static const int totalFaces = 13; // total number of faces static const int totalSu…
#ifndef CREDIT_ACCOUNT_H #define CREDIT_ACCOUNT_H class CreditAccount { private:
#ifndef CREDIT_ACCOUNT_H #define CREDIT_ACCOUNT_H class CreditAccount { private: char accountNo[20]; char custName[20]; double creditLimit; double currentBalance; public: CreditAc…
#ifndef CSC116_ARRAY_LIST_H #define CSC116_ARRAY_LIST_H #include clas
#ifndef CSC116_ARRAY_LIST_H #define CSC116_ARRAY_LIST_H #include <iostream> class array_list { static const unsigned int INITIAL_SIZE = 6; static const unsigned int GR…
#ifndef FRACTION_H #define FRACTION_H //Fraction.h class Fraction{ private: int
#ifndef FRACTION_H #define FRACTION_H //Fraction.h class Fraction{ private: int numerator; int denominator; public: Fraction(); Fraction(int,int); void setNumerator(int num)…
#ifndef HEAP_H_ #define HEAP_H_ namespace cse { template < typename dtype> class
#ifndef HEAP_H_ #define HEAP_H_ namespace cse { template<typename dtype> class heap { public: /** TO DO:: default constructor perform new to reserve memory of size INITIAL_C…
#ifndef HEAP_H_ #define HEAP_H_ namespace cse { template < typename dtype> class
#ifndef HEAP_H_ #define HEAP_H_ namespace cse { template<typename dtype> class heap { public: /** TO DO:: default constructor perform new to reserve memory of size INITIAL_C…
#ifndef HEAP_H_ #define HEAP_H_ namespace cse { template < typename dtype> class
#ifndef HEAP_H_ #define HEAP_H_ namespace cse { template<typename dtype> class heap { public: /** TO DO:: default constructor perform new to reserve memory of size INITIAL_C…
#ifndef HEAP_H_ #define HEAP_H_ namespace cse { template < typename dtype> class
#ifndef HEAP_H_ #define HEAP_H_ namespace cse { template<typename dtype> class heap { public: /** TO DO:: default constructor perform new to reserve memory of size INITIAL_C…
#ifndef H_NodeType #define H_NodeType #include using namespace std; t
#ifndef H_NodeType #define H_NodeType #include <iostream> using namespace std; template <class Type> class nodeType { public: const nodeType<Type>& operator=…
#ifndef H_QueueType #define H_QueueType #include #include #
#ifndef H_QueueType #define H_QueueType #include <iostream> #include <cassert> #include <string> using namespace std; // definition of the template class queueTy…
#ifndef H_arrayListType #define H_arrayListType //******************************
#ifndef H_arrayListType #define H_arrayListType //*********************************************************** // Author: D.S. Malik // // This class specifies the members to imple…
#ifndef H_circularLinkedList #define H_circularLinkedList #include #i
#ifndef H_circularLinkedList #define H_circularLinkedList #include <iostream> #include <cassert> using namespace std; template <class Type> struct nodeType { …
#ifndef H_linkedQueue #define H_linkedQueue #include #include
#ifndef H_linkedQueue #define H_linkedQueue #include <iostream> #include <cassert> using namespace std; //Definition of the node template <class Type> struct nod…
#ifndef LINKED_LIST_H #define LINKED_LIST_H #ifndef TYPE #define TYPE int #endif
#ifndef LINKED_LIST_H #define LINKED_LIST_H #ifndef TYPE #define TYPE int #endif #ifndef LT #define LT(A, B) ((A) < (B)) #endif #ifndef EQ #define EQ(A, B) ((A) == (B)) #endif …
#ifndef LIST_H #define LIST_H #include using namespace std; template
#ifndef LIST_H #define LIST_H #include <algorithm> using namespace std; template <typename Object> class List { private: // The basic doubly linked list node. // Ne…
#ifndef MAIN_SAVITCH_NODE2_H #define MAIN_SAVITCH_NODE2_H #include //
#ifndef MAIN_SAVITCH_NODE2_H #define MAIN_SAVITCH_NODE2_H #include <cstdlib> // Provides NULL and size_t #include <iterator> // Provides iterator and forward_iterato…
#ifndef NETWORK #define NETWORK #include using std::vector; #include
#ifndef NETWORK #define NETWORK #include<vector> using std::vector; #include<utility> using std::pair; #include<string> using std::string; #include<fstream>…
#ifndef NODE_H #define NODE_H /* An Implementation of the Node ADT * -written by
#ifndef NODE_H #define NODE_H /* An Implementation of the Node ADT * -written by Brian P. Eddy */ //create a handle for nodes typedef struct node* Node; /* Create a new Node * @…
#ifndef PETS_H #define PETS_H #include #include #include
#ifndef PETS_H #define PETS_H #include <iostream> #include <string> #include <vector> namespace csc161 { class Pet_T { public: …
#ifndef PHONE_H #define PHONE_H #include using namespace::std; const
#ifndef PHONE_H #define PHONE_H #include <iostream> using namespace::std; const int COUNT_TOLL_FREE = 2; // CHANGE the value class phone { public: phone(void); // …
#ifndef RATIONAL_H #define RATIONAL_H // class who represents fraction class Rat
#ifndef RATIONAL_H #define RATIONAL_H // class who represents fraction class Rational { public: Rational(); // default constructor Rational(int numerator, int denominator); // alt…
#ifndef RATIONAL_H // if this compiler macro is not defined #define RATIONAL_H /
#ifndef RATIONAL_H // if this compiler macro is not defined #define RATIONAL_H // then define it so this file will not be processed again #include "stdafx.h" // use only for…
#ifndef SET_INTERFACE_H_ #define SET_INTERFACE_H_ #include template class SetInt
#ifndef SET_INTERFACE_H_ #define SET_INTERFACE_H_ #include template class SetInterface { public: virtual int getCurrentSize() const = 0; virtual bool isEmpty() const = 0; virtual …
#ifndef SHELLP_H #define SHELLP_H enum Kind { noCMD,exitCMD,cdCMD,pwdCMD,linkCMD
#ifndef SHELLP_H #define SHELLP_H enum Kind { noCMD,exitCMD,cdCMD,pwdCMD,linkCMD,rmCMD,basicCMD,pipelineCMD }; typedef struct Stage { int _nba; char** _args; // Feel free to add f…
#ifndef SMART_ARRAY_H #define SMART_ARRAY_H /* NOTE: * In some of the function i
#ifndef SMART_ARRAY_H #define SMART_ARRAY_H /* NOTE: * In some of the function implementation bodies, you will see partial implementations, * such as the following (in the capacit…