Select Page

Department of Computer Science and Engineering

Innovative Teaching Methods

Role Play

In this session, one set of students were holding the board which contains the plain text and one student is holding the key value board. Another set of set of students are holding the boards which contains the encrypted text. Using the plain text and key, student who is holding the key will convert the plain text into cipher text. From the observation of CNS theory class, students have done an activity to convert plain text into cipher text using Caesar cipher technique.

Peer Learning

After completing the switching concept in classes, the students are divided into various groups. From the observation of switching concepts, students are allowed to discuss with their peer mates to have a clear idea on the switching concept as well as the different types of switching techniques.

In this session, after learning the basic types of networking concepts from the classroom, students are insisted to discuss about various types of networks using the LAN TRAINER Simulator and to compare the advantages and disadvantages among those types of networking concepts. From this, students can able to analyze the different types of networking concepts comparatively


In this session, computer scraps are used to demonstrate the Input/ Output organization in the CPU. After completing I/O organization in the classroom session, students are allowed to discuss with their peer mates to have a clear idea on the I/O Organization

Project Based Learning

Department of Computer Science and Engineering had conducted, “CODE SCAPE” (An internal code hackathon) for the students to motivate them to learn to provide solutions for the real time scenario. In addition to this real time problems were given as Mini Project for the students.


In order to understand the concepts better, After completing the session, Multiple Choice Questions were Posted to the students. Thirty Seconds have been provided for each question. Maximum marks will be provided for the students those who are responding for the questions quickly. Finally, results will be displayed in the screen. By practicing this technique, students can able to retrieve something after learning it, and also it makes the students more likely to retain it for the long term.


Name of the FacultyTitle of the Video Lectureslink
1Dr.G. SaravananM-commerceM-commerce
2Dr.G. SaravananMPI overviewMPI overview
3K.A. DamotharanM-commerceM-commerce
4K.A. DamotharanTree TraversalsTree Traversals
5K.A. DamotharanFunctionsFunctions
6T. KalaiselviOptimal Merge PatternOptimal Merge Pattern
7S. TamilselvanSerializabilitySerializability
8S. TamilselvanSyntax Directed TranslationSyntax Directed Translation
9R. NarendranDistributed Mutual Exclusion and Non-Token based ApproachesDistributed Mutual Exclusion and Non-Token based Approaches
10R. NarendranExamples of DFD Model DevelopmentExamples of DFD Model Development
11Dr. S. SelviTriggers in databaseTriggers in database
12Dr. G. RevathyHill Climbing and Simulated annealingHill Climbing and Simulated annealing
13Dr. G. RevathyFunctionsFunctions
14Ms. T.KalaiselviQuick sort algorithmQuick sort algorithm
15Dr. G. SaravananMulti-Core Computer Architecture Storage and InterconnectsMulti-Core Computer Architecture Storage and Interconnects
16Dr. G. RevathyConstrains satisfaction problemConstrains satisfaction problem
17Dr. G. RevathySortingSorting
18Mr. S. TamilselvanNormalizationNormalization
19Mr. R.NarendranGlobal states and snapshot algorithmsGlobal states and snapshot algorithms
20Dr. S. SelviDistributed SystemsDistributed Systems
21Dr. S. SelviGlobal states and snapshot algorithmsGlobal states and snapshot algorithms
22Ms.K.SenthilvadivuSearching and SortingSearching and Sorting
23Ms.K.SenthilvadivuSearching and SortingSearching and Sorting
24K.A. DamotharanMobile IPMobile IP
25K.A. DamotharanGraph TraversalsGraph Traversals
26K.A. DamotharanFile handling in CFile handling in C
27K.A. DamotharanWMLWML
28K.A. DamotharanShortest Path AlgorithmShortest Path Algorithm
29K.A. DamotharanInterrupt ProgrammingInterrupt Programming
30D. SathyaReal TimeReal Time
31R. NarendranConsensus and AgreementConsensus and Agreement
32R. NarendranBasic path TestingBasic path Testing
33K.A. Damotharanm-commercem-commerce
34K.A. DamotharanBinary search treeBinary search tree
35K.A. DamotharanPointersPointers
36M. SivakumarStorage AllocationStorage Allocation
37M. SivakumarIssues in Code GenerationIssues in Code Generation
38R. NarendranTwo General Problem and Byzantine Fault ToleranceTwo General Problem and Byzantine Fault Tolerance
39R. NarendranBusiness Process RemodelingBusiness Process Remodeling
40K.A. DamotharanHeap treeHeap tree
41K.A. DamotharanMobile Ad-hoc NetworkMobile Ad-hoc Network
42K.A. DamotharanNested StructureNested Structure
43Dr. S. SelviTriggers in DBMSTriggers in DBMS
44Dr. S. SelviQuery processing and OptimizationQuery processing and Optimization
45R. KarunamoorthiQuick Sort AlgorithmQuick Sort Algorithm
46R. KarunamoorthiMerge Sort AlgorithmMerge Sort Algorithm
47Dr. G. RevathiUML DiagramsUML Diagrams
48Dr. G. SivakumarGraphical User Interface in javaGraphical User Interface in java



Contact Us


Admission : Mail : admission@esec.ac.in, Mobile :9442132706, 9865279443, 9842465500, 9842865500

Official Mail Id : contact@esec.ac.in

Principal Mail Id : esecprincipal@gmail.com

Contact No. : 04294232701,702,703


web counter