Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7608849
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 31, 20262026-05-31T01:01:33+00:00 2026-05-31T01:01:33+00:00

I am suppose to be creating a memory map of this program for my

  • 0

I am suppose to be creating a memory map of this program for my class, but when I try to compile it, I get an error:

invalid operands to binary expression ('double *' and 'double *')

I am a student, please do not edit the code to print out memory locations, I need to write that myself.

main()
{
double testd;
int testi;
FILE *fpt;

struct frog {
    double *x, y;
}frog;

struct frog turtle, *apple, tv[3];

testi = 2;

apple = &turtle;
apple->x = &testd

*(turtle).x = 7.3;    //this is where im getting the error. 
(*apple).y = 3.6;

turtle.y = 1.5;

for (testi = 0; testi < 3; testi++)
    tv[testi].x = &(tv[(testi+1)%3].y);

*(tv[1].x) = 6.4;
}
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-31T01:01:34+00:00Added an answer on May 31, 2026 at 1:01 am

    You are missing the ; at the end of the previous line.

    You are not wrong to dereference *(turtle).x instead of *(turtle.x). The . operator has higher precedence than the * operator, meaning those two statements are equivalent and you don’t even need parentheses: you could just do *turtle.x.

    Check out this site for precedence ordering.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Suppose that a process is creating a mutex in shared memory and locking it
Suppose I have this structures in c++ : class A{ public: B b; }
Suppose I'm creating a session class, with relevant implementation as below: public class Session()
Suppose I have an SConstruct file that looks like this: env = Environment() env.Program(a,
Suppose I'm creating a class to validate a number, like Social Security in US
Suppose we are creating a generic control in .NET. E.g. a tree. I don't
Suppose you are implementing a publication database and creating migrations to represent different publications.
i am dynamically creating sql query for inserting multiple records in one hit.Suppose no
Suppose your git history looks like this: 1 2 3 4 5 1–5 are
Suppose I have a stringbuilder in C# that does this: StringBuilder sb = new

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.