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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 18, 20262026-06-18T09:52:55+00:00 2026-06-18T09:52:55+00:00

For an interview question: how would I write new malloc and free functions? I

  • 0

For an interview question: how would I write new “malloc” and “free” functions? I don’t think “using new and delete” would be an acceptable answer or using something similar like LocalAlloc/HeapAlloc

  • 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-18T09:52:55+00:00Added an answer on June 18, 2026 at 9:52 am

    Since this is for an interview question, it probably won’t have a “right” answer, and they’re more interested in your thought process, and your general knowledge surrounding the topic.

    You should ask to clarify the requirements, or give a range of answers depending on the situation. Here are some issues to consider:

    • Is it important to avoid memory fragmentation? A fixed alloc size may help.
    • Do you need speed guarantees for allocation? Use index of used/free blocks.
    • Do you need to easily trace the allocations performed? Add logging structures to the malloc/free library.
    • Do you need to protect against or detect memory under/overruns? Extra padding and periodic padding checks.
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I was going through some interview question on linux i found What would happen
The Java interview question is: Without using a temporary buffer, separate the 0's and
I was asked this question in an interview would appreciate your answers. Regards; Mohammad
Yesterday i had this interview question, which I couldn't fully answer: Given a function
I was asked this interview question so thought I would post it here to
A common interview question asks to write an algorithm that detects duplicates in a
This is an interview question (phone screen): write a function (in Java) to find
In a per-interview question i have been asked that How would you sort a
This is an interview question. Till now, I used to think such questions were
I got this question today in an interview: write a function to calculate the

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.