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 9207441
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 18, 20262026-06-18T00:23:17+00:00 2026-06-18T00:23:17+00:00

By considering that the memory is divided into four segments: data, heap, stack, and

  • 0

By considering that the memory is divided into four segments: data, heap, stack, and code, where do global variables, static variables, constant data types, local variables (defined and declared in functions), variables (in main function), pointers, and dynamically allocated space (using malloc and calloc) get stored in memory?

I think they would be allocated as follows:

  • Global variables ——-> data
  • Static variables ——-> data
  • Constant data types —–> code
  • Local variables (declared and defined in functions) ——–> stack
  • Variables declared and defined in main function —–> heap
  • Pointers (for example, char *arr, int *arr) ——-> heap
  • Dynamically allocated space (using malloc and calloc) ——–> stack

I am referring to these variables only from the C perspective.

Please correct me if I am wrong as I am new to C.

  • 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-06-18T00:23:18+00:00Added an answer on June 18, 2026 at 12:23 am

    You got some of these right, but whoever wrote the questions tricked you on at least one question:

    • global variables ——-> data (correct)
    • static variables ——-> data (correct)
    • constant data types —–> code and/or data. Consider string literals for a situation when a constant itself would be stored in the data segment, and references to it would be embedded in the code
    • local variables(declared and defined in functions) ——–> stack (correct)
    • variables declared and defined in main function —–> heap also stack (the teacher was trying to trick you)
    • pointers(ex: char *arr, int *arr) ——-> heap data or stack, depending on the context. C lets you declare a global or a static pointer, in which case the pointer itself would end up in the data segment.
    • dynamically allocated space(using malloc, calloc, realloc) ——–> stack heap

    It is worth mentioning that “stack” is officially called “automatic storage class”.

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

Sidebar

Related Questions

Considering that simple java code which would not work: public class Bar extends AbstractBar{
I have a question considering a program that stimulates a stack (not using any
I'm looking for a real time memory tracker library (or considering writing one) that
Considering the following code: #include <memory> #include <iostream> using namespace std; struct MySharedStruct {
Considering that I have a Schema named SBST I want to find all empty
Considering that the two machine's time settings are not synced, is it still possible
considering that metric is delay in distance vector routing algorithm, is it possible that
I would like to know , considering that Clojure uses 32-bit hash for its
I'm trying to create programmability a home shortcut for any installed application. Considering that
I'm considering a project that involves the browser user being able to screen capture

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.