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

  • SEARCH
  • Home
  • 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 8347459
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 9, 20262026-06-09T07:22:12+00:00 2026-06-09T07:22:12+00:00

This is really a theoretical question. My example will use C but the language

  • 0

This is really a theoretical question. My example will use C but the language isn’t that important.

Let’s say I create lots and lots of variables on the stack

int x0 = 0;
int x1 = 1;
.
.
.
int x100 = 100;

Now I want to call x0. Since the stack is LIFO, where are x100,…,x1 stored, temporarily, while x0 is being fetched? By this I mean, won’t they have to be placed on registers? And if so, there simply aren’t enough registers. Using the standard analogy of cafeteria trays, If I’m trying to get to the bottom tray, I need lots of people to hold onto the other trays while I get it, unless there are three stacks and I can do some “tower of hanoi” solution…

Obviously this question shows my ignorance of the stack and how it works. Thanks in advance.

  • 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-09T07:22:13+00:00Added an answer on June 9, 2026 at 7:22 am

    The top of the stack is simply a memory address so you can access it with an offset. That said, this would make your code extremely fragile.

    The whole point of LIFO, is the last value you put on there is the next one you need, so in your example you’d either push them in reverse order, or you’d define a structure with them all in there and push it’s address on to the stack.

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

Sidebar

Related Questions

This is probably a noob question that I will get slated for but here
This will be a really theoretical question, just bear with me a bit. I
Hi this is a theoretical question, but i really am not able to figure
First off I'm not sure that's the proper title for this question but hopefully
This is theoretical question but I am curious about it. What if I do
I am aware that this is a very basic question, but an interviewer asked
This really seems like a bug to me, but perhaps some databinding gurus can
This really puzzled for hours, I searched all over the internet, but got no
hey guys having this really simple problem but cant seem to figure out have
I've got this really simple piece of code that I thought was the correct

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.