C :: Welch Powell Algorithm Exam Schedule
Mar 16, 2013I want to make welch Powell algorithm c language exam schedule?
View 1 Replies
ADVERTISEMENT
C :: How To Make Exam Schedule
Mar 5, 2013i want to make a exam schedule with C or C++ language,but I do not know how to do it,which algorithm do i use?
View 6 Replies View RelatedC/C++ :: Drivers License Exam (Read Results From File)
Apr 14, 2015How to get this code to compile and build. It gives me a really strange error saying:
"1>Project 7 Code.obj : error LNK2019: unresolved external symbol "void __cdecl checkAnswers(char * const,char * const,int,int)" (?checkAnswers@@YAXQAD0HH@Z) referenced in function _main
1>C:UsersHaruha Raharu HarukoDesktopSpring 2015 Class WorkIntro to ProgrammingProject 7Project 7DebugProject 7.exe : fatal error LNK1120: 1 unresolved externals"
Here is the specifics on the assignment:
"Complete Programming Challenge #12 (Driver's License Exam) with file modification
The State Department of Motor Vehicles (DMV) has asked you to write a program that grades the written portion of the driver's license exam, which has 20 multiple choice questions.
Here are the correct answers:
1. B 5. C 9. C 13. D 17. C
2. D 6. A 10. D 14. A 18. B
3. A 7. B 11. B 15. D 19. D
4. A 8. A 12. C 16. C 20. A
Create a TestGrader class. The class will have an answers array of 20 characters, which holds the correct test answers. It will also have a student array of 20 characters to hold the student's answers. It will have three public member functions that enable user programs to interact with the class: setKey, setStudent, and grade. The setkey function receives a 20-character string holding the correct answers and copies this information into the answers array. The setStudent function will read in the student's answers from the file student.txt and will store the answers in a 20-character array named student. The grade method will compare each student answer to the correct answer in the key.
An applicant must correctly answer 15 or more of the 20 questions to pass the exam. After grading the exam, the program should display the following items:
-the number of right answers and the number of wrong answers
-a list of the question numbers for all incorrectly answered questions
-a message indicating whether the applicant passed or failed the exam"
C/C++ :: Schedule Sending Of Messages From A Process
Mar 18, 2015I am new to this area and have the requirement like:
1) A running process wants to send message based on event arrival.
2)the process checks if event is critical
3)if critical then it has to send message immediately ,else send after time t.
4) The process is continuously process the events . so once it knows the event is not critical and has to send message later it has to proceed with its normal operation.. only when time 't" comes it has to come and send message.
C :: Write A Program To Display Class Schedule To User
Apr 20, 2014I'm new to coding, and I have to write a program to display a class schedule to the user (the classes are entered into the program in strings like this:
Code:
course Calculus3 = {80934,"MATH",11,"Calculus 3","Edward Turner","M,W",950,1100}; )
in the format of an excel file (the user picks the classes they want to have) that then displays the course title and professor in the correct cell corresponding to the day/time the class meets. I've been googling it, and from what I've read, I think I need to use a csv file, but I don't know how to input the data into the file. I know the general format for how data is entered, but I don't know how to write it into a specific file or if I even have to (we covered txt files very briefly in my class, but never touched csv files).
C :: Can't Get Tic-tac-toe Win Algorithm To Work
Apr 9, 2014I am writing a simple console-based tic-tac-toe game. I am trying to write a function to check whether someone has won the game.
The board data is saved in an array called board: Code: int board[3][3] with each element corresponding either to an empty spot, an X, or an O, using the numbers 0, 1, and 2, respectively. For clarity:
Code:
#define EMPTY 0
#define X 1
#define O 2 Here is my function: Code: int check_state(int board[3][3]) {
int winner = 0;
[Code].....
C++ :: Algorithm For All Possible Combinations?
Mar 7, 2013A few days ago I got a "bright idea" to see if I could match a string, with an arbitrary length from 1 to 12, to its formulated sequence by using an algorithm to find all possible combinations of the integer combinations from 0 to 9 at each length (1 to 12).
Example: Desired numerical combinations from integers 1 to 3:
At Length 1:
1, 2, 3
At Length 2:
11, 12, 13, 21, 22, 23, 31, 32, 33
At Length 3:
111, 112, 113, 121, 122, 123, 131, 132, 133, 211, 212, 213, 221, 222, 223, 231, 232, 233, 311, 312, 313, 321, 322, 323, 331, 332, 333
And so on until the nth length (in my case a length of 12).
First off, I would like to say that this is not as easy as I thought. I clearly underestimated the problem seeing as I've spent hours attempting to write a working algorithm, but feel like I've made no progress.
Here are a few of my attempts:
Attempt 1:
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string>
[Code]....
I can't exactly explain this one. It works if the length is 2 or less; however, the order of the output is horrendous.
Attempt 3: I tried using recursion, but only found myself getting more and more lost the further I tried developing my function. Cannot find my work for this attempt.
I would really like to figure this out on my own, but I am very stuck as you can see. I also lack time that I can spend working on this since im a full time student.
C++ :: Extending STL Algorithm
Jul 24, 2013I wrote a version of find_all() which searches through containers for matches and returns another container that holds iterators pointing to each match. When I compared what I wrote to what the authors of Professional C++ wrote, I found the two find_all() functions to be very different.Here they are:
//Mine
template<typename Iterator, typename Predicate>
std::list<Iterator> find_all
(Iterator front, Iterator back, const Predicate& match) {
std::list<Iterator> toreturn;
for(; front != back; ++front) if(*front == match) toreturn.push_back(front);
[code]...
C++ :: VRP Algorithm - Run EXE In Website
Jun 27, 2014I have VRP algorithm written in C++, run with command prompt Windows. input (command line) -> VRP.exe -> output (txt file)
Now I want to built a website to run it as SaaS. How to run an exe application(compiled c++) in server used as Saas? What kind of programming do I have to use? Ruby or html5 or others? I don't know how to start.
C++ :: Frame Per Second Algorithm?
Aug 27, 2013i was trying to achieve a better way of game looping. so i have a game loop algrithm. but i dont think its quite good. i want it to be better.
here is my algorithm
bool quit = false;
while(quit == false) {
while(blah blah events)//here we hold events {
if(the user want to quits) {
quit = true;
[code]....
C# :: Algorithm With Recursion Use
May 12, 2014To construct and write down algorithm of determination of the sum of squares of consecutive integers with recursion use. I tried to do something:
public static int RecSumSquare(int x, int n)
{
if (n < 0) throw new ArgumentException("n should be greater than zero");
if (n == 0) return 0;
else return x*x+RecSumSquare(x, n - 1);
}
But I don't know as the beginning and the end of this algorithm will look.
C++ :: Simulated Annealing Algorithm
Mar 10, 2014I'm still a beginner at C++ programming, I have tried to implement some optimization algorithms (related to database) in C++, I cannot say it is going as far as I thought it will be, some errors does not even make sense, I will cut to the chase, I need to implement SA (Simulated Annealing) in C++, SA, which is an example of the Randomized Algorithms, functions on the concept of randomness and probability. In addition, I searched the internet with no (let say "accurate") code that might give me insight on how to begin, I only found one code for SA that I could understand, and edited it (which will be shown below), still looking to enhance and correct it more.
The code for SA is as follows:
Code:
#include "stdafx.h"
#include <iostream>
#include <time.h>
#include <stdlib.h>
#include <cmath>
[Code] .....
If the concept of Simulated Annealing is not clear, you may refer to the following papers which can be found in a simple Google search: Simulated Annealing Algorithms: an overview.An Introduction to Interacting Simulated Annealing. Query Optimization (there is a sub-section for Simulated Annealing in this paper that explains SA briefly) ....
C++ :: Algorithm To Roll A Rectangle
Sep 17, 2014I'm trying to draw and pivot a rectangle. How to get the new coordinates if I turn it 90 degree for example?
From this:
To this:
This is not good because it will reduce it in size.
Code:
int size = 50;
if(b) // draw rectangle
{
POINT points[4] =
{{xCoord, yCoord},
[Code] ....
C++ :: Multiplying Matrix Using Algorithm
Jun 3, 2013Trying to multiply to matrixes using the following algorithm,
Code:
ABrec(A,B)
n=A.rows; //n must be multiple of 2
C is a new n*n matrix.
if(n==1)
C[0][0]=A[0][0]*B[0][0];
[Code] ....
but the code doesn't work !!!
C :: Algorithm To Calculate Highest Value?
Aug 3, 2014Now I know there's a simple way to calculate highest value. But here i have this algorithm which i understood part of it.
I know that *largest is point to the first element of begin which is 5. so in the first if statement its 5<5 at the first iteration ?
// i marked the parts i didnt understand with " //"
Code:
#include <stdio.h>
int *print(int *begin ,int *end ){
if(begin==end)
return 0;
int *largest = begin;
[Code] ....
C :: Merge Sort Algorithm
Dec 24, 2014 i can't seem to get this merge sort to work. running through gdb though;
Code:
*Filename: mergeSort.c
*Usage: This implements merge sort algorithm to sort and array of numbers.
*/
#include <stdio.h>
#include <stdlib.h>
}
[code]...
C :: Write Algorithm Using Stack
Jul 22, 2014write an algorithm using stack to determine if an input of string is in the form xCy where y is the reverse of x.x and y are strings of A and B. eg : AABACABAA
View 8 Replies View RelatedC++ :: Implement Flocking Algorithm
Mar 25, 2013I'm trying to implement the flocking algorithm in C++. I've tried to implement it myself by making all the particles 'home-in' on the player. When 2 particles then collide within their larger bounding boxes they home-in to each other. And when the 2 particles are actually touching they repel each other until they are outside of their bounding boxes and find another particle to home-into.when I run my application the particles all home into the player and come to a stand still along the Y-axis above the player.
All the particles in question are stored in a Vector, with a pos and velocity.
for(int i = 0; i < swarm.size(); i++) {
for (int j = 0; j < swarm.size(); j++) {
if (swarm.at(i)->getParticleModel()->getPosition().x < gameObjects.front()->getParticleModel()->getPosition().x) {
if (swarm.at(i)->getParticleModel()->getTouching() == false)
[code]....
C++ :: SIGSEV On Genetic Algorithm
Jun 22, 2014I made this program in C++ that should, by a genetic algorithm, build a word identical to the initial one improving itself recursively.
The code is:
main.cpp
#include <stdio.h>
#include <cstdlib>
#include "Genetic.h"
using namespace std;
[Code] ....
The problem is: when running with gdb it gave me this
warning: Could not load shared library symbols for linux-vdso.so.1.
Do you need "set solib-search-path" or "set sysroot"?
CREATA LA PRIMA POPOLAZIONE
PARTE L'EVOLUZIONE
TROVATO BEST: fzlrq
TROVATO BEST: hglhe
Program received signal SIGSEGV, Segmentation fault.
0x000000000040720e in Genetic::Gene::Gene (this=0x7fffff7ff030) at Genetic.h:20
20 struct Gene {
The line corresponds to the struct declaration. Every 1000 executions it runs well.
C++ :: Compression Algorithm For Numbers
Feb 27, 2014I am looking for a compression algorithm which compress sequence of random numbers (will be in sorted order but some of the numbers may be missing). The compressed data will be sent to other component where decompression will take place.
View 5 Replies View RelatedC++ :: Realization Of Lee Algorithm In Game
Nov 19, 2013I wont search realization of Lee algorithm in Game(2d turn-Based Strategy 20 x 30 cells),need AI on C++ ???
View 1 Replies View RelatedC++ :: (array) Deletion From The End In Algorithm
Aug 3, 2014Any simple example of deletion from the end here is the algorithm
1. If n=0 then array is underflow step
2. A (UB) <------- null
UB <---- UB1
3. Stop
Example:
Suppose array
Arr[0]=5 , Arr[1]=8 , Arr[2]=10 , Arr[3]=7
After Deletion
Arr[0]=5 , Arr[1]=8 , Arr[2]=10
How to delete the last element of array?
C++ :: Genetic Algorithm Library?
Jan 28, 2014Genetic Algorithm Library in C++? I looked for in the web, there are a lot of them, have you tried some? Is there one up to date or with a good community?
View 1 Replies View RelatedC++ :: How To Write Algorithm / Design
Nov 16, 2013How to write Algorithm / Design
View 7 Replies View RelatedC++ :: Divide And Conquer Algorithm
Feb 6, 2013I've been stuck on a divide a conquer algorithm problem for about an hour now, and I'm not sure how to solve it. I need to use divide-and-conquer to implement an algorithm that finds the dominant element of an array of positive integers and returns -1 if the array does not have a dominant element (a dominant element is one that occurs in more than half the elements of a given array).
No sorting may be used, and the only comparison that may be used is a test for equality.
I understand the general process I need to follow to solve this problem, but I'm not sure exactly how to convert my thoughts to code. I know that if a number x is the dominant element of an array A, the x must be the dominant element in either the first half of A, the second half of A, or both.
Here is what I have so far.
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int find_dominant(int *A, int p, int r) {
[Code] ....
The program must run in O(n log n) time.
C++ :: Pathfinding Algorithm Implementation
May 11, 2013I am currently trying to implement a pathfinding algorithm using c++ and opengl. My code so far is shown below:
#define OPEN 1
#define CLOSED 2
#define UNVISITED 3
#define BLOCKED 4
#define HIGHLIGHT 5
#define ONROUTE 6
#define GOAL 7
#define GSIZE 20 // size of tile grid
#define ISTART 15 // index position of starting tile in grid
[Code] ....