A STUDY OF ACADEMY ACHIEVEMENT OF GOVERNMENT AND NON GOVERNMENT PRIMARY SCHOOL STUDENTS IN RELATION TO REINFORCEMENT
Keywords:Reinforcement, secondary schools, academic performance, Allahabad
The purpose of the study was to determine study of academy achievement of government and non government primary school students in relation to reinforcement. The study employed a Mixed Methods design in which both quantitative and qualitative data were collected. The study has targeted the students from public and private schools students of rural and urban area of the Allahabad district. Data was collected by using check-lists and interview schedules. Qualitative data was analyzed by using the thematic and content analysis such as Cronbach’s Alpha. The study reported on the use of praise, tangible items such as games and money, social, activity and token one were also moderately often used by the teachers. These terms also used in both form of reinforcement such as positive and negative reinforcement. The participants also used both Continuous reinforcement and partial reinforcement schedules. The purpose of this study was also to determine the effect of positive and negative reinforcement in the form of rewards on the achievement of primary students' end of the academic achievement. The study was conducted on 500 students of primary schools in Allahabad district. The researcher collected the students' grades for four weeks during which positive reinforcements in the form of rewards were not used and the grades for four weeks during which the students received positive reinforcements in the form of rewards ever time the student earned a grade of ninety-two or above. The eight week study showed significant improvement in the grades of the students when they received positive reinforcement in the form of rewards than when the same students did not receive rewards. The implications of the study is that positive reinforcement can be used to obtain desired result that a teacher, or parent seeks for a student to achieve; and that when used correctly, positive reinforcement is very effective. The study recommends that, schools should enhance reinforcement programs which have long term effect. Moreover, teachers should deepen their knowledge on reinforcement programs for academic success of students.
I. S. Marti, T.J. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad hoc Networks,” Proc. 6th Annual ACM/IEEE Int’l. Conf. Mobile Computing and Networking (Mobicom’00), Boston, Massachusetts, August 2000, pp. 255-265.
II. E.M. Royer, and C.-K. Toh, “A Review of Current Routing Protocols for Ad hoc Mobile Wireless Networks,” IEEE Personal Communications, vol. 2, no. 6, April 1999, pp. 46-55.
III. S. Ramanathan, and M. Steenstrup, “A Survey of Routing Techniques for Mobile Communications Networks,” Mobile Networks And Applications, vol. 2, no. 1, October 1996, pp. 89-104.
IV. T. Clausen, P. Jacquet, and L. Viennot, “Comparative Study of Routing Protocols for Mobile Ad hoc Networks,” Med-Hoc-Net’02, Sardegna, Italy, September 2002, 10 pp.
V. C.E. Perkins, and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector (DSDV) for Mobile Computers,” Proc. ACM Conf. Communications Architectures and Protocols (SIGCOMM’94), London, UK, August 1994, pp. 234-244.
VI. T. Clausen, G. Hansen, L. Christensen, and G. Behrmann, “The Optimized Link State Routing Protocol – Evaluation Through Experiments and Simulation,” Proc. 4th Int’l. Symp. Wireless Personal Multimedia Communications, Aalborg, Denmark, September 2001, 6 pp.
VII. R. Perlman, Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, Addison-Wesley, Reading, MA, 2000.
VIII. J. Moy, “Open Shortest Path First (OSPF) Version 2,” RFC 2328, April 1998.
IX. C.E Perkins, and E.M. Royer, “Ad hoc On-Demand Distance Vector Routing,” Proc. 2nd IEEE Workshop Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90-100.
X. D.B. Johnson, D.A Maltz, and J. Broch, “DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad hoc Networks,” Ad Hoc Networking, C.E. Perkins, Ed., Addison-Wesley, 2001, 139-172.
XI. D.B. Johnson, D.A. Maltz, Y.-C. Hu, and J.G. Jetcheva, “The Dynamic Source Routing Protocol for Mobile Ad hoc Networks (DSR),” Internet Draft, draft-ietf-manet-dsr-07.txt, February 2002.
XII. C.E Perkins, E.M. Royer, and S. Das, “Ad hoc On-demand Distance Vector (AODV),” RFC 3561, July 2003.
XIII. S. Murphy, “Routing Protocol Threat Analysis,” Internet Draft, draft-murphy-threat-00.txt, October 2002.
XIV. K. Zhang, “Efficient Protocols for Signing Routing Messages,” Proc. Symp. Network and Distributed Systems Security (NDSS’98), San Diego, CA, March 1998, pp. 29-35.
XV. P. Papadimitratos, and Z.J. Haas, “Securing the Internet Routing Infrastructure,” IEEE Communications, vol. 10, no. 40, October 2002, pp. 60-68.
XVI. R. Perlman, “Network Layer Protocols with Byzantine Robustness,” Ph.D. Dissertation, MIT/LCS/TR-429, MIT, October 1988.
XVII. B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, “An On-Demand Secure Routing Protocol Resilient to Byzantine Failures,” WISE’02, Atlanta, Georgia, September 2002, pp. 21-30.
XVIII. J. Lundberg, “Routing Security in Ad hoc Networks,”http://citeseer.nj.nec.com/400961.html
XIX. J.-F. Raymond, “Traffic Analysis: Protocols, Attacks, Design Issues and Open Problems,” Proc. Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, July 2000, pp. 7-26.
XX. Y.-C. Hu, A. Perrig, and D.B. Johnson, “Packet Leashes: A Defense Against Wormhole Attacks in Wireless Ad hoc Networks,” Proc. 22nd Annual Joint Conf. IEEE Computer and Communications Societies (Infocom’03), San Francisco, CA, April 2003.
XXI. Y.-C. Hu, D.B. Johnson, and A. Perrig, “SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad hoc Networks,” Proc. 4th IEEE Workshop on Mobile Computing Systems and Applications, Callicoon, NY, June 2002, pp. 3-13.
XXII. L. Zhou, and Z.J. Haas, “Securing Ad hoc Networks,” IEEE Network Magazine, vol. 6, no. 13, November/December 1999, pp. 24-30.
XXIII. F. Stajano, and R. Anderson, “The Resurrecting Duckling: Security Issues for Ad hoc Wireless Networks,” Proc. 7th Int’l. Workshop on Security Protocols, Cambridge, UK, April 1999, pp. 172-194.
XXIV. K. Sanzgiri, B. Dahill, B.N. Levine, C. Shields and E.M. Royer, “A Secure Routing Protocol for Ad hoc Networks”, Proc. 10th IEEE Int’l. Conf. Network Protocols (ICNP’02), IEEE Press, 2002, pp. 78-87.
XXV. S. Yi, P. Naldurg, and R. Kravets, “Security-Aware Ad hoc Routing for Wireless Networks,” Proc. 2nd ACM Symp. Mobile Ad hoc Networking and Computing (Mobihoc’01), Long Beach, CA, October 2001, pp. 299-302.
XXVI. P. Papadimitratos, and Z.J. Haas, “Secure Routing for Mobile Ad hoc Networks,” Proc. Communication Networks and Distributed Systems, Modeling and Simulation Conf. (CNDS’02), San Antonio, Texas, January 2002, pp. 27-31.
XXVII. A. Perrig, R. Canetti, D. Song, and J.D. Tygar, “Efficient and Secure Source Authentication for Multicast,” Proc. Symp. Network and Distributed Systems Security (NDSS’01), San Diego, California, February 2001, pp. 35-46.
XXVIII. Y.-C. Hu, A. Perrig, and D.B. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad hoc Networks,” Proc. 8th ACM Int’l. Conf. Mobile Computing and Networking (Mobicom’02), Atlanta, Georgia, September 2002, pp. 12-23.
XXIX. T. Imielinski, and J.C. Navas, “GPS-based Geographic Addressing, Routing, and Resource Discovery,” Communications of the ACM, vol. 42, no. 4, April 1999, pp. 86-92.
XXX. S. Toner, and D. O'Mahony, “Self-Organising Node Address Management in Ad hoc Networks,” Personal Wireless Communications, IFIP-TC6 8th Int’l. Conf. (PWC 2003), 2003, pp. 476-483.
XXXI. S. Buchegger, and J.-Y. Le Boudec, “Performance Analysis of the CONFIDANT Protocol (Cooperation Of Nodes: Fairness In Dynamic Ad hoc NeTworks),” Proc. 3rd Symp. Mobile Ad hoc Networking and Computing (MobiHoc 2002), ACM Press, 2002, pp. 226-236.
XXXII. P. Papadimitratos, and Z.J. Haas, “Secure Link State Routing for Mobile Ad hoc Networks,” Proc. IEEE Workshop on Security and Assurance in Ad hoc Networks, IEEE Press, 2003, pp. 27-31.
XXXIII. S. Capkun, and J.-P. Hubaux, “BISS: Building Secure Routing out of an Incomplete Set of Security Associations,” Proc. ACM Workshop on Wireless Security, ACM Press, 2003, pp. 21-29.
XXXIV. B. Schneier, Applied Cryptography – Protocols, Algorithms and Source Code in C, 2nd Ed., John Wiley & Sons, Inc., 1996.
XXXV. D. Eastlake, and P. Jones, “US Secure Hash Algorithm 1 (SHA1),” RFC 3174, September 2001.
XXXVI. R. Rivest, “The MD5 Message-Digest Algorithm,” RFC 1321, April 1992.
How to Cite
Copyright (c) 2021 International Education and Research Journal (IERJ)
This work is licensed under a Creative Commons Attribution 4.0 International License.