Stack and the heap - Study guides, Study notes & Summaries

Looking for the best study guides, study notes and summaries about Stack and the heap? On this page you'll find 147 study documents about Stack and the heap.

Page 2 out of 147 results

Sort by

Certiport: Chapter 1 - Understanding Core Programming Questions with Correct Answers
  • Certiport: Chapter 1 - Understanding Core Programming Questions with Correct Answers

  • Exam (elaborations) • 5 pages • 2024
  • Byte Correct Answer-It uses the least amount of memory, but still holds numbers up to 255. Integral data types Correct Answer-Ex. include byte, integer, short, and long; store whole numbers—such as the number of goals a player has scored Floating point data types Correct Answer-Examples like float, single, and double can represent numbers that include fractional data, such as a player's height. Value data types Correct Answer-These go on the stack. Reference data types Correct A...
    (0)
  • R281,60
  • + learn more
csci 2467 final  Questions and Answers with complete solutions
  • csci 2467 final Questions and Answers with complete solutions

  • Exam (elaborations) • 13 pages • 2024
  • Encapsulation - a fundamental principle of object-oriented programming, whereby the internal components of a class are hidden from external classes and are only accessed via getter / setter methods. Why use encapsulation? - so that you can change the internal implementation of a class without affecting other classes. instantiation - Process of creating an object, an instance of a class; creates space in memory for the new object and binds a name for the object with the object's data in me...
    (0)
  • R145,26
  • + learn more
CSD-Full Questions and Answers | Latest Update | 2024/2025 | Already  Passed
  • CSD-Full Questions and Answers | Latest Update | 2024/2025 | Already Passed

  • Exam (elaborations) • 123 pages • 2024
  • Available in package deal
  • CSD-Full Questions and Answers | Latest Update | 2024/2025 | Already Passed (Choice 2) Select correct statements : A. Extendible hashing is directoryless technique. B. Linear hashing is directory technique. C. The characteristic feature of extendible hashing is the organization of the index, which is expandable table. D. A reorganization of the file is avoided by using extendible hashing if the directory overflows. E. Extendible hashing is faster than and requires less space than...
    (0)
  • R215,97
  • + learn more
CMSC 433 Midterm (All Exams Combined) solutions 2023/24
  • CMSC 433 Midterm (All Exams Combined) solutions 2023/24

  • Exam (elaborations) • 91 pages • 2023
  • CMSC 433 Midterm (All Exams Combined) solutions 2023/24 1. True/False/Multiple Choice Questions [15 points] (1) True False A program with a race condition will always produce incorrect results. (2) True False If the release() method of a newly constructed semaphore is called before any thread ever calls the semaphore’s acquire() method, the release() method will have no effect. (3) True False The get() method of a FutureTask does not guarantee that it can return a value immediately a...
    (0)
  • R436,13
  • + learn more
C949 WGU Terminology exam questions and answers
  • C949 WGU Terminology exam questions and answers

  • Exam (elaborations) • 22 pages • 2023
  • Available in package deal
  • inserting a new item at the beginning it causes no shift to the data what is an advantage of a linked list over an array?n N In the worst case, inserting a new node into a tree with N nodes requires how many comparisons? reference count A _____________is an integer counter that represents how many variables reference an object. When an object's reference count is 0, that object is no longer referenced. Branching directs a program to execute either one group of st...
    (1)
  • R263,42
  • + learn more
WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024
  • WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024

  • Exam (elaborations) • 13 pages • 2024
  • Available in package deal
  • WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024 Task decomposition - answermeans to reduce a complex task into simpler basic steps, making the whole task easier to solve. interactive interpreter - answeris a program that allows the user to execute one line of code at a time. A statement - answeris a program instruction. A program mostly consists of a series of statements, each statement usually appears on its own line. Expressions - answerare code that retu...
    (0)
  • R227,07
  • + learn more
WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024
  • WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024

  • Exam (elaborations) • 13 pages • 2024
  • Available in package deal
  • WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024 Task decomposition - answermeans to reduce a complex task into simpler basic steps, making the whole task easier to solve. interactive interpreter - answeris a program that allows the user to execute one line of code at a time. A statement - answeris a program instruction. A program mostly consists of a series of statements, each statement usually appears on its own line. Expressions - answerare code that retu...
    (0)
  • R227,07
  • + learn more
C949 WGU Terminology|72 Questions With 100% Correct Answers.
  • C949 WGU Terminology|72 Questions With 100% Correct Answers.

  • Exam (elaborations) • 9 pages • 2023
  • Available in package deal
  • record - data structure that stores subitems, with a name associated with each subitem array - a data structure that stores an ordered list of items, with each item is directly accessible by a positional index homogeneous data elements linked list - data structure that stores *ordered* list of items in nodes, where each node stores data and has a pointer to the next node; can have multiple subitems binary tree - A data structure that consists of nodes, with one root node at the base of the...
    (0)
  • R154,35
  • + learn more
COP 4600 Lesson 2 Chapter 12 Operating System Security || Questions & Answers (100% Verified)
  • COP 4600 Lesson 2 Chapter 12 Operating System Security || Questions & Answers (100% Verified)

  • Exam (elaborations) • 12 pages • 2023
  • Available in package deal
  • COP 4600 Lesson 2 Chapter 12 Operating System Security || Questions & Answers (100% Verified) COP 4600 Lesson 2 Chapter 12 Operating System Security || Questions & Answers (100% Verified) ______ is a part of a process that has ______ - ANSWER - Thread; It's own execution history( can't have without a stack) Program Counter Stack Every process has ______ threads and every thread ____ - ANSWER - one or more threads; belongs to exactly one process Elements that are unique to a pr...
    (0)
  • R208,89
  • + learn more
CSE 240 Final | 178 questions| with complete solutions
  • CSE 240 Final | 178 questions| with complete solutions

  • Exam (elaborations) • 30 pages • 2023
  • Available in package deal
  • If a function calls another function, the local variables in these two functions use the memory from correct answer: different stack frames. Which C/C++ operations will acquire memory from heap? Select all that apply. correct answer: - new - malloc You do not need to garbage-collect the memory, if it comes from (Select all that apply) correct answer: - global memory - stack memory - static memory What is the key difference between a static variable and a global variable? correct a...
    (0)
  • R236,15
  • + learn more