I am trying to implement setjmp for functions.
Code:
#include <setjmp.h>
#include <stdio.h>
jmp_buf arr[3];
void DISP(int x , int i)
[Code]....
Could I possibly use malloc to allocate memory for the stack too?
I am trying to implement own strcpy function, but no output is being printed.
#include<stdio.h>
#include<string.h>
void strcpy_own(char dest[], char src[], int len);
int main() {
char src[15]="jeevan", dest[15];
[Code] ....
write a program which contains two global variables:
1.Account number (integer)
2.Account Balance (float)
and three functions :
A function called set values which sets initial values for account number and account balance,
A function called set values which prompt user to enter the values of the above variables,
A function called input transaction which reads a character value for transaction type that is D (for deposit) and W (for withdrawal ) and a floating point value for transaction amount which updates the account balance .
Implement a pointer to call each of the functions using C++.
Code:
#include <iostream>
using namespace std;
int main() {
//I'll be making a 1 dimensional array
int array1d[25];
[Code] .....
I need to implement simple wrapper for logging function log(const char *). So the solution is below:
#include <stdio.h>
#include <sstream>
using namespace std;
void log(const char * str){ printf(str);}
[Code] ...
So, according to standard the temporary objects should not be destroyed before full expression execution (expression whitch is not a part of another expression).
The question is: is StreamLogger() << "foo1" << "foo2" << "foo3"; full expression or not?
Code:
#include <iostream>
#include <windows.h>
#include <iomanip>
using namespace std;
[Code] .....
I'm trying to implement Morse code program. However, I cannot find any codes which make a time gap between the letters. How the time gap code?
I have written this code to arrange user input array in an order.
//Recursive Quick Sort
#include<stdio.h>
#define ARRAY_SIZE 10
void quick_sort(int array[], int len)
}
[code].....
I'm playing with the idea of a singleton base class, but I'm having an issue with how to implement the GetInstance() function in the base class. Since I'm trying to make this ridiculously simple for the child, I'd like to handle that in the base.
class Singleton {
private:
static Singleton* instance;
Singleton() { Construct(); } // Private to avoid other instances
[Code] .....
It would be easy to use like so:
class Hello : public Singleton {
private:
std::string hello;
void Construct() { hello = "hello"; }
public:
std::string GetHello() const { return hello; }
};
Then the instance would be handled like so:
std::cout << Hello::GetInstance()->GetHello();
I am supposed to implement the member functions of class Person.
class Person {
public:
Person();
Person(string pname, int page);
void get_name() const;
void get_age() const;
[Code] ....
The code I wrote is below. Where I am struggling is the program does not allow me to input age. Therefore, I cannot test if my temp for age works. It automatically defaults to 0 because it hasn't taken input. Here is my code:
// Program Title: Person function
// Program Description: The program prompts the user for first and last name and age.
// It then prints the output that was provided by the user.
#include<iostream>
#include<string>
using namespace std;
class Person {
[Code] .....
I am unable to implement the insert function properly, every time i run the program i just get the first value and name, I am not getting other Id's and name.
"(Header File)"
#include <iostream>
#include <string>
using namespace std;
class node{
public:
int ID;
string name;
class node *left, *right, *parent;
[Code] .....
I'm trying to learn how to implement vectorization. Lets say I have this an array like this.
Code: int Array[10] = { 3,4,5,3,4,5,6,7,8,9};
If I traverse through the array and preform some simple calculation like adding numbers, how would I go about vectorizing this feat? For example if I want to add numbers, .
An example, add element at index 5,6,7 to element with index 1.
Code:
0 1 2 3 4 5 6 7 8 9 --- index
3,4,5,2,8,2,3,5,1,2 --- ints
I have to make a prgrama using the C programming language that is able to read several lines of commands entered by the user and interpret it as a command to run.
I have to implement the following command:
a) Command generic - program should be able to read any one command and execute the same command on the operating system through primitives for implementing generic processes (eg "ls-l/etc").
Code:
char str[40][40];
int number = 7;
for (int i=0;i<number;i++){
printf("enter %d th string::",i+1);
scanf("%s",str[i]);
}
Above, I have a little snippet of a code that I'm trying to figure out. I don't really understand how to implement 2d arrays in C that well. But, I mostly want to know is how and where the strings are being stored, especially with the code below.
Code:
for (int i=0;i<number;i++){
printf("enter %d th string::",i+1);
scanf("%s",str[i]);
}
I know that it's asking the user to enter strings, which will be stored into the 2d array. I just don't understand how it's being stored. Will it be placed in the 1st column or 2nd row or something?
I'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]....
I implement copy constructor for priority queue like this, is it right?
PRIORITY_QUEUE<T>::PRIORITY_QUEUE(const PRIORITY_QUEUE &aQueue)
{
this->maxSize = aQueue.maxSize;
this->items = new T [maxSize + 1];
this->rear = aQueue.rear;
for (int i = 0; i < aQueue.rear; i++)
[code]....
By the way, how to implement "insert" and "heapify" and in insert, when we insert an element we also heapify it?
Ok so i am coding in WPF i was coding just fine and im trying to implement a browserDialog
Here is the class
The issue i am having is in the DialogResult.Cancel This is the issue i receive 'System.Nullable<bool>' does not contain a definition for 'Cancel' and no extension method 'Cancel' accepting a first argument of type 'System.Nullable<bool>' could be found (are you missing a using directive or an assembly reference.
private void ArmaPathSelect_Click(object sender, RoutedEventArgs e)
{
FolderBrowserDialog folderBrowserDialog = new FolderBrowserDialog();
if (folderBrowserDialog.ShowDialog() == DialogResult.Cancel)
return;
this.Path_Arma3.Text = folderBrowserDialog.SelectedPath;
}
I do this because I want to transform the .x format into xml... The "frame" data structure can contain other frames, and a name for the frame and a transformation. For example:
Code:
struct frame {
std::string name;
Matrix transform;
std::vector<struct frame> child;
std::vector<struct frame> sibling;
[Code] ....
I know the above won't compile. But am I on the right track to implement data structures this way using linked lists? about directx, I'd like to ask is the .x format implemented with a tree structure rather than linked lists.
Not inheriting properly and provide the corrected code if possible
Code:
#include <iostream>
using namespace std;
class Node {
protected:
int Data;
[Code] ....
I have a struct and I want to implement in with pointers and functions.
What is the corect syntax? For example:
Code:
typedef struct XYZ
{
int x;
int y;
int z;
}XYZ_t;
int func( using the XYZ_t struct)
[Code] .....
I'm trying to implement the Merge-Sort algorithm. I only had the pseudocode for it and have some problems coding this into C.
I have only covered pointers recently and I tried using them, which did not work. I started with the code for the merge algorithm and only used a 10 element array, which was already divided into two sorted subarrays:
Code:
#include <stdio.h>#include <stdlib.h>
int main() {
int a[5]={1,5,6,10,13}, b[5]={4,8,9,10,14},c[10], *i,*j,k;
[Code].....
This is the result that I get:
Code: 1 4 5 6 8 9 10 10 13 0
So I think the problem occurs because in the second to last loop i is incremented again, but the end of the array is already reached, and the compiler has no element a[6] to compare with *j in the last run of the loop. Is there generally a better way to implement Merge?
I am starting to use contiki and learn c programming for my summer internship. I have to calculate the mean of the ongoing process of refrigerator power. I made the code like this
Code:
#include <stdlib.h>
#include <stdio.h>
#include <homadeus/processes/fridge_process.h>
#include <homadeus/devices/78M6610.h>
#include <homadeus/utils/utils.h>
float global_variable;
int current_state = 0; //down =0, up =1
[Code]....
How it gets the value of power is handled already. Every one second, it will display the power consumed (get_instant_power()). I don't know how to start and end the sample numbre. If I start by 1 then how should it be until? Also, is it possible if I store the power in array to accumulate?
I'm attempting to write the maximal clique algorithm for use with an adjacency matrix.I'm following a video which explains how to code and implement the algorithm using python. I want to write it for c++. URL....I'm currently trying to code the powerset function at 2 minutes into the video. I'm not sure if I should be using arrays or not.
So far I have coded the below but I dont know how to return an empty array inside an empty array (when the elts list is of size 0). I wrote an isEmpty function for the array since I cant use len(elts) like in python.
bool empty = true;
bool isEmpty(int elts[]) {
for (int z=0;z<10;z++) {
if (elts[z] != 0) {
cout << elts[z] << endl;
empty = false;
[code]....
The code should use either an array/list/vector that we call 'elts' (short for elements). Then firstly, it should add the empty list [], then the rest of the power set (all shown in the video).So for example, in the case that elts = [1,2,3,4], my code should return:[ [],[4],[3],[4,3],[2],[4,2],[3,2],[4,3,2],[1],[4,1],[3,1],[4,3,1],[2,1],[4,2,1],[3,2,1],[4,3,2,1] ]
I have problems when implementing the IDIV Instruction in gcc assembler, the program has compiled ok, but when executing function that imparts the asm codes which contained the IDIV instruction the error box immediately appeared announcing that it should terminates the program quickly.
The following is the complete listing of the program that I just been working on it:
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
signed long divider(signed long num, signed long divisor);
int main(int argc, char* argv[]) {
signed long dn0,dn1,dn2;
[code]....
I compiled it with DevCpp 4.9.9.2, and I had tried on CodeBlocks, in CodeBlocks I made used the int64_t type but still it could not works more..
Im trying to implement a way to use really big numbers to be able to add, substract and multiply them with the class I made. for example:
huge a = "45646464646455464654656"
huge b = "456464564646544646"
huge c = a+b;
[Code]....
Design a C++ Program to implement the following functions:
a.)the function for bubble sorting : int bubblesort(int*a,int size).
b.)the function for merge sorting : int mergesort(int*a,int size).
c.)the function for generating array of random elements: int generate(int*a,int size) which calls the function rand() in c++.
d.)Test both bubble sorting and merge sorting with 10,100,1000,10000,100000 and 1000000,4000000 integers.
The integers are from the array generated by part c).calculate the time spent in calling each sorting.you may use a function in <time.h>to get the current time. Draw curves to compare the speed performance between the two functions. The merge sorting algorithm implementation must use recursion. you are expected to define a global array for holding result from merging two arrays.otherwise,it may cause a lot extra money in recursion.
Hint 1:use the following format to calculate the time cost for bubble sort.
{……..
Time1=Get the current time(call a function in <time.h>);
Bbblesort(….)
Tme2=Get the current time(call a function in <time.h>);
Time_cost=the difference between time 1 and tim2;
…….
}
Print your program and test results
Below is a snippet of a class I am working on. My head is swimming, but I cannot understand why I am seeing the following error:
Quote
Error1 does not implement interface member 'System.ComponentModel.INotifyPropertyChanged.PropertyChanged'Medication.cs1011
