Memory & Performance interview questions

15 Memory & Performance questions from the Go bank, written for Indian campus drives and tech interviews. Every question has a verified answer and an AI-tutor explanation on placd.

Free to start: the 2-minute IT readiness check — six questions and a result.

Take the free IT readiness check

or take a mock interview set up for this area

1. What is Escape analysis?

Senior
  1. A.the concurrent tri-color mark-and-sweep subsystem that reclaims unreachable heap memory automatically
  2. B.placing a value in a per-goroutine growable region that is freed cheaply when the function returns
  3. C.a value holding the memory address of another value, dereferenced and taken with the * and & operators
  4. D.the compile-time process that decides whether a value can live on the stack or must be allocated on the heap

Answer + AI explanation with Pro

2. Which term means: "the compile-time process that decides whether a value can live on the stack or must be allocated on the heap"?

Senior
  1. A.Stack allocation
  2. B.Pointer
  3. C.Escape analysis
  4. D.Garbage collector

Answer + AI explanation with Pro

3. Which statement is correct?

Senior
  1. A.Escape analysis — the compile-time process that decides whether a value can live on the stack or must be allocated on the heap
  2. B.Escape analysis — the concurrent tri-color mark-and-sweep subsystem that reclaims unreachable heap memory automatically
  3. C.Escape analysis — the safety rule that addresses cannot be freely incremented or offset outside the unsafe package
  4. D.Escape analysis — a value holding the memory address of another value, dereferenced and taken with the * and & operators

Answer + AI explanation with Pro

4. What is Garbage collector?

Mid
  1. A.a value holding the memory address of another value, dereferenced and taken with the * and & operators
  2. B.the safety rule that addresses cannot be freely incremented or offset outside the unsafe package
  3. C.placing a value in a per-goroutine growable region that is freed cheaply when the function returns
  4. D.the concurrent tri-color mark-and-sweep subsystem that reclaims unreachable heap memory automatically

Answer + AI explanation with Pro

5. Which term means: "the concurrent tri-color mark-and-sweep subsystem that reclaims unreachable heap memory automatically"?

Mid
  1. A.Escape analysis
  2. B.Garbage collector
  3. C.Pointer
  4. D.Stack allocation

Answer + AI explanation with Pro

6. Which statement is correct?

Mid
  1. A.Garbage collector — the safety rule that addresses cannot be freely incremented or offset outside the unsafe package
  2. B.Garbage collector — the compile-time process that decides whether a value can live on the stack or must be allocated on the heap
  3. C.Garbage collector — the concurrent tri-color mark-and-sweep subsystem that reclaims unreachable heap memory automatically
  4. D.Garbage collector — a value holding the memory address of another value, dereferenced and taken with the * and & operators

Answer + AI explanation with Pro

7. What is Stack allocation?

Mid
  1. A.the safety rule that addresses cannot be freely incremented or offset outside the unsafe package
  2. B.the compile-time process that decides whether a value can live on the stack or must be allocated on the heap
  3. C.placing a value in a per-goroutine growable region that is freed cheaply when the function returns
  4. D.the concurrent tri-color mark-and-sweep subsystem that reclaims unreachable heap memory automatically

Answer + AI explanation with Pro

8. Which term means: "placing a value in a per-goroutine growable region that is freed cheaply when the function returns"?

Mid
  1. A.Escape analysis
  2. B.Garbage collector
  3. C.Pointer
  4. D.Stack allocation

Answer + AI explanation with Pro

9. Which statement is correct?

Mid
  1. A.Stack allocation — placing a value in a per-goroutine growable region that is freed cheaply when the function returns
  2. B.Stack allocation — the concurrent tri-color mark-and-sweep subsystem that reclaims unreachable heap memory automatically
  3. C.Stack allocation — the compile-time process that decides whether a value can live on the stack or must be allocated on the heap
  4. D.Stack allocation — a value holding the memory address of another value, dereferenced and taken with the * and & operators

Answer + AI explanation with Pro

10. What is Pointer?

Junior
  1. A.a value holding the memory address of another value, dereferenced and taken with the * and & operators
  2. B.the safety rule that addresses cannot be freely incremented or offset outside the unsafe package
  3. C.placing a value in a per-goroutine growable region that is freed cheaply when the function returns
  4. D.the concurrent tri-color mark-and-sweep subsystem that reclaims unreachable heap memory automatically

Answer + AI explanation with Pro

11. Which term means: "a value holding the memory address of another value, dereferenced and taken with the * and & operators"?

Junior
  1. A.Garbage collector
  2. B.Pointer
  3. C.Stack allocation
  4. D.Escape analysis

Answer + AI explanation with Pro

12. Which statement is correct?

Junior
  1. A.Pointer — a value holding the memory address of another value, dereferenced and taken with the * and & operators
  2. B.Pointer — placing a value in a per-goroutine growable region that is freed cheaply when the function returns
  3. C.Pointer — the compile-time process that decides whether a value can live on the stack or must be allocated on the heap
  4. D.Pointer — the concurrent tri-color mark-and-sweep subsystem that reclaims unreachable heap memory automatically

Answer + AI explanation with Pro

13. What is Pointer arithmetic restriction?

Senior
  1. A.a value holding the memory address of another value, dereferenced and taken with the * and & operators
  2. B.the concurrent tri-color mark-and-sweep subsystem that reclaims unreachable heap memory automatically
  3. C.the compile-time process that decides whether a value can live on the stack or must be allocated on the heap
  4. D.the safety rule that addresses cannot be freely incremented or offset outside the unsafe package

Answer + AI explanation with Pro

14. Which term means: "the safety rule that addresses cannot be freely incremented or offset outside the unsafe package"?

Senior
  1. A.Stack allocation
  2. B.Pointer arithmetic restriction
  3. C.Pointer
  4. D.Garbage collector

Answer + AI explanation with Pro

15. Which statement is correct?

Senior
  1. A.Pointer arithmetic restriction — a value holding the memory address of another value, dereferenced and taken with the * and & operators
  2. B.Pointer arithmetic restriction — the safety rule that addresses cannot be freely incremented or offset outside the unsafe package
  3. C.Pointer arithmetic restriction — the compile-time process that decides whether a value can live on the stack or must be allocated on the heap
  4. D.Pointer arithmetic restriction — the concurrent tri-color mark-and-sweep subsystem that reclaims unreachable heap memory automatically

Answer + AI explanation with Pro

Free to start

Start with a free readiness check

Sign up free for the 2-minute IT readiness check and a scored result. Answers, explanations and the AI tutor on every Memory & Performance question come with Pro.

Take the free IT readiness check

or take a mock interview set up for this area

24,000+ questions & coding problemsSoftware & IT16,274 questionsGovernment jobs26 examsAptitudenew questions every timeAI practice interviewwith feedback65 topics to practiseMechanical1,149 questionsGATE ME9 papersEngineering Mathematics381 questions2-minute checkfreeDSA Problems1,422Civil1,005 questionsGATE CE9 papersCS Fundamentals1,209 questionsYour scores6 skillsSystem Design25Electrical / EEE1,047 questionsGATE EE9 papersRun your codeC++ · Java · PythonLow-Level Design144Electronics & Comm.975 questionsGATE EC9 papersAI help on every questionFull-Stack6,282Chemical1,005 questionsGATE CH9 papersAI whiteboardsystem designWork abroadEurope · remote · transfersESE ME1 paperGATE practice papers2019–2026ESE CE1 paperDate alertsbefore the last dateESE EE1 paperBehavioural courseHR round practiceESE ET1 paperResume optimizerProSSC JE ME1 paperApplication trackerSSC JE CE1 paperCompany-wise prepSSC JE EE1 paperRole roadmapsRRB JE1 subjectPriced in ₹UPI · cardsISRO SC1 paperGATE CS9 papersIBPS SO IT1 paperUGC NET CS1 paperSSC CGL26 papersIBPS PO26 papersRRB NTPC26 papersSSC CHSL26 papersIBPS Clerk26 papersSBI Clerk26 papersRRB Group D26 papersSSC CPO26 papersSSC GD26 papers