About the Department


Department & its year of establishment
  • Department of Computer Science
  • Year of the Establishment  :  1988
Programmes / Courses offered (UG, PG, M.Phil., Ph.D., Integrated Masters; Integrated Ph.D., etc.)
UGB.Sc., Computer Science
BCA
PGM.Sc., Computer Science
M.Phil.M.Phil. Computer Science
Interdisciplinary courses and departments involved
Interdisciplinary courses
  • E-Commerce
  • Office Software
Department Involved
  • Business Administration
Non-Major Elective Courses
  • Internet Fundamentals
  • Principles of Web Design
Departments Involved
  • English, Maths, Physics, Chemistry, Commerce
Annual / Semester / Choice based credit system
  • Semester system cum Choice based credit system
Participation of the department in the courses offered by other departments
CommerceElements of Accounts, Advertising and Salesmanship
MathematicsMathematics for Competitive Examination, Basic Mathematics
PhysicsNon-Conventional Energy, Astrophysics
EnglishEnglish for Competitive Examination, Effective English for Communications
BBAOrganizational Behavior, Human Resource Management
BiochemistryEnergy Builders, Health Care and Disease Management
Faculty with ongoing projects from  a) National  b)International funding agencies and Total grants received.
Mention names of funding agencies and grants received project-wise.
S. NoName of the FacultyType of GrantFunding AgencyGrants Received
1.
Dr.L.Ravi
21st Sep. 2012		Sponsors & Sacred Heart College
  • Dr.G.Sekaran, CLRI, Chennai
  • Dr.L.John Kenndy
    VIT, Chennai
  • Dr.Syed Shafi, HOD,
    Dept. of Chemistry, Thiruvalluvar University
Departmental projects funded by DST-FIST; DBT, ICSSR, etc.; total grants received
  • Nill
Areas of consultancy and income generated
  • Nil
Faculty recharging strategies
S. NoFaculty NameOrientationRefresherWorkshop/ Seminar / ConferencesTraining Programme
1.Dr.L.Ravi--132
2.Dr.S.Sagayaraj--81
3.Mr.J.John Arockiaraj--3-
4.Mrs.A.Josephine Sagaya Mala--4-
5.Mr.D.Adhiyaman--3-
6.Mrs.R.Sandrilla--1-
7.Mr.R.Veeraraghavan--2-
8.Mr.A.Selvaraj Jeyakumar--1-
9.Mr.R.Karthik--2-
10.Mr.P.Karthik--1-
11.Mr.V.S.Jayakumar Paul Bosco--1-
12.Ms.M.Poovizhi--1-
13.Mrs.P.Punitha Ilayarani  1 
14.Mr.S.Srinath--1-
 

Comments

Post a Comment

Popular posts from this blog

Myself

Alumni Alumni of the Department S. No Name Designation Official Address E-Mail_id Contact Details 1 Dr. Sagayaraj Francis Associate Professor Department of Computer Science, Pondicherry Engineering College, Pondicherry. fsfrancis@pec.com 9443467590 2 Mr.Maria Johnson Manager ? Projects, CSC India Pvt Ltd., Unit-13,Block-2, SDF Buildings, MPEZ, Cehnnai 600 045 manandaraj@csc.com 9790753102 3 Mr. Wilson Anandaraj Head IPTC India , Alcatel-Lucent India Limited., TVH Agnitio Park, 5th floor, No.141, Rajiv Gandhi Salai, Kandanchavadi, Perungudi, Chennai ? 600096 Anandaraj.wilson@alcarel-lucent.com 98406 51908 4 Mr. Karthikeyan Programmer CTS, Chennai karthiksoft23@gmail.com 8098178422 5 Mr.Ganesh Prakash Programmer CTS, Chennai dgp.ganesh@gmail.com 7708267651 6 Mr.Harish Ramamoorthy Senior Engineer-ing Wipro InfoTech, Bangalore Harish.ramamoorthy@wipro.com 9663711661 7 Mr. Punniyakodi Muthusamy Project Manager InfoSys Ltd, Chennai Kodi_ugi@gmail.com 9962213700 8 Mr.Farnc...
Read more

MySelf

Graphs are mathematical structures that represent pairwise relationships between objects. A graph is a flow structure that represents the relationship between various objects. It can be visualized by using the following two basic components: Nodes: These are the most important components in any graph. Nodes are entities whose relationships are expressed using edges. If a graph comprises 2 nodes A and B and an undirected edge between them, then it expresses a bi-directional relationship between the nodes and edge. Edges: Edges are the components that are used to represent the relationships between various nodes in a graph. An edge between two nodes expresses a one-way or two-way relationship between the nodes. Types of nodes Root node: The root node is the ancestor of all other nodes in a graph. It does not have any ancestor. Each graph consists of exactly one root node. Generally, you must start traversing a grap...
Read more