SETHU INSTITUTE OF TECHNOLOGY
Estd.1995 AN AUTONOMOUS INSTITUTION | ACCREDITED WITH ‘A’ GRADE BY NAAC
Approved by AICTE, New Delhi & Permanently Affiliated to Anna University, Chennai
Pulloor-626115, Kariapatti Taluk.Virudhunagar District.
DEPARTMENT OF INFORMATION TECHNOLOGY
ACTIVITY BASED LEARNING (ABL)
The key feature of the Activity Based Learning (ABL) method is that it uses Student-friendly
educational aids to adoptive self-learning and allows a student to study their course according to
his or her technical skills.
Activity-based learning or ABL describes a range of pedagogical approaches to teaching. Its
core premises include the requirement that learning should be based on doing some hands-on
experiments and activities.
The idea of activity-based learning is rooted in the common notion that students are active
learners rather than passive recipients of information. If student is provided the opportunity to
explore by their own and and long-lasting. provided an optimum learning environment then the
learning becomes joyful
The above figure represents the active based learning methods. We are selecting the Jerome Bruner
under the stages of individual recommended ABL
Jerome Bruner ABL
The outcome of cognitive development is thinking. The intelligent mind creates from experience
"generic coding systems that permit one to go beyond the data to new and possibly fruitful
predictions" (Bruner, 1957, p. 234). Thus, children, as they grow, must acquire a way of
representing the "recurrent regularities" in their environment.
So, to Bruner, important outcomes of learning include not just the concepts, categories, and
problem-solving procedures invented previously by the culture, but also the ability to "invent"
these things for oneself.
Cognitive growth involves an interaction between basic human capabilities and "culturally
invented technologies that serve as amplifiers of these capabilities."
In his research on the cognitive development of children (1966), Jerome Bruner proposed three
modes of representation:
Enactive representation (action-based)
Iconic representation (image-based)
Symbolic representation (language-based)
The intellectual development includes three stages. The enactive stage which refers to learning
through actions. The iconic stage which refers to the learners use of pictures or models.
The symbolic stage which refers to the development of the ability to think in abstract terms.
Activity performs a certain number of educational purposes. In this respect, they aim to motivate
students to learn more effectively and encourage them to learn from their mistakes. Subjects of
Data Structure and Algorithms course offered to Information Technology students are very
virtual and are very difficult to interpret visually. In this study, we used this technique for teaching of
basic operations (construction, insertion, deletion) of binary search trees (BST).
Here we assume that nodes as a cards .This activity performed by a student in the class room.
Persons: 15
Here Actor as a Student
Operations on Binary Search Tree’s
A binary tree is a binary search tree (BST) if and only if an inorder traversal of the binary tree
results in a sorted sequence. The idea of a binary search tree is that data is stored according to an
order, so that it can be retrieved very efficiently.
A BST is a binary tree of nodes ordered in the following way:
1. Each node contains one key (also unique)
2. The keys in the left subtree are < (less) than the key in its parent node
3. The keys in the right subtree > (greater) than the key in its parent node
4. Duplicate node keys are not allowed.
Activities to the Students:
The students were distributed with the cards where the card says a number and an alphabet
behind it.
The teacher will:
Prepare a list of cards displays a number and an alphabet
Distribute the cards to the students
Deliver the instructions as
o The student come to the stage once their alphabet is announced
o If the stage is free the first person will be the center of attraction
o Else
The student compare his number with the number holded by center of
attraction
If it is greater the student should walk to the right side if it is lesser
walk to the left side
If a student is already in that destiny then that student will be
consider as center of attraction and repeat the process till he/she find
a place to stand
In this way the list of student will be called and stand in the stage.
Next Operation:
Faculty will randomly called the student to check a given number is available
The rules are
o The student go and ask the center of attraction if the number is equal to
center of attraction he/she announced found
o Otherwise if the number is greater then walk to RIGHT
o Else walk to LEFT, repeat the same until the number is found or no one to
ask next
In this way the teacher can elaborate the advantages of arranging the elements in order
which helps in searching. Finally the teacher disclose the concept of Binary Search Tree.
Insertion of a Node in Binary Search Tree
Binary search tree having two characteristics:
(1) All the nodes in a left sub tree having values less then root node.
(2) All the nodes in a right sub tree having values greater then root node.
Suppose we want to construct binary search tree for following set of data:
45 68 35 42 15 64 78
Step 1: First element is 45 so it is inserted as a root node of the tree.
Step 2: Now we have to insert 68. First we compare 68 with the root node which is 45. Since the
value of 68 is greater then 45 so it is inserted to the right of the root node.
Step 3: Now we have to insert 35. First we compare 35 with the root node which is 45. Since the
value of 35 is less then 45 so it is inserted to the left of the root node.
Step 4: Now we have to insert 42. First we compare 42 with the root node which is 45. Since the
value of 42 is less then 45 so it is inserted to the left of the root node. But the root node has
already one left node 35. So now we compare 42 with 35. Since the value of 42 is greater then 35
we insert 42 to the right of node 35.
Step 5: Now we have to insert 15. First we compare 15 with the root node which is 45. Since the
value of 15 is less then 45 so it is inserted to the left of the root node. But the root node has
already one left node 35. So now we compare 15 with 35. Since the value of 15 is less then 35
we insert 15 to the left of node 35.
Step 6: Now we have to insert 64. First we compare 64 with the root node which is 45. Since the
value of 64 is greater then 45 so it is inserted to the right of the root node. But the root node has
already one right node 68. So now we compare 64 with 68. Since the value of 64 is less then 68
we insert 64 to the left of node 68.
Step 7: Now we have to insert 78. First we compare 78 with the root node which is 45. Since the
value of 78 is greater then 45 so it is inserted to the right of the root node. But the root node has
already one right node 68. So now we compare 78 with 68. Since the value of 78 is greater then
68 we insert 78 to the right of node 68.
>
Prepared by
Dr.S.Siva Ranjani
Mr.R.Rajaguru
Mrs.D.Roja Ramani
Mrs.K.Krishnaveni
