Search:

Amazing Laserlight! That's great.

I already changed everything.
I will have in the next days a conference with a teacher, nothing too important, but the information you gave me will be precious....

They're exercises taken by exams of the previous years.
The university course is "Fundamentals of C language".
It regards just the fundamentals of this language, so it isn't about the best...

Hi everyone!

I'm trying to create this function:

Given a matrix, create a list which has in his nodes the values of the matrix that are greater than zero. The function has to return the double...

It's not correct dear Laserlight.
I hope that I'm not bothering you.
Actually it isn't correct.
The function deletes the float element given in input, but it doesn't link correctly the list after...

My opinion is that:
In the function I wrote, the input always changeds(because of the function nexta), so, theorically, it should be able to remove nodes "in the middle".
This is just my opinion,...

Hello Laserlight!

Here there is the function which search a specific value in a Binary Search Tree:





Booleansearch(structbtree* ptr, floattarget) {
if(ptr != NULL) { //It's not a...

ALL FINE GReaper, I solved that!

Thank you for your time!

Firstable, thank you for your advices.

Unluckly, the code is still not working.
Here there is the function:



void traspo (float *A, int m, int n){

After I created the transposed of A (C), I assign C to A.
Doing this, the matrix given as input will be actually transformed into its transposed.
After doing that, I delete C, which becomes useless.

Hi everyone!
I should resolve this exercise, but I think I have some problems.
"Given a matrix written as a monodimensional array, write a function which change this matrix into his transposed".
...

P.s. I actually needed that clarification. Thanks a lot!!!

Hello Laserlight!

Unfortunately, I'm not able to do that.
I know how to do visit a binary search tree (in many ways).
I know how to search a value in a binary search tree.
But I'm not able (at...

I'm sorry for the name of structured data.

This is the one:


struct node {
float value;
struct node *next;
};

Hi everyone!

I'm having some troubles with the definition of a function.
Here there is the exercise:

"Given two Binary Search Trees, T1 and T2, which contain float values, write a function...

Hello Laserlight!

Thanks again for your answer.

Here there is what I changed:



void delete_commons (struct list **B, struct list **A){
while ((*A)!=NULL && (*B)!=NULL){

Hi again laserlight.
I didn't understand this.
Are you telling me that, when I use a list, I need a doublepointer only when I have to modify nodes?

Hi everyone! I have a little problem with the solution of this exercise:

List exercise: Given two lists, A and B, write a function which delete common elements in the list named "B".

Here there...

Thanks a lot Laserlight.
I try immediatly to verify what you wrote.
P.S. I agree with you, struct node is better.

Hi everybody!
I have a little problem with the solution of this problem:
"Given two lists, insert in a third list the pair values of the first one and the odd values of the other one."

My...

sorry but I know just a little bit of C.
I never saw

"std::cout << "Entering at: " << n << std::endl;
if ( n < 5 ) foo( n + 1 );

std::cout << "Leaving at: " << n << std::endl;"

what...

Hi everyone,

I have a serious problem.
Code.Blocks' Debugger is not working at all, and I need it before saturday.
The version of Code Blocks is 17.12
The version of Windows is Windows10.

It...

Hi everyone.


In this post I'm gonna show you just the definition of a function that I can't understand.


Here we have the exercise.....
Given a binary search tree:
define a recursive...

Ok, so when it reaches line n°10 it starts again from line n°1 with a different input.
But I still don't understand how it can work,
because it will do this until 'ptr->left_ptr' will be' ==...

Hi everyone.

In this post I'm gonna show you just the definition of a function that I can't understand.

Here we have the exercise.....
Given a binary search tree:
define a recursive function...

Super, thanks a lot!!!