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

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

Fibonacci Sequence and Climbing Staircase problem

Hello Friends, So here is our next blog on Fibonacci  Sequence. In this blog I will introduce another problem whose solution is the Fibonacci Number. This problem is known as Climbing Staircase problem. The Question is How many ways one can climb staircase with n steps, taking one or two steps at a time ?? Questions Of Climbing Staircase  Eg. Suppose we have 3 steps to climb. So we have a Staircase, we climb it by taking one step , one step , one step or two step , one step or one step, two step. So If we have n-steps in Staircase , then how many different ways can we climb the Staircase? So to answer this question we could make a table, considering small numbers of steps i.e n = 1,2,3,4,5 And we can list the number of ways to climb the Staircase. So Observe the table first column is number of stairs or steps. Second column is the list of ways one can climb by taking one or two steps at a time. Third column a n   the total number of ways to climb Staircase. I hope y...
1 comment
Read more

Humans-puppet of mobile phones Part-1

Introduction       You have never seen dinosaur but imagine how they  looks like?  Just by reading name you got the  picture of it in your mind that's the power of imagination.  Therefore, Don't  just read imagine simultaneously.     Sometimes we comes to a turning point there Everything that happening its never happened  before....        Covid-19 a pendemic not declared as a pendemic until it's spread to whole world. Initially  corona virus widely spreading all over the world and it's reached our country too, so we came to the decision as lockdown for 21 days by the order of prime minister Narendra modi ji.    At that time our PM said the sentence he said: “If we are not able to adhere to this lockdown sincerely for 21 days, believe me, India will go back 21 years.”    Assume if we go back to 21 year what will be happen.....! Let's go to the flashback It was 1999,a fortunately recentl...
1 comment
Read more