Resource management: Difference between revisions

Revision as of 15:50, 12 April 2016

Resource Management^[1]

In computer programming, resource management refers to techniques for managing resources (components with limited availability). It includes both preventing resource leaks (releasing a resource when a process has finished using it) and dealing with resource contention (when multiple processes wish to access a limited resource). Resource leaks are an issue in sequential computing, while resource contention is an issue in concurrent computing. On many systems the operating system reclaims resources after the process makes the exit system call.^[2]

The big ideas in Abstract data structures

Thinking recursively

Abstract data structures

Linked lists

Trees

Trees

References

[1] ttp://www.flaticon.com/

[2] ttps://en.wikipedia.org/wiki/Resource_management_(computing)

[1]

[2]

@@ Line 1: / Line 1: @@
-<center>
+[[file:resource.png|right|frame|Resource Management<ref>http://www.flaticon.com/</ref>]]
-<blockquote style="padding: 5px; background-color: #FFF8DC; border: solid thin gray;">
-   [[File:Exclamation.png]] This is one of '''the most important ideas''' you can take with you:
-   '''Decompose''' a problem into smaller parts, '''model''' a problem with flowcharts. Learn to think '''sequentially'''
+In computer programming, resource management refers to techniques for managing resources (components with limited availability). It includes both preventing resource leaks (releasing a resource when a process has finished using it) and dealing with resource contention (when multiple processes wish to access a limited resource). Resource leaks are an issue in sequential computing, while resource contention is an issue in concurrent computing. On many systems the operating system reclaims resources after the process makes the exit system call.<ref>https://en.wikipedia.org/wiki/Resource_management_(computing)</ref>
-</blockquote>
-</center>
-[[file:computation.png|right|frame|Computational thinking, problem-solving and programming<ref>http://www.flaticon.com/</ref>]]
-Computational Thinking (CT) is a process that generalizes a solution to open-ended problems. Open-ended problems encourage full, meaningful answers based on multiple variables, which require using decomposition, data representation, generalization, modeling, and algorithms found in Computational Thinking. Computational Thinking requires the decomposition of the entire decision making process, the variables involved, and all possible solutions, ensuring that the right decision is made based on the corresponding parameters and limitations of the problem. The term computational thinking was first used by Seymour Papert in 1980[1] and again in 1996.[2] Computational thinking can be used to algorithmically solve complicated problems of scale, and is often used to realize large improvements in efficiency<ref>https://en.wikipedia.org/wiki/Computational_thinking</ref>
@@ Line 39: / Line 31: @@
 [[Category:HL]]
 [[Category:problem-solving]]
-[[Category:essential idea]]