STUDENTS’ HAND BOOK
ACADEMIC PROGRAMMES
Of
CSIT
Department of Computer Science & Information Technology
Guru Ghasidas Vishwavidyalaya, Bilaspur
(A Central University established by the Central Universities Act, 2009
Bilaspur 495009 - Chhattisgarh
"Victory goes to the player who makes the next-to-last mistake." ― Chessmaster Savielly Grigorievitch
Tartakower (1887-1956)
Message from Vice Chancellor
Dr. Lakshman Chaturvedi
Vice-Chancellor
Guru Ghasidas Vishwavidyalaya
Bilaspur (C.G.) 495 009 India
e-mail : laksh44@rediffmail.com
Phone: 07752-260283,260353
Fax
: 07752 – 260148
Dear students
I welcome you all in the campus of Guru Ghasidas Vishwavidyalaya, Bilaspur. I
appreciate your decision to be a part of this department and University. After up gradation of
the University to the status of Central University in the year 2009, several initiatives related to
students’ interest have been taken. Latest computers, software and other equipments have
been provided to you for a better practical knowledge. The books in departmental and central
library are available to add to your knowledge about your subject. You can also read research
journals and other reference books besides a large number of text books available in the central
library, in both forms: hard copy as well as online. Very soon we are going to install University
Management System in the campus which will ease many of your routines such as fees
deposit, monitoring attendance, downloading course material etc. Our large campus is full of
beautiful sights, lush greenery, ponds, state of the art laboratories, spacious auditorium,
cafeteria and much more. The campus is vibrating round the year with activities mainly with
your active participations. Several competitive activities relating to sports, culture, academics
etc are organized to explore and encourage potentials among you. But we are not complacent
at this, sky is the limit. In the present scenario of competitive world, you have to prepare
yourself to face the challenges due to emergence of newer technology, rapid changes in
requirements of the industries and academic domain. We are committed to impart you
excellent education and to provide a conducive environment to develop within you an all
round personality. We will work together day and night to elevate the name and fame of this
University to International level. Feel free to interact with your teachers for your problems.
University administration is ready to attend your calls promptly. I am always eager to listen to
you for your suggestions for improving the quality of education and facilities available in the
campus.
I wish you all a bright career.
(Dr. Lakshman Chaturvedi)
Vice Chancellor
“Education is the most powerful weapon which you can use to change the world.” ― Nelson Mandela
Message from the Head of the Department
Dr.A.K.Saxena
(Prof. & Head)
Guru Ghasidas Vishwavidyalaya
Bilaspur (C.G.) 495 009 India
e-mail : amitsaxena65@rediffmail.com
Phone: 07752-260283,260353
Fax : 07752 - 260148
I congratulate all my students for their decision to be a part of this department. The
courses running in this department are designed to meet high standards. The courses will help
them to secure jobs in Industries as well in academic domain. The Integrated course leading to
Postgraduate in Computer Science with exit option is a great favour to students who wish to
continue their studies in the department after graduation. The Post graduate courses, M Sc and
MCA are highly demanding in the job market. I am pleased to share with you that almost all
the students passing out from this department are in good positions professionally as well as
academically.
The handbook with you is our effort to provide useful piece of information to each of
you. The handbook contains syllabi, different instructions in the interest of the students,
contact details of their teachers as well as administration personnel. The Vishwavidyalaya
since its up gradation to Central University status has grown in various dimensions all in the
welfare of students. The departmental library has enough books for you. You will be happy to
use latest computer machines during practical time. The entire faculty including teachers,
technical staff and staff members of department of CSIT welcome you to this department and
we are committed to offer you the best in the campus as well as in department. Please do not
hesitate to contact any of us, your valuable suggestions will help us to improve the quality of
education and facilities for you.
Wish you all the very best in your future.
(Dr. A.K.SAXENA)
Head of the department
Computer Science & Information Technology
“You can teach a student a lesson for a day; but if you can teach him to learn by creating curiosity, he will
continue the learning process as long as he lives.” ―Clay P. Bedford
My Details
Student Photo
Name
:------------------------------------------------------------------
Father’s Name
:------------------------------------------------------------------
Mother’s Name
:------------------------------------------------------------------
Blood Group
:------------------------------------------------------------------
Address
:-----------------------------------------------------------------:-----------------------------------------------------------------:-----------------------------------------------------------------:------------------------------------------------------------------
Phone
:------------------------------------------------------------------
Mobile
:------------------------------------------------------------------
Whom to Call
in case of Emergency
:------------------------------------------------------------------
Phone number 1
:----------------------- Phone number 2 :-----------------
e-mail
:------------------------------------------------------------------
Local Guardian’s Name :-----------------------------------------------------------------(If any)
Driving License Number :-----------------------------------------------------------------Other Information
:------------------------------------------------------------------
“Software is not limited by physics, like buildings are. It is limited by imagination, by design, by organization.
In short, it is limited by properties of people, not by properties of the world.” ― Ralph Johnson
CONTENTS
1.
About The University
2.
Department at a Glance
3.
Code of Conduct for Students
4.
Awards and Scholarships
5.
Facility in the Campus
6.
Academic Activities
7.
Details of Syllabi
8.
Fees Structure
9.
Alumina Association Form
10.
Telephone Directory
•
Faculty of CSIT
•
Department Technical & Office Staff
•
Important numbers of University
11.
Important Instructions to Students
12.
Academic Calendar
"I can write better than anybody who can write faster, and I can write faster than anybody who can write
better."― A. J. Liebling (1904-1963)
ABOUT THE UNIVERSITY
Guru Ghasidas Vishwavidyalaya, a Central University established by an Act
2009 of the Parliament, was originally established as State University by an Act of State
Legislative Assembly of the then undivided Madhya Pradesh on 16 June 1983. Guru
Ghasidas Vishwavidyalaya is an active member of the Association of Indian
Universities and Association of Commonwealth University. The National Assessment
and Accreditation Council ( NAAC ) has accredited the University as B+.
Situated in
a
socially
and
economically
challenged
area,
the
Vishwavidhyalaya is appropriately named to honor the great Satnami Saint Guru Ghasidas
( born in 17th century ) , who championed the cause of the downtrodden and waged a
relentless struggle against all forms of social evils and injustice prevailing in the society.
The Vishwavidyalaya is a residential institution. The Vishwavidyalaya covers
almost the total spectrum of higher education in 36 numbers of Vishwavidyalaya teaching
departments and 01 new departments forensic Science is introduced in the year 2012.
The lush green sprawling campus of the Vishwavidhyalaya spread over an area of
aprox. 655 acres is located five KM away from the main Bilaspur Town. River Arpa,
the lifeline of Bilaspur, runs parallel to the Vishwavidhyalaya campus. Bilaspur is a fast
Industrializing City, already having a large number of industrial units coming up in the
region. The area is the nerve center of trade in iron and steel, coal, aluminium, textiles,
foodgrains, ' Kosa' silk, cement, paper, furniture and jewellery and is internationally known
for its rice production.
The Vishwavidyalaya aims at disseminating and advancing knowledge by
providing instructional and research facilities in various branches of learning. It
promotes innovation in teaching learning process, interdisciplinary studies &
research, establish linkages with the industries for the promotion of science &
technology, educate and train man-power for the development of the country and is
committed to the improvement of the social and economic conditions & welfare of
the people by improving their intellectual, academic & cultural development.
The city is well connected with all parts of the country by road and rail. Being a railway
zone, Bilaspur facilitates travel by train to and from any part of the country. 120
Kilometers away, at Raipur, the Capital of Chhattisgarh, is the nearest airport.
History
Guru Ghasidas University (GGU) was established by an Act of the State Legislative
Assembly in 1983 as Guru Ghasidas Vishwavidyalaya. The university is suitably named to
honor the great Satnami Saint Guru Ghasidas who championed the cause of the
downtrodden and waged a constant effort against all forms of social evils and injustice
existing in the society. Guru Ghasidas Vishwavidyalaya was given the status of a Central
University under Central University Ordinance 2009, No. 3 of 2009.
“Sometimes the questions are complicated and the answers are simple.” ― Dr. Seuss
Department at a Glance
The Department of Computer Science & Information technology (CSIT) started in the
year 1990, with one year P.G. Diploma course (PGDCA). This course was followed by a
Master's degree course in Computer Science as well as Information Technology (M.Sc.(CS)
and M.Sc.(IT)) in 1996. Subsequently Master of Computer Application (MCA) course
approved by the All India Council of Technical Education ( AICTE), New Delhi was
introduced in the year 1998. The department has a large number of branded PCs with
latest configuration. Every student can have enough time for hands on practice on these
machines. CSIT has got its own departmental library besides Central Library. The
department avails Internet facility in the Computer Center, which is used as lab of CSIT in
the same building.
The department has well qualified faculty members having live interaction &
collaboration with Other National & International Universities & Institutions. The faculty
members of the department are actively involved in R&D activities. The faculty members
publish their research articles in National and International Journals and proceedings. The
faculty members have been invited to deliver invited talks in India and abroad. Expert
lectures are conducted in the department from time to time. The students are motivated to
develop real time project and assigned a software development live project preferably in
reputed organizations Seminars and Group Discussions are the regular features of the
department. Department has organized a number of National Seminars on emerging
issues in Computer Science like Data Mining & E- Governance . These seminars proved to
be a great success. The seminar brought a good gathering of researchers, academicians not
only from chhattisgarh but all over of country. Eminent speakers delivered their expert
talks on the issues during the seminar. On 16-17 March 2011, CSIT organized an
international conference on Soft Computing and ICT (SCICT-2011) eminent speakers prof
C.T.Lin (Taiwan),Prof Sun Wang Cho (Korea) ,Prof Jun Wang (Singapur) ,Prof A.K.Pujari
(VC Sambalpur university, India ),Prof G. Panda (IIT bhubhneswar, India) and Prof
N.S.Choudhary (IIT ,Indore, India) have delivered their expert lecture during the
conference .This conference was participated by 300 delegates including students, faculty
members ,researchers from all over the country .The proceeding of the conference was also
published . The department encourages student- teacher in-traction. Students are given
freedom to consult teacher at any time in the department for their problems or suggestion.
The department has always been buzzing with activities. The department is planning to
establish International research collaborations. Department of CSIT revises its course
curriculum frequently looking to the need of the industries to place our students there in
and has a closed interaction with software and R&D organizations. The passing out
students have an excellent placement record and are able to secure jobs round the globe in
reputed companies. On 24 March 2012, CSIT organized a one day workshop on “National
e-governance plan (NeGP)” awareness campaign and supported by Department of
Information Technology, Govt. of India.
“ Life is like riding a bicycle. To keep your balance, you must keep moving.”-Albert Einstein
Academic Programmes
Courses Offered
Seats
Duration
Eligibility for admission
60
5 Year
(10 Sem.)
Minimum 50% aggregate at 10+2 level
with Maths from any recognized
University/Board or equivalent (Through
VET Exam)
M.Sc ( Comp.Sc. )
60
2 Year
(4 Sem.)
Graduation with 50 % marks in Physics
Electronics/Comp. Sc./Statistics / B.Sc ( IT )
/ BCA or equivalent. (Through VET Exam)
M.C.A
60
3 Year
(6 Sem.)
Integrated UG/PG Prog. with exit
option on completion of 3 yrs.UG
Prog.
Graduation with 50 % marks with Mathematics
at 10+2 level/B.C.A with 50 % marks(Through
VET Exam)
As per rules
-
Ph.D
Objectives of the program
The program prepares students to obtain up positions as system analysts, systems
designers, Programmers and managers in any field related to information technology.
The program, therefore, aims at imparting comprehensive knowledge with equal
emphasis on theory and practice. The MCA and M.Sc.(CS) students are encouraged to
spend a full semester working in the industry in the institute giving them insight into the
workings of the IT world. However, the course curriculum will have enough flexibility to
enable a student to undertake advance studies in computer science later on.
“Learning gives creativity. Creativity leads to thinking. Thinking gives knowledge and. Knowledge makes you
great. ” ― Abdul Kalam
Faculty Member
Department Name: Computer Science & Information Technology
Name
Designation
E-Mail-ID
Teaching & Research Experience
Specialization
Other Important Assignments
Name
Designation
E-Mail-ID
Teaching & Research Experience
Specialization
Other Important Assignments
Name
Designation
E-Mail-ID
Teaching & Research Experience
Specialization
Other Important Assignments
Name
Designation
E-Mail-ID
Teaching & Research Experience
Specialization
Other Important Assignments
Dr. A.K. Saxena
Professor & HOD
amitsaxena65@rediffmail.com,
hodcsit@ggu.ac.in
22 years
Data Mining, soft computing
Overall discipline , teaching and
other administrative control.
Dr. Hari Shankar Hota
Assistant Professor
hota_hari@rediffmail.com
7 Years
Soft Computing and Data Mining
I/C-Unit
Test
Conduction,
Faculty Cultural Coordinator,
Dept. Meeting, Departmental
Student Union Election
Mrs. Pushplata Pujari
Assistant Professor
pujari.lata@rediffmail.com
7 Years
Soft Computing, Classification
Attendance
Management,
Member
Anti
Ragging
Committee,
Handbook,
Decorative Work of LAB
Mr Rajwant Singh Rao
Assistant Professor
rajwantrao@gmail.com
2 Years 6 Months(research exp.)
Compiler Design ,Theory of
Computation, Artificial
Intelligence
Departmental Library Incharge,
LAB3 Incharge, Construction
Work and Electric Work etc.
“Success is when your signature becomes an autograph. ” ― Abdul Kalam
Name
Designation
E-Mail-ID
Teaching & Research Experience
Specialization
Other Important Assignments
Name
Designation
E-Mail-ID
Teaching & Research Experience
Specialization
Other Important Assignments
Name
Designation
E-Mail-ID
Teaching & Research Experience
Specialization
Other Important Assignments
Mr. Amitesh Kumar Jha
Assistant Professor
amittesh2911@yahoo.co.in
7 years
Data
mining,
Programming
Languages
Time
Table
Management,
Coordinator Integrated UG, RTI.
Ms.Sushma Jaiswal
Assistant Professor
Jaiswal1302@gmail.com
7 years
DIP
Department Handbook, Syllabus,
Decorative Work
of LAB,
Placement & Training Cell,
Student Alumina Cell, LAB2
Incharge,Ad-hoc
faculty
attendance and lecture records.
Dr.Babita Majhi
Assistant Professor
babitamajhi@gmail.com
Currently on leave for Post Doc
-------
“Aim for success, not perfection. Never give up your right to be wrong, because then you will lose the ability
to learn new things and move forward with your life. Remember that fear always lurks behind
perfectionism.” ―David M. Burns
Staff Members of Compute Center
Name
Designation
E-Mail-ID
Working Experience
Specialization
Dr. Ghazala Mumtaz Mollick
System Programmer
ghazalamumtaz@gmail.com
22 Years
Computer Architecture
Name
Designation
E-Mail-ID
Working Experience
Specialization
Mrs. Amita Toppo
System Programmer
toppo_amita@yahoomail.com
8 Years
C++,JAVA, Oracle
Staff Members of CSIT & Computer Center
Computer Science Mr. Sadhu Prasad Pandey Computer Operator
& Information
Office Assistant
Tech. & Computer Mr. J.P. Verma
Centre
07752Mr. Vikas Talalwar
Office Assistant
260356
Course Assignments other than their
routine department duties
I/C of MCA Course
BSc, Ph.D
Mr. R. K.Tomar
Office Assistant
M.Sc. Course
Mr. Hanuman Singh
MPS
----
Mr. Onkar Singh Sidar
MPS
----
Mrs.Rani Bai
MPS
----
“Education makes a people easy to lead but difficult to drive: easy to govern, but impossible to enslave.”
―Peter Brougham
Code of Conduct for Students
The students are admitted to Guru Ghasidas Vishwavidalaya to achieve
excellence and shape their character to become responsible citizens. They must realize their
responsibility towards the Vishwavidalaya and to its components like faculty, staff and fellow
students. Failure to maintain a good standard of conduct shall result in disciplinary action.
Attendance :
75% attendance is compulsory in each subject including practical .
Misconduct : Any of the following activities ( but not limited to these only ) will be
treated as misconduct.
1. Disruption of teaching activities or disturbing the learning process of other students
on the campus.
2. Any act on the part of the students, which disrupts functioning of the university,
endangers health and safety of campus residents and damages Vishwavidalaya
properties.
3. Cheating in examination and supplying of false documents / information in order to
seek any consideration / favor from the University.
4. Possession or consumption of intoxicating beverages on the campus.
5. Failure to return back loaned material, settle University dues.
6. Possession of weapons.
7. Use of unparliamentarily language while in conversation with Vishwavidalaya
Staff and fellow students.
Disciplinary Actions :
Failure to adhere to good conduct may result in disciplinary actions like :
1. A warning by the authorities.
2. Suspension from a particular class.
3.
Suspension / expulsion from the University.
4.
Suspension of campus privileges e.g. hostel, accommodation etc.
5.
Withholding of examination result or withdrawal of awarded diploma / degree
certificate.
6.
Any other disciplinary action deemed appropriate by the University authorities.
RAGGING
It is observed that perverse form of ragging is prevalent in institutions of
higher learning.The Government and the apex courts of the country have taken
very serious view to combat the menace of ragging in universities and other
educational institutions. Ragging has been recognized as the “Cognizable
offence” and is punishable under law. The following could be the possible
punishments for those who are found guilty of participation in or abetment of
ragging. The quantum of punishment shall, naturally depend upon the nature
and gravity of the offence as established by disciplinary committee or the court
of law.
“Do you know the difference between education and experience? Education is when you read the fine
print; experience is what you get when you don't. ”― Pete Seeger
Punishments:
1. Cancellation of admission;
2. Suspension from attending the classes;
3. Withholding/withdrawing scholarships/fellowships & other benefits;
4. Debarring from appearing in any tests / examination or other
evaluation process; withholding results;
5. Debarring from representing the institution in any national meet,
tournament, youth festival, etc.;
6. Suspension / Expulsion from the hostel;
7. Rustication from the institution for period varying from 1 to 4 semesters;
8. Expulsion from the institution &consequent debarring from admission to any
other institution;
9. Fine up to Rs. 25000/10. Rigorous imprisonment up to three years.
While the first ten types of punishment can be awarded by the appropriate
authority of the institution itself, the last punishment can be awarded by a
court of law.
“The secret of education lies in respecting the pupil.” ― Ralph Waldo Emerson
Awards and Scholarships
The topper of each batch is awarded a Gold Medal and Merit Certificate in the
convocation of the University.
Facility in the Campus
Hostel: Hostel facility for boys and girls are available in the university campus.
Computer Centre : The University has a sophisticated computer centre equipped
with latest versions of hardware and software. The centre has appropriate
statistical, scientific and simulation packages to cater to the educational and
managerial needs. The computer centre is equipped with BSNL based leased
line and broadband for accessing internet. Students of the Department are
eligible to avail the centralized computer facility. The Department has fully airconditioned computer lab with Wi-Fi facilities well connected with LAN
networking and necessary software for management students.
Central Library : The University has a well stocked up-to-date library
containing about 86,000 books, 1650 back volumes of journals and five thousand
projects / Ph.D. thesis. Presently, it subscribes about 150 Indian and foreign
journals in various disciplines. The reprographic facility on subsidized rate is
provided to the users along with other library services. The library has internet
facility and library automation with INFLIBNET link is under progress. Besides
the central library, students can also use the departmental library.
Departmental Library : CSIT department has its own departmental library
containing about 2250 books.
National Service Scheme: The University has a unit of National Service Scheme
(NSS) having a total strength of 100 students from the University Teaching
Departments. The aim of NSS is to provide an opportunity and working
experience for social services. The students participate in various activities like
plantation, blood donation, seminar, essay writing, quiz, debate etc..
Post Office and Bank: The residents and students on the Campus are
provided with Banking & Communication facilities. Punjab National Bank,
Counter (PNB), BOI (Bank of India) and Post Office are rendering their services
in the campus. ATM (24 hours) facilities as well as online banking have been
recently introduced by the PNB .Also ATM (24 hours) facilities by State Bank of
India is available in the campus. A new electronic telephone exchange is also
established in the campus.
“Education is our passport to the future, for tomorrow belongs to the people who prepare for it
today.” ― Malcolm X
Health Centre : Health and ambulance facilities to the students and residents are
available in the Health Centre located near the University Computer Centre. One
Medical officer with other staff is posted to take care of the Centre.
SC/ST Cell: University has a separate SC/ST cell. The cell processes and
provides assistance to the SC/ST students to get scholarships as per the
Government rules and deals with all the problems of the SC/ST students.
Cultural Activities: University as well as each department conducts the cultural activities
every Year on various occasions like Annual day of university (15 Jan), Guru Ghasidas
Jayanti (18 Dec.) and other.
Campus Development: Students and faculty of the Department are actively
involved in developing the area surrounding the Department.
Canteen : Vishwavidyalaya has a canteen in the campus, near the administrative
building. The canteen provides snacks, tea, coffee, cold drink, etc. during office hours as
well as working lunch. It operates from 10 am to 5 pm. on all working days. Canteen
committee appointed by the Vishwavidyalaya monitors the quality, rates and standard.
Auditorium : Vishwavidyalaya has one State of art Auditorium with a seating capacity
of about 800 audience in the campus near administrative block.
Staff Quarters : There are staff quarters for Teaching and Non teaching staff of the
University. The staff colony is very well connected by roads with well lit avenues. The
colony is surrounded by lush green trees with pleasant environment.
Vishwavidyalaya Guest House : Vishwavidyalaya Guest House having 16 well
furnished suites including 8 VIP AC suits provide comfortable stay for the visitors to the
Campus. Additional Guest Housed facility for 64 persons is also available in the Forestry
Guest House. The Guest Houses also provides lodging and boarding to visitors during
seminars / conferences etc. on reasonable charges.
Bus Facility: The university provides Bus facility for the students. City bus facility is also
available for the students from the campus .
Coaching classes: The university staff college provides special coaching classes for the
students like IAS, PSC, UGC-NET,CSIR-NET, Spoken English classes etc. at free of cost.
Industry Academia Interaction( Placement Cell):
Department has a recently established a training and placement cell which
would organize industrial visits, summer placements and campus recruitments
for students of the department.
“A good head and good heart are always a formidable combination. But when you add to that a
literate tongue or pen, then you have something very special.” ― Nelson Mandela
ACADEMIC ACTIVITIES
Guest Lectures
In order to strengthen academic inputs and to minimize the gap between
theory and practice, regular teaching is supplemented by guest lectures by
eminent academicians, industrialists and through seminars and conferences.
Seminar, Workshop & Lecture Series
Apart from guest lectures, the Department has taken steps to boost the academic
activities by organizing lecture series, conferences, workshops and training
programme
for
corporate
executives.
Following
Workshop/Conferences/Seminars/Invited
Talks(National/International)
are
conducted in the CSIT department.
1. National Conference on Cyber Security, Data Mining and ICT for The Society on
18-19 January,2006.
2. National Seminar on Data Mining & E-Governance on 17 February,2007.
3. Work Shop on PC Maintenance and Networking on 07th Feb-10th Feb, 2010.
4. International Conference on Emerging Trends in Soft Computing and ICT, from
16-17 March, 2011.
5. Workshop on “National e-governance plan (NeGP)” awareness campaign
supported by Department of Information Technology, Govt. of India ,24,
March,2012.
6. Workshop on “Web site Designing and Development “, 2012, in three batches
for the students of this university.
Apart from this a number of invited lectures are conducted in CSIT department
from time to time.
“You are educated. Your certification is in your degree. You may think of it as the ticket to the good
life. Let me ask you to think of an alternative. Think of it as your ticket to change the world.” ― Tom
Brokaw
(The scheme and syllabi of any programme can be modified from time to time, students are advised to
refer to University website for updates if any/ consult their respective teachers )
DEPARTMENT OF COMPUTER SCIENCE & INFORMATION TECHNOLOGY
GURU GHASIDAS VISHWAVIDYALAYA, BILASPUR (C.G.)
Examination Scheme and Syllabus of Integrated UG/PG- CS
1st Semester
S.No.
Paper Code
Subject
Marks
Allotted
End
Semester
Marks
Internal
Marks
1. PCSC-101
Fundamentals of computer
50
30
20
2. PCSC-102
Introduction to Programming
Methodology
50
30
20
3. PCSC-103
LAB 1
50
30
20
Total
150
90
60
IIndSemester
S.No.
Paper Code
1. PCSC-201
2. PCSC-202
3. PCSC-203
Marks
Allotted
End
Semester
Marks
Internal
Marks
50
30
20
50
30
20
50
150
30
90
20
60
Marks
Allotted
End
Semester
Marks
Internal
Marks
50
30
20
50
30
20
Subject
Introduction to Logics of
Computer
System Analysis & Design
LAB 2
Total
IIIrdSemseter
S.No.
Paper Code
Subject
1.
PCSC-301
2.
PCSC-302
Introduction to Operating
system
Introduction to C Language
3.
PCSC-303
LAB 3
50
30
20
Total
150
90
60
“True education does not consist merely in the acquiring of a few facts of science, history, literature, or art,
but in the development of character.” ― David O. McKay
IVthSemseter
S.No.
Paper Code
Subject
Marks
Allotted
End
Semester
Marks
Internal
Marks
1.
PCSC-401
Database Management System
50
30
20
2.
PCSC-402
Computer Based Numerical
Method
LAB 4
Total
50
30
20
3.
PCSC-403
50
150
30
90
20
60
VthSemester
S.No.
Paper Code
Subject
Marks
Allotted
End
Semester
Marks
Internal
Marks
1.
PCSC 501
Internet Application
50
30
20
2.
PCSC502
Objected Oriented Concepts
50
30
20
3.
PCSC503
System Software
50
30
20
4.
PCSC-504
Introduction to Artificial
Intelligence
50
30
20
5.
PCSC-505
Minor Project
100
100
-----
Total
300
220
80
Marks
Allotted
End
Semester
Marks
Internal
Marks
VIthSemester
S.No.
Paper Code
Subject
1.
PCSC-601
Programming with JAVA
50
30
20
2.
PCSC-602
Software Testing
50
30
20
3.
PCSC-603
Introduction to Data Structure
50
30
20
4.
PCSC-604
Management Information
50
30
20
5.
PCSC-605
Major Project
100
100
-----
Total
300
220
80
“Education isn't for getting a job. It's about developing yourself as a human being.” ― Liz Berry, The China
Garden
PCSC-101
Fundamentals of Computer
Basics of Computer – Development of computer ,Computer system concepts,
Characteristics, capabilities and limitations of computer, Types and generation of
computers, Computer architecture.
Input /Output and Storage device – Basic input devices :keyboard, mouse ,joystick
,MICR, OCR. Light pen ,Bar Code Reader, Touch screen ,Basic output devices: Printer
Types of printer, Plotter, Monitor VGA, SVGA ,XGA etc.
Storage device : Different types of storage device ,Primary Vs Secondary data storage .
Computer software – Definition ,Software and its need ,types of software : Application
software, System software, Firmware, Evolution of programming language ,Different
types of programming language :High level ,Assembly level ,Low level and 4GL,their
advantages and disadvantages , language translator: Compiler, Interpreter, Assembler,
Booting process.
Data Representation – Number system :Binary ,Octal, and Hexadecimal ,converting
from one number system to another ,Computer code: BCD,EBCDIC and ASCII ,Binary
arithmetic :Addition ,subtraction, multiplication and division.
Operating System and other Software – Definition and objective of operating system
,Types o f operating system, DOS and Windows ,Characteristics of DOS ,some basic co
mmands of DOS ,Virus : Types of virus ,virus detection and prevent ion .
BOOKS RECOMMENDED:
1. Alexis Leon and Mathews Leon ,Fundamental of Informat ion Technology ,Vikas
Publicat ion .
2. V.Rajaraman .Computer fundamental ,PHI publicat ion .
“The great aim of education is not knowledge but action.” ― Herbert Spencer
PCSC-102
Introduction to Programming Methodology
Programming Concepts, Characteristics of Programming, Stored Program Concepts,
Procedure Oriented Programming, Object Oriented Programming- characteristics & its
advantages, Types of Computer Languages (Low Level, High Level, 4GL and Object
Oriented Languages).
Programming Tools : Algorithms, characteristics of Algorithm, Program Flow Charts,
Pseudo code, Decision Tables, Structured Programming Techniques.
File Concepts, Data Terminology and File Operations : File Organization and Accessing
Techniques-Sequential, Direct and Index Sequential.
Software and its Need, Types of Software, System Software and its type, Application
Software and its type, Compilers and Interpreters.
Operating System : Introduction to OS, Functions of OS, Broad View of MS-OS(Internal
and External Commands only), UNIX (commands only) and MS-Windows.
BOOKS RECOMMENDED:
1. Computer fundamentals: By V.Rajaram; PHI Publicat ion
2. Data Structure : By Shaum Series
“Education does not mean teaching people what they do not know. It means teaching them to behave as they
do not behave.” ― John Ruskin
PCSC-201
Introduction to logics of computer
Number Systems and codes: Decimal numbers, binary numbers, binary arithmetic, 1’s
and 2’s complements, Octal numbers, hexadecimal numbers, inter-conversion of
number system, Digital codes: Binary coded decimal (BCD) , Gray code, Excess-3 code,
Format of ASCII code.
Logic Gates: Positive and negative logics, NOT gate, OR gate, AND gate, NAND gate,
NOR gate, EX-OR and EX-NOR gates , Symbol , truth table, Circuit diagram using
basic gates , universal property of NAND and NOR gates.
Boolean Algebra: Boolean operation, logic expressing, rules and laws of Boolean
algebra, Demorgan’s theorems, simplification of Boolean expression using Boolean
algebra techniques.
SOP and POS from of Boolean expressions, minterms, maxterms, and simplification of
Boolean expression using Karnaugh map techniques (Up to 4 Variables), half adder,
Full adder, Multiplexer.
Flip-Flops, Registers, Shift registers, Counters.
BOOKS RECOMMENDED:
1. Computer Fundamentals , Architecture & Organization By B.Ram, New Age
International Publisher limited.
2. Computer Architecture & Organization by Moriss Manno, 3rd edit ion, Print ice Hall o
f India Pvt Ltd.
3. Digital Computer electronics: An Introduction to micro computers by Albert Malvino
and Jerald Brown, Tata Mcgraw Hill.
4. Mordern
Digital Electronics, by R.P Jain, Tata Mcgraw Hill Publicat ion, 3rd
Edition.
“Education is the movement from darkness to light.” ― Allan Bloom
PCSC-202
System Analysis and Design
System Concepts : What is system, Characteristics of system, Elements of a System,
Computer Based System and its Components, Types of Systems: Open and Closed
System, Transact ion Processing System, MIS, DSS etc.
System Analysis & Requirement Analysis: what is System Analysis, Ro le and Qualities
of System Analyst, System Development Life Cycle- Phases of SDLC, PrototypingSteps in Prototyping, Advantages and Disadvantages of prototyping?
Requirement Investigation, Feasibility y Study, Fact Finding Techniques.
Analysis and Design Tools: Flowcharts, Decision Trees, Decision n Tables,
Database/File Design, Data Flow Diagrams, E-R Diagrams.
System testing and Implementation : System testing – Black Box Testing, White Box
Testing, Unit Testing , Integration Testing, Modular Testing.
What is implementation, Type of Implementation- Fresh, Replacement and Modified,
Implementation Methods?
BOOKS RECOMMENDED:
1. Analysis and Design of Information System: James A Senn
2. System Analysis and Design: Awad
“To educate a person in the mind but not in morals is to educate a menace to society.” ― Theodore
Roosevelt
PCSC-301
Introduction to Operating System
Introduction to O.S: Overview of OS , function and goal, characteristics of OS, Hardware
Concept related to OS , CPU States, I/O channels , Memory Hierarchy, Types of OS –
Multiprogramming, Timesharing, Batch Processing , Multitasking, Real-time.
Concepts of Process: Operation on Process, Process states, Concurrent Processes, Process
Control Block(PCB) and signals, Process scheduling, Process Hierarchy.
Process synchronization and Communication: Problem of concurrent processes, Critical
section, Mutual Exclusion, Deadlock, Process of Deadlock, Interposes, synchronization, need for
interposes synchronization, Buffering and Blocking Process.
Memory Organization and management: Address Binding, Logical and Physical address,
Fragmentation, Concept of Virtual memory, Swapping and Relocation.
Preliminary Study of DOS and WINDOWS.
BOOKS RECOMMENDED:
1. Silberschatz and Galvin, Operat ing System Concepts 6/ed, Addisio n Wesley.
2. William Stalling, Operat ing Systems: Internals and Design Principles 5/ed, PHI.
3. Tanenbaum, Modern Operat ing Systems, PHI.
4. Peterson and Silberschatz, Operating System Concepts, Addison Wesley.
“In Learning you will teach and in teaching you will learn.”― Phil Collins
PCSC-302
Introduction to C Language
Origin & Introduction to C : About C, Evolution of C, Programming languages,
Structure of a C program, Compiling a C program, Simple C program, Character set in
C, Keywords in C, Basic data types, Qualifiers used with basic data types, Variables in
C, Type declaration, Input function, Output function and format specifiers, arithmetic
operators, Unary operators, Relational and logical operators, address operator,
conditional operator, Hierarchy o f operators.
Decision Making, looping & Branching: Control statements, if statement, if else
statement, for statement, while loop, do while loop, switch statement, break statement,
continue statement, goto statement.
Arrays & String Handling : Introduction to arrays, advantages of arrays, single
dimensional arrays, multidimensional arrays, array declaration, array initialization,
accessing data from array, Character arrays, String Variables, Reading & writing
strings, string handling functions.
Pointers & User Defined Functions : Introduction to pointers, pointer variables, pointers
and arrays, pointers to pointers, array of pointers, 2 dimensional arrays and pointers,
Introduction to functions, advantages of functions, declaring a function, calling a
function, passing arguments to a function.
File Management in C : Defining & opening a file, closing a file, I/O operations on file,
error handling during I/O operations.
BOOKS RECOMMENDED:
1. A. K. Saxena, Programming Language C : Anamaya Publishers, New Delhi.
2. Y. Kanetkar, Let Us C, BPB Publicat ion.
3. B.S. Gottfried, Schaum’s outline of Theory and Problems o f Programming with C,
McGraw-Hill.
“The whole of science is nothing more than a refinement of everyday thinking.” ― Albert Einstein
PCSC-401
Database Management System
Introduction : Purpose of Database System, Concept of database & its evaluation, Views of
Data, Types of DBMS, DBMS architecture, Data Independency, Data Models, Data Dictionary.
E-R Model : Basic Concept, Design Issues, Entity Sets, Attributes & its Types, E-R Diagram,
Design of an E-R Database Schema , Keys.
Normalization : Purpose of Normalization , Functional Dependencies, 1 NF, 2 NF and 3 NF.
SQL : Introduction to SQL, DDL, DML & DCL statements, Basic Operations, Aggregate
function, Modification of Database, other SQL features.
Relational Model : Structure of Relational Model, The Relational algebra (Selection, Projection,
Union, Intersection,Cartesian product, Join), Tuple relational calculus.
BOOKS RECOMMENDED:
(1) Database system concepts By H.Korth and A. Silberschatz ,S.Sudarshan, TMH Publication ,
2010.
(2) An introduction to Database Systems by Bipin Desai, Galgotia Publications, 2003 edition.
(3) An Introduction to Database Systems, C.J.Date, A.Kannan, S. Swamynathan, Pearson
Publication, Eight edition, Database Management System C.J.Data
“A good system can’t have a weak command language.” ― Alan J. Perlis
PCSC-402
Computer Based Numerical Method
Algebraic Equation : Bisection Method, Newton – Raphson Method, Regula Falsi Method.
Simultaneous Algebraic Equation: Gauss Elimination Method, Gauss-Jordan Method,
Factorization Method, Jacobi’s Iteration Method, Gauss- seidal Iteration Method.
Matrix Inversion & Eigen Value : Gauss Jordan Method, Factorization Method , Eigen values
and Eigen Vectors .
Interpolation: Newton’s
Interpolation Formula.
backward
and
forward
Interpolation
Formula,
Lagrange’s
Numerical Differentiation & Integration: Trapezoidal Rule, Simpson’s one- third rule Simpson’s
three- eight rule.
BOOKS RECOMMENDED:
1 Numerical Methods in Engineering & Science By Dr. B.S.Grewal, Khanna Publishers, Seventh
edition, 2005.
2 Introductory methods of numerical Analysis By S.S.Sastry, Phi Learning publication, Edition
Fourth , 2009
“I don’t need to waste my time with a computer just because I am a computer scientist.” ― Edsger W.
Dijkstra
PCSC-501
Internet Application
Basic of Internet: Basic concept, History, Hardware & software requirement, Client server
architecture model, IP Address and Domain Name System, Use of Web Browsers, Customizing
the browser, Finding information on the Internet, Search Engines, and Basic Protocols: HTTP,
FTP, Telnet etc.
Working with Internet: Uploading and Downloading Text and Images, Web Pages and Web
sites, Downloading software with the Browser, Installing, Downloading software , Advanced
Software Downloading.
Services of Internet: E-mail, Outlook express, Eudora and Netscape Messenger, Advanced Email Facilities, Newsgroups: Use and Advantages, Online and e-mail Gaming, Chatting,
Videoconferencing, World Wide Web(WWW).
HTML: Benefit and drawbacks, Tables, Frames, Image and Form, Introduction to CGI scripting.
Web Pages: Developing Web page with HTML.
BOOKS RECOMMENDED:
1. How to do Everything with the Internet: Dennis Jones.
2. The Internet: Douglas E. Coiner, Prenlicc- Hall, India.
3. Internet & Intranet Engineering : Daniel Minoli, TataMcGraw-Hill.
4. Introduction to Data Communication & Networking : Forouzan.
“Computer Science is no more about computers than astronomy is about telescopes” ― Edsger Wybe Dijkastra
PCSC- 502
Object Oriented Concepts
Overview of Object Oriented: Ned of Object Oriented, Procedural Vs Object Oriented approach,
Benefits, C++ and other languages.
Features of Object Oriented: Class, Objects, Polymorphism, Inheritance, Message Passing,
Abstraction, Encapsulation.
Class and Object: Definition, Difference, Pointer to Object, Array of Object, Comparison of Class
with Union & Structure.
Polymorphism : Type of Polymorphism, Methods Overloading, Operator overloading.
Inheritance : Types of Inheritance, Single Level, Multi Level, Multiple & Hybrid Inheritance,
Advantage of Inheritance, Base Class & Derived Class C++ & VB: Introduction, Basic Data
Type, Writing Simple Program.
BOOKS RECOMMENDED:
1 Object Oriented Programming: E. Balaguru Swamy, Tata Mc. Graw Hill
2 Object Oriented Programming & C++: By R. Raja Raman
3 Visual C++ Programming: Yeshwant P. Kanitkar
“You educate a man; you educate a man. You educate a woman; you educate a generation.” ― Brigham
Young
PCSC-503
System Software
Basic Concepts: System Software, Types of system software’s, SIC (Simplified Instructional
Computer), Simple programs for SIC, CISC and RISC machines.
Assembler: Assembler functions, M/C dependent assembler features, M/C independent
assembler features, one pass assembler, Multi pass assembler.
Macro and macro processor: Macro definition and expansion, macro processor algorithm and
data structure, Independent macro processor features, Macro processor design option.
Compilers and software tools: Phases of Compiler, Software tools for program development,
Editors, Debugging, Programming environment, User Interface.
Loader and linkers: Introduction, Basic loader function, Machine dependent loader features,
machine independent loader features, Loader design option.
BOOKS RECOMMENDED:
1 D.M.Dhamdhere, System Programming & Operating Systems, Tata Mc Graw Hill, Second
Revised Edition ,
1999.
2 J. Donovan, Systems Programming : An Introduction to System Programming, Tata Mc Graw
Hill Publication,
Edition, 1999.
3 A.C.Shalini, System Software, Scitech Publications(INDIA) PVT,LTD, Fifth Reprint, 2010
“Education is the ability to listen to almost anything without losing your temper or your self-confidence.” ―
Robert Frost
PCSC – 504
Introduction to Artificial Neural Networks
Introduction: Definition and meaning, Different areas of A.I. Applications.
Preliminaries of Neural Networks: Essence and benefits of neural networks.
Introduction to Artificial Neuron: Model of biological neuron, meaning of learning and training,
Model of an artificial Neuron, different units of an artificial neuron.
Introduction to Artificial Neural Network: Connectionist Networks, types of neural networks,
single layer and multilayer perceptrons, Weights, bias, transfer functions
Training of a simple perceptron: Training of a single layer neural network with simple example
like AND, OR logic gates.
BOOKS RECOMMENDED:
Neural Networks: A comprehensive Foundation (2e preferred): Simon Haykins, Prentice Hall of
India
ii. Neural Networks for Pattern Recognition: Christopher M Bishop: Oxford Press
iii. Introduction to Artificial Neural Systems:J.M.Zurada, West Publishing Company, St. Paul,
Minnesota, 1992 / Jaico
Publishing House, Bombay, 1994
iv. Artificial Intelligence, E. Rich and K. Knight, Tata McGraw Hill.
v. Artificial Intelligence: A New Synthesis, Nilsson , Morgan Kaufmann.
“Education is a progressive discovery of our own ignorance.” ―Will Durant
PCSC – 601
Programming with Java
Introduction: Genesis of java, importance to the Internet, overview and features. Language
Basics: Variables Primitive Data Types Operators Expressions, Statements, and Blocks Control
Statements Array class and Object.
Inheritance : Definition, Types, Method overloading and Method Overriding, super and this
keywords, interfaces. Packages: Defining Packages, CLASS PATH.
Threads: Thread Model, Creating Threads, Synchronization. Exception handling: Exception
Types, Try, Catch & finally Blocks, Throw and Throws.
Input/output: Basic Streams, Byte and Character Stream, predefined streams, reading and
writing from console and files. JDBC: JDBC connectivity with backend database, JDBC driver
types.
Applets: Fundamentals, life cycle, HTML applet tag, passing parameters.
Introduction to AWT: Window fundamentals, creating windowed programs working with
graphics, Using AWT controls, menus. Delegation event model, handling mouse and keyboard
events.
BOOKS RECOMMENDED:
1. Naughton P and schildt H. Java: The complete reference, Osborne Mcgra-Hill, Berkeley, USA,
1997.
2. Rodgers Cadenhead, Laura Lemay, Sams Teach Yourself Java 2 in 21 Days, Sams Publishing.
3. E. Balagurusamy, Programming with Java, Tata McGraw Hill.
4. Bruce Eckel, Thinking in Java, Pearson Education.
5. Peter Van Der Linden, Just Java 2, Sun Microsystems/Prentice Hall.
6. Simply JAVA :An Introduction to JAVA programming By James R. Levenick ,Firewall Media
publication New,Delhi.
7. Java Programming - Khalid Mughal.
“Education is a weapon, whose effect depends on who holds it in his hands and at whom it is aimed.” ― Joseph
Stalin
PCSC – 602
Software Testing
Fundamentals of Testing :Human and errors, Testing and Debugging, Software Quality,
Requirement Behavior and Correctness, Fundamentals of Test Process, Psychology of
Testing, General Principles of Testing, Test Metrics.
Role of Testing in SDLC :Review of software development models (Waterfall Models,
Spiral Model, W Model, V Model) Agile Methodology and Its Impact on testing, Test
Levels (Unit, Component, Module, Integration, System, Acceptance, Generic)
Approaches to Testing – I :Static Testing ,Structured Group Examinations ,Static
Analysis ,Control flow & Data flow, Determining Metrics
Approaches to Testing – II :Dynamic Testing ,Black Box Testing ,Equivalence Class
Partitioning, Boundary Value Analysis, State Transition Test, Cause Effect Graphing
and Decision Table Technique and Used Case Testing. White Box Testing , Statement
Coverage, Branch Coverage, Test of Conditions, Path Coverage.
Test Management :Test Organization ,Test teams, tasks and Qualifications ,Test
Planning ,Quality Assurance Plan, Test Plan, Prioritization Plan, Test Exit Criteria ,Cost
and economy Aspects ,Test Strategies, Test Activity Management, Incident
Management.
BOOKS RECOMMENDED:
1. Software Testing Foundations, Andreas Spillner, Tilo Linz, Hans Schaefer, Shoff
Publishers and Distributors
2. Software Testing: Ron Patton , Techmedia
3. Foundations of Software Testing by Aditya P. Mathur – Pearson Education custom
edition 2000
4. Testing Object Oriented Systems: models, patterns and tools, Robert V Binder,
Addison Wesley, 1996
5. Software Engineering – A practitioner’s approach by Roger S. Pressman, 5th Edition,
McGraw Hill
“A year spent in artificial intelligence is enough to make one believe in God.” ― Alan J. Perlis
PCSC – 603
Introduction to Data Structure
Introduction, Basic terminology, Elementary data organization, Data structure, Data
structure Operation and Types, Order of an algorithm, Complexity of Algorithms.
Array: Basic Terminology, Linear and multi dimensional Array. Pointers: Array of pointers.
Records: Record Structures.
Linked list: traversing a linked list, searching a linked list, Insertion into a linked List,
Deletion from a Linked List. Stacks: operation on stack, Array Representation of Stack.
Queues: Linear Queue, Circular Queue, operation on Queue,.
Trees : Definition of Trees: Types of Trees, Linear Tree, Binary Tree and Their
Representation, Implementation and Searching (Inorder, Preorder, Postorder)
Operations on binary search tree: Traversing, Searching, Insertion, Deletion.
Sorting: Sorting, bubble sort, quick sort, Insertion Sort, Selection Sort, Merge sort, heap sort.
Searching: Binary Search, hashing.
BOOKS RECOMMENDED:
1. Data Structure - Seymour Lipschutz (Schaum's Series).
2. Data Structure & Program Design - Robert L. Kruse, 3rd Ed., Prentice Hall.
3. Standish, Data Structure, Addison-Wesley.
4. A. M. Tennenbaum, Y. Langsam and M. J. Augenstein, Data Structures using C, PHI, 1996.
5. N. Wirth, Algorithms+Data Structures= Program, Prentice Hall.
6. Robert Lafore, Data Structures and Algorithms in Java, Sams.
7. Sahni S, data Structures, Algorithms and Applications in C++ , Mc Graw- Hill, 2002.
8. R. B. Patel and M.M.S. Rauthan, Expert Data Structures With C++, Khanna Publications,
Delhi, India.
9. G. S. Baluja Data Structures Using C.
“ Education is what remains after one has forgotten everything he learned in school. ” ― Albert
Einstein
PCSC -604
Management Information System
Management Information System: Definition, MIS as an evolving concept, MIS and other
Academic Disciplines, Subsystems of an MIS.
Structure of MIS: Elements of an Information System, MIS support for Decision making, MIS
Structure.
Hardware, Software, and communications Technology for Information Systems.
System & Design: Systems Development Initiative, Different Methodologies - Life Cycle &
Prototype approach, detailed study on Life Cycle Design & Implementation. Case Study.
Managerial Decision Making: Decision Making Process, Group Decision Support Systems,
Architecture of GDSS, Categories of GDSS.
Decision Support System: Definition, Components of DSS (Data Base Management System,
Model Base Management System, Support Tools), Applications of DSS, Functions of DSS.
Study of Computerization: Computerization in different functional areas of a typical
manufacturing/business organization i.e. Marketing, production, material, financial, personal.
BOOKS RECOMMENDED:
1 Management Information Systems, Gordon B. Davis & Margerethe H. Olson Mc-Graw-Hill
2 Management Information Systems, Kenneth, Prentice Hall Publication
3 Management Information Systems, T. Lucey , Thomson Learning
“ If you think education is expensive, try ignorance. ” ― Derek Bok
(The scheme and syllabi of any programme can be modified from time to time, students are advised to
refer to University website for updates if any/ consult their respective teachers )
SCHEME OF EXAMINATION 2012-2013
MASTER OF COMPUTER APPLICATIONS
MCA Ist Semester
S.No.
Subject
Code
Subject
Period / Week
Scheme of Exam
Theory / Practical
L
T
P
E.S.E.
IA
Test
Total
Marks
1
MCA-101
Introduction to Information Technology
4
1
--
60
10
30
100
2
MCA-102
Programming Based Numerical Analysis
4
1
--
60
10
30
100
3
MCA-103
Advanced Programming in “C” language
4
1
--
60
10
30
100
4
MCA-104
Data Structure with algorithm
4
1
--
60
10
30
100
5
MCA-105
Digital Electronics
4
1
--
60
10
30
100
6
MCA-106
LAB-I:Programming in C
--
--
3
100
--
--
100
7
MCA-107
LAB-II: Data Structure Using C
--
--
3
100
--
--
100
20
5
6
500
50
150
700
Total
MCA IInd Semester
S.No.
Subject
Code
Subject
Period / Week
L
T
P
Scheme of Exam
Theory / Practical
E.S.E.
IA
Total
Marks
Test
1
MCA-201
Principles of Operating System
4
1
--
60
10
30
100
2
MCA-202
Object Oriented Programming with C++
4
1
--
60
10
30
100
3
MCA-203
Computer System Architecture
4
1
--
60
10
30
100
4
MCA-204
Web Technology
4
1
--
60
10
30
100
5
MCA-205
Discrete Mathematics
4
1
--
60
10
30
100
6
MCA-206
LAB-I: Object Oriented Programming with
“C++ “
--
--
3
100
--
--
100
7
MCA-207
LAB-II: Unix/Linux
--
--
3
100
--
--
100
20
5
6
500
50
150
700
Total
“ By spiritual training I mean education of the heart. ” ― Mahatma Gandhi
MCA IIIrd Semester
S.No.
Subject
Code
Subject
Period / Week
L
T
P
Scheme of Exam
Theory / Practical
E.S.E.
IA
Total
Marks
Test
1
MCA-301
Introduction to JAVA
4
1
--
60
10
30
100
2
MCA-302
Artificial Intelligence and Expert Systems
4
1
--
60
10
30
100
3
MCA-303
RDBMS
4
1
--
60
10
30
100
4
MCA-304
Theory of Computation
4
1
--
60
10
30
100
5
MCA-305
Computer Network
4
1
--
60
10
30
100
6
MCA-306
LAB-I: RDBMS
--
--
3
100
--
--
100
7
MCA-307
LAB-II: Programming Lab JAVA
--
--
3
100
--
--
100
20
5
6
500
50
150
700
TOTAL
MCA IVth Semester
S.No.
Subject
Code
Subject
Period / Week
L
T
P
Scheme of Exam
Theory / Practical
E.S.E.
IA
Total
Marks
Test
1
MCA-401
Compiler Design
4
1
--
60
10
30
100
2
MCA-402
Software Engineering
4
1
--
60
10
30
100
3
MCA-403
Financial Accounting
4
1
--
60
10
30
100
4
MCA-404
Operation Research
4
1
--
60
10
30
100
5
MCA-405
Management Information System
4
1
--
60
10
30
100
6
MCA-406
LAB-I: Programming in .NET
--
--
3
100
--
--
100
7
MCA-407
LAB-II:MATLAB
--
--
3
100
--
--
100
20
5
6
500
50
150
700
TOTAL
“ I do regard spinning and weaving as the necessary part of any national system of education. ” - Mahatma
Gandhi
MCA Vth Semester
S.No.
Subject
Code
Subject
Period / Week
L
T
P
Scheme of Exam
Theory / Practical
E.S.E.
IA
Total
Marks
Test
1
MCA-501
Soft Computing Techniques
4
1
--
60
10
30
100
2
MCA-502
Interactive Computer Graphics
4
1
--
60
10
30
100
3
MCA-503
Data Mining & Data Warehousing
4
1
--
60
10
30
100
4
MCA-504
Network Security
4
1
--
60
10
30
100
5
MCA-505
Analysis & Design of Algorithm
4
1
--
60
10
30
100
6
MCA-506
LAB1: - Advanced Programming Tools –
JAVA
--
--
3
100
--
--
100
7
MCA-507
Minor Project
--
--
3
100
--
--
100
20
5
6
500
50
150
700
TOTAL
MCA VIth Semester
S.No.
Subject Code
Subject
Total Marks
1
MCA-601
Major Project ( Viva Voce)
500
Total
500
“ Don't take rest after your first Victory. Because if you fail in second, more lips are waiting to say that your
first victory was just Luck. ” ― Abdul Kalam
MCA-101
Introduction to Information Technology
1.
Introduction–Basics concept of
IT, concept of data and information, History of
computer, Generations and classification of Computers, organization of computers, Input
and Output devices, storage devices, Data processing and file organization.
2.
Software and Computer language -Software and its need, Types of Software: System
software, application software, utility software, Firm ware. Operating system :Types ,Job
and objective. Language translator .Introduction and evolution of Programming
Languages, Types of Programming Languages, Generations of Programming Languages,
Programming Paradigms: procedural oriented and object oriented programming.
3. Communication and network technology :Communication process, Communication and
system elements ,Analog and digital signal, mode of communication , communication
media: Wired and Wireless. Computer Network: Types ,criteria, advantages and
disadvantages, Topology, LAN and other network related protocols, OSI reference
model and TCP/IP model.
4.
Internet-Technical foundation of Internet, history of Internet, Internet Service Provider
(ASP), ARPANET , Services Available on Internet; Internet Applications : E-mail, WWW
and file transfer .Internet addressing , Client server computing, Domain name system
(DNS), Internet Security – Fire walls, Encryptions etc.
5. Application of IT and Latest IT Trends : IT in business, Industry, home, education
entertainment, science and engineering and medicine. E-commerce, M-Commerce.
Latest IT Trends :Artificial Intelligence ,Data Mining, Overview of Geographic
Information System(GIS) ,Cloud computing ,Information communication Technology
(ICT)
BOOKS RECOMMENDED:
1.
2.
3.
4.
5.
Fundamental of Computer 5th Edition By V.Rajaraman,PHI Publication.
Introduction to Information Technology by V.Rajaraman ,PHI Publication.
Information technology today By S.Jaiswal
Fundamental of IT :Leon and Leon ,Leon Tec World
Introduction to Information Technology by Aksoy and DeNardis ,Cengage Learning.
“We have to dare to be ourselves, however frightening or strange that self may prove to be.” ― May Sarton
MCA-102
Programming Based Numerical Analysis
1. Algebraic Equation :Computer Arithmetic – Floating point Numbers- Operations
Normalization and their consequences. Iterative Methods – Roots of a Single
transcendental equations and roots of Polynomials using Bisection Method , False
position Method , Newton Raphson Method.
2. Simultaneous Algebraic Equation :Gauss Elimination Method, Gauss-Jordan Method,
Factorization Method, Jacobi’s Iteration Method, Gauss- seidal Iteration Method.
Matrix Inversion & Eigen Value: Gauss Jordan Method, Factorization Method
and Eigen Vectors.
3. Interpolations: Polynomials interpolation, Newton Method. Lagrange’s Interpolation
Formula and difference tables. Least Square Approximations- Linear regression only.
4. Differentiation and Integration- Formula for Numerical Differentiation and Numerical
integration by Trapezoidal Rule and Simpson’s rule only.
5. Numerical Solution of Differential Equation :- Euler’s Method, Taylor series Method,
Runge-Kutta Method.
BOOKS RECOMMENDED:
1.
2.
3.
4.
Numerical Methods By V. Rajaraman, 3rd Edition, Prentice-Hall India Pvt. Ltd.
Numerical Methods By S.S. Shastri, 4th edition, 2005,PHI publications.
Numerical Methods in Engineering and Science, 36th Edition, Khanna Publishers, Delhi.
Computer Based Numerical and Statistical techniques, P.K.Mittal and Mukesh
B.,Galgotia Publication.
“Life isn't about finding yourself. Life is about creating yourself.” ― George Bernard Shaw
MCA-103
Advanced Programming in ‘C’ Language
1.
Fundamentals of C Programming :Overview of C : History of 'C', Structure of 'C'
program. Keywords, Tokens, Data types, Constants, Literals and Variables, Operators
and Expressions : Arithmetic operators, Relational operator, Logical operators,
Expressions, Operator : operator precedence and associativity ,Type casting, Console
I/O formatting, Unformatted I/O functions: getch(), getchar, getche(), getc(), putc(),
putchar().
Control Constructs : If-else, conditional operators, switch and break, nested conditional
branching statements, loops: For, do.. while, while, Nested loops, break and continue,
goto and label, exit function.
2. Arrays, Strings and Functions :Array:-Array declaration, One and Two dimensional
numeric and character arrays. Multidimensional arrays.
String:- String declaration, initialization, string manipulation with/without using
library function.
Functions:-definition, function components: Function arguments, return value, function
call statement, function prototype. Type of function arrangement: return and argument,
no return and no argument, return and no argument, no return and argument. Scope
and lifetime of variable. Call by value and call by reference. Function using arrays,
function with command line argument. User defined function: maths and character
functions, Recursive function.
3. Structure, Union & Enum- Structure :basics, declaring structure and structure variable,
typedef statement, array of structure, array within structure, Nested structure; passing
structure to function, function returning structure. Union: basics, declaring union and
union variable, Enum: declaring enum and enum variable.
4. Dynamic Data Structures in 'C' - Pointers: Definition of pointers, pointer declaration,
using & and * operators. Void pointer, pointer to pointer, Pointer in math expression,
pointer arithmetic, pointer comparison, dynamic memory allocation functions – malloc,
calloc, realloc and free, pointers vs. Arrays, Arrays of pointer, pointer to array, pointers
to functions, function returning pointer, passing function as argument to function,
pointer to structure, dynamic array of structure through pointer to structure.
5. File Handling and Miscellaneous Features :File handling: file pointer, file accessing
functions,:fopen, fclose, fputc, fgetc, fprintf, fscanf, fread, fwrite,beof, fflush, rewind,
fseek, ferror. File handling through command line argument. Introduction to C
preprocessor #include, #define, conditional compilation directives: #if, #else, #elif,
#endif, #ifndef etc.
BOOKS RECOMMENDED:
1.
2.
3.
4.
5.
Programming in C “Yashwant Kanetkar”, BPB Publications,Tenth Edition.
Programming with C “Venugopal”, TMHOutline Series,Third Edition.
The C Programming Language “Kemigham and Ritche [ Prentice Hall]”
Programming in C Language, “Dr Amit Saxena“ Ananya Publication
Programming in C Language “Bala Gurusamy“ Fourth Edition
“Everything you can imagine is real.” ― Pablo Picasso
MCA-104
Data Structure with Algorithm
1. Basics terminologies: Introduction to basic data Structures: Arrays, linked list, trees,
stack, queue, Data structure operations; time complexity.
2. Stacks, Queues: Stacks; Array representation of stack; Linked representation of stack;
Various polish notation’s-Prefix, Postfix, infix; Evaluation of a postfix & Prefix
expression; Conversion from one another; Application of stack; Queues; Linked
representation of queues; Dqueues; Circular queue; Priority queue; Singly Linked listOperation on it; Doubly linked list- Operation on it; Circular linked list.
3.
Searching and Sorting: Searching algorithm: linear search, binary search; sorting
algorithms: Bubble sort, Insertion sort, Selection sort, Quick Sort, Merge sort and Heap
sort.
4.
Trees :Binary trees; Representation of binary tree in memory; traversing binary tree;
Traversing using stack; Binary search trees; Searching and inserting in binary search
trees; Deleting in a binary search ,tree; AVL search trees; Insertion and deletion in binary
search trees; B trees: searching, insertion, deletion; Heap.
5. Graphs : Terminology & representation; Warshall algorithm; Shortest path; Minimum
spanning tree; Kruskal & Dijkstara algorithm; Linked representation of graph; Operation
on graph; Traversing a graph.
BOOKS RECOMMENDED:
1. Data Structure By Lipshutz, McGraw Hill.
2. Data Structure By Standish, Addison-Wesley.
3. Data Structures using C By A. M. Tennenbaum, Y. Langsam and M. J. Augenstein,PHI,
1991
“Good friends, good books, and a sleepy conscience: this is the ideal life.” ― Mark Twain
MCA-105
Digital Electronics
1. Number System: Binary, Octal and Hexadecimal number system, Conversion from one
number system to another, Binary arithmetic, Representing negative numbers, BCD
codes, ASCII codes, EBCDIC codes, Excess three code, Gray code, Floating point
representation, 1's complement and 2's compliment, arithmetic representation of signed
binary numbers, 9's complement and 10's compliment system.
2. Digital Devices: Logic Gates, Flip-Flops, Latches, Registers, Shift registers, Buffers/
Drivers, Encoders, Decoders, code converters, Counters, Multiplexer, De multiplexers.
3. Logic Design: Boolean algebra, Minimum Boolean expression, Karnaugh map method
of simplification of logic expression, Arithmetic circuits: Half-adder, Full- Adder, n-bit
adder, Adder- subtractor, Multiplication of binary number.
4. Memory Unit: Elementary idea of semiconductor memories, ROM, PROM, EPROM,
EEPROM, RAM, SRAMS, DRAMS, Memory cells A to D and D to A converters.
5. Application of electronics in computers: Register transfer logic, Processor Logic design,
Control Logic design, Digital Integrated Circuits.
BOOKS RECOMMENDED:
1.
2.
3.
4.
5.
M. Morris Mano, Digital Design, 3.ed., Prentice Hall of India Pvt. Ltd., New Delhi,
2003/Pearson Education (Singapore) Pvt. Ltd., New Delhi, 2003.
Donald P.Leach and Albert Paul Malvino, Digital Principles and Applications, 5d.,
Tata McGraw Hill Publishing Company Limited, New Delhi, 2003.
R.P.jain, Modern Digital Electronics, 3ed., Tata McGraw-Hill publishing company
limited , New Delhi, 2003.
S. Salivahanan and S. Arivazhagan, Digital Circuits and Design, 2nd ed., Vikas
Publishing House Pvt. Ltd, New Delhi, 2004
Charles H.Roth. “Fundamentals of Logic Design”, Thomson Publication
Company,2003.
“It does not do to dwell on dreams and forget to live.” ― J.K. Rowling
MCA-201
Principles of Operating System
1. Introduction: Definition, Design Goals, Types, Batch processing, Multi-programming,
Time sharing; Functions of Operating System.
2. Process Management: Process states, Process Control block, Schedulers, CPU
Scheduling algorithm
3. Inter process synchronization and communication: need, Mutual exclusion,
semaphore, and hardware support for mutual exclusion, classical problem in concurrent
programming, critical region and conditional critical region, Deadlock Characteristics,
prevention, resource allocation graphs.
4. Memory Management (Contiguous and non contiguous) : Address Binding, Dynamic
Loading and Linking Concepts, Logical and Physical Addresses, Contiguous Allocation,
Fragmentation, Paging, Segmentation, Virtual Memory, Demand Paging, Page fault,
Page replacement algorithms, Global Vs Local Allocation, Thrashing,
5. File and Secondary Storage Management: File Attributes, File Types, File Access
Methods, Directory Structure, File System Organization and Mounting, Allocation
Methods, Free Space management; Disk Structure, Logical and Physical View, Disk
Head Scheduling, Formatting, Swap Management.
Protection & Security., UNIX/ LINUX and WINDOWS as an example of Operating
systems.
BOOKS RECOMMENDED:
1.
2.
3.
4.
5.
6.
Operating System Concepts 6/ed By Silberschatz and Galvin, Addison Wesley.
Operating Systems: Internals and Design Principles 5/ed By William Stalling, PHI.
Modern operating Systems By Tanenbaum, PHI.
Operating System Concepts By Peterson and Silberschatz, Addison Wesley.
Operating System Principles By P. B. Hansen, PHI.
The UNIX Operating System By K. Christian, John Wiley.
“You only live once, but if you do it right, once is enough.” ― Mae West
MCA-202
Object Oriented Programming with C++
1.
Principal of OOP
Procedure oriented Vs Object oriented, OOP paradigm, Features of OOP ,Basic Data
types Tokens, Keywords, Constant ,Variables, Operator I/O statements , Structure of
C++ program, Arrays, pointers, Object modeling technique (OMT).
2.
Function, Object and Class
Defining class, Abstract class ,Function prototype, Function with parameter ,Passing
object as a parameter, Constructor function ,Types of constructor, Destructor Friend
function , Friend class, Dynamic allocation operator new and delete.
3.
Polymorphism and Inheritance
Types of polymorphism, Constructor overloading ,Operator overloading, Template
function Template class, Types of inheritance ,Private ,protected and public derivation of
class ,Resolving ambiguity Pointer to object, This pointer ,Virtual class , virtual function.
4.
Input - output and File handling
I/O classes ,File and stream classes ,Opening and closing file Detecting end of file, String
I/O, Char I/O, Object I/O, I/O with multiple object ,File pointer, Disk I/O.
5.
Exception handling ,Name spaces and Standard Template library (STL)
Need of Exception handling, try, catch and throws keywords , defining namespace
,benefit of namespace, Component of STL.
BOOKS RECOMMENDED:
1. Object oriented programming with C++ by E.Balagurusamy II nd edition Tata Mc-Graw
Hill.
2. Object Oriented Programmin By McGregor and Sykes S A, 1992 Van Nostrand.
3. The C++ Programming Language
By Strustrp B,Addision Wasley.
4. Object Oriented Programming in C++ By Lafore R, Galgotia Publications.
5. Introduction to Object Oriented Programming By Witt KV, Galgotia Publications.
6. Object Oriented Programming By Blaschek G, Springer Verlag
“I'm not afraid of death; I just don't want to be there when it happens.” ― Woody Allen
MCA-203
Computer System Architecture
1. Micro operation and Computer Organization : Arithmetic micro operation, Logic micro
operation, Shift micro operation, Arithmetic logic shift unit Instruction codes, Bus and
memory transfer, Computer registers, Computer instructions, Instruction cycle, Memory
reference instruction, I/O and interrupt, Design of basic computer and Accumulator
logic.
2. Programming Basic Computer and C.P.U Organization: Machine language, Assembly
language, Assembler, Programming arithmetic and logic operation, I/O programming,
General register organization of C.P.U, Stack organization, Instruction format,
Addressing modes .
3. Pipeline and Vector Processing: Parallel processing, Pipelining, Arithmetic pipelining,
Instruction pipeline, RISC pipeline, Vector processing, Memory interleaving, Array
processor, Multiprocessor.
4. Input-output Organization: Peripheral devices, I/O interfaces, Modes of data transfer,
Asynchronous data transfer, DMA, Priority interrupt, I/O processor.
5. Memory Organization: Auxiliary memory, Microcomputer memory, Memory
hierarchy, Associative memory, Virtual memory, Cache memory, Memory management
hardware.
BOOKS RECOMMENDED:
1. M.Morris Manno, “Computer system Architecture”, 3rd Edition, PHI
2. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, 5th Edition “Computer
Organization”, McGraw-Hill,2002.
3. William Stallings, “Computer Organization and Architecture – Designing for
Performance”, 6th Edition, Pearson Education, 2003.
4. David A.Patterson and John L.Hennessy, “Computer Organization and Design: The
hardware / software interface”, 2nd Edition, Morgan Kaufmann, 2002.
5. John P.Hayes, “Computer Architecture and Organization”, 3rd Edition, McGraw Hill,
1998.
“Just when you think it can't get any worse, it can. And just when you think it can't get any better, it can.” ―
Nicholas Sparks
MCA-204
Web Technology
1. Internet Concept:
Fundamental of Web ,History of Web, Web development overview, Domain Name System
(DNS),DHCP and SMTP and other servers ,Internet service provider (ISP), Concept of IP
Address, Internet Protocol, TCP/IP Architecture ,Web Browser and Web Server.
2. HTML and DHTML
HTML Tag, Rules of HTML, Text Formatting and Style, List, Adding Graphics to Html
Document, Tables and Layout , Linking Documents, Frame, Forms, Project in HTML,
Introduction to DHTML, CSS, Class and DIV, External Style Sheet.
3. Scripting Languages
Java Script (JS) in Web Page, Advantage of Java Script, JS object model and hierarchy
,Handling event ,Operators and syntax of JS, JS Function, Client side JS Vs Server side JS ,JS
security, Introduction to VB Script, Operator and Syntax of VB Script, Dialog Boxes, Control
and Loop, Function in VBS.
4. XML
Introduction to XML, XML in Action, Commercial Benefits of XML, Gaining Competitive
advantage with XML, Programming in XML, XML Schema ,XSLT ,DOM structure model
,XML quires and transformation.
5. Active Server Page (ASP)
Introduction ,Internet Information System (IIS),ASP object ,Server object, File system object,
session ,Accessing data base with an ASP page ,ODBC – ADO connection object, common
methods and properties, ADO record set object .Introduction to ASP.Net.
BOOKS RECOMMENDED:
1. The complete Reference By Thomos A. Powell ,TMH publication
2. Web Technology :A Developers Perspective ,N.P.Gopalan ,J.Akilandeswani,PHI
Publication.
3.Java Script :The definite Guide By Flangam , O’Reilly
4. Java Script :Developers Resource by Kamran Husain and Jason Levitt PTR-PHI
publication.
5.”Mastering VB Script” BPB Publication.
6.World Wide Web design with HTML by Xavier Tata McGraw Hill Publication .
7. XML By Example, Sean Mc Grath Pentice Hall Publication.
8. Web Technology : A Developments Perspective , N.P. Gopalan, J. Akilandeswari, PHI
Publication.
“If you don't know where you are going, any road will get you there.” ― Lewis Carroll
MCA-205
Discrete Mathematics
1. Mathematical Logic : Notations, Algebra of Propositions & Propositional functions,
logical connectives, Truth values & Truth table Tautologies & Contradictions, Normal
Forms, Predicate Calculus, Quantifiers.
Set Theory: Sets, Subsets, Power sets, Complement, Union and Intersection, De-Morgan's
law Cardinality, relations: Cartesian Products, relational Matrices, properties of relations
equivalence relation functions: Injection, Surjection, Bijection, Composition, of Functions,
Permutations, Cardinality, the characteristic functions recursive definitions, finite
induction.
2. Boolean Algebra : Truth values and truth tables, the algebra of propositional functions, boolean
algebra of truth values Axiomatic definitions of Boolean algebra as algebraic structures with
two operations, Switching Circuits.
3. Groups : Groups, axioms, permutation groups, subgroups, co-sets, normal subgroups.
4.
Graphs : Simple Graph, directed graph, Degree of a Vertex, Types of Graphs, Sub Graphs
and Isomorphic Graphs, Operations of Graphs, Path, Cycles and Connectivity, Euler and
Hamilton Graph, Shortest Path Problems, BFS ,DFS, Dijkastra’s
Algorithm,
Representation of Graphs, Planar Graphs, Applications of Graph Theory.
5. Matrices : Addition, subtraction, multiplication, transposes.
BOOKS RECOMMENDED:
1. A text book of Discrete Mathematics By Swapan Kumar Sarkar (S. Chand & company
Ltd.).
2. Discrete Mathematical structure with Applications to computer science By J.P Trembly
& R.P. Manohar.
3. Discrete Mathematics By K.A Ross and C.R.B writht.
4. Discrete Mathematics Structures By Bernard Kohman & Robert C. Bushy.
for computer science
5. Discrete Mathematics By Seymour Lipschutz Mare Lipson. Tata McGraw-Hill
Edition.
“How wonderful it is that nobody need wait a single moment before starting to improve the world.” ― Anne
Frank
MCA-301
Introduction to JAVA
1. Overview of JAVA : The genesis of java, An overview of java, java virtual machine
(JVM) ,Java development kit (JDK) ,Java Vs C++, Data types, Literals, Variables, and
Arrays, Operators, Control statements, Introducing Class, closer look at Methods and
class ,Nested and inner class ,Exploring Java.lang, String handling ,Constructor ,Garbage
collection and finalize() method. Writing simple JAVA program.
2. Inheritance, Packages and interface- Types of inheritance ,Access specifier ,using super,
method overriding ,Abstract class ,constructor in multilevel inheritance ,using final with
inheritance ,Dynamic method dispatch ,Defining package, CLASSPATH, Access
protection ,Importing package ,Defining and implementing interface ,Extending
interface, Nested interface.
3. Exception handling and Multithreading: Using try and catch ,multiple catch classes,
Nested try statements , throw ,throws and finally ,Built in exception ,Uncaught
exception , Creating own exception class , Java Thread Model: Main thread ,Creating
own Thread ,Life cycle of thread, Thread priorities ,Synchronization and messaging,
Interthread communication ,Suspending ,Resuming and stopping thread.
4. Input Output and Networking :I/O classes: Byte stream and character stream
,Predefined stream ,reading console input, writing consol output, PrintWriter class
,Reading and writing files. Networking : classes and interface ,Socket and overview,
TCP/IP client socket and server socket ,Inet address ,URL Connection, Datagram.
5. Applet ,AWT,Swing, Event handling and Advance JAVA– Applet life cycle, Creating
an applet, Using image and sound in applet ,passing parameter. Exploring AWT and
introduction to Swing.Event handling –The delegation-event model , Event classes
,Source of event, Event listener interfaces ,handling mouse and keyboard event ,Adapter
class.
Advance JAVA : JDBC API. Servlet – Overview of servlet, Life cycle of servlet, JAVA
servlet architecture , Generic servlet and http servlet ,The servlet interface, Request and
response.
BOOKS RECOMMENDED:
1. Java: The complete reference By Naughton P and schildt H. ,Osborne Mcgraw-Hill,
Berkeley, USA, 1997.
2. Simply JAVA :An Introduction to JAVA programming By James R. Levenick ,Firewall
Media publication New,Delhi
3. Java Programming By E.Balguruswami
4. Core JAVA for beginners By Rashmi Kanta Das ,Vikas Publication.
5. Core JAVA : A Comprehensive Study by Mahesh P. Matha , PHI publication.
“But better to be hurt by the truth than comforted with a lie.” ― KhaledHosseini
MCA -302
Artificial Intelligence and Expert Systems
1. Introduction: Definitions and approaches, Foundation of A.I. History, Area and
Applications of A.I. Preliminary Concept of Intelligent Agents.
2. Problem Solving: Problem solving as state space search, production system, Search
techniques: Breadth First and Depth-first, Best-First Search, Hill-climbing, Heuristics, A
and A* algorithm.
3. Knowledge Representation and Reasoning: Syntactic and Semantic representations,
Predicate and prepositional logic, Resolution, Unification, Semantic Net.
4. Pattern Recognition : Meaning of pattern, Pattern Recognition, Classification,
Supervised & Unsupervised Learning of classification , K-NN, K-MEANS.
5. Expert Systems: Introduction, Architecture, Application.
BOOKS RECOMMENDED:
1. Artificial Intelligence By E. Rich and K. Knight, Tata McGraw Hill.
2. Artificial Intelligence: A New Synthesis By Nilsson, Morgan Kaufmann.
3. Pattern Classification 2nd Edition By R.O. Duda, Hart, Stork (2001) ,John wiley, New
York.
4. Pattern Recognition : Technique and Applications By Shinghal (2006) ,Oxford University
Press,New Delhi.
MCA - 303
RDBMS
1.
Overview of Database Management :Data, Information and knowledge, Increasing use of
data as a corporate resource, data processing verses data management, file oriented
approach verses database oriented approach to data management; data independence,
database administration roles, DBMS architecture, different kinds of DBMS users,
importance of data dictionary, contents of data dictionary, types of database languages.
Data models: network, hierarchical, relational. Introduction to distributed databases.
2. Relational Model : Entity - Relationship model as a tool for conceptual design-entities
attributes and relationships. ER diagrams; Concept of keys: candidate key, primary key,
alternate key, foreign key; Strong and weak entities, Case studies of ER modeling
Generalization; specialization and aggregation. Converting an ER model into relational
Schema. Extended ER features.
“Do not read, as children do, to amuse yourself, or like the ambitious, for the purpose of instruction. No, read
in order to live.” ― Gustave Flaubert
3.
Structured Query Language :Relational Algebra: select, project, cross product different
types of joins (inner join, outer joins, self join); set operations, Tuple relational calculus,
Domain relational calculus, Simple and complex queries using relational algebra, stand
alone and embedded query languages, Introduction to SQL constructs (SELECT…FROM,
WHERE… GROUP BY… HAVING… ORDERBY….), INSERT, DELETE, UPDATE, VIEW
definition and use, Temporary tables, Nested queries, and correlated nested queries,
Integrity constraints: Not null, unique, check, primary key, foreign key, references,
Triggers. Embedded SQL and Application Programming Interfaces.
4.
Relational Database Design :Normalization concept in logical model; Pitfalls in database
design, update anomalies: Functional dependencies, Join dependencies, Normal forms
(1NF, 2NF, 3NF). Boyce Codd Normal form, Decomposition, Multi-Valued Dependencies,
4NF, 5NF. Issues in physical design; Concepts of indexes, File organization for relational
tables, De-normalization.
5. Introduction to Query Processing and Protecting the Database & Data Organizations :
Parsing, translation, optimization, evaluation and overview of Query Processing.
Protecting the Data Base - Integrity, Security and Recovery. Domain Constraints,
Referential Integrity, Assertion, Triggers, Security & Authorization in SQL.
BOOKS RECOMMENDED:
1.
2.
3.
4.
5.
6.
7.
Database system concept By H. Korth and A. Silberschatz, TMH.
Data Base Management System By Alexies & Mathews , Vikas publication.
Data Base Management System By C. J. Date ,Narosha Pub.
Data Base Management System By James Matin .
Principles of Database System By Ullman.
An Introduction to database systems By Bipin Desai, 2011 ed.,Galgotia Publication.
Database Management System By A. K. Majumdar & P.Bhattacharya, TMH
MCA-304
Theory of Computation
1
Theory of Automata: Definition of an automaton, Transition system, Acceptability of a
string by FA, Nondeterministic finite state machine, Designing of DFA and NFA
,Equivalence of DFA and NFA, Conversion of NFA to DFA, Mealy and Moore models,
Minimization of finite automata.
2
Formal Languages, Regular Sets and Regular Grammars: Definition, Languages and
their relation, Chomsky classification of language, Regular expression, and Finite
“A life spent making mistakes is not only more honorable, but more useful than a life spent doing nothing.”
― George Bernard Shaw
automaton, Pumping Lemma for regular sets, Application of Pumping lemma, Closure
property of regular sets, Regular sets and regular grammar.
3
Context-free Language: Context fee language and derivation trees, Ambiguity in
context free languages, Simplification of context free languages: (left recursion, Unit
production elimination, Eliminating null values) Normal forms of context free
languages.
4
Pushdown Automation: Definition, Acceptance by PDA, Designing PDA, Push down
automation and Context free languages, Parsing and Pushdown automata.
5
Turing Machine: Turing Machines model, Representation of TM, Languages
acceptability by TM, Design of TM, Introduction: Universal Turing Machines and
Halting problem, Introduction: Linear bounded automata and languages.
BOOKS RECOMMENDED :
1. K L P Mishra “Theory of Computation”,3rd Edition PHI Publication.
2. J.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata Theory, Languages
and Computations”, Second Edition, Pearson Education, 2003
3. G.PSaradhiVarma and B. ThirupathiRao , “ Theory and Computation Formal Languages
and Automata Theory”,2005, SCITECH publication.
4. H.R.Lewis and C.H.Papadimitriou, “Elements of The theory of Computation”, Second
Edition, Pearson Education/PHI, 2003
5. J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition,
TMH, 2003.
“Things change. And friends leave. Life doesn't stop for anybody.” ― Stephen Chbosky
MCA 305
Computer Networks
1. Introduction and Physical Layer :Introduction: Goal and application Network
Hardware and Software , Protocol Hierarchies, Design Issue of the layers,Interfaces and
services, Connection oriented and connection less services, Service Primitives,Reference
Models – The OSI Reference model, The TCP/IP Model ,Types of computer Network
:LAN,MAN,WAN, Topologies, Transmission mode .
Physical Layer :Data and signal, Analog and digital Communication, Transmission
Media ,Concept of data transmission, Switching Techniques ,Communication Satellites –
Geosynchronous Satellite – VSAT, Low Orbit Satellites, ISDN and ATM.
2. Data Link Layer : Data Link Layer design issues Data link control:Framing, Flow
control. Error Detection and Correction. DLC protocol :Stop and Wait Protocol, Sliding
window protocol, A Simplex protocol for noisy channel, Medium access sublayer:
Channel allocation :static and dynamic ,Multiple access protocol FDDI, Data Link Layer
in the Internet : SLIP,PPP. Wired and Wireless LAN protocol.
3. Network Layer : The Network Layer Design Issue, IP addressing, Address mapping,
Error reporting ,Multicasting ,Delivery, Forwarding and Routing. The Network Layer in
the Internet : The IP Protocol. subnets, Internet control protocols ,internet multicasting.
4. Transport Layer :The Transport layer services, The concept of client and server in terms
of socket addressing Quality of service, Transport service primitives and buffering,
Multiplexing, Crash Recovery. The Internet Transport Protocols (TCP/IP) – The TCP
Service Model, The TCP protocol, The TCP segment header, TCP connection
management, TCP transmission policy, TCP congestion control, TCP timer management,
UDP.
5. Presentation and Application Layer : Network Security, Traditional Cryptography,
Private key cryptography and public key cryptography, Authentication protocols, DNS
,SNMP,E-mail, application layer protocols.
BOOKS RECOMMENDED :
1. Data Communications and Networking By Forouzan, Tata McGraw Hill Company.
2. Computer Networks By A.S. Tanenbaum
3. Computer Network By S.S.Shinde ,New Age International Publisher.
4. Data and computer Communication by Shashi banzal ,Firewall media .
5.Internetworking with TCP/IP :Principles,protocols,and Architecture Vol 1 5th Edition
,PHI publication
6. Data Communications and Computer Network by Prakash C Gupta, PHI Publication.
“Life is pain, highness. Anyone who says differently is selling something.” ― William Goldman, William
Goldman: Four Screenplays
MCA-401
Compiler Design
1. Basics of Compilers and Lexical Analysis: Compilers and Translators, Bootstrap
compiler, Phases of Compiler, Compiler writing tools, Bootstrapping, Overview of one
pass compiler, Finite Automation, Basics of DFA, NFA, Regular sets and Regular
expressions.
2. Syntax analysis & Parsing techniques: Basics of context free grammars and derivation
of parse trees, Top down parsing and its implementation, Operator precedence parsing,
Predicative top down parser, Bottom up parsing, Handel of right sentential form, LR
parser, Canonical collection of sets, Construction of parsing action and GOTO table,
Construction of LALR parsing table, Handling ambiguous grammar.
3. Syntax directed definition and Translation: L-attributed definition, Syntax directed
translation scheme, Intermediate code generation, Representing three address
statements, Syntax directed translation scheme to specify the translation of various
programming language construct, Implementing increment and decrement operators,
Array reference, Switch/case.
4. Symbol table management & Error Handling: Various approaches to symbol table
organization, Representation of scope information in symbol table, Storage allocation
activation of procedure and record, Static allocation and stack allocation. Error recovery,
Error recovery in LR parsing, Predicative parsing error recovery.
5. Code Optimization and Code Generation : Introduction, Loop optimization,
Eliminating induction variable, Eliminating local common sub expression, DAG,
Eliminating global common sub expression, loop unrolling, loop jamming, Problems
hindering code generation, Straight forward code generation, Using DAG for code
generation, Peephole optimization.
BOOKS RECOMMENDED:
1.Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman. “Compilers Principles, Techniques and
Tools”. Pearson Education,2008.
2.O.G.Kakde, “Compiler Design”, 2005, Laxmi Publication.
3. AdeshK.Pandey“ Concepts of Compiler Design ”, First Edition, S.K.Kataria& Sons
Publication.
4.Steven S. Muchnick, “Advanced Compiler Design Implementation”, Morgan
Koffman,1997.
5.AllenHolub, “Compiler Design in C”, Prentice Hall of India, 1990.
“The most important thing is to enjoy your life—to be happy—it's all that matters.” ― Audrey Hepburn
MCA - 402
Software Engineering
1.
Software Engineering Fundamentals : Definition of software product, software
development paradigms; software engineering, knowledge engineering and end user
development approaches.
Software Analysis :Abstraction, partitioning and projection, system specification,
software requirements specification (SRS) standards, formal specification method,
specification tools, flow based, data based and object orientated analysis.
2.
Systems Design : Idealized and constrained design, process oriented design (Gane and
Sarson and Yourdon notations); data oriented design, Object oriented design (Booch
approach), Cohesion and coupling; Design metrics, design documentation standards.
Role of Case Tools : Relevance of case tools, High-end and low–end case tools;
Automated support for data dictionaries, data flow diagrams, entity relationship
diagrams.
3.
Coding And Programming : Choice of programming languages, mixed language
programming and call semantics, Re-engineering legacy systems, coding standard.
4.
Software Quality And Testing : Software quality assurance, types of software testing
(white box, black box, unit, integration, validation, system etc), debugging and
reliability analysis, program complexity analysis, software quality and metrics;
software maturity model and extensions. Software cost and Time estimation,
Functions points, issues in software cost estimation, introduction to the Rayleigh
curve, algorithmic cost model (COCOMO), Other approaches to software cost and size
estimation .
5.
Software Project Management : Planning software projects, work background
structures, integrating software, software design and project planning, software
project teams, project monitoring and controls.
BOOKS RECOMMENDED:
1.Software Engineering: A Practitioner’s Approach , pressman Roger, Tata McGraw Hill.
2 . An Integrated approach to Software Engineering , Jalote Pankaj, Narosa: New delhi.
1991.
3. I Sommerville, " Software Engineering V edition: ", Addison Wesley, 1996.
4. P fleeger, " Software Engineering ", Prentice Hall, 1999.
5. Carlo Ghezzi, Mehdi Jazayari, Dino Mandrioli " Fundamental of Software Engineering ",
Prentice Hall of India 1991.
6.Software Engineering Demystified By Deepti Bhanot,Galgotia Publications.
“Do not go where the path may lead, go instead where there is no path and leave a trail.” ― Ralph Waldo
Emerson
MCA-403
Financial Accounting
1. Meaning and objects of accounting, Accounting Cycle, Accounting concepts and
conventions, accounting equations, rules of journalizing, ledger posting.
2. Cash book, preparation of trial balance, trading and profit and loss account and balance
sheet with adjustments relating to closing stock, outstanding expenses, prepaid
expenses, Accrued income depreciation, Bad debts, provision for bad debts, provision
for discount on debtors and creditors.
3. Basic concepts of cost accounting, elements of cost, classification of cost, preparation of
cost sheet, inventory pricing, numerical through FIFO and LIFO methods.
4. Cost volume, profit analysis, standard costing computation of material and labor
variances.
5. Budgetary control, preparation of cash budget and flexible budget, Zero base budgeting.
BOOKS RECOMMENDED:
1.
2.
3.
4.
5.
6.
7.
Chadwick, " The Essence of Management Accounting", PHI, India.
Subhash Sharma, “Management Control Systems (Text & Cases)”, Tata McGraw Hill.
P. Sarvancel, " Management Control Systems"
Grewal, " Introduction to Book Keeping".
S.M. Shukla, Financial accounting, Sahitya Bhawan Publications,Agra.
M.L.agrawal ,Cost Accounting, Sahitya Bhawan Publications,Agra.
S.P.Gupta ,Management Accounting , Sahitya Bhawan Publications,Agra.
“Tell the truth, or someone will tell it for you.” ― Stephanie Klein, Straight Up and Dirty: A Memoir
MCA-404
Operation Research
1. Introduction to OR, The Nature and Meaning of OR, History, Management Applications
of OR , Principles, Characteristics, Scope of OR.
2. Linear Programming-Introduction and Applications of LP, Limitations of LP
Formulation of a LP Model, Graphical Solution of a LPP, Simplex Method, Two Phase
Method, Big-M Method, duality in LPP.
3. Transportation Problem – Introduction, Mathematical Formulation, Feasible Solution
and Optimum Solution(simple case only).
4. Assignment Problem – Introduction, Mathematical Formulation, Traveling Salesman
Problem, elementary Problems, Replacement Problems-Types, Simple Replacement
Problems.
5. Project Management by PERT-CPM – Introduction, History & Applications, Basic
Steps, Network Diagram Representation, Rules, Time Estimates and Critical Path in
Network Analysis, Uses and Applications of PERT/CPM.
BOOKS RECOMMENDED:
1. Operations Research By H.A.Taha
2. Operations Research By V.K.Kapoor
3. Operation Research By S.D. Sharma
“Life can only be understood backwards; but it must be lived forwards.” ― Søren Kierkegaard
MCA-405
Management Information System
1. Management Information System : Definition, MIS as an evolving concept, MIS and
other Academic Disciplines, Subsystems of an MIS.
Structure of MIS : Elements of an Information System, MIS support for Decision
making, MIS Structure and its different views.
2. Hardware, Software, and communications Technology for Information Systems.
System & Design :Systems Development Initiative, Different Methodologies - Life Cycle
& Prototype approach, Detailed study on Life Cycle Design & Implementation. Case
Study.
3. Managerial Decision Making : Decision Making Process, Group Decision Support
Systems, Architecture of GDSS, Categories of GDSS.
4. Decision Support System : Definition and Components of DSS (Data Base Management
System, Model Base Management System, Support Tools), Applications of DSS,
Functions of DSS.
5. Planning and Control : Definition of planning ,types , structure , Control definitions and
its role in MIS.
A study of Computerization in different functional areas of a typical
manufacturing/business organization i.e Marketing, production, material, financial,
personal.
BOOKS RECOMMENDED:
1. Management Information Systems ,Gordon B. Davis & Margerethe H. Olson Mc-GrawHill
2. Management Information Systems ,Kenneth, Prentice Hall Publication
3. Management Information Systems , T. Lucey , Thomson Learning
“That it will never come again is what makes life so sweet.” ― Emily Dickinson
MCA-501
Soft Computing Techniques
1. Introduction -What is soft computing?,different soft computing techniques and its
comparison. Strength and weakness of various soft computing techniques.
2. Artificial Neural Network :Biological neural network Vs Artificial neural network,
Evolution of Neural Network , Neural Model and Network Architectures, ANN
terminologies, Perceptron learning, Supervised learning network :Error back
propogation network,Radial basis function network. Unsupervised learning network
:Kohonen self organizing feature maps (SOM),Counter propagation network.
Associative memory network: Bidirectional associative memory, Hopefield network.
Special Neural Network: Probabilistic neural Network,Simulated Annelling, Boltzman
machine ,Cauchy Machine.
3. Fuzzy Logic-Crisp set Vs Fuzzy set, Operations on Fuzzy sets,Fuzzy
relation,Membership function, Fuzzy arithmetic and Fuzzy measures, Fuzzy rule base
and approximate reasoning :Fuzzy Inference System(FIS).
4. Genetic Algorithm – Introduction , Biological Background Genetic Operators and
Parameters, Genetic Algorithms in Problem Solving, Theoretical Foundations of Genetic
Algorithms, Classification of Genetic algorithm.
5
Application of soft computing: Application of Neural Network ,Fuzzy logic and
Genetic Algorithm in science and engineering, Study of popular Hybrid soft computing
techniques.
BOOKS RECOMMENDED:
1. Principles of soft computing , S.N.Shivanandan and S.N. deepa Wiley India
publication ,First Indian edition ,2008.
2. A Comprehensive Foundation to Neural Networks , Simon Haykins , Prentice Hall
3. Fuzzy Sets and Fuzzy Logic: Theory and Applications , G. J. Klir, and B. Yuan, PHI
learning ,2011.
4. Dr.G.Canon,Fuzzy Logic and Fuzzy Decision Making: Concepts and Applications,
Galgotia Publication.
5. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning,
Addison-Wesley, 1989.
6. Jang,Sun and Mizutani :Neuro-Fuzzy and soft computing :A computational
Approach to learning and machine intelligence ,PHI learning ,2011.
7. N.K. Sinha & M. M. Gupta(Eds), Soft Computing and Intelligent Systems: Theory &
Applications, Academic Press, 2000.
“You realize that our mistrust of the future makes it hard to give up the past.” ― Chuck Palahniuk, Survivor
MCA- 502
Interactive Computer Graphics
1. Basics and Interactive Graphics : Origin of graphics, Working of interactive graphics,
Random scan methods, Raster scan methods, Pixels and frame buffer, Color display
techniques, Graphics Primitives, Display file structure, CRT, Graphical input devices,
Graphical input techniques, Event handling, Input functions.
2. Output primitives and Segmented display file: Points & lines, Line drawing DDA
algorithm, Bresenhams line drawing algorithm, Circle generation algorithm, Character
generation, Text display, Filling polygon.
Segments, Functions for segmenting the display file, Posting and un-posting a segment,
Segment naming schemes, Appending to segment.
3. Display description: Line and polygon clipping, Viewing algorithms- Windows and
viewpoints, windowing, Zooming and planning, Homogeneous co-ordinate, Two
dimensional and three dimensional transformation, Concatenation.
4. Three dimensional graphics: Geometric models, Introduction to realism, Perspective
depth, Introduction to shading and illumination: Phong shading, Gouraud shading,
Projection, Types of projection.
5. Hidden Surface elimination, Curves and surfaces: Back face removal and algorithm,
Depth buffer algorithm, Area Subdivision algorithm, Scan line algorithm, Parametric
functions, Cubic spline Bezier methods, B- Spline Methods, Displaying curves and
surfaces.
BOOKS RECOMMENDED:
1. William M. Newman and Robert F. Sproull, ‘’ Principles of Interactive Computer
Graphics ‘’, Tata McGraw- Hill Edition.
2. Steven Harrington ‘’ Computer Graphics ‘’ , 2nd Edition, Tata McGraw-Hill Edition.
3. Foley, van Dam, Feiner and Hughes, ‘’Computer Graphics (Principles and Practice)’’
,Indian Edition, Addison Wesley Publication.
4. D Hearn and P M Baker ,’’Computer Graphics ‘’, Printice Hall of India (Indian
Edition).
5. D F Rogers ,’’Mathematical Elements for Computer Graphics ‘’, 2nd Edition,Tata
McGraw-Hill
“People aren't born good or bad. Maybe they're born with tendencies either way, but its the way you live
your life that matters.” ― Cassandra Clare, City of Glass
MCA-503
Data Mining & Data Warehousing
1. Data Mining: Meaning, necessity, steps, Normal searching Vs. knowledge extraction
2. Data Mining on different types of databases :Relational ,Data Warehouses
,Transactional ,Object oriented, Object relational, Spatial , Temporal and time series, Text
and multimedia (i) Heterogeneous and legacy.
3. Data Warehouse: Meaning, definition, OLTP Vs. OLAP, Data cube, star, snow flake,
constellations, basic concepts in writing of DML
4. Data Preprocessing :Noisy data,
Inconsistent data, Data integration, Data
transformation, Dimensionality reduction, Data compression.
5. Classification and Prediction :Meaning , Neutral networks based classification , Knearest neighbor classifiers, Clustering, k-means clustering.
BOOKS RECOMMENDED:
1. Data Mining: Concepts and Techniques, Jiawei Han, Micheline Kamber, Morgan
Kaufmann,Harcourt India 2001.
2. Data Mining Methods for Knowledge Discovery , Cios, Pedrycz, Swiniarski,Kluwer
Academic Publishers, London – 1998.
“Education make a people easy to lead, but difficult to drive: easy to govern, but impossible to enslave.”
―Peter Brougham
MCA-504
Network Security
1.
Foundations of Cryptography and security
Security trends, The OSI Security architecture Security attack, services and mechanism
Ciphers and secret messages, Mathematical tools for cryptography: substitution
techniques, modular arithmetic, Euclid's algorithm, finite fields, polynomial arithmetic.
2.
Symmetric Cipher
Symmetric cipher model, Design Principles of Block Ciphers, Theory of Block Cipher
Design, Feistel cipher network structure, Data Encryption Standard (DES), Strength of
DES Triple DES ,Modes of operation.
Advance encryption Standard (AES)- Evaluation criteria of AES,AES cipher ,key
distribution.
3.
Public Key cryptography and Hash function
Prime numbers and testing for primarily, factoring large numbers, Principles of public
key cryptosystem, RSA algorithm. Key management: Diffie-Helman Key exchange,
elliptic curve arithmetic, elliptic curve cryptography, Hash and Message authentication
Code (MAC), Hash and MAC algorithms, Digital signature and Authentication protocol.
4.
IP and Web security protocols:
Authentication application: Kerberos, Public key infrastructure .E-mail: Pretty Good
Privacy (PGP), S/MIME. IP security, Web Security: Secure Socket layer (SSL) and
Transport layer security, Secure Electronic Transaction (SET).
5.
System Security: Firewall, and Intrusion Detection system (IDS), Malicious Software.
BOOKS RECOMMENDED:
1. Cryptography and Network Security By William Stallings, 4th Edition Pearson
Publication
2. Applied cryptography - protocols and algorithm By Buce Schneier, Springer Verlag
2003
3. Cryptography and Network Security By Atul Kahate , TMH Publication.
4. Cryptography and Network Security By Behrouz A. Forouzan, First Edition, TMH
Publication.
5.Network Security:Private Communication in Public World By Charlie Kaufman,Radia
Perlman and Mike Speciner ,PHI Publication.
“Education is not the filling of a pail,but the lighting of a fire.” ―Wiliam Butler Yeats
MCA-505
Analysis & Design of Algorithms
1
Basic: Algorithm analysis, Analyzing algorithms, Worst- case and Average case
Analysis, Asymptotic Notations, Recurrence: substitution method, master method.
2
Design Methods : General Consideration, Algorithm design paradigms and
representative problems.
3
Deterministic Algorithms
Divide and Conquer: Binary search, Merge sort, Quick sort.
Greedy Method: Minimal spanning tree, Shortest Paths, Knapsack.
Dynamic Programming: Chained matrix multiplication, shortest paths, optimal search
trees.
Backtracking 8-queens problem, Graph colouring, Hamiltonian cycles.
Branch and Bound: 0/1 Knapsack problem, Traveling salesperson.
4
Non Deterministic Algorithms
Intractable Problems : Basic concepts, Nondeterministic algorithms, NP Completeness,
Cook's theorem, Examples of NP-Hard and NP-Complete problems, Problem reduction.
Approximation Graph colouring, Task scheduling, Bin packing.
Probabilistic Algorithms Numerical integration, Primality testing.
Graph Algorithms: BFS, DFS and its applications.
5
Evaluation of Algorithm
Lower Bound Techniques: Comparison tree, Reduction, Adversary argument.
BOOKS RECOMMENDED:
1. The Design and Analysis of Computer Algorithms , A.Aho, J. Hopcroft and J.Ullman,
Addison Wesley.
2. Fundamentals of Computer Algorithms , E. Horowitz and S. Sahani, Galgotia, New
Delhi.
3. Introduction to the Design and Analysis of Algorithms , S.E.Goodman and
S.T.Hedetniemi, McGraw Hill.
4. Design Methods and Analysis of Algorithmics , G.Brassard and P.Bratley, PHI.
5. Design Methods and Analysis of Algorithms, S.K.Basu, PHI, 2005.
6. Introduction To Algorithms , Thomas H Cormen, Charles E Leiserson, Ronald L
Rivest, Clifford Stein ,MIT Press.
“What we learn with pleasure we never forget.” ―Alfred Mercier
MCA-601
MAJOR PROJECT
“Tell me and I'll forget. Show me, and I may not remember. Involve me, and I'll understand.”―Native
American Saying
GUIDELINES FOR PROJECT WORK (MCA / M.Sc.(CS))
A project report has to be submitted as per the rules described. Some additional guidelines
regarding the Project Report are:
Number of Copies:
The student should submit One hardbound copy of the Project Report with one
RW/CD/DVD.
Acceptance / Rejection of Project Report:
The student must submit a project report to the Head of Department/Project Guide for
approval. The Head of Department/Project Guide holds the right to accept the project or
suggest modifications for resubmission.
Format of the Project Report :
The student must adhere strictly to the following format for the submission of the Project
Report
a. Paper
The Report shall be typed on white paper, A4 size or continuous computer stationary bond,
for the final submission. The Report to be submitted to the University must be original and
subsequent copies may be photocopied on any paper.
b. Typing
The typing shall be of standard letter size, double-spaced and on one side of the paper only,
using black ribbons and black carbons.
c. Margins
The typing must be done in the following margins
Left ----- 35mm, Right ----- 20mm, Top ----- 35mm, Bottom ----- 20mm
d. Binding
The Report shall be Rexene bound in black. Plastic and spiral bound Project Reports not be
accepted.
e. Front Cover:
The front cover should contain the following details:
TOP
: The title in block capitals of 6mm to 15mm letters.
CENTER
: Full name in block capitals of 6mm to 10mm letters.
“Whatever is good to know is difficult to learn.” ―Greek Proverb
BOTTOM : Name of the University, year of submission- all in block capitals of 6mm to
10mm letters on separate lines with proper spacing and centering.
f. Blank Sheets
At the beginning and end of the report , two white black bound papers should be
provided, one for the purpose of binding and other to be left blank.
Abstract
Every report should have an Abstract following the Institute’s Certificate. The abstract shall
guide the reader by highlighting the important material contained in the individual
chapters, section, subsection etc.
The report should contain the following:
Certificate from Company
Institute Certificate: Successful completion of project by competent authority.
Acknowledgments
Abstract
List of Figures
Tables
Nomenclature and Abbreviations
Contents of the Project Report
1. Company Profile (only for M.I.S. projects)
2. Introduction to the project
3. Scope of work.
4. Existing System and Need for System.
5. Operating Environment - Hardware and Software.
6. Proposed System.
6.1 Objectives to be fulfilled
6.2 User Requirements
6.3 Requirements Determination Techniques and Systems Analysis Methods
Employed.
6.4 Prototyping.
6.5 System Features
“You can never be overdressed or overeducated.” ― Oscar Wilde
-Design of Input
-Design of Output screens and reports
-Module specifications
-D.F.D.’s and ER’s
-System flow charts
-Data Dictionary
-Structure charts
-Database /File layouts
-User Interfaces
-Coding system
-Design of Control Procedures
-Design of Exception Handling
7. Testing procedures and Implementation Phases
8. Acceptance Procedure
9. Post-Implementation Review
10. User Manual
Menu explanation
-User guide
-Expected problems/errors and their solutions
11. Problems encountered
12. Drawbacks and Limitations
13. Proposed Enhancements
14. Conclusions
15. Bibliography
Annexure:
-Sample documents (manual or computer generated)
-Source code listing in a separate file
-Output reports
“You educate a man; you educate a man. You educate a woman; you educate a generation.” ― Brigham Young
List of Tables:
The Contents shall be followed by a ‘List of Tables’ indicating the table number, table title
and the corresponding page number(s).The table number shall be in decimal point notation
indicating the chapter number and the table number in that chapter.
NOTE : Any reference within the text shall be given by quoting relevant number.eg:
‘Table5.2’
List of Figures:
The ‘List of Figures, shall follow the ‘List of Tables’ indicating the figure numbers, figure
titles and corresponding page number. The figure numbers shall be in decimal point
notation.
Nomenclature and Abbreviations:
The ‘Nomenclature and Abbreviations’ shall follow the ‘List of Figures’ and contain the list
of symbols and abbreviations and their long names used. The nomenclature should be given
for ER’s, DFD’s, STRUCTURED CHARTS, and RUN CHARTS and for all other symbols in
the techniques used. The nomenclature for every technique should appear on a separate
sheet. As far as possible, accepted standard symbols shall be used.
Chapter Numbering:
The Chapters shall be numbered in Arabic numerals. Section and subsections of any
chapters shall be in decimal notation. All chapters shall begin on a new page. The titles for
the chapters and the title shall be properly centered at the top of the page and have three
spaces between them.
Company Profile:
This chapter should highlight the company details. This would be chapter 1 and should
include the main stream activity of the company, the product line of the company and the
details of the department where the student was working. This should not exceed two pages
or 800 words.
N.B. : Only relevant for M.I.S. Projects.
Introduction:
The ‘Introduction’ shall highlight the purpose of project work It will also define the chapters
to be followed in the Project Report.
Existing System and the Need for the System:
If there is some system already in use, then a brief detail of it must be included, to help the
examiner understand the enhancements carried out by6 the student in the existing system.
Based on this, the student should exemplify the need for the computerization should be
given.
“Intelligence plus character-that is the goal of true education.” ― Martin Luther King Jr.
N.B. : Only where relevant.
Proposed System :
1. Objectives
: clearly define the objective(s) of the system in a few lines.
2. User Requirements
: State the requirements of the use in an unambiguous
manner.
3. Requirements Determination Techniques and System Analysis Methods Employed:
Use the formal methods to describe the requirements of the use. Like Fact Finding Methods,
Decision Analysis, Data Flow Analysis etc.
4. Prototyping
: If the prototypes has been developed prior to the
detailed design , then give details of the prototype.
5. System Features :
5.1 Design of Input
:Inputs, Data Dictionary, Screens.
5.2 Design of Output
:Outputs, Reports etc.
5.3 Design of Control Procedures : Structured charts, Module Specifications, Run
charts etc.
5.4 Design of Exception Handling : Error handling and recovery procedures.
The choice of including topics in this chapter entirely depends on the student. The freedom
given for this chapter is obvious.
Students will be working on various types of projects. A typical M.I.S. development project
must include DFD’s and structured charts etc. Thus a student is allowed to employ the
techniques of his/her own choice suitable to his/her work. However, there is a guideline
that the student must employ the techniques taught during the MCA/MSC course.
“The educated differ from the uneducated as much as the living differs from the dead.” ― Aristotle
(The scheme and syllabi of any programme can be modified from time to time, students are advised to
refer to University website for updates if any/ consult their respective teachers )
DEPARTMENT OF COMPUTER SCIENCE & INFORMATION TECHNOLOGY
GURU GHASIDAS VISHWAVIDYALAYA, BILASPUR (C.G.)
COURSE – MASTER OF SCIENCE (COMPUTER SCIENCE)
M.Sc. (CS) -Ist Semester
S.No.
Subject Code
1.
M.Sc.(CS)101
2.
M.Sc.(CS)102
3.
M.Sc.(CS)103
4.
M.Sc.(CS)104
5.
6.
7.
M.Sc.(CS)105
M.Sc.(CS)106
M.Sc.(CS)107
Subject
Period / Week
Introduction to
Information Technology
Programming Based
Numerical Analysis
Advanced Programming In
C Language
Data Structure with
Algorithm
Digital Electronics
LAB-I:Programming in C
LAB-II: Data Structure
Using C
TOTAL
Scheme of Exam
Theory / Practical
Total
Marks
L
T
P
E.S.E.
IA
Test
4
1
--
60
10
30
100
4
1
--
60
10
30
100
4
1
--
60
10
30
100
4
1
--
60
10
30
100
4
---
1
---
-3
3
60
100
100
10
---
30
---
100
100
100
20
5
6
500
50
150
700
M.Sc. (CS)IInd Semester
S.No.
Subject Code
Period /
Week
Subject
Scheme of Exam
Theory / Practical
Total
Marks
L
T
P
E.S.E.
IA
Test
1.
M.Sc.(CS)201
Principles of Operating
System
4
1
--
60
10
30
100
2.
M.Sc.(CS)202
4
1
--
60
10
30
100
3.
M.Sc.(CS)203
4
1
--
60
10
30
100
4.
5.
6.
M.Sc.(CS)204
M.Sc.(CS)205
M.Sc.(CS)206
Object Oriented
Programming with C++
Computer System
Architecture
Web Technology
4
4
--
1
1
--
--3
60
60
100
10
10
--
30
30
--
100
100
100
7.
M.Sc.(CS)207
LAB-II: Unix/Linux
--
--
3
100
--
--
100
TOTAL
20 5
6
500
50
150
700
Discrete Mathematics
LAB-I: Object Oriented
Programming with C++
“I'm killing time while I wait for life to shower me with meaning and happiness.” ― Bill Watterson
M.Sc. (CS)IIIrd Semester
S.NO
Subject Code
Subject
Period / Week
L
4
T
1
P
--
Scheme of Exam
Theory / Practical
E.S.E.
IA
Test
60
10
30
Total
Marks
100
1.
M.Sc.(CS)301
Introduction to JAVA
2.
M.Sc.(CS)302
4
1
--
60
10
30
100
3.
M.Sc.(CS)303
Artificial Intelligence
and Expert Systems
RDBMS
4
1
--
60
10
30
100
4.
M.Sc.(CS)304
Theory of Computation
4
1
--
60
10
30
100
5.
M.Sc.(CS)305
Computer Network
4
1
--
60
10
30
100
6.
M.Sc.(CS)306
LAB-I: RDBMS
--
--
3
100
--
--
100
7.
M.Sc.(CS)307
LAB-II: JAVA
Programming
TOTAL
--
--
3
100
--
--
100
20
5
6
500
50
150
700
M.Sc. (CS)IVth Semester
S.No.
1.
Subject
Code
M.Sc.
(CS)401
Subject
Major Project ( Viva Voce)
Total
Total Marks
500
500
“Do I not destroy my enemies when I make them my friends?” ― Abraham Lincoln
M.Sc. (CS)101
Introduction to Information Technology
1. Introduction–Basics concept of IT, concept of data and information, History of computer,
Generations and classification of Computers, organization of computers, Input and
Output devices, storage devices, Data processing and file organization.
2.
Software and Computer language -Software and its need, Types of Software: System
software, application software, utility software, Firm ware. Operating system :Types ,Job
and objective. Language translator .Introduction and evolution of Programming
Languages, Types of Programming Languages, Generations of Programming Languages,
Programming Paradigms: procedural oriented and object oriented programming.
3.
Communication and network technology :Communication process, Communication
and system elements ,Analog and digital signal,
mode of communication ,
communication media: Wired and Wireless. Computer Network: Types ,criteria,
advantages and disadvantages, Topology, LAN and other network related protocols, OSI
reference model and TCP/IP model.
4.
Internet-Technical foundation of Internet, history of Internet, Internet Service Provider
(ASP), ARPANET , Services Available on Internet; Internet Applications : E-mail, WWW
and file transfer .Internet addressing , Client server computing, Domain name system
(DNS), Internet Security – Fire walls, Encryptions etc.
5.
Application of IT and Latest IT Trends : IT in business, Industry, home, education
entertainment, science and engineering and medicine. E-commerce, M-Commerce.
Latest IT Trends :Artificial Intelligence ,Data Mining, Overview of Geographic
Information System(GIS) ,Cloud computing ,Information communication Technology
(ICT)
BOOKS RECOMMENDED:
1.
2.
3.
4.
5.
Fundamental of Computer 5th Edition By V.Rajaraman,PHI Publication.
Introduction to Information Technology by V.Rajaraman ,PHI Publication.
Information technology today By S.Jaiswal
Fundamental of IT :Leon and Leon ,Leon Tec World
Introduction to Information Technology by Aksoy and DeNardis ,Cengage Learning.
“Luxury is not a necessity to me, but beautiful and good things are.” ― Anaïs Nin
M.Sc. (CS)102
Programming Based Numerical Analysis
1. Algebraic Equation :Computer Arithmetic – Floating point Numbers- Operations
Normalization and their consequences. Iterative Methods – Roots of a Single
transcendental equations and roots of Polynomials using Bisection Method , False
position Method , Newton Raphson Method.
2. Simultaneous Algebraic Equation :Gauss Elimination Method, Gauss-Jordan Method,
Factorization Method, Jacobi’s Iteration Method, Gauss- seidal Iteration Method.
Matrix Inversion & Eigen Value: Gauss Jordan Method, Factorization Method
and Eigen Vectors.
3. Interpolations: Polynomials interpolation, Newton Method. Lagrange’s Interpolation
Formula and difference tables. Least Square Approximations- Linear regression only.
4. Differentiation and Integration- Formula for Numerical Differentiation and Numerical
integration by Trapezoidal Rule and Simpson’s rule only.
5. Numerical Solution of Differential Equation :- Euler’s Method, Taylor series Method,
Runge-Kutta Method.
BOOKS RECOMMENDED:
1. Numerical Methods By V. Rajaraman, 3rd Edition, Prentice-Hall India Pvt. Ltd.
2. Numerical Methods By S.S. Shastri, 4th edition, 2005,PHI publications.
3. Numerical Methods in Engineering and Science, 36th Edition, Khanna Publishers,
Delhi.
4. Computer Based Numerical and Statistical techniques, P.K.Mittal and Mukesh
B.,Galgotia Publication.
“Life is a foreign language; all men mispronounce it.”― Christopher Morley (1890 - 1957)
M.Sc. (CS)103
Programming in C Language
1.
Fundamentals of C Programming :Overview of C : History of 'C', Structure of 'C'
program. Keywords, Tokens, Data types, Constants, Literals and Variables, Operators
and Expressions : Arithmetic operators, Relational operator, Logical operators,
Expressions, Operator : operator precedence and associativity ,Type casting, Console
I/O formatting, Unformatted I/O functions: getch(), getchar, getche(), getc(), putc(),
putchar().
Control Constructs : If-else, conditional operators, switch and break, nested conditional
branching statements, loops: For, do.. while, while, Nested loops, break and continue,
goto and label, exit function.
2.
Arrays, Strings and Functions :Array:-Array declaration, One and Two dimensional
numeric and character arrays. Multidimensional arrays.
String:- String declaration, initialization, string manipulation with/without using
library function.
Functions:-definition, function components: Function arguments, return value, function
call statement, function prototype. Type of function arrangement: return and argument,
no return and no argument, return and no argument, no return and argument. Scope
and lifetime of variable. Call by value and call by reference. Function using arrays,
function with command line argument. User defined function: maths and character
functions, Recursive function.
3.
Structure, Union & Enum- Structure :basics, declaring structure and structure variable,
typedef statement, array of structure, array within structure, Nested structure; passing
structure to function, function returning structure. Union: basics, declaring union and
union variable, Enum: declaring enum and enum variable.
4.
Dynamic Data Structures in 'C' - Pointers: Definition of pointers, pointer declaration,
using & and * operators. Void pointer, pointer to pointer, Pointer in math expression,
pointer arithmetic, pointer comparison, dynamic memory allocation functions – malloc,
calloc, realloc and free, pointers vs. Arrays, Arrays of pointer, pointer to array, pointers
to functions, function returning pointer, passing function as argument to function,
pointer to structure, dynamic array of structure through pointer to structure.
5.
File Handling and Miscellaneous Features :File handling: file pointer, file accessing
functions,:fopen, fclose, fputc, fgetc, fprintf, fscanf, fread, fwrite,beof, fflush, rewind,
fseek, ferror. File handling through command line argument. Introduction to C
preprocessor #include, #define, conditional compilation directives: #if, #else, #elif,
#endif, #ifndef etc.
BOOKS RECOMMENDED:
1. Programming in C “Yashwant Kanetkar”, BPB Publications,Tenth Edition.
2. Programming with C “Venugopal”, TMHOutline Series,Third Edition.
3. The C Programming Language “Kemigham and Ritche [ Prentice Hall]”
4. Programming in C Language, “Dr Amit Saxena“ Ananya Publication
5. Programming in C Language “Bala Gurusamy“ Fourth Edition
“Not a shred of evidence exists in favor of the idea that life is serious.”― Brendan Gill
M.Sc. (CS)104
Data Structure with Algorithm
1.
Basics terminologies: Introduction to basic data Structures: Arrays, linked list, trees,
stack, queue, Data structure operations; time complexity.
2.
Stacks, Queues: Stacks; Array representation of stack; Linked representation of stack;
Various polish notation’s-Prefix, Postfix, infix; Evaluation of a postfix & Prefix
expression; Conversion from one another; Application of stack; Queues; Linked
representation of queues; Dqueues; Circular queue; Priority queue; Singly Linked listOperation on it; Doubly linked list- Operation on it; Circular linked list.
3.
Searching and Sorting: Searching algorithm: linear search, binary search; sorting
algorithms: Bubble sort, Insertion sort, Selection sort, Quick Sort, Merge sort and Heap
sort.
4.
Trees :Binary trees; Representation of binary tree in memory; traversing binary tree;
Traversing using stack; Binary search trees; Searching and inserting in binary search
trees; Deleting in a binary search ,tree; AVL search trees; Insertion and deletion in binary
search trees; B trees: searching, insertion, deletion; Heap.
5.
Graphs : Terminology & representation; Warshall algorithm; Shortest path; Minimum
spanning tree; Kruskal & Dijkstara algorithm; Linked representation of graph; Operation
on graph; Traversing a graph.
BOOKS RECOMMENDED:
1. Data Structure By Lipshutz, McGraw Hill.
2. Data Structure By Standish, Addison-Wesley.
3. Data Structures using C By A. M. Tennenbaum, Y. Langsam and M. J. Augenstein,
PHI, 1991.
“Life is what happens to you while you're busy making other plans.” ― John Lennon (1940 - 980)
M.Sc.(CS)-105
Digital Electronics
1. Number System: Binary, Octal and Hexadecimal number system, Conversion from one
number system to another, Binary arithmetic, Representing negative numbers, BCD
codes, ASCII codes, EBCDIC codes, Excess three code, Gray code, Floating point
representation, 1's complement and 2's compliment arithmetic representation of signed
binary numbers, 9's complement and 10's compliment system.
2. Digital Devices: Logic Gates, Flip-Flops, Latches, Registers, Shift registers, Buffers/
Drivers, Encoders, Decoders, code converters, Counters, Multiplexer, De multiplexers.
3. Logic Design: Boolean algebra, Minimum Boolean expression, Karnaugh map method
of simplification of logic expression , Arithmetic circuits: Half-adder, Full- Adder, n-bit
adder, Adder- subtractor, Multiplication of binary number.
4. Memory Unit : Elementary idea of semiconductor memories, ROM, PROM, EPROM,
EEPROM, RAM, SRAMS, DRAMS, Memory cells A to D and D to A converters.
5. Application of electronics in computers: Register transfer logic, Processor Logic design,
Control Logic design, Digital Integrated Circuits.
BOOKS RECOMMENDED:
1.
2.
3.
4.
5.
M. Morris Mano, Digital Design, 3.ed., Prentice Hall of India Pvt. Ltd., New Delhi,
2003/Pearson Education (Singapore) Pvt. Ltd., New Delhi, 2003.
Donald P.Leach and Albert Paul Malvino, Digital Principles and Applications, 5d.,
Tata McGraw Hill Publishing Company Limited, New Delhi, 2003.
R.P.jain, Modern Digital Electronics, 3ed., Tata McGraw-Hill publishing company
limited , New Delhi, 2003.
S. Salivahanan and S. Arivazhagan, Digital Circuits and Design, 2nd ed., Vikas
Publishing House Pvt. Ltd, New Delhi, 2004
Charles H.Roth. “Fundamentals of Logic Design”, Thomson Publication Company,2003.
“The aim of life is to live, and to live means to be aware, joyously, drunkenly, serenely, divinely aware.” ―
Henry Miller
M.Sc.(CS)-201
Principles of Operating System
1.
Introduction: Definition, Design Goals, Types, Batch processing,Multi-programming,
Time sharing; Functions of Operating System.
2.
Process Management: Process states, Process Control block, Schedulers, CPU
Scheduling algorithm
3.
Inter process synchronization and communication: need, Mutual exclusion,
semaphore, and hardware support for mutual exclusion, classical problem in concurrent
programming, critical region and conditional critical region, Deadlock Characteristics,
prevention, resource allocation graphs.
4.
Memory Management (Contiguous and non contiguous) : Address Binding, Dynamic
Loading and Linking Concepts, Logical and Physical Addresses, Contiguous Allocation,
Fragmentation, Paging, Segmentation, Virtual Memory, Demand Paging, Page fault,
Page replacement algorithms, Global Vs Local Allocation, Thrashing,
5.
File and Secondary Storage Management: File Attributes, File Types, File Access
Methods, Directory Structure, File System Organization and Mounting, Allocation
Methods, Free Space management; Disk Structure, Logical and Physical View, Disk
Head Scheduling, Formatting, Swap Management.
Protection & Security., UNIX/ LINUX and WINDOWS as an example of Operating
systems.
BOOKS RECOMMENDED:
1.
2.
3.
4.
5.
6.
Operating System Concepts 6/ed By Silberschatz and Galvin, Addison Wesley.
Operating Systems: Internals and Design Principles 5/ed By William Stalling, PHI.
Modern operating Systems By Tanenbaum, PHI.
Operating System Concepts By Peterson and Silberschatz, Addison Wesley.
Operating System Principles By P. B. Hansen, PHI.
The UNIX Operating System By K. Christian, John Wiley.
“Live simply so others may simply live.” ― Mother Teresa
M.Sc.(CS)-202
Object Oriented Programming with C++
1.
Principal of OOP
Procedure oriented Vs Object oriented, OOP paradigm, Features of OOP ,Basic Data
types Tokens, Keywords, Constant ,Variables, Operator I/O statements , Structure of
C++ program, Arrays, pointers, Object modeling technique (OMT).
2.
Function, Object and Class
Defining class, Abstract class ,Function prototype, Function with parameter ,Passing
object as a parameter, Constructor function ,Types of constructor, Destructor Friend
function , Friend class, Dynamic allocation operator new and delete.
3.
Polymorphism and Inheritance
Types of polymorphism, Constructor overloading ,Operator overloading, Template
function Template class, Types of inheritance ,Private ,protected and public derivation of
class ,Resolving ambiguity Pointer to object, This pointer ,Virtual class , virtual function.
4.
Input - output and File handling
I/O classes ,File and stream classes ,Opening and closing file Detecting end of file, String
I/O, Char I/O, Object I/O, I/O with multiple object ,File pointer, Disk I/O.
5.
Exception handling ,Name spaces and Standard Template library (STL)
Need of Exception handling ,try ,catch and throws keywords , defining namespace
,benefit of namespace, Component of STL.
BOOKS RECOMMENDED:
1. Object oriented programming with C++ by E.Balagurusamy IInd edition Tata Mc-Graw
Hill.
2. Object Oriented Programmin By McGregor and Sykes S A, 1992 Van Nostrand.
3. The C++ Programming Language
By Strustrp B,Addision Wasley.
4. Object Oriented Programming in C++ By Lafore R, Galgotia Publications.
5. Introduction to Object Oriented Programming By Witt KV, Galgotia Publications.
6. Object Oriented Programming By Blaschek G, Springer Verlag
“Living is Easy with Eyes Closed.” ― John Lennon
M.Sc.(CS)-203
Computer System Architecture
1. Micro operation and Computer Organization : Arithmetic micro operation, Logic micro
operation, Shift micro operation, Arithmetic logic shift unit Instruction codes, Bus and
memory transfer, Computer registers, Computer instructions, Instruction cycle, Memory
reference instruction, I/O and interrupt, Design of basic computer and Accumulator
logic.
2. Programming Basic Computer and C.P.U Organization: Machine language, Assembly
language, Assembler, Programming arithmetic and logic operation, I/O programming,
General register organization of C.P.U, Stack organization, Instruction format,
Addressing modes
3. Pipeline and Vector Processing: Parallel processing, Pipelining, Arithmetic pipelining,
Instruction pipeline, RISC pipeline, Vector processing, Memory interleaving, Array
processor, Multiprocessor.
4. Input-output Organization: Peripheral devices, I/O interfaces, Modes of data transfer,
Asynchronous data transfer, DMA, Priority interrupt I/O processor.
5. Memory Organization: Auxiliary memory, Microcomputer memory, Memory
hierarchy, Associative memory, Virtual memory, Cache memory, Memory management
hardware.
BOOKS RECOMMENDED:
1. M.Morris Manno, “Computer system Architecture”, 3rd Edition, PHI
2. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, 5th Edition “Computer
Organization”, McGraw-Hill,2002.
3. William Stallings, “Computer Organization and Architecture – Designing for
Performance”, 6th Edition, Pearson Education, 2003.
4. David A.Patterson and John L.Hennessy, “Computer Organization and Design: The
hardware / software interface”, 2nd Edition, Morgan Kaufmann, 2002.
5. John P.Hayes, “Computer Architecture and Organization”, 3rd Edition, McGraw Hill,
1998.
“A good traveler has no fixed plans and is not intent on arriving.” ― Lao Tzu
M.Sc.(CS)-204
Web Technology
1. Internet Concept:
Fundamental of Web ,History of Web, Web development overview, Domain Name System
(DNS),DHCP,and SMTP and other servers ,Internet service provider (ISP), Concept of IP
Address, Internet Protocol, TCP/IP Architecture and protocol (IP) ,Web Browser and Web
Server.
2. HTML and DHTML
HTML Tag, Rules of HTML, Text Formatting & Style, List, Adding Graphics to Html
Document,Tables and Layout , Linking Documents, Frame, Forms, Project in HTML,
Introduction to DHTML, CSS,Class & DIV, External Style Sheet.
3. Scripting Languages
Java Script (JS) in Web Page, Advantage of Java Script, JS object model and hierarchy
,Handling event ,Operators and syntax of JS, Function, Client side JS Vs Server side JS ,JS
security, Introduction to VB Script, Operator & Syntax of VB Script, Dialog Boxes, Control &
Loop, Function in VBS.
4. XML
Introduction to XML, XML in Action, Commercial Benefits of XML, Gaining Competitive
advantage with XML, Programming in XML, XML Schema ,XSLT ,DOM structure model
,XML quires and transformation .
5. Active Server Page (ASP)
Introduction ,Internet Information System (IIS),ASP object ,Server object File system object,
session ,Accessing data base with an ASP page ,ODBC – ADO connection object, common
methods and properties, ADO record set object .Introduction to ASP.Net.
BOOKS RECOMMENDED:
1. The complete Reference By Thomos A. Powell ,TMH publication
2. XML By Example, Sean Mc Grath Pentice Hall Publication
3.Java Script :The definite Guide By Flangam , O’Reilly
4. Java Script :Developers Resource by Kamran Husain and Jason Levitt PTR-PH publication
4.”Introduction to XML” IDG Publication
5.”Mastering VB Script” BPB Publication
6.World Wide Web design with HTML by Xavier Tata McGraw Hill Publication .
“Wisdom comes from experience. Experience is often a result of lack of wisdom.” ― Terry Pratchett
M.Sc.(CS)-205
Discrete Mathematics
1.
Mathematical Logic : Notations, Algebra of Propositions & Propositional functions,
logical connectives, Truth values & Truth table Tautologies & Contradictions, Normal
Forms, Predicate Calculus, Quantifiers.
Set Theory: Sets, Subsets, Power sets, Complement, Union and Intersection, De-Morgan's
law Cardinality, relations: Cartesian Products, relational Matrices, properties of relations
equivalence relation functions: Injection, Surjection, Bijection, Composition, of Functions,
Permutations, Cardinality, the characteristic functions recursive definitions, finite
induction.
2. Boolean Algebra : Truth values and truth tables, the algebra of propositional functions,
boolean algebra of truth values Axiomatic definitions of Boolean algebra as algebraic
structures with two operations, Switching Circuits.
3. Groups : Groups, axioms, permutation groups, subgroups, co-sets, normal subgroups.
4. Graphs : Simple Graph, directed graph, Degree of a Vertex, Types of Graphs, Sub Graphs
and Isomorphic Graphs, Operations of Graphs, Path, Cycles and Connectivity, Euler and
Hamilton Graph, Shortest Path Problems, BFS ,DFS, Dijkastra’s Algorithm, Representation
of Graphs, Planar Graphs, Applications of Graph Theory.
5. Matrices : Addition, subtraction, multiplication, transposes.
BOOKS RECOMMENDED:
1. A text book of Discrete Mathematics By Swapan Kumar Sarkar (S. Chand & company
Ltd.).
2. Discrete Mathematical structure with Applications to computer science By J.P Trembly
& R.P. Manohar.
3. Discrete Mathematics By K.A Ross and C.R.B writht.
4. Discrete Mathematics Structures By Bernard Kohman & Robert C. Bushy.
for computer science
5. Discrete Mathematics By Seymour Lipschutz Mare Lipson. Tata McGraw-Hill
Edition.
“Life is to be lived, not controlled; and humanity is won by continuing to play in face of certain defeat.” ―
Ralph Ellison, Invisible Man
M.Sc. (CS)-301
Introduction to JAVA
1. Overview of JAVA : The genesis of java, An overview of java, java virtual machine
(JVM) ,Java development kit (JDK) ,Java Vs C++, Data types, Literals, Variables, and
Arrays, Operators, Control statements, Introducing Class, closer look at Methods and
class ,Nested and inner class ,Exploring Java.lang, String handling ,Constructor ,Garbage
collection and finalize() method. Writing simple JAVA program.
2. Inheritance, Packages and interface- Types of inheritance ,Access specifier ,using super,
method overriding ,Abstract class ,constructor in multilevel inheritance ,using final with
inheritance ,Dynamic method dispatch ,Defining package, CLASSPATH, Access
protection ,Importing package ,Defining and implementing interface ,Extending
interface, Nested interface.
3. Exception handling and Multithreading: Using try and catch ,multiple catch classes,
Nested try statements , throw ,throws and finally ,Built in exception ,Uncaught
exception , Creating own exception class , Java Thread Model: Main thread ,Creating
own Thread ,Life cycle of thread, Thread priorities ,Synchronization and messaging,
Interthread communication ,Suspending ,Resuming and stopping thread.
4. Input Output and Networking :I/O classes: Byte stream and character stream
,Predefined stream ,reading console input, writing consol output,PrintWriter class
,Reading and writing files. Networking : classes and interface ,Socket and overview,
TCP/IP client socket and server socket ,Inet address ,URL Connection, Datagram.
5. Applet ,AWT,Swing, Event handling and Advance JAVA– Applet life cycle, Creating
an applet, Using image and sound in applet ,passing parameter.Exploring AWT and
introduction to Swing.Event handling –The delegation-event model , Event classes
,Source of event, Event listener interfaces ,handling mouse and keyboard event ,Adapter
class.
Advance JAVA : JDBC API. Servlet – Overview of servelet,Life cycle of servlet, JAVA
servlet architecture , Generic servlet and http servlet ,The servlet interface, Request and
response.
BOOKS RECOMMENDED:
1. Java: The complete reference By Naughton P and schildt H. ,Osborne Mcgraw-Hill,
Berkeley, USA, 1997.
2. Simply JAVA :An Introduction to JAVA programming By James R. Levenick ,Firewall
Media publication New,Delhi
3. Java Programming By E.Balguruswami
4. Core JAVA for beginners By Rashmi Kanta Das ,Vikas Publication.
5. Core JAVA : A Comprehensive Study by Mahesh P. Matha , PHI publication.
“The trouble is if you don’t spend your life yourself, other people spend it for you.” ― Peter Shaffer, Five
Finger Exercise: A Play
M.Sc.(CS)-302
Artificial Intelligence and Expert Systems
1. Introduction: Definitions and approaches, Foundation of A.I. History, Area and
Applications of A.I. Preliminary Concept of Intelligent Agents.
2. Problem Solving: Problem solving as state space search, production system, Search
techniques: Breadth First and Depth-first, Best-First Search, Hill-climbing, Heuristics, A
and A* algorithm.
3. Knowledge Representation and Reasoning: Syntactic and Semantic representations,
Predicate and prepositional logic, Resolution, Unification, Semantic Net.
4. Pattern Recognition: Meaning of pattern, Pattern Recognition, Classification,
Supervised & Unsupervised Learning of classification , K-NN, K-MEANS.
5. Expert Systems: Introduction, Architecture, Application.
BOOKS RECOMMENDED:
1. Artificial Intelligence By E. Rich and K. Knight, Tata McGraw Hill.
2. Artificial Intelligence: A New Synthesis By Nilsson, Morgan Kaufmann.
3. Pattern Classification 2nd Edition By R.O. Duda, Hart, Stork (2001) ,John wiley, New
York.
4. Pattern Recognition : Technique and Applications By Shinghal (2006) ,Oxford University
Press,New Delhi.
“The secret of life is honesty and fair dealing. If you can fake that, you've got it made.” ― Groucho Marx
M.Sc.(CS)- 303
RDBMS
1.
Overview of Database Management :Data, Information and knowledge, Increasing use
of data as a corporate resource, data processing verses data management, file oriented
approach verses database oriented approach to data management; data independence,
database administration roles, DBMS architecture, different kinds of DBMS users,
importance of data dictionary, contents of data dictionary, types of database languages.
Data models: network, hierarchical, relational. Introduction to distributed databases.
2.
Relational Model : Entity - Relationship model as a tool for conceptual design-entities
attributes and relationships. ER diagrams; Concept of keys: candidate key, primary key,
alternate key, foreign key; Strong and weak entities, Case studies of ER modeling
Generalization; specialization and aggregation. Converting an ER model into relational
Schema. Extended ER features.
3.
Structured Query Language :Relational Algebra: select, project, cross product different
types of joins (inner join, outer joins, self join); set operations, Tuple relational calculus,
Domain relational calculus, Simple and complex queries using relational algebra, stand
alone and embedded query languages, Introduction to SQL constructs (SELECT…FROM,
WHERE… GROUP BY… HAVING… ORDERBY….), INSERT, DELETE, UPDATE, VIEW
definition and use, Temporary tables, Nested queries, and correlated nested queries,
Integrity constraints: Not null, unique, check, primary key, foreign key, references,
Triggers. Embedded SQL and Application Programming Interfaces.
4.
Relational Database Design :Normalization concept in logical model; Pitfalls in database
design, update anomalies: Functional dependencies, Join dependencies, Normal forms
(1NF, 2NF, 3NF). Boyce Codd Normal form, Decomposition, Multi-Valued Dependencies,
4NF, 5NF. Issues in physical design; Concepts of indexes, File organization for relational
tables, De-normalization.
5. Introduction to Query Processing and Protecting the Database & Data Organizations :
Parsing, translation, optimization, evaluation and overview of Query Processing.
Protecting the Data Base - Integrity, Security and Recovery. Domain Constraints,
Referential Integrity, Assertion, Triggers, Security & Authorization in SQL.
BOOKS RECOMMENDED:
1. Database system concept By H. Korth and A. Silberschatz, TMH
2. Data Base Management System By Alexies & Mathews [ Vikas publication]
3. Data Base Management System By C. J. Date [Narosha Pub.]
4. Data Base Management System By James Matin
5. Principles of Database System By Ullman
6. An Introduction to database systems By Bipin Desai, 2011 ed.,Galgotia Publication.
7. Database Management System By A. K. Majumdar & P.Bhattacharya, TMH
“If you can't change your fate, change your attitude.” ― Amy Tan
M.Sc.(CS)-304
THEORY OF COMPUTATION
1
Theory of Automata: Definition of an automaton, Transition system, Acceptability of a
string by FA, Nondeterministic finite state machine, Designing of DFA and NFA
,Conversion of NFA to DFA, Equivalence of DFA and NFA, Mealy and Moore models,
Minimization of finite automata.
2
Formal Languages, Regular Sets and Regular Grammars: Definition, Languages and
their relation, Chomsky classification of language, Regular expression, and Finite
automaton, Pumping Lemma for regular sets, Application of Pumping lemma, Closure
property of regular sets, Regular sets and regular grammar.
3
Context-free Language: Context fee language and derivation trees, Ambiguity in
context free languages, Simplification of context free languages: (left recursion, Unit
production elimination, Eliminating null values) Normal forms of context free
languages.
4
Pushdown Automation: Definition, Acceptance by PDA, Designing PDA, Push down
automation and Context free languages, Parsing and Pushdown automata.
5
Turing Machine: Turing Machines model, Representation of TM, Languages acceptability
by TM, Design of TM, Introduction: Universal Turing Machines and Halting problem,
Introduction: Linear bounded automata and languages.
BOOKS RECOMMENDED:
1.
2.
3.
4.
5.
K L P Mishra “Theory of Computation”,3rd Edition PHI Publication.
J.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata Theory, Languages
and Computations”, Second Edition, Pearson Education, 2003
G.PSaradhiVarma and B. ThirupathiRao , “ Theory and Computation Formal Languages
and Automata Theory”,2005, SCITECH publication.
H.R.Lewis and C.H.Papadimitriou, “Elements of The theory of Computation”, Second
Edition, Pearson Education/PHI, 2003
J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition,
TMH, 2003.
“Education is simply the soul of a society as it passes from one generation to another.” ―G. K. Chesterson
M.Sc.(CS)- 305
Computer Networks
1. Introduction and Physical Layer :Introduction: Goal and application Network
Hardware and Software , Protocol Hierarchies, Design Issue of the layers,Interfaces and
services, Connection oriented and connection less services, Service Primitives,Reference
Models – The OSI Reference model, The TCP/IP Model ,Types of computer Network
:LAN,MAN,WAN, Topologies, Transmission mode .
Physical Layer :Data and signal,Analog and digital Communication, Transmission
Media ,Concept of data transmission, Switching Techniques ,Communication Satellites –
Geosynchronous Satellite – VSAT, Low Orbit Satellites, ISDN and ATM.
2. Data Link Layer : Data Link Layer design issues Data link control:Framing, Flow
control. Error Detection and Correction. DLC protocol :Stop and Wait Protocol, Sliding
window protocol, A Simplex protocol for noisy channel, Medium access sublayer:
Channel allocation :static and dynamic ,Multiple access protocol FDDI, Data Link Layer
in the Internet : SLIP,PPP. Wired and Wireless LAN protocol.
3. Network Layer : The Network Layer Design Issue, IP addressing, Address mapping,
Error reporting ,Multicasting ,Delivery, Forwarding and Routing. The Network Layer in
the Internet : The IP Protocol. subnets, Internet control protocols ,internet multicasting.
4. Transport Layer :The Transport layer services, The concept of client and server in terms
of socket addressing Quality of service, Transport service primitives and buffering,
Multiplexing, Crash Recovery. The Internet Transport Protocols (TCP/IP) – The TCP
Service Model, The TCP protocol, The TCP segment header, TCP connection
management, TCP transmission policy, TCP congestion control, TCP timer management,
UDP.
5. Presentation and Application Layer : Network Security, Traditional Cryptography,
Private key cryptography and public key cryptography, Authentication protocols, DNS
,SNMP,E-mail, application layer protocols.
BOOKS RECOMMENDED :
3. Data Communications and Networking By Forouzan, Tata McGraw Hill Company.
4. Computer Networks By A.S. Tanenbaum
3. Computer Network By S.S.Shinde ,New Age International Publisher.
4. Data and computer Communication by Shashi banzal ,Firewall media .
5.Internetworking with TCP/IP :Principles,Protocols,and Architecture Vol. 1 5th
Edition,PHI publication.
6. Data Communications and Computer Network by Prakash C Gupta, PHI Publication.
“Instruction ends in the school-room, but education ends only with life.” ―Frederick W.Robertson
M.Sc(CS)- 401
Major Project
NOTE:
FOR PROJECT GUIDELINES PLEASE REFER TO MCA601
“The saddest aspect of life right now is that science gathers knowledge faster than society gathers wisdom.”
― Isaac Asimov
(The scheme and syllabi of any programme can be modified from time to time, students are advised to
refer to University website for updates if any/ consult their respective teachers )
Faculty of Mathematical and Computational Science
Dept of Computer Science and Information Technology (CSIT)
Guru Ghasidas Vishwavidyalaya, Bilaspur
Scheme and syllabus for Ph. D. Course work in Computer Science
Code
PHDCS01
PHDCS02
PHDCS03
PHDCS04
Subject
Fundamentals of Research in Science
Soft Computing Techniques
Pattern Recognition
Seminar
Max Marks
Min Passing Marks
100
60
100
60
100
60
Open Viva – Qualified / Not Qualified
General Instruction
1. There shall be three theory papers.
2. There shall be an Open Seminar/ Evaluation that will be organized in the University
Campus. An Examinee shall be awarded either “Qualified” or “Not Qualified”. Marks
shall not be allotted for it.
3. Duration of the theory paper shall be three hours.
4. The duration of the course work shall be six months / one Semester.
"C makes it easy to shoot yourself in the foot; C++ makes it harder, but when you do, it blows away your
whole leg." ― BjarneStroustrup
PHDCS01
Fundamentals of Research in Science
Note: A candidate has to attempt five questions out of eight questions. All questions will
carry equal marks. Question No. 01 is Compulsory which will consist of 10 short answered
type questions spread all over the syllabus carrying 2 marks each.
Ethics in Science
Science and ethics, science as the social, cultural and human pursuit, Ethical theory and
applications, Interrelationship of science with technology and delivery.
The source of ethical issues, in science, example from disciplines, e.g. biotechnology,
medical sciences, defense research and development, environmental issues, Space research,
energy, food security etc., Social and normal responsibilities of scientists and activists. Ethical
issues in science research and reporting, objectivity and integrity, the problem of plagiarism and
related issues, international norms and standards, Scientific temper and virtues, expectations
from scientific community, Desired temper of scientists, truthfulness, simplicity, humility, open
mindedness, attitude of service towards social and human well being.
A. Fuzzy Sets and Neural Network
Fuzzy Sets, Probability Theory and Possibility Theory: A comparison.
Structure of a Biological neuron, An artificial neurons with its components, A network of
artificial neuron (ANN), Feed forward networks, Transfer function, Computation of output of
an ANN.
B. Science Communication
Nature and importance of Communication in Science, Preparation of manuscripts, review
articles, research papers, books, monograms, research projects, review of manuscript, Survey of
literature and presentation of data, Preparation of power point presentation, Population of
Sciences, Socio – Legal issues, Originality, Integrity, IPR, Patents, Plagiarism
Recommended Books:
Ethics in Science
1.David B. Resnik (1998): The Ethics of Science: An Introduction. Routledge
publisher, USA.
2.Callahan D. & Bok S. (1996): Ethics teaching in Higher Education. Plenum Press,
New York, USA.
3.Kapur J. N. (1996): Ethical values Excellence in Education and Science. Wishwa
4.Prakashan, New Delhi.
Tripathi A. N. (2008) : Human values. New Age International Publishers, New
Delhi.
"A mathematician is a device for turning coffee into theorems." ― Paul Erdos (1913-1996)
Fuzzy Sets and Neural Network
1.G. J. Klir and B. Yuan: Fuzzy sets and Fuzzy logic theory and application, PHI
(EEE).
2.Simon Haykin: Artificial Neural Network, PHI.
Science Communication
1.A. Willson: Handbook of Science Communication, 1998 Institute of Physics
Publishing, Bristol, Philadelphia.
2.Stocklmayer, Gore MM, Bryant C.: Science Communication Theory & Practice;
(Eds.) 2002, Springer.
3.Laszis P: Communicating Science, A practical Guide, 2006, Springer.
Laszis P:Communicating Science: A practical Guide(2006), Springer.
"Talent does what it can; genius does what it must." ― Edward George Bulwer-Lytton (1803-1873)
PHDCS-02
Soft Computing Techniques
Note: A candidate has to attempt five questions out of eight questions. All questions will
carry equal marks. Question No. 01 is Compulsory which will consist of 10 short answered
type questions spread all over the syllabus carrying 2 marks each.
Introduction – What is soft computing ?, Different tools of soft computing and its comparison,
area of application .
Artificial Neural Network and Genetic Algorithm – ANN: Architecture, Different types of
ANN, Supervised and unsupervised learning, EBPA network , Kohenen network. Genetic
algorithm: Introduction and operators.
Fuzzy Logic – Type-1 Fuzzy logic: Introduction ,Operations , membership function, Fuzzy
inference System ,Fuzzy rule base ,Fuzzy control system.Type-2 fuzzy logic: Introduction,
operations, membership function, Comparison with type-1 fuzzy logic ,Type-2 fuzzy system,
Rule base generation ,design of intelligent system with type-2 fuzzy logic.
Hybrid soft commuting : Design of Neuro-Fuzzy ,Neuro – Genetic ,Fuzzy –Genetic NeuroFuzzy-Genetic model .
Experimental Work : Application of different soft computing tool in different problem domain.
Reference Books:
1. Type-2 fuzzy logic :Theory and Applications by Oscar Castillo and Partricia Melin
,Springer publication
2. Uncertain rule-based fuzzy logic systems: Introduction and new directions by Jerry
M.Mendel ,Prentic Hall of India .
3. Intelligent hybrid System : Neural Network ,Fuzzy Logic and Genetic Algorithm by Da
Ruan ,Kluwer Academics publishers
4. Neural Network ,Fuzzy logic and Genetic Algorithm :Synthesis and application by S.
Rajshekhran and G.A. Vijay Laxmi ,PHI publication
5. Fuzzy logic with engineering applications by Timothy J Ross, Wiley Publication
6. Neural network by Simon Haykins: Prentice Hall of India
"Try to learn something about everything and everything about something." - Thomas Henry Huxley
(1825-1895)
PHDCS03
Pattern Recognition
Note: A candidate has to attempt five questions out of eight questions. All questions will
carry equal marks. Question No. 01 is Compulsory which will consist of 10 short answered
type questions spread all over the syllabus carrying 2 marks each.
Pattern Classification: Meaning of pattern, patterns classification, pattern
recognition
Classification: Meaning of classification, supervised and unsupervised
classification, k-nn,. Decision Trees, clustering, k-Means clustering
Data Mining: Meaning, concepts, types of databases for data mining,
Dimensionality reduction, feature selection, Principal Component Analysis
Review paper on any ONE topic including research work carried upto current
year.
Reference Books:
1. Pattern Classification: Duda, R.O., Hart, P.E., Stork, D.G., 2001. John Wiley and
Sons (Asia) Pte. Ltd.
2. Data Mining : Concepts and Techniques - Jiawei Han, Micheline Kamber,
Morgan Kaufmann,Harcourt India 2001.
3. Data Mining Methods for Knowledge Discovery - Cios, Pedrycz, Swiniarski,
Kluwer Academic Publishers, London – 1998.
PHDCS04:
Seminar
There shall be an Open Seminar/ Evaluation that will be organized in the University
Campus. An Examinee shall be awarded either “Qualified” or “Not Qualified”. Marks
shall not be allotted for it.
“No amount of experimentation can ever prove me right; a single experiment can prove me wrong.” ―
Albert Einstein
Fee Structure
Course
At the time of
Semester II
Semester III
Semester IV
Rs. 8800/-
admission
Integrated UG/PG Prog.
Rs. 2000/- per semester
M.Sc. ( Comp.Sc. )
Rs. 14050/-
Rs. 8800/-
Rs. 9995/-
M.C.A.
Rs. 20425/- (1st year)
Rs. 18425/- (2nd
Rs. 15125/- (3rd
year)
year)
“Science may be described as the art of systematic oversimplification.” ― Karl R. Popper
ALUMINI ASSOCIATION MEMBERSHIP
FORM
“The aim of science is not to open the door to infinite wisdom, but to set a limit to infinite error.” ― Bertolt
Brecht, Life of Galileo
DEPARTMENT OF COMPUTER SCIENCE & INFORMATION TECHNOLOGY (CSIT)
Guru Ghasidas Vishwavidyalaya, Bilaspur(C.G.)
MEMBERSHIP FORM
1. Name: ……………………………….…………………………………………………………
(In block capital, surname first)
2. Date of Birth: …………………………
3.Sex: …..
4. Permanent Address: (with PIN Code, Phone/Fax/e mail etc)
…………………………………………………………………………………………………
5. Present Address: (with PIN Code, Phone/Fax/e mail etc)
…………………………………………………………………………………………………
Mobile/ Phone No-(with STD code)……………………….……………..………….………..
6. Present occupation: ………………………………………………………………………
7. Association with CS & IT Dept.,GGU University as a student/research scholar
From…………………………………….to…………………………………………..………...
Name of the Course or Programme………………………..…………………………………...
Year
of
degree/diploma
obtained…………………………………...…………………….…….
Department……………………..…………………………………………………….................
8. Any notable achievement during your University days?
9. A brief resume of your academic/professional activities after you left
GG
viswavidyalaya
10. Your special interest/achievement (sports, cultural and literary activities etc.)
11.
Your
suggestions
for
the
future
development
of
the
University…………….………....…...……………………………………………………………
…………………………….……
12. D.D/Cheque No……………………….. Amount Rs………………………………..….….
Date… …………………..
Signature :
Membership :
a) All post graduate/M.C.A/ M.Sc.(CS)/M.Sc.(IT)/Ph.D, degree , diploma & Certificate holders of
University.b) Graduates from the colleges now affiliated to CS
CS & IT Dept.GGU
& IT Dept.GGU University prior to the date of affiliation.
“Wonder is the seed of knowledge” ― Francis Bacon
Details of the Faculty Members of CSIT
S.No.
Name of Faculties
Designation
Contact No.
1.
Dr. A.K. Saxena
Professor & HOD
94252-22744
2.
Dr. Hari Shankar Hota
Assistant Professor
94252-22658
3.
Mrs. Pushplata Pujari
Assistant Professor
94252-62192
4.
Mr Rajwant Singh Rao
Assistant Professor
5.
Mr. Amitesh Kumar Jha
Assistant Professor
8827572070
9628260394
9827930291
6.
Ms.Sushma Jaiswal
Assistant Professor
9993781013
7.
Mr.Dovendra Patre
9303825285
8.
Ms. Nazil Parveen
9.
Ms. Khushbu Verma
10.
Mr.Akhilesh Srivas
11.
Ms. Prasoon Kairwat
12.
Ms. Aparna Dubey
Assistant
Professor(Temporary)
Assistant
Professor(Temporary)
Assistant
Professor(Temporary)
Assistant
Professor(Temporary)
Assistant
Professor(Temporary)
Assistant
Professor(Temporary)
7869240530
7879025552
9893551642
8103332278
9826661783
Staff Member
Computer Science & Information Mr. Sadhu Prasad Pandey
Tech. & Computer Centre
07752-260356
Mr. J.P. Verma
96305-25029
97533-81096
Mr. Vikas Talalwar
93021-76657
Mr. R. K.Tomar
98068-63280
Mr. Hanuman Singh
99778-98589
Mr. Onkar Sing Sidar
97541-21595
Mrs. Rani Bai
-----
“To know the history of science is to recognize the mortality of any claim to universal truth. ”― Evelyn Fox
Keller, Reflections on Gender and Science
University Telephone Directory
S.No.
POSITION
NAME
PHONE NO.
(07752)
01. Vice Chancellor
Prof.LakshmanChaturvedi 260283, 260353
02. Registrar (Acting)
Prof. M.S.K. Khokhar
260209
03.
Deputy Registrar (Administration)
Mr. R. K. Soni
260435
04.
Deputy Registrar (Academic &Engg.
Section)
--------
--------
05.
OSD
Dr. P. K. Bajpai
260159
Assistant Registrar (Development
Mr.AbhideepTiwari
-------&Engg. Section)
Assistant Registrar (Administration, RIT
07.
Mr. T. P. Singh
260017
Cell)
08. Assistant Registrar (Finance)
Mr.Santosh Kumar Tripathi 260000
06.
09.
Controller of Exam
Dr. A. S. Randive
260044
10.
Dean Student Welfare (DSW)
Dr. S.V.S. Chouhan
260204
11.
Finance Officer (In Charge)
Mr. R. K. Soni
260036
12.
HOD, In-charge (Anthropology)
Dr. B.N. Tiwari
260203
13.
HOD (Biotechnology)
Dr. B.N. Tiwari
260405
14.
HOD (Commerce)
Dr. M.B. Shukla
260142
15.
HOD (CSIT)
Dr. A. K. Saxena
260356
16.
HOD (Economics)
Dr.ManishaDubey
260412
HOD (English)
Dr. Manish Shrivastava
HOD (Forestry, Wild life & Environment
18.
Dr. S. S. Singh
Science)
19. HOD (Hindi)
Dr.BrajeshTiwari
17.
-------260078
-------
20.
HOD (History)
Dr.PradeepShukla
-------
21.
HOD,Incharge (Journalism and Mass
Communication))
Dr. Manish Shrivastava
-------
22.
HOD (Library and Information Science)) Dr.BrajeshTiwari
-------
23.
HOD (Pure & Applied Mathematics)
Dr. S. P. Singh
260144
Dr. R. K. Bhowmik
260159
Dr.AnupamaSaxena
260461
HOD (Pure & Applied Physics)
HOD (Political Science & Public
25.
Administration)
24.
26.
HOD (Physical Education)
Dr.Vishan Singh Rathore
260035
27.
HOD (Management)
Dr. S.V.S. Chouhan
260025
28.
HOD (Rural Technology)
Dr. M.S.K. Khokhar
260287
29.
HOD (Social Work)
Dr. S.V.S. Chouhan
260204
30.
HOD (Computer Science and
Engineering)
Dr. Manish Shrivastava
260456
31.
HOD (Information Technology)
Dr.AmitKhaskalam
260454
Mrs.BhawanaShukla
260458
Mr. C.P. Dewangan
260453
HOD (Electronics & Communication
Engineering)
HOD (Industrial & Production
33.
Engineering)
32.
34.
HOD (Chemical Engineering)
Dr. S.N. Saha
260457
35.
HOD (Mechanical Engineering)
Mr.Shailendra Singh
......
36.
HOD (Civil Engineering)
Dr.Shailndra Singh
.......
37.
HOD (Department of Pharmacy)
Dr. J.S. Dangi
260027
38.
HOD (Education Department)
Dr.C.S.Vazalwar
94252-23875
39.
Computer Centre
Dr. A.K. Saxena
260356
40.
HOD (Botany)
Dr. B.N. Tiwari
260471, 9425280739
41.
HOD (Zoology)
Dr. B.N. Tiwari
260203
42.
HOD (Chemistry)
Dr. G.K. Patra
---------
43.
Director (Distance Education)
Dr. Manish Shivastava
260048
44.
Central Library
Dr. U.N. Singh
260041
45.
University Guest House
Dr. R.K. Mehta
260024
46.
N.S.S.
Dr.Kalyani Jain
260084, 9893786358
“The scientist is not a person who gives the right answers, he's one who asks the right questions.” ― Claude Lévi-Strauss
Workshop on E-Governance - February 2012
Group Photo - CSIT Students
“If the facts don't fit the theory, change the facts.” ― Albert Einstein
Important Instructions to Students
Attendance:
I.
Attendance of a student should not be less than 75 % in a semester failing
which he/she will not be allowed to appear in the examination.
II.
Maximum 15 % relaxation in attendance will be given on the basis of medical
certificate / NSS / Sports / Other University related activities for students
having attendance in between 60 to 75%. This relaxation applies only to
students lying within attendance range of 60 to 75% in order to allow them to
appear in examination.
Student of the above category II has to produce valid certificate issued from
the competent authority. Strict action will be taken against students
presenting fake certificates including fake medical certificates etc.
III.
Internal Assessment:
There are two components of internal assessment:
I. Unit test
II. Assignment/presentation / or as decided by department from time to
time + attendance.
The second component (II) is further divided into two parts:
I. Assignment/presentation carrying 5% of total marks in a subject .
II. Attendance carrying 5 % of total marks in a subject which will be
calculated using following formula .
Below 75 %
Between 75 to 85%
85% or above 85 %
: No marks
: 2 Marks
: 5 Marks
1. Unit test will be conducted as per the academic calendar published by
university every year. In total there will be three unit tests carrying 30% of
total marks in a subject .Each test will carry 15% marks out of the total marks
in a subject. Out of which best two will be considered for the final evaluation.
Discipline:
As per the direction of honorable Supreme Court ragging is strictly
prohibited.
“Time is a drug. Too much of it kills you.” ― Terry Pratchett, Small Gods
Time Table
PERIOD
DAY
MONDAY
I
II
III
IV
V
VI
VII
I
II
III
IV
V
VI
VII
TUESDAY
WEDNESDAY
THURSDAY
FRIDAY
SATURDAY
PERIOD
DAY
MONDAY
TUESDAY
WEDNESDAY
THURSDAY
FRIDAY
SATURDAY
“Learn from yesterday, live for today, hope for tomorrow. The important thing is to not stop questioning.”
― Albert Einstein, Relativity: The Special and the General Theory
Time Table
PERIOD
DAY
MONDAY
I
II
III
IV
V
VI
VII
I
II
III
IV
V
VI
VII
TUESDAY
WEDNESDAY
THURSDAY
FRIDAY
SATURDAY
PERIOD
DAY
MONDAY
TUESDAY
WEDNESDAY
THURSDAY
FRIDAY
SATURDAY
“Science is the process that takes us from confusion to understanding..” ― Brian Greene
Time Table
Time Table
PERIOD
DAY
MONDAY
I
II
III
IV
V
VI
VII
I
II
III
IV
V
VI
VII
TUESDAY
WEDNESDAY
THURSDAY
FRIDAY
SATURDAY
PERIOD
DAY
MONDAY
TUESDAY
WEDNESDAY
THURSDAY
FRIDAY
SATURDAY
“Science is the topography of ignorance.” ― Oliver Wendell Holmes Sr.
Contact Address and Numbers
S.No
Name and Address
Tel. No./ Mobile No.
“Science is a differential equation. Religion is a boundary condition.” ― Alan Turing
Contact Address and Numbers
S.No
Name and Address
Tel. No./ Mobile No.
“Problems in science are sometimes made easier by adding complications.” ― Daniel C. Dennett, Darwin's
Dangerous Idea: Evolution and the Meanings of Life
Important Notes
“Science is the poetry of reality.” ― Richard Dawkins
Important Notes
“A real scientist solves problems, not wails that they are unsolvable.” ― Anne McCaffrey, Acorna: The
Unicorn Girl
Academic Calendar 2012-13
Guru Ghasidas Vishwavidyalaya, Bilaspur
(A Central University established by the Central Universities Act, 2009)
Important Dates for admission to various courses (2012-13)
1.
4.
5.
6.
Admission Brochure (2012-13) and application form
for VET available from
Last Date of receipt of duty completed application
from VET
Date of Vishwavidyalaya Entrance test (VET)
(a) Integrated Course, UG, Diploma/PG Diploma
(b) PG & Integrated M.Phil/Ph.D. Programme
Declaration of VET results
Commencement of Admission
Completion of Admission
7.
Declaration of list of admitted students
2.
3.
4-May-12(Friday)
31-May-12(Thursday)
15-June-12(Friday)
16-June-12(Saturday)
04-Jul-12(Wednesday)
07-Jul-12(Saturday)
1. 12-Jul-12(Monday)
2. 30-Jul-12(Monday) with
the permission of VC)
31-Jul-12(Tuesday)
Academic Calendar for Odd Semester (2012-2013)
1.
2.
*Commencement of Classes(New Admission)
Ist Unit Test(Internal Assessment)
3.
Last Date for showing the answer scripts of test to the
students
Last Date for submission of Marks to COE
2nd Unit test (Internal Assessment)
4.
5.
6.
7.
8.
9.
10.
11.
Last Date for showing the answer scripts of test to the
students
Last Date for submission of Marks to COE
Last Date for Submission of End Semester Examination
Form
Last date for submission of End Semester Examination
from with late fee
3nd Unit test (Internal Assessment)
15.
Last Date for showing the answer scripts of test to the
students
Last Date for submission of Marks to COE
Last day of the class
Last Date for submission of final Marks of Internal
Assessment(40%) to COE
Preparation Leave
16.
End-Semester Examination
17.
Semester or winter Vacation
12.
13.
14.
01-Aug-12(Wednesday)
03-Sep-12(Monday) to7-Sep12(Friday)
14-Sep-12(Friday)
18-Sep-12(Tuesday)
08-Oct-12(Monday) to 12-Oct12(Friday)
19-Oct-12(Friday)
23-Oct-12(Tuesday)
5-Nov-12(Monday)
16-Nov-12(Friday)
19-Nov-12(Monday) to 23-Nov12(Friday)
29-Nov-12(Thursday)
03-Dec-12(Monday)
30-Nov-12(Friday)
05-Dec-12(Wednesday)
01-Dec-12(Saturday) to 07-Dec12(Friday)
08-Dec-12(Saturday) to 22-dec12(Saturday)
24-Dec-12(Monday) to 31-Dec12(Monday)
“Science, like art, is not a copy of nature but a re-creation of her.” ― Jacob Bronowski, Science & Human
Values
Academic Calendar for Even Semester (2012-2013)
1.
2.
3.
Reporting to the department
Commencement of Classes
Sports and Games Events
4.
Ist Unit Test(Internal Assessment)
5.
Last Date of showing the answer scripts of test to the
students
Last Date of submission of Marks to COE
2nd Unit test (Internal Assessment)
6.
7.
8.
9.
10.
11.
12.
13.
Last Date of showing the answer scripts of test to the
students
Last Date of submission of Marks to COE
Last Date of Submission of End Semester Examination
Form
Last date of submission of End Semester Examination
from with late fee
3nd Unit test (Internal Assessment)
17.
Last Date of showing the answer scripts of test to the
students
Last Date of submission of Marks to COE
Last day of the class
Last Date of submission of final Marks of Internal
Assessment(40%) to COE
Preparation Leave
18.
End-Semester Examination
19.
Summer Vacation
14.
15.
16.
01-Jan-13(Tuesday)
02-Jan-13(Wednesday)
07-Jan-13(Monday) to 14-Jan13(Monday)
11-Feb-13(Monday) to 16-Feb13(Saturday)
21-Feb-13(Thursday)
26-Feb-13(Tuesday)
11-March-13(Monday) to 16March-13(Saturday)
21-March-13(Thursday)
26-March-13(Tuesday)
02-April-13(Tuesday)
12-April-13(Wednesday)
15-April-13(Monday) to 20April-13(Saturday)
25-April-13(Thursday)
30-April-13(Tuesday)
27-April-13(Saturday)
04-May-13(Saturday)
29-April-13(Monday) to 06May-13(Monday)
07-May-13(Tuesday) to 31-May13(Friday)
01-June-13 (Saturday) to 15-Jul13(Monday)
“The secret of a good life is to have the right loyalties and hold them in the right scale of values.”― Norman Thomas
(1884 - 1968)