Skip to main content

Chunking

What are chunks ?

 What is illusion of competence in Learning?

 How to make your studies more valuable?

 So basically chunks are compact packages of information that your mind can easily access.
When we start Learning a new concept sometimes it doesn't make much sense and appear as a puzzle whose pieces are randomly placed. Chunking is a mental process that helps you to take small or individual pieces of information and let them tie together with other pieces so this grouping forms a new larger units .

The new logic makes it easier to rememberit also you can fit this small chunk into puzzle to make a larger picture of what you are Learning.
If you just mug up or memorize facts without understanding them it won't help you to learn what's really going on or how this concept actually fits with other concept you are Learning.
Octopuse of attention :
When we are in Focused mode there are four slots of working memory appear behind forehead or in the prefrontal cortex. When you are focusing it's like an octopus of attention this octopus slips tentacles through four slots of working memory and help you to make connection to information that you have in various parts of your brain . Its different from the random connection of diffuse mode.

Focusing your attention to connect parts of the brain to tie together ideas is an important step that helps you start creating chunks .
You know whenever you are stressed you can't concentrate its because your octopuse begins to lose the ability to make connection. So when you are stressed, angry or afraid your brain doesn't work.

Next time we will learn How actually you can form chunks and answers to other questions asked in starting.
So happy Learning .

Labels:

Comments

Post a Comment

Popular posts from this blog

Connection Between Fibonacci Numbers and The Golden Ratio

Welcome. In this blog I will tell you relation between the Fibonacci Sequences and the Golden Ratio.Before that below  you can see the statue of Fibonacci, made in 1863 by Giovanni Paganucci, a sculpture in florence, but kept in a ancient cemetery in pisa where the Fibonacci was born. Its is interesting that the likeness of Fibonacci in this statue and his iconic portrait probably looks nothing like Fibonacci, since no true drawings of him exist from 850 years ago . But nevertheless Italy still honors him with this sculpture.  Statue Of Fibonacci Let's Return to Fibonacci Numbers and Fibonacci recursion relation. Then we will show you how they are related to Golden Ratio. So let's do some mathematics. Any way what's the recursion relation do you remember?? The n+1 Fibonacci number is equal to the sum of preceding two that is nth Fibonacci number Plus n-1 Fibonacci number right .                         Fn+1 = Fn + Fn−...
Post a Comment
Read more

Fibonacci Sequence and Rabbit Problem

Hello friends hope you all are good , healthy and safe.  In this Blog we will learn about fibonacci Sequence , golden ratio,relation between them , rabbit problem and many more. Fibonacci  Greatest mathematician of the middle ages, Fibonacci. Fibonacci was born in pisa around 850 years ago. He was a famous Italian mathematician. In the year 1202 he finished his book "Liber Abeci". The book of calculations that brought Arabic numerals to Europe, the zero one,two that we use today. Fibonacci also presented a growing rabbit population problem. And after solving this problem he derived the famous sequence of numbers that is named after him, The Fibonacci Sequence . Suppose you put a male-female pair of newly born rabbits in a field . Rabbits take a month to mature before mating. After o ne month , females gives birth to one male-female pair and then mate again. No rabbits die. How many rabbit pairs are there after one year? To solve this, we construct table. At the start of each ...
Post a Comment
Read more

Fibonacci Sequence Problem set 1

 Problems  1. The Fibonacci numbers can be extended to zero and negative indices using the relation Fn = Fn+2 − Fn+1 . Determine F0 and find a general formula for F−n in terms of Fn. Prove your result using mathematical induction. Solution: F0 = F2 − F1 = 0, F−1 = F1 − F0 = 1, F−2 = F0 − F−1 = −1, F−3 = F−1 − F−2 = 2, F−4 = F−2 − F−3 = −3, F−5 = F−3 − F−4 = 5, F−6 = F−4 − F−5 = −8. The correct relation appears to be F−n = (−1)^(n+1)×Fn                .............(1) We now prove equation (1) by mathematical induction. Base case: Our calculation above already shows that equation (1) is true for n = 1 and n = 2, that is, F−1 = F1 and F−2 = −F2. Induction step: Let us  assume that (1) is true for positive integers n = k − 1 and n = k. Then we have F−(k+1) = F−(k−1) − F(−k)     ..(from definition)                = (−1)^k×Fk−1 − (−1)^(k+1)×Fk           ...
Post a Comment
Read more