0% found this document useful (0 votes)
27 views40 pages

SNPV 1648281427

The document outlines the examination scheme and distribution of marks for the M.Sc. Computer Science program at Bilaspur Vishwavidyalaya across four semesters. It details the subjects, internal assessments, and total marks for each paper, including both theoretical and practical components. Additionally, it provides an overview of specific course content for selected papers, emphasizing key topics and learning objectives.

Uploaded by

pateldinesh71530
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views40 pages

SNPV 1648281427

The document outlines the examination scheme and distribution of marks for the M.Sc. Computer Science program at Bilaspur Vishwavidyalaya across four semesters. It details the subjects, internal assessments, and total marks for each paper, including both theoretical and practical components. Additionally, it provides an overview of specific course content for selected papers, emphasizing key topics and learning objectives.

Uploaded by

pateldinesh71530
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 40

..

'kghn uaC-drqg{
ndqekjffiaoraq,
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
Rarwg< @w)
@ Qt-€s qqqf,q
M.Sc. COMPUTER SCIENCE

SCHEME OF EXAMINATION & DISTRIBUTION OF MARKS


,SEMESTER - I
'Faper Title of the Paper (s) Nature lnternal Term T-otal
, ,"!){,.ror,
Assessment end lVgrj<q
Exam
1 Digital Elec.tronics and Theory 20 80 100
Microprocessor
2 Advance Computer Network Theory 20 80 100
3 OOPs using JAVA Theory 20 80 100
4 Advanced Operatin g System Theory 20 80 100
Lab-1 Diqital Electronics Practical 100
Lab-2 Javq Programminq Practical 100

- lt
Paper Title of the Paper (s) Nature lnternal Term Total
No. Assessment e!r.d
Exam ffa*s
1 Analysis and Design of Theory 20 89 100
Algorithm
2. Relational Database Theory 20 80 100
.,.,lr,. i.i
Managernent System
,(RDBMg)
3. Data Stmcture usinq C++ Theory 20 80 100
4 Softwar,e Engineering Theory 20 80 100
Lab-1 RDBMS Practical 100
Lab-2 Data Structure usinq C++ Practical 100

SEMESTER.III
Paper Title of the Paper (s) Nature lnternal Term Total
No. Assessment end Marks
Exam
1 Theory of computation and Theory 20 BO 100
compiler design
2 artifi cial intelligence and Theory 20 80 100
expert system
3 soft computing techniques Theory 20 80 100
4 net technology Theory 20 80 100
Lab-'1 MAT LAB Practical 100
Lab-2 Programminq throuqh .NET Practical 100

aILASPUR VISHWAVTDYALAYA, BtLASpUR (CHHAT-fl SGARH)


rwrr'. b i I aspunrn i vcrsity.ac. in
'kghn uanfr-dT-s5
dqekj M+qroq,
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
frarsg3 pu6q*)
ttg qrd-qrq
M.Sc. COMPUTER SCIENCE

SEMESTER - IV
Paper Title of the Paper (s) Nature lnternal Term Total
No. Assessment end Marks
{!t+r;-" ., .,tr ' -",, -r,."ar{.!, '"Exam
Ad Trends And Tech "Iheory.'
1 20 BO 100
ln Com Science
2 ELECTIVE - I Theory 20 80 100
Data Mining and Data
Warehousing

ELECTIVE - II
Computer Graphics and
fi/ultimedia

ELECTIVE - III
Embedded System

ELECTIVE-IV
Network Security & Cryptography
3 Major Project 400

Note: lnternal assessment of 20 marks will consisf.sf two,parts.:.


1. Unit Test (10 Marks): Two tests will be conducted and aveiage of these tests
willbe the marks of ,Unit TeSt.
2. seminar/Assignment (10 Marks): To be conducted by the Department
concerned.

BILASPUR VISHWAVIDYALAYA, BILASPUR (CHHATTISGARH)


wrvw. bi laspu run i versi ty.ac. in

&*
*'

'kghn uafr-du5
ndqekjffi+qraq,
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
frarwgt (udrs,rd,)
ttw{ qr1dffiq
M.SC. COMPUTER SCIENCE

SEMESTER-I
PAPER-I
DIGITAL ELECTRONICS AND MICROPROGESSOR

Nq!g; There wjll be two pails of the question-pap,er; Sec.tion'.Arary$-,-S9qt1g B,


Sgetion A:wititConsistl0 short answer typei (u.esiions/ ObjectivA''qubs'tioii!-of ,l
marks each covering entire syllabus while se'ction B will consist two questions
from each unit of 16 marks each, student has to solve ariy one'from'thdse'tWo
(50% internal choice).

UNIT_I
Evolution of,Digital System & Logic Families
Semiconductor tVlaterials, Types of Solids, lmperfections and lmpur:ities in Solids,
pn Junction Diodes, BJTs and other junction Devices, FET and MOSFET; Digital
Electronic Signals and Switches, Diode and Transistor as a Switch, l-ogic
Families - Significance and Types, Electrical characteristiOs of 'logie families;
Comparison of Different Logic Families.

UNIT-II
BOOlban'concepts and Design of Combinati6nal Circuits
Fundamentals of Logic Gates: AND Gate, OR Gate, lnverter, NAND Gate, NOR
Gate. Boolean Algebra and Simplification Techniques: tntioduction to Btiolean
A[gebra, Simplifiiation Techniques: Sum-of-Products Boolean"'iExprd$$tOns,
Proddct-of-Sums Expressions, Karnaugh Maps for Multi-Output Functions,
Karnaugh Map Method, Karnaugh tUap for Boolean Expressions with a Larger
Nurnber of Variables.

uNtT-ll!
Design of Combinational Circuits
lmple-menting Combinational Circuits using K-Map: Half-Adder, Full Adder, Half-
Subtractor, Full Subtractor, BCD Adder, Design of code converters, comparators
and various Circuits: BCD to excess- 3 code and excess-3 to BCD converters;
Binary to Gray Code and Gray Code to Binary Code converter, One & Two Bit
Comparator, BCD to 7-segment decoder, BCD lo 84-2-1 code converter and
other code converter, Carry Propagation-Look-Ahead Carry Generator,
Multipliers. Design of Multiplexers, Demultiplexers, Decoder and Encoder.

UNIT=IV
Design of Sequential Circuit
lntroduction to sequential circuits: Moore and Mealy machines, lntroduction to
flip-flops like SR, JK, D & T with truth tables, logic diagrams, and timing
relationships, Conversion of Flip-Flops, Excitation table, State tables, and
realization of state stables, Design of shift registers, Counters: Ripple
(Asynchronous) Counter, Synchronous Counter, UP/DOWN Counters, Design of
Different Synchronous Counter using K-Map, Design of sequence generators
and detectors, lntroduction to Programmable Devices, Architecture of PLDs.

BILASPUR VISHWAVIOYALAYA, BILASPUR (CHHATTISGARH)


wwrv. bilaspurun iversity. ac. in
'kghn ual{-iTtHW
ndqekj M+enra-q,
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
frcil-flW pffiflq-6)
tlwq qrfltr-q
M.Sc. COMPUTER SCTENCE

UNIT_V
M icroprocessors System
lntroduction to Microprocessors, Evolution of Microprocessors and family of
microprocessor, Architecture of Microprocessor, [Vlicroprocessor lnstructions,
194i"":,:ing#gQp*.,epg l,"e-t9.si f"b*lotrjtp qIl$e,nory".pitegt" fQg.rgssilg M.s{Q*
lniriiediate Addressin$'Mc,iili, Redisler Direci Rooressihg'rvtb<ie, Rtjgister-indii;ct
Addressing Mode, lndexed Addressing fMode, lmplicit Addressing Mode and
Relative Addressing Mo.de.

Text Books:
1- Digital Electronics, William H. Gothmann, pHl
2. lntroduction to Digital systems,.palmer and- perlman,Tata Mc Graw-Hill
3. A Systematic Appi.oach to.,Digital Design, Fletcher, prentice Hill.
4. DigitalQesign, M,,Mano, pHl
5. Midroproces5ois; Priricipal-and Application, Giihore, Tata Mc Graw-Hill
6- Circuit DeSlgn.and"simulation,with VHDL, V. pedroni, MIT press

Reference Book:
1. Digital Design , Samuel Lee, pearson
2 Il: lntel Microprocessor- Architecture, programming and lnterfacing, Brey,
PHI-
3. lntr:gduction to, Microproc"essor for Engineers and Scientists, Hosh and
Sridhar, PHl.

BILASPUR VISHWAVIDYALAYA, BtLASpUR (CHHATT|SGARHI


wwrx,.Iil65punrn ivcrsity.ac. ilr
'kghn uandqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
ffdrsg{ ffi+erroq, ffdTry Grfrsrra)
+ts qr*ffi-q
M.Sc. COMPUTER'SCIENCE

SEMESTER.I
PAPER{I
ADVANCE COMPUTER NETWORK
Note: There will be two parts of the question paper: Section A and Section B.
Section A will consistl0 short answer-type questionsl Objective questions of 2
marks each covering entire syllabus whiie section B will bonsist iw6'questiond
from each unit of 16 marks each, student has to solve any one from th€se two
(500/o internal choice).

UNIT_I
Basics of Data Communication
lntroduciion to Computer Networks, Network Hardware and Software, OSI
and TCP/IP Reference Models, Network topology ,Data Communications,
Communication System, transmission modes.

UNIT_II
Physical layer and Media
Data and Signal, Transmission lmpairment, Digital and Analog Transmission,
Transmission media: Guided media, Wireless transrnission: Electromagnetic
spectrum, Radio and Micro Waves, lnfrared, Light wave, Spread Spectrum
Systemg, Multiplexing, and Switching: Circuit Switched Network, Datagram
Netwotk, and Virtual Circuit Netwoik.
uNtT-ilt
Data Link Layer
Data link layer design issues: Services, Framing, Error detection and correction,
Enor and flow control, Stop-and-Wait protocol, Sliding Window protocol, HDLC,
Channel allocation: Static and Dynamic allocation, t\Iultiple Access Protocols:
ALOHA, CSMA, Collision-free and limited-contention protocols, Virtual LAN, LAN
and MANs: IEEE Standards for LAN and MAN, High Speed LAN, Bluetooth,
Cellular telephony, Broadband wireless technologies, Wireless LAN,
Transmission in ISDN, Broad Band ISDN , ATM Networks.
UN!T-IV
Upper Layeis
Network Layer: Design lssues in Networks, Routing Algorithms, Congestion
ControlAlgorithms, lnternet Protocol (lP), ICMP, IGMP, Delivery, Forwarding and
routing, IP Address, Need of Subnetting, and lnternetworking, Transport Layer:
Services of transport layer , TCP, UDP and SCTP Protocols, Quality of Service,
Services of presentation layer, Overview of application layer protocol: Telnet,
DNS, SNMP, SMTP, FTP, TFTP, BOOTP, HTTP Protocols, Firewalls.
UNIT-V
Advanced Concept and Network Security
Over View of Cellular Networks, Adhoc Networks, Mobile Adhoc Networks,
Wireless Medium Access Control, Properties of a MANET, Sensor Networks,
Virtual Private Networks, Mobile Network Layer: Mobile lP. Network Security:
Cryptography, Symmetric key and Asymmetric key cryptography, Security
services: Confidentiality, lntegrity and authentication, Digital signature, lP
security.

BTLASPU R VISHWAVTDYALAYA, BtLASpU R (CHHATTTSGARH)


www. bi laspurunivers i ty.ac. in
'kghn ua ndqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
fr-cTrsgq ffi*enoq, fronwgr ftnefere)
@ *trEq qr*ffiq
M.Sc. COMPUTER SCIENCE

Text Books:
1. Data communication and Networ.king, Behrouz A. Forouzan, Tata McGraw-
Hif, Fourth ed.ition, 20-06.
?1 S. T rs..pn
"Ed.q"cqlien,, [nc-.,, -
3. ng the lntemet, James
F
F. Kurose, W.'. Ross; PeArson Education lnc., New Delhi.
4. Data and computer Netwo rk Communication, Firewall Media, Shashi
Manjal,First Edition, 2OO7 .
5. Network security and Management, Brijendra singh, PHI Learning private
limited.
6. CompUtel;N-e,twoqk, Udit Ag a;ryyal; Ehanpat Rai and Co., 20 1 3.
7. Cryptogrdphy and Network Security By William Stallings, 4th Edition Pearson
Publication
8. Deia eorirriiunidatiori's and Networking, wayne fomasi,
iniioduciiqii- to
Pearson Education lnc., NevV Delhi.

201'0:, .,'',;r':.
9. Network Security and Cryptography, Bernard N4enezes, Cengage Learning,
. '

1 riiiiniOation, \ffillidm Sta lin gs, Pea rson Edu cation


I

2 Computer Networks, Nbder F. [\4ir, Pearson Educatibn,


200:7.
3. Data & , Blagk, PHl.
4.
5. , and Prentice Hall lndia.

B]LASPUR VISHWAV|DYALAYA, BILASpUR (CHHATTTSGARH)


www. b i laspurun i vcrs iry. ac. i n
'kghn uandqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
fr-.ilrn$ A friilqw @nre)
tirw qrg*..q
M.Sc. COMPUTERT SCIENCE

SEMESTER{
":PAPER:lll,
OOPb L'SING JAVA

Note: Ther:e.will b ,and.Section,"B.


Sbction A Will qireStions;6f 2
rnaiks each coVerii{g'etiti licons'-t two queslioni
from each unit of 16 marks ent has to solve any ohe fiom these Two
(50% internal choice)

uNlT-l . :' ..
An overview of Java
object-oriented,Piogramming: Glasses, zind ""objects, Variables; constants, and .

Data Types, Prirnitive Data Variable Cbhditional


Statement if, switch r,Glass,"Meth:6ds:
Method Arguments, I super,,' this;
final, static, brd s6b0tss; :liift
Cycle of a Java S;'Polrmorphism ;'Dynamie
methcid dispatch ;' i;' 1'"
r' ;'
i'-ri[-,'rr'? i
UNIT-II | ': , :'

Paekage, Applet, Swing an"d


Packages, lnterfacds; and' 'Abstfact elasses; , Graphic User
lnterface, Event Handling , Applets Using Swing, Error
Handling, Java Exceptions, I JDBC Driver Types.
UN|T-lll
N €twork-socket Programmifl
0,and..f DBC
lntroduction to Collectlons and "lntrbduction to Generics, Java Serialization,
Network Programming, socket Progrimming, and processing E-Mails with Java:
Protocols and Servers, Creating Mailer, Required supporting classes, writing
the Mail Sender, lntroduction to'lVlulti-Threading, Swing'with J-Table: J-Table and
the MVC Paradigm, Remote Fulethod lnvocation (RMl), writing RMI clients,
Finding Remote objects. Java Enterprise Edition overview: JCp, JsR, and other
Acronyms, Tiers of Java EE Applications.
UNIT-IV
Servlet, Ja-va Beans and JNDI
What is Servlet?, Deplolng a Servlet, tnstatling Glass Fish Plug-ln for Eclipse,
creating servlet with Eclipse, Browser-servtet Data Flow, HTTP Get and post
Requests, cookies, server-side http session, Filters, Event Listeners,
Asynchronous servlets. Java Server pages (JSp): Embedding Java code into
HTML, lmplicit JSP Objects, Overview ofihe jSe fags, Directives, Declarations,
Expressions, JavaBeans, JSTL. Developing Web Applications with servlet and
JSP.
UNIT_V
Enterprise JavaBeans (EJB) and other Apls
Overview of EJB, Types of EJB, Stateless and Stateful Session Beans, Singleton
Beans, Deploying EJB, Message-Driven Beans, Timer Service. lntroduction to
the Java Persistence API: Mapping objects to Database Tables, JpeL,
Overview of Spring MVC, lntroduction to Hibernate Framework

BILASPUR V|SHWAV|DYALAYA, BtLASpUR (CHHATTISGARH)


www.bilaspunrniversi ly. ac. i n
'kghn ua ndqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
ffdrflIf MC_orW. fu-dlggq @.fis,r6-)
@ *+E(,qrgmq
M;Sc., COMPIUTER SCIEN C E

Text Books:
Complete Reference - Java, tt"erb-ert Schildt, Tata tVcGraw Hill.
1. Ilg
2. lntroduction to programming:with .IAVA,= A problem Solving Approach
, John
Dean, Raymond Dean, Tata Mc Graw Hill

Hiil,
:i comprellensive version, y. Daniel Lia.pg;

Referen
1. Java F Herbert Schildt, Qale
Skrign,,
t Jp,. Ralph :Fravaco, Shai Simonson,,and

lish ing, l1 suse Pvt, Lt-d-.,

ac-k:Bqok,$-.teyen
F{olzner press.

., ..: .

. -'..,
..:,
.., :

.J-.-.

BILASPUR VISHWAVIDYALAYA, BILASPUR (CHHATTISGARH)


www.b ilaspururiversity. ac. in
'kghn uandqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
frdrs5 ffioroq, R-drsg{ (6ffiW)
ttser qrgtrq
M.Sc. COMPUTER SCIENCE

SEMESTER-I
PAPER.IV
ADVANCED OPERATING SYSTEM

Note: There*will;be two parts of the questiofl papen Section A,and,Section B,


Section A will consiStl0 ShOrt"anSwer type {uestions/ Objeitive questions:-of 2
marks each covering entire syllabus while section B will consist two Questions
from each unit of 16 marks each, student has to solve any one from these two
(50% internal choice).

UNIT-I
Operating System Basics
Processor Registers, lnstruction Execution, lnterrupts, lnterrupts and the
lnstruction Cycle, lnterrupt Processing, Multiple lnterrupts, Multiprogramming,
The Memory Hierarchy, Cache Memory, l1O Communication Techniques,
Programmed l/O, lntemlpt-Driven l/O, Direct Memory Access, Operating System
Objectives and Functions, Types of Operating system.

uNtT--il
Processes and Process Control Strategy
Process States, Process Description, Process scheduling Process Control block,
Execution of the Operating System, Security lssues, Processes and Threads,
Multithreading, Thread Functionality, Windows Thread and SMP Management,
Solaris Thread and SMP Managem,ent,iLinux Process and Thread Management,
Principles of Concunenby;'hIiitiiHl':€iilusion: Hardware Support,
Semaphores,
Monitors, Message Fassing, Principles of Eeadlock, Deadlock Prevention,
Deadlock Avoidance, Deadlock Dbtection, lntegrated Deadlock Strategy.

uNtT-ilt
Memory Management and€cheduling
Memory Partitioning, Paging, Segmentation, swapping, Security Issues. Virtual
Memory concept, Algorithms, ,Locality.and Viilual Memory, Operating System
Software, UNIX and Solaris Memory Management, Linux t\,iemory Manigement,
Windows Memory Management, Types of Professor Scheduling, Scheduling
Aigorithms, Traditional LJNiX Scheduling, Muttiprocessor Scheduling, Real-Time
Scheduling, Linux Scheduling, Windows Scheduling, Process and Thread
Priorities, Multiprocessor Scheduling.

UNIT_IV
l/O Management and File Management
Disk Scheduling, l/O Devices, Organization of the l/O Function, Operating
System Design lssues, l/O Buffering, Disk Scheduling, LINUX l/O, Windows
l/O, File Organization and Access, File Directories, File Sharing, Record
Blocking, Secondary Storage Management, File System Security, UNIX File
Management, LINUX Viftual File System, Windows File System.

BILASPUR VISHWAVIDYALAYA, BILASPUR (CHHATTISGARH)


www.bilaspurun iversi ry.ac. in
'kghn uafr-drqgq
ndqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
M+qrcm. fdamrg{ trdjflre)
ttw qrry.q-
M.Sc. COMpU:rER SCIENcE

UNIT_V
Advance Topics of Operating System
Embedded operating systems, ecos, Tiny os, computer security concepts,
Threats, Attacks, and Assets, lntruders, Malicious Software Overview, Viruses,
-..,,Wot"q,,..Au,thept!Q31i,.-o-tl,a,A"C*ss."Qo4!rgl,.lntrusion
" D-e.teptiqn,*-MalWar.e,e"efe-esB.,,.,,.,:
Dedtins with Briffe"f overflow'Attbckd," oi.tiin,iid6 Fil;;;;t'il;;r;;t#;:
!1oc9ss Migration, Distributed Global states, Distributed Mutual Exau;;;;
Distributed Deadlock.

Text Books:
1. Operating System Concepts, Silbersachatz and Galvin, pearson Education
Pub.
Operating Systems, Madnick E., Donovan J., Tata McGraw Hill,
!.
$ - 9"rsreltassvstelt l, A, s, T..q nn 9 n ba q. -ry1 p, H 1.
Referenqe:goo[a:
1. Operaling Systems lntemats and Design Principle, William Stallings, prentice
HallPublishers
2. operating systems- AConcept-Based Approach, Dhananjay [Vl. Dhamdhere,
McGraw-Hill

',SElll[EST#,R.l,,,,., : ],, :i
.LAB 1.: DIGITAL ELECTRONICS

SEMESTER.I
LAB 2: JAVA PROGRAMMING
LAB Detait
Break-up of 'marks for External Practical
S. o Argu ment Minimum
, 4.,.
Passing Marks
36
1 Lib:R€cord - :20
1 Viva-voce 40
2. Program Development and 40
Execution

Ttital'MarkS '-
100 36

BTLASPUR VISHWAV|DYALAYA, BtLASPUR (CHHATTISGARH)


www.bilaspuruniversiry.ac.in
'kghn uandqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
fr-dug{ fq{-{trqmq, ffidrs5 @)
fiH qrd{r6q
M.Sc. COMPUTER SCIENCE

SEMESTER-II
PAPER-I
ANALYSIS AND DESIGN OF ALGORITHM
Note: Thejre will be two parts of the question paper: Section A and Section B.
'S9eti9n1;$'will consistl0 short answer type qugsti.ons/,Qbjective. questions of 2
marks'each covering entire syllabus Whiie section B wilt tonsist iwo questions
from each unit of 16 marks each,.student has to solv€,,anf sne from these two
(50% internal choice). .

UNIT.I
lntroduction:
Analysis of algorithms, asymptotic notations, Standard notations and common
functions, Recurrence solution: Substitution method, iteration method and the
master method, algorithm design techniques: basic
uNtT-il
Divide and Conquer
Binary search, Min-Max Problem, merge soft, quick sort, and Matrix
Multiplication.
lntroduction to NP-Gompleteness
The class P and NP, Polynomial reduction, NP-completeness problem, Np-Hard
Problems
UNIT-I1I
Graph Atgorithms
Undireeted Giaph, Directed Graph, Traversing Graphs, Representation of
graphs, Breadth-first seareh, Depth-first search, strongly connected components,
topological sort.
String Matching: lntroduction, The narVe string matching algorithm, Rabin-Karp
algorithm, String Matching with finite automata.
UNIT.IV
Greedy Method
Knapsack problem, Huffman codes, job sequencing with deadrines, Minimum
Spanning trees: Prim's and Kruskal's algorithms, Single Source Shortest path:
Dijkstra's algorithm and Bellman Ford algorithms.
UNIT-V
Dynamic Programming
ol1 Knapsack problem, all Pair's shortest paths: warshals and Floyd's
algorithms, Single source shortest paths, Backtracking, Branch and Bound:
Travelling Salesman Problem.

Text Books:
1. lntroduction to Algorithms, T.H.cormen, c.E-Leiserson, R.L.Rivest, and
C.Stein, PHI P\,,t.Ltd./ Pearson Education.
2. computer Algorithms: lntroduction to Design & Analysis, Basse, Addision
Wesley.
3. Fundamental of Computer Algorithm, Horowitz & Sahani, Galgotia.
4. lntroduction to the Design and Analysis of Algorithms, Anany Levitin, Pearson
Education.

BILASPUR VISHWAVIDYALAYA, BILASPUR (CHHATTISGARH)


ww-rv. b i laspurun i versi ry. ac. in
'kghn uandqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
fr-drfl5t ffi-qrorq, fr-drflW 1516)
@ *t.es qrflfiq
M.Sc. COMPUTER SCIENCE

Reference Books:
1. A practical guide to data Structuies and algorithms Using JAVA, Sally
Goldman & Kenneth Goldman, CRC Press
2. Data Structures and Algorithms, V. Aho, J. E. Hopcroft, and J. D. Ullman,
[salssn-Edu"ca{g[b.,*.r"- :]. :?,.r i r":r -., .ri..r ;-,_.".. . -<\q -..-.ta,r.:s{"?:*.rs#"}di:i,;rr;,;,*
Fundamentals of Data structures in Q++.,'E. Horowitz, S.Sahni and Din"esh
Mehta; University Press.

BtLAspuR vtsHwAvtDyAr-AyA, BtLAspuR (cHHATT|SGARH)


www.bi laspuruniversi ty.ac. in
'kghn uandqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
(prfu)
G-drflW M+qraq, fr-om5{
ti-ffi qr.dqmq
M.Sc- COMPUTER SCIENCE

SEMESTER-II
PAPER-II
RELATIONAL DATABASE MANAGEMENT SYSTEM

...,.-,'.:llotet.There will be twoparts of the question. paper.:."Section A.and Section"B,,


Sectlon A will consistl0 short answer type (uesiions/ Obj0ctive questions of 2
rnarks each,covering entire syllabus while section B will:cohsist hrvo'queStibns
from each unit of 16 marks each, student has to solvti an! one from these iwo
(50% internal choice).

UNIT-I
Fundainentals of Relational DBMS
Data f\Iodels, Schemas and lnstances, Data AbstractiOn, Data lndependEnce,
eodd's 12'rules, Overview & Architecture of Commercial.RDBMSs: Oia'cle, SQL
Server, My SQL etc.,

UNIT-II
Entity - Relationship (ER) Model, Relational data model concepts, Database
Language. SQL, SQL Programming Techniques: DDL, DML, DCL query
statements, Constraints and Triggers, Views and lndexes, SQL in Server
Envirenment. Data dependency, Functional dependencies and Normalization of
Relational Databases, First, Second and Third Normal forms, Boyce.Codd
Nonnalform (BCNF),

uNlT-ilt
Trahsaction Processi ng
ACID Properties of Transactions, Concurrency control, Seiializability and
Recoverability, Transaction support in SQL, Locking Techniques, .Time Stamp
ordering, Validation Techniques, Granularity of Data ltems, Database recovery
techniques - Shadow paging, Log Based Recovery. Database Security: Access
control, Statistical Database Security, Deadlock: Detection, Avoidance and
Recovery.

UNIT-IV
Object Model and Object-Oriented Databases
User defined abstract data types and structured types, Subclasses, Super
classes, lnheritance, Specialization and Generalization, Overview of Object
Oriented concepts, Database schema design for OODBMS; OQL, Persistent
programming languages; OODBMS architecture and storage issues;
Transactions and Concunency control, Example of ODBMS, Query processing
and Optimization.

UNIT-V
Parallel and Distributed Databases and Client-Server Architecture
Architectures for parallel databases, Parallel query evaluation; Parallelizing
individual operations, Sorting, Joins; Distributed database concepts, Data
fragmentation, Replication, and allocation techniques for distributed database
design; Query processing in distributed databases; Concurrency control and
Recovery in distributed databases. An overview of Client-Server architecture.

BTLASPUR vISHWAVTDYALAYA, BtLASpUR (CHHATTTSGARH)


w'rvw.bi laspurun iversi ry. ac. i n
'kghn uandqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
|fi.{ru5fqeqf{qrcrq.fr -dTsg(CffiNrq-6)
tte( qrqq-#q
M.Sc. COMPUTER SCIENCE

Text Books:
1. Fundamentals of Database systems, Ramez Elmasri and shamkant B
Navathe, Pearson Education lnc., New Delhi.
2.. .H eary,iE-n*(p rt"h.,al _d. S.
u:
rshdn, du
3. Fundamentals of Database Mariagement systems; ,Mark L. Gillenson, wiley
lndia Pvt. Ltd., New delhi.
4. lntroduction To Database systems, c.J.Date, Longman, pearson Education
Reference Books:
1. A Complete ina, Jeffret D.
Widom, Pearson
2.
.Fet-er,BqF B
Carlos ndia , New
s. Database Systems Using Oracle, Nilesh Shah, PHI Learning Pvt. Ltd., New
Delhi

BILASPUR VISHWAVIDYALAYA BILASPUR (CHHATTTSGARH)


www.bilaspuruniversity. ac. irr
'kghn uafr=drryM*qrrq,
ndqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
ftarwgt (66ffi)
+fs{ qrqffiq
M.Sc. COMPUTER SCIENCE

SEMESTER-II
PAPERJII
DATA STRUCTURE USING C++

--..-ti.r:.:
parts of
'--

(50% internal choice)

uNlr'l
tn(f<iuoction
Data structure, Data types: prirnitive, n on-pr;im[tive data,!yp.qs,. AQf .!lhQe.r end
,
ngp..ljpear data structure, Complexity qn( its N.gt-e!!qp'. Usq"gliuglli!
,i,,,, .,.
Atr;}; '.r'";, .- *'i,".
One ryelsional ?r,!:?ys., allddlatip-n., mblh-odS-,''addiess
r!'i; ji !t1'.i::a:ri'r ; i: ;t:i,f
Doubly r_i!e.ef,,[irt!t
operations (INSERT,
operation ihcJudes - insertion before a given element,
6"!"e,Jp.!a$i qsgyfrsn gt o ivgp
"pggitign, inagrttpn iQ 9,"0{199. ui 71;-11i,.,1'1';

PUS

cg'nversion using stack, Posffix expreggiop gy,q[uqtign


recursion, Stacks in C++ Using Template.s
Queue
lntroduction, and rypes of Queues: Priority eueue, circular queue, Double
Ended Queue, operations (INSERT, DELETE, TRAVERSE), implementation
using array and linked list and applications.

uNrT-lI
Tree
Definition of trees and their types, Binary trees, properties of Binary trees and
lmplementation operation (lnsertion, deletion, searching and traversal atgorithm:
preorder, post order,'in-order traversal), Binary Search rrees, lmplementations,
Threaded trees, AVL Trees, Balanced multi way search trees: 2-3 tree, Red
Black tree, B tree, B+ tree, their applications.

UNIT.IV
Softing
Types of sorting, sequential sort, lnsertion Sort, Bubble sort, euick sort, Merge
sort, Heap sort, Radix sort, complexity analysis of sorting techniques
SEARCHING: Linear or sequential search, Binary search, Hashing, collision
resolution methods.

aTLASPUR VtSHWAV|DYALAYA BtLASpUR (CHHATTTSGARH)


www-bilaspuruniversi ry.ac. in
'kghn uakdmgs
ndqekjffiqTilq.
iVsy fo'ofo|ky;
fd-drs5
jk;x<+ ¼N-x-½
@srr6)
@ *frtqr, qtwm-fr
M.Sc.,GOMPUTERcSGIENCE

UNIT-V
Graph
cy and incident

Text Boo k:
1. Data using C, A. M. Tenenbaum, Langsam, Nrloshe J. Augentem

T,p, UJlmaI],

of comp

, :i oni:.l,4ri'1ii;r:tl., ii*",:,''i.',i,,,,: S rr: t:;i*{ il'::t,;r.*;{,..;

of "O'ata SirutluiE!, Jr. Symour 'Lipschetz, Schbum's

algerithrns appioach , Jean Ptiiil


::i.iirY:l:!

cdtinri;'2093;
4.
5. Data Struetures, schaumf s Outllnes,
i:..'

BILASPUR.VISHWAVIDYALAYA, BILASPUR (CHHATTISGARH)


www.bilaspuruniversify.ac. in
'kghn uafudrs$
ndqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
ffi{€nf,q, ftarwgt (6ffifl.t-E)
fiT* qrdffi
M.Sc. CoMPUTER SCIENCE

SEMESTER{I
PAPERJV

Note: ir'",." wi, be *" ;'*::Tffi=r:I:ITI'Jlsu"tion A and section B


Section"A will .congiqtl0 9!grt ahswei tyjrt,;g1reg.,U.o!lg{_,g,bjeg{yp ,ggestigpS ,O.f ?:
marks each coveririg entiie syllabus'while section B will'tbnsigt hrup qrlestions
from each unit of 16 marks each, student has to solve any one frorn these two
(50% internal choice).
UNIT-I
Fundamentals of Software Engineering and ProceEs models
Software .mythS, Software engineering- A y, Software
Developrnent Life Cycle, Capability Maturity Model Model
CMM, Process models: waterfall model, process models,
Evofqtionary process modefs, Softwa.re Reqglrer.ngnls: Funcfional an.d non-
func[ional requirements, User requirements, System requirements, lnterface
specification, software requirements document.
UNIT-!I
S/W' Requirements and Design Engineering
Feasibility studies, Requirements elicitation and analysis, Requirements
validation, Requirements management, System models: Context Models,
Behavioral models, Data models, Object models, Design process and Design
quality, Design concepts, the design model, software ar6hitecture, Fundamenial
issues in softwaie design: Goodness of design, cohesions, coupling. Function-
oriented design: structured analysis and design.
uNrT-rlt
Testing Strategies and Product metrics
A strategic approach to softuiare testing, test strategies for conventional
software, Black-Box and White-tsox testing, Validation testing, System testing,
the art of Debugging, Software Quality, Metrics for Analysis Model, Metrics for
Design Model, Metrics for source code, Metrics for testing, tMetrics for
maintenance.
UNIT-IV
Testing Plan and Maintenance
Snooping for information, Coping with complexity through teaming, Testing plan
focus areas, Testing for recoverability, Planning for troubles, Preparing for the
tests: Software Reuse, Developing good test programs , Data corruption, Tools,
Test Execution ,Testing with a virtual computer, Simulation and.Prototypes,
Managing the Test, Customer's role in testing, Software maintenance issues and
tech niques. Software reuse. Client-Server software development.
UNIT-V
Software Reengineering and Project Management
Software Reengineering, Evolution of Software Economics, Life Cycle Phases
and Process artifacts, Model based software architectures, Software process
workflows, lteration worKlows, Major milestones, Minor milestones, Periodic
status assessments, Process Planning, Project Control and process
instrumentation: Seven core metrics, management indicators, quality indicators,
life-cycle expectati ons

BILASPUR VtSHWAV|DYALAYA, BtLASpUR (CHHATTTSGARH)


rvww.bi I aspuruni versi ry.ac. in
'kghn uafd-drss
ndqekjfe{sBeT-f,q,
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
kilFug( Cffi ifl _6)
ttser qrqgfiq
M.Sc. COMPUTER SCTENCE

Text Books:
1- Fundamentals of Software Engineer:ing, Rajib Mall, pHl Learning pvt. Ltd.
2. Software Engineering, lanSomeryille, Pearson Education lnc., New Delhi.
3- Software Engineering: A Practitioner's Approach, Roger S. Pressman, Tata
:r, --*. . ,-McGr?w:Hill ., +r.;:i.. , ._, . ..&. .,r , i, 4,1] !Fl,;, .i:]-...-,r.. "_
4- softlware Projg$ Managdment, watker Rbyce, pearson Education.
Reference gooks:
1. Software Engineering, Shari Lawrence Pfleeger, Joanne M. Atlee, pearson
Education, lnc. New Delhi.
2. Software
.tn{ia Pvt. Ltd., New Delhi.
3. gel lndia Pvt. Ltd., New Delhi.
4. Pearson Education.
5. Mike Cotterell, fourth edition,
.!n.---. ,&]4*;;--,.,. _

6.Ap Project Mqnad6meni;-ffiAiew Sieiii'ian & Jennifer creene,

BILASPUR VISHWAVIDYALAYA, BILASPUR (CHHATTISGARH)


www.bi laspuruniversity.ac. in
'kghn uanR-drflW
dqekj ffi+qroq,
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
frarsgt (grdsrr-d-)
@ +tg qr.dffiq
M.Sc. COMPUTER SCIENCE

SEMESTER.II
LAB 1: RDBMS

SEMESTER-II
LAB 2: DATA STRUCTURE

Break-up of marks for External Practical Examination


S. No. Argument '
'l\4aximum
Minimum
Marks Passing Marks
36
1 Lab Reeord 20

1 Viva-voce 40
2 Program Development qqd 4:o
Execution
TbtalMaikE 100 36

BILASPUR VISHWAVIDYALAYA, BILASPUR (CHHATTISGARH)


www.bilaspuruniversity-ac. in
'kghn uanfd-drry
dqekj ffi-eTdq,
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
fran-ugr @)
tlw vr-gtrq
M.Sc. cOMPUTER SCTENCE

SEMESTER.III

rHEoRy oF coMpur^T8fiTlio DESTGN


"o*"tLER
'If$:,'^r'!ff"rfl,lll!.9,,ry9 pE,rts"Pl,the.queqtisp.pflper:"Section A and sgqtion wil
conslst 1u snort dhSwer typ6"questions/Objective questions bi 2 'marks Q
each
covering entire syllabus while section B will tonsist two question
from each unit
of 16 marks each, student has to solve any one from these two (50% internal
choice).

UNIT.I
AND LANG,UAGES
ction, Finite Automata (FA), Deterministic Finite
iq.tiq Finite Automata (NFA). Regular Express.ion,
FAa Proving languages not to be regular, Closure
properties of regtrlai languages, Equivalence and
minimization of Automata_
UNIT-II
CONTEXT LANGUAGES
Context-Free Trees, Ambiguity in grammars and
languaggs qu(-o.;nata, Languages
of a pushdown
Autcimata, of Pu automata and CFG, Detemtinistic
Pushdown

UNILII
IRoPETTIES'QF e ONTE!ff -FREE LANGUAGES, UN DEqDABAL|TY
Norrnal forms for cFG, pumping Lemma for cFL, crosure-effiIiei
of crl,
Turing Machines, A languqge trit is not Recursivery Enumerabre (RE),
An Un-
decidable.problern that is RE, un-decidabre probrems auout ruring
Machine,
Post's Correspondence problem.

UNIT.IV
INTRODUCTION TO COMPTLING & SYNTAX ANALYSIS
c_ompilers - Analygis.of.the source program, phases of a
compiler, compiler
c-onstruction tools Lexical anatysis , Role-of lexical analyzer,Role
of in" puir"r,
writing grammars, c9nlgxt free .grammars ,Top down parsing, Bottom-up
parsihQ, shift reduce'iiarsihE, opeLtor precedence parsing,
LR parsers , sLR
parser.

UNIT.V
CODE GENERATION & OPTIMIZATTON, RUN TIME ENVIRONMENTS
lssues in the.design-of code:generation,,Basic blocks and flow g'aphs,
A simple
code generator - DAG representation of basic blocks, peephole'opiimization.
Principal sources of optimization,'Optimization of basic blocks,
lntroduction to
global data flow analysis, Runtime environments.

Text Books:
1- J.E. Hopcroft, R. Motwani and J.D. Ullman, .,lntroduction to Automata
Theory, Languages and computations", second Edition, pearson
Education,

al!_AspuR vrsHwAvtDYALAYA BtLASPUR (CHHATTTSGARH)


wrvw. bila spunur i vers i ty. ac. i n
'kghn ua ndqekj iVsy fo'ofo|ky;
fti{rsg3ffiqroq. jk;x<+ ¼N-x-½
furflW (tfu)
@ fuqrd-{#"q
M.Sc. COMPUTER SCIENCE

2OO7 .2. J. tMartin, "lntroduction to Ldnguales and the Theory of


computation" Third Edition, Tata N4c Graw Hill, 2007
2. Principles of Compiler Desi$n'by Aho,'D, Ullman, Lam and Ravi Sethi,
Pearson Education.
3. Alfred Ahgr.Ravi.Selhi6nd.Ullmap,.JiD,,;lCompilers Pr:inciples, Techniques
and Torils", Pearson Education, 2003.

Reference Books:
'1. Theory of Computing by K L P Mishra, S.Chandrashekran Pub.
2. Compiler Design, A.A. Pentambekar, Technical Publications.

BILASPUR VISHWAVIOYALAYA BILASPUR (CHHATTISGARH)


www.b i I aspumn i versi ty.ac. i n
'kghn uan dqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
fd-drfl gSfr sqP{qrdq.ft -dTfl g{(Edsat_6)
*twq qr-fl#q
M.Sc. COMPUTER SCiENCE

SEMFSTER-ilt
PAPERJ1
ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEM
Note: There will be two parts of the question paper: Section A and Section-B will
ce{!$i!1q pach,
,19"-qhq(,4{rsye1,,typ"9r,QUe,stigps{obje,ctive qqestiqfs.,g.f .2 mg-rfis
coVering entire syllabus While sectioii B will consist two questicih'fiom each ufiit
of 16 marks each, student has to solve any one from these two (50% internal
choice).

UNIT_I
Fundamentats of Artificial tntelligence
lntroduction to Al, lntelligent Agents: Agents and Environments, Al Technique-s,
'Al,
Foundations.of A.[., History of Ar6as and state of the art in A.1., Knowledge:
lntroduction, Knowledge Based system Definition of Knowledge and Knowledge
REFESenhtioh,-EX6rflFIE5"bT Seeidh Problbms, Defining the Probilbin dS a Sta'G
space search, Uninformed Search rechniques- DFS, BFS, Best-First search, A*
Algorithm, Problem Reduetion, Ao*Algorithm, constrained satisfaction
Problems: Various CSP problems,.

uNtT-il
Sy,mhotic and,Stru ctu red Represe ntations of Knowted ge
Kitotivledge Representation: Procedural Vs Declarative Knowledge,
Repr.esentations & Approaches to Knowledge Representation, Frarire,
conceptuii.l dependency ,. s€rnantic Net ,scripts etc. Forward vs Backward
Reasoning. Symbolic Logic: Propositional Logic, First Order Predicate Logic:
R'epresenting lnstanbe and is-a Relationships, computable Functions and
Predicates; Syntax & Semantics of FOPL.

uNlT-il
A.l. Programming languages
lntroduction to LISP ,Basic list manipulation functions, Predicate function ,l-ogical
function ,lnpuUoutput and local variables, Lists and Arrays, simple program in
LISP , lntroduction to PROLOG

UNIT-IV
Natural Language Processing and Planning
Natural Language Processing: Role of Knowledge in Language Understanding,
Approaches Natural ldnguege "Undeistanding, Steps in Natural LaniTuage
Processing, Syntactic Processing and Augmented Transition Nets, Sernantic
Analysis, NLP Under:standing Systems; Planning: Components of a planning
System, Goal Stack Planning, Hierarchical Planning, Partial Order Planning,
Hierarchical Planning, Conditional Planning, Reactive Systems.

UNIT.V
Experts Systems
overview of an Expert system, structure of ah Expert systems, Different Types
of Expert Systems- Rule Based, Model Based, Non-Production System
Architecture, Case Based and Hybrid Expert Systems, Knowledge Acquisition
and Validation Techniques, Black Board Architecture, Knowledge Building
System Tools.

BILASPUR VISHWAVIDYALAYA, BILASPUR (CHHATTISGAP.H)


wrvw. bi laspurun ivcrsi ry. ac. i n
'kghn kcn$W
uandqekjffiqroq,
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
Rarsgf @irra-)
@ fiH
M.Sc. COMPUTER SCIENCE
qrg*,.q

Text Book:
1. Dan W. Patterson, lntrodurition tci Artifieial Intelligence and Expert Systems,
PHI Publication.- '

2:,Ra limited;
,. i.
3.V Foundati s of Artificial
in Computer Science.
4. Artificial lntelligence: A [Vlodern Approach, Stuart Russell and Peter Norvig,
Pearson Publication.
5. Principles of Artificial lntelligence, Nils J. Nilsson, Narosa Publication.
6. Arlifi cial'lntelligence," Elaine Rich,,(6y1n rKnight, Tata McGraw Hill.

Reference Books:
1. Al-structures and Strategies for Comptex Problem Solving, George Lugar,
PearsonEducations:,, . . .

2. Artifie[al.htelliggngF,.n"anaEBginee.rjng,approash; Roterd J. Schalkolf, McGraw


Hitl. ,,.
3. rArtificial'krtblligence;rP{ri'e}crkl,,,,lAliribton;,3rdr,edjtion, Pearson Educations.
4.,Deeision Sqppoft6yst€ifn*:ditdJlntelli$ent:Systems, Efraim Turban Jay E.
' Aronson;{Pl'l!i,:: :'l:tli :'.li}:!;; :r
rr'"*':?ir:';}ii'' ;i -' -
5. Artificial'lntelligEridb -ASyStem'.'i{ppfoach, tM. Tim Jones, lnfinity Science
Press - Firewall MEDIA.

BILASPUR VISHWAVIDYALAYA5 BILASPUR (CHHATTISGARH)


www. bi laspunrn i versi ry.ac. i n
'kghn uanffdts5
dqekj fdroPfqrdq.
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
frdrggr (5ffisq_6)
tlwq qrd,{m-rff
M.Sc. COMPUTER SCIENCE

SEMESTER-III
PAPER.III
SOFT COMPUTING TECHN lQUes
Note paper : Section A and Section B.will
1

student aS any
choic,e.),

UNIT-I
tnlroduction ,.,.,, . , .

W[at"i-s.soft computing? Differen[,toolg..g[,sgft,_eonrputing i!9 qomparisop;


-aq{"
area of application.

euial'Network
is a neural

Supelvised and

,Hop{ie[d,nqtq1orks, d:rE*aMes,
etc. .{ v 1.;;, il!.- , , \
".tt

uNtT-ilt
Fuzzy.Logic
lntroduction to classical sets & Fuzzy sets, Membership Fu4ction, a-cgts,
Propertiei of a-cuts, Decomposition, Theor"ri, dt"n;io; ilin"ipi", op"Lio:n"
on Fuzzy Sets: Cornp.lirnent, lntersections, Unions, Combinations of eperations,
lggreOation Operations, Fuzzy Arithmetic: FuzzylNurnberc, Linguistic'Variables
-,Apptications
luizy Relations: crisp & Fuzzy Relations, Fuizy Measures,
Fuzzy Logic.
of

UNIT-IV
G,,eir,e ti c,A I gorit h m
wilat ib opiiiiiization? tntioduction, ABplication, GA operato6: selection,
croSsover and mutation, different techniques of selection, crossover and
mutation, different types of chromosomes: Binary chromosome, etc., Basic GA
and its variations, Application of Genetic algorithm,

UNIT-V
Hybrid soft commuting:
Design of Neuro-Fuzzy model like ANFls, Neuro-Genetic, Fuzy-Genetic Neuro-
Fuzzy-Genetic model and experiments with MATLAB.

Text Books:
1. Uncertain rule-based fuzzy logic systems: lntroduction and new directions by
Jerry M.lVlendel, Prentic Hall of lndia.

BTLASPUR VISHWAV|DYALAYA, BtLASpUR (CHHATTTSGARH)


' www.bilaspuruniversify.ac.in
'kghn ua ndqekjM+qrorq.
fd-dtqg3 iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
ftamg3 (trffi sl-6-)
ttw qrd{o-q
M.Sc. cOMPUTER SCIENCE

2. lntelligent hybrid System: Neural Network, Fuzzy Logic and Genetic Algorithm
by Da Ruan, Kluwer Academics publishers
3. Neural Network, Fuzzy logic and Genetic Algorithm: Synthesis and application
by'S, RajShekhrah and G.A. Vijiiy Laxmi, PFil pubtication
'4';Firy!.l6gic,wittr enginedring applications by Timothyd;Ross; Wiley Publication
5. Neural netwofi by Simon Haykins: Prentice Hall of lndia
6. Fuzzy Sets, Uncertainty & lnformation, G.J.Klir & T.A. Folyger, pHl.
7. Fuzzy sets & Fuzzy logic, G.J.Klir & B.yuan, pHl.

Reference Books:
1. Art[ficial ne.qral netwrcirks, B.Vegnanarayana prentice Halll of tndia p Ltd.
2. Neural networks in Computer intelligencc, Li Min Fu, TMH.
3. l)ilg.qrqlr.rre,.{y,,g,r:ks,.J4mes A Fr,eeman & David M S kapura, pearson eduqtig4.

BTLASPUR VtSHWAV|DYALAYA, BtLASPUR (CHHATTTSGARH)


www. bilaspuruniversity.ac. in
'kghn uanft-drqg{
dqekj iVs y fo'ofo|ky; jk;x<+ ¼N-x-½
ftwft-qrf,q, ftenry @)
ttsx qr-.irumq
M.Sc. COMPUTER SCIENCE

SEMESTER{II
PAPER-.IV
.NET TECHNOLOGY
Note: There will be two parts of the question paper: Section A and Section B will
990sE-t.,1,q" Shgr{,'enFWer- typ e. .q ue-sjion q u gnlip
RP,,qtt&Barks leeeh
covering entire syllabus while section B will two question from each unit
of 16 ma rks each, student has to solve any one from these two (50% internal
choice).
uNtT-t
.Net Framework and C#.NET
lntroduction to .NET Technology, .NET F Com of .N ET CLR
and Class Library lmportance of MSIL, to
ViSual Studio.NET, lDE, lVenu Bar, , Inside
aC# Pr6gram, Data Types ClaSies
and Structs, Properti es, lnh mespaces,
Generics, Collections and Data Structures, Exception Handling, Threading,
Using Streams and Files, Reflection, Assembl ies, versioning, Windows Forms,
Controls.

UNIT-II
Programming with VB.NET
The structure of VB.NET and control structures, VB.NET Variables, vB.NET
operators, control Statements, working with fgrms, GUI with windows forms,
Working with Menu, Loops, Validation, Sub Procedures and Functions, Multiple
Forrns, Form controls, File Handling, Exception Handling, working with
Databases, Advanced Database programmihg using ADo.net, classes,
Generics, Collections, lnheritance.

uNtT-ilt
A'sP.NET: lntroduction to ASP.NET, working with web and HTML controls,
Using Rich Server Controls, Login controls, Ovenriew of ASP.NET Validation
Controls, Using the Simple Validations, Using the Complex Validates Accessing
Data using ADO.NET, Using the complex Validates Accessing Data using
ADO.NET, configuration overview. Themes and Master pages: creating a
consistent web site, ASP.NET 2.0 Themes - Master pages, Displaying Data
with the Grid View Control lntroducing the Grid View Controt, Filter Data in the
Grid View control, Allow users to select from a Drop Down List in the Grid, Add
a Hyperlink to the Grid, Deleting a Row and Handling Errors.

UNIT.IV
Database Handling with .NET Technology
How to consume a web service from an ASP.NET page,,Web services accessing
database, sQL connect, sQL command, Data Access with LrNe to sel :
Automatic Properties, creating LlNe to SeL Entities, performing standard
database commands with LINQ to sQL, performing validation; Navigation
Controls: Understanding Site lMaps, Site lVap Path Control, Formatting the Site
Map Path control, [Vlenu control, Tree View control; Login control s,
Authenticated Users, change Password contlo-1, Tqmplates with password
Recovery Control, Caching Application pages and Data.

atLAspuR vtsHwAvtoyALAyA, BtLASpUR (CHHATTTSGARH)


www. bi laspuruniversi ry.ac.in
'kghn uanf{ilrry
dqekj ffienaq,
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
furwgt @irrrq)
@ fiEr qr.dq#q
M.Sc. COMPUTER SCIENCE

UNIT-V
Advanced Applications in .NET Framework
XML web Services: Setting web tvethod Attribute, setting web services
Attribute, lnvoking an XML web service with HTTP-Get, HTTp-post & soAp,
Xfl!! Wgb Services .Behavior, AJAX(Asynchronous JavaScript and XM!): .Seruer
side & client side Ajax, Ajax Toolkit, Setting up and implementing Ajax, sel
Seryer Administration: Setup Database server of a website, Converting data
between MDF to DBo,DBo to XLS or in any other format, Backup and Restore
of data, FTP Management, Sending Emails, Designing email panel, How to send
an email to various users, Sending auto emails

Text Books:
1. Professional Visual Studio 2013, Bruce Johnson, Wrox Publication
2. Begjnning ASP.NET 4.5.1: in C# and VB, lmar Spaanjaars, Wrsx
, . P06libation
g; lpidfessional C# 5,0 and .NET 4.5.1, Christian Nagel, Jay Glynn, Morgan
Skinner, Wrox Publication
4. Pro ASP.NET 3.5 in c# 2008, Matthew MacDonald and Mario szpuszta,
Wrox Publication
5. Pro ASP.NET MVC 3 Framework, Adam Freeman; Steven Sanderson,
Apress
6. PiofessionalASP.NET IMVC 3, Jon Galloway; Phil Haack; Brad wilson; K.
Scott.Allen, Wrox
7. The Complete reference, ASP.NET, M M Donald, TMH

Reference Books:
1. Pro ASP.NET 4 in C# 2010, lVatthew MacDonald; Adam Freeman; Mario
Szpuszta, Apress
2. Microsoft@ ASP.NET 4 step by step, George shepherd, Microsoft press
3. Programming Microsoft@ ASP.NET 4, Dino Esposito, Microsoft press

BILASPUR VISHWAVIDYALAYA BILASPUR (CHHATTISGARH)


www. bilaspuruni vcrsity.ac. in
'kghn uafd-drqg{
ndqekjM{qrrq,
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
Garsgq @s-rd-)
@ tts qqrr.f,q
M.Sc- COMPUTER SCIENCE

SEMESTER.ITI
LAB.1
MAT LAB

,,..--{,?!j**- i: -r
.}-1.

LAB.2
PROGRAMMING THROUGH .NET

The break-up of marks for Practical will be as under :


Sr. No. Ar$ument Maximum ,4!i,i.i,a*n
Marks Passinq,Marks
1 Lab Record 2A
2 Viva-voce 40
3 Program Development and 40
Execution
Total [\iarks 100 36

BTLASPUR VtSHWAV|DYALAYA BtLASpUR (CHHATTTSGARH)


www. bilaspurunivcrsi ty.ac. in
'kghn fd-drflg(
uandqefreqfuqrf,q,
kj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
franwgt (udrsl-d)
*i-€{ qr.irffiq
M.Sc. COMPUTER SCIENCE

SEMESTER.!V
PAPER-I
ADVANCED TRENDS AND TECHNOLOGY IN COMPUTER SCIENCE

Note: There will be two parts of the question paper: Section A and Section B will
consist 10 short answer type questions/Objective questions of 2 markS.each
covering entire syllabus while section B will consist two question from eaeh unit
of 16 maiks each, student has to solve any one from these two (500/o ihtei'hzil
choice).

UNIT-I
Big Data Analytics
Big Data Analytics Applications, Product Selection, Design and Engineering,
Location.Based Services, Online Advertising, Architecture Gomponents:
Massively Parallel Processing (MPP) Platforms, Unstructured Data Analytics and
Rqp.orling:'rSearch and Count, Context-Sensitive and Dornain'Specific SFar:ehes,
Catdgories and Ontology, Qualitative Comparisons, Data Privacy Protection,
Reaf.-Time Adaptive Analytics and Decision Engines, lmplemen[glion of'Big,D-3ta.

UNIT_!I
Gtbud Computing
.and the
Qlqud Gomputing Overview, Applications, lntranets
Computing Services, Business Applications and Examplgqo
Datacenter , Benefits & Limitations of Cloud Computing,
Platforms, Web Ap plications, Web APls, Web Browsers,. ,
Overview, Cloud Storage Providers, Standards - Applicalion,.
I nffastructu re, Servi ce

UNIT-III
Grid Computing
Grid Architecture and Service modeling, Grid resource mana.gemen!, Grid
Application trends, Characterization of Grids, Organizatigns and their RoleS, Grid
Computing Road fi/aps, Grid t\4onitoring Architecture (GMA) - An Overview of
Grid Monitoring Systems. Grid Middleware: List of globally available Middle
wares.

UNIT-IV
Cluster Gomputing
Role of Clusters, Definition and Taxonomy Of Parallel Computing, Hardware
System Structure, Node Software, Cluster Planning, Architecture , Node
Hardware and Node Software, Design Decisions, Network Hardware: lnternet
technologies, Ethernet, System Access Models, Assigning Names, Node
Software, Cluster Workload Management Activities, Queuing, scheduling and
monitoring, Virtualization technologies.

UNIT-V
Pervasive Computing
lntroduction: Pervasive Computing, Evolution of Pervasive Computing, Pervasive
Computing Principles, Pervasive Computing Characteristics, Pervasive

BTLASPUR VtSHWAV|OYALAYA, BtLASpUR (CHHATTISGARHI


r',"lyw. b i la spu run ivers i ty. ac. i n
'kghn fddrflg{
uandqekj iVsy fo'ofo|ky;
Mcmoq, jk;x<+ ¼N-x-½
Rarwgv (3idf€'r6,)
ttsqrqqm-q
M.Sc. COMPUTER SCIENCE

lnformation Technology, And Pervasive Architecture: Background, Scalability


and Availability, Pervasive Web Application Architecture, lmplementation lssues,
Pervasive Devices: Device Categories, Device Characteristics, and Software
Components in the Device, Information Access Devices, Smart ldentification and
Eql.hedded Qontfpls,,P.e{v?Qive Applicati,qpS.; ,: ;, {\}.:r :..i .,-. _ ..-..,.
Text Books:
1. Big Data Analytics: Disruptive Technorogies for changing the Game, Dr.
Arvind Sathi, IBM Corp.
2. tMining of Massive Datasets, Anand Rajarama, Jure Leskovec, and Jeffrey D.
Ullman. E-book,2013.
3.
lloud computing-A PracticalApproach, Anthony T. Velte, Toby J. velte,
Robert Elsenp Mc Graw Hill.
+. 9":id e,gmpUting,,Joshy Joseph and C_raig E_ellens,te.in,-pear-son EduEatisn_,_
2004.
5. The Grid core Technologies, Maozhen Li, Mark Baker, John wiley-and.sons,
2905.
6. Beowulf.cluster Gbmputing with Linux;'william Gropp, Ewing Lusk, Thomas
Steiling; MIT press,
-rrr -"-'
7. Pervasive computing: The Mobile world, Uwe Hansmann, Lothar Merk;
B. Pervasive : Technolsgy And Architecture Of Mobile:hiteinet: , , ,,
Bu.rkhartJt ; HdrStrHdnn , StefanrHeppel. , Klaus Rindtorff

,Cory OUtinS,'K.
G-doffrriy C:Fox an d Jdik' J :Bon(iiia,

1. Big Data lmperatives, soumendra Nlohanty, Madhu Jagadeesh,''H.'srivatsa,:


Apress, e-book o'f 2O12.
2.. Grid computing: Making the GIobal lnfrastructure a reality, Fran Bermdn,
GeoffreyFox,AnthonyJ.G.Hey,JohnWileyandsons.
3. ln $earc[olc_]yslers: The ongolng.bq!![e in [owty Pai.ailetcomputing,
Gregory F. P Fi3ter, Prentice Hall pubiishing Company.

BILASPUR VISHWAVIDYALAYA BILASPUR (CHHATTISGARH)


u.rrw.bilaspurunivcrsity. ac. in
'kghn uandqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
flf,iil'q5 ffi+qraq, ftarugt Greq-c)
t+€{ qr.dffiq
M.Sc. COMPUTER SCIENCE

SEMESTER.IV
PAPER - II
ELECTIVE.I
DATA MINING AND DATA WAREHOUSING
Unit -|
lntrodtidtion.toDataMihingandDatawarehouse
lntr:odUction: :Fundamentals of data mining, Data Mining'''Ftinctiohalities,
Classification of Data Mining systems, Data Mining Task Primitiv6s; lntegtbtion of
a Data Nlining System with a Database or a Data Warehouse System, fulajor
issues in Data Mining. Data Preprocessing: Data Cleaning, Data:lnt€gration'antJ
'
Transformation, Data Reduction. ''':
OLAP (Online Analytical Processing)
Ddta,*drehouse and OI:AP Technology 'for Data Mining:,iData W,Hrehouse,
fulultidimensional Data Model, Data warehouse Architeat$deii:Data:'warbhouse
lmplementat[on, Further Development of Data Cube Technologyl From Data
Warehousing to Data Mining Data Cube Computation and DatalGdhe'rdlization:
Efficient Methods for Data.Cube Computation, Further'D6ve6p"merit.:6f Data
CubeandoLAPTechnology,Attribute-orientedlnduction. - - -i'. il'-.!1
Unit -!ll
Associations and Classification
Mining Frequent Patterns, Associations and Correlations: Basic Concepts,
Efficient and Scalable Frequent ltem set Mining t\rlethods, Mining various kinds of
Association Rules, From Association Mining to Correlation Anatysis, Constiaint-
Based Association Mining, Classification and Prediction: lssues Regarding
Classification and Prediction, Classification qy Decision Tree lnduction, Bayesian
Classification, Rule-Based Classification, Classification by Back propagation,
Prediction, Accuracy and Error measures, Evaluating the.accuracy of a Classifier
or a Predictor, Ensemble Methods.
Unit -lV
Cluster Analysis and Sequence
Cluster Analysis lntroduction :Types of Data in Cluster Analysis, A Gategorization
of Major Clustering lVethods, Parlitioning Methods, Hierarchical Methods,
Density-t!s5s6 Methods, Grid-Based Methods, Model-Based Clustering
Methods, Clustering High-Dimensional Data, Constraint-Based Cluster Analysis,
Outlier Analysis. Mining Streams, Time Series and Sequence Data: Mining Data
Streams, Mining Time-Series Data, Mining Sequence Patterns in Transactional
Databases, Mining Sequence Patterns in Biological Data, Graph Mining, Social
Network Analysis and Multi-relational Data Mining.
Unit -V
Application Areas
Mining Object, Spatial, Multimedia, Text and Web Data: Multidimensional
Analysis and Descriptive Mining of Complex Data Objects, Spatial Data Mining,
Multimedia Data Mining, Text Mining, l/ining the World Wide Web, Applications
and Trends in Data Mining: Data Mining Applications, Data Mining System
Products and Research Prototypes, Additional Themes on Data Mining and
Social lmpacts of Data lMining.

BILASPUR VISHWAVIDYALAYA, BILASPUR (CHHAfi ISGARH}


rvtrv.bi l asptr run ivcrsi ry. ac. i n
'kghn ua ndqekjM+qraq.
frdrflg{ iVsy fo'ofo|ky;
CEIwgv
jk;x<+ ¼N-x-½
- @sl_B)
rther qrcrqmlr
M.Sc. COMPUTER,SCTENCE

Text Books:
1. Data lvining-concepts & Techniques, J. Han & IVl. Kamber, Morgan
Kaufmann Pub. :
2. lntr:oduction.to ,Data Mining, p. N. Tan, M. steinbach & Vipin Kumar,
Pe.crsg!...p"dUggliqn. ..;\,.,.,;:....{.}::;.:,.,,,.
...: r::* ,
3. Data Mining'Tebnniques::-Arun.Kpujarj,.2nd.edition, Unirrersities pr6ss.-.
4. Data warehousing in the Rear world Sam Aanhory & Dennis ntrrry -
,Pear,SpnrE.dh: : ..
.. ,, t :, . - .

':.:l:'-.. 1.,...., :'.


Refere
I , K.P.Soman, S.Diwakar:, V.Ajay;: PHl, 2008,
2 Da"tq Fundamentals Paulraj Ponnaiah Wiley $tudent
Editib n
3. Toplcs, ;Mg rg. gge-!,,HlD EJlhgllr*
,i'i.i .-!;,... l:; tr,. i
:t,. ,.: i ..;,
"
Mioiirg ;::Pbvid,rHand, Heikki Manila,.Padhraie Syrnth,
.:. 1' ,;: " r'
15.
rWiley;2003.
6. ,,. Alex Bezon; Stephen,.€mrith,

BILASPUR VISHWAVIoYALAYA, BtLASpUR (CH HATTTSGARH)


www. bi I aspuruniversi ry. ac. in
'kghn uafr-ffT5
ndqekjffi1a-q,
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
Gsrsgq (6ffiqq-d)
tts
M.Sc. COMPUTER SCIENCE

SEMESTER - IV
PAPER.II
ELECTIVE.II
COMPUTER GRAPI,IICS AND MULTIMEDIA

Unit-l :

An lntroduction Graphics Systgm


Computer Giaphics 'Fundamentals; Applieation of Computer Gr:aphics, Video
Display Devices, Raster & Random Scan Systems, lnput Devices, Graphics
Software, lnteractive devices, Output Primitives, Line Drawing & Circle
Generating Algorithms, Scan-Line Polygon Fill Algorithm, lnside-Outside tests,
Boundary-Fill Algorithm, Flood Fill Algorithm.

Unit-l!
2D Tr.ansformations
2-D Viewing and Clipping: Viewing Transformations; Point Clipping & Line
Clipping Algorithms, Polygon Clipping algorithms, 2D 'Geometric
Transformations: Basic transformations (Translation, Rotation, ScalinQ),' Matrix
Representation &'Homogen'b'ous Coordinates, Composite tranSformations,
Reflection and Shear.

Unit-lll
3D transformations
3D Viewing' Transformation, Projections: Parallel Projection (Orthographic &
Oblique Projections, lsometric Projections), Perspective Projections, 3D
Geometric Transformations: Translation, Rotation, Scaling, Matrix
Representation, 3D Object Representations: Polygon Surface and Polygon table,
Bezier curves and surfaces.

Unit-lV
Multimedia and Photoshop s/w
Fundamehtals of Multimedia, Adobe Photoshop CS4: N/enus and panels,
Exploring the Toolbox, Working with lmages: Working with Multiple lmages,
Rulers, Guides & Grids, lmage Size Command, Adjusting Canvas Size & Canvas
Rotation, Creating, Selecting, Linking & Deleting Layers, Painting with
Selections, Red Eye Tool, Clone Stamp Tool, Color creation, Quick Mask
Options, Creating Straight &"Curved Paths, Creating Special Effects.

Unit-V
CorelDraw X4
CorelDraw X4 Command Bars & Tools, Drawing Area-Objects-Lines, Working
with Text & Artistic Media Tool, Fills & Modifying Outlines, Drop Shadows,
lmporting and Editing OCR Text, Templates, Drawing and Editing Curves and
Lines, Three-point Tools, Clipart, Special Characters and Creating Symbols,
Working with Layers & Creating a Master Layer, Brush Tools and Adding
Objects, lnteractive Tools, Power Clip Feature and the Envelope Tool.

Bi LAsp uR vtsHwAVtoyALAyA" BtLASpu R (cHHATTtSGARH )


www.bi Iaspuruniversity. ac. in
'kghn fr-d.H5
uandqekj iVsy fo'ofo|ky;
fd{qfr-qrdq, frqrs5 jk;x<+ ¼N-x-½
@HTd-)
t+€{ vrErr.q
M.Sc. COMPUTER SCIENCE

Text Books
1. Procedural Elements for computer Graphics, D.F. Rogers, Tata lVlcGraw
Hiil
2. Fundamentals of lnteractive computer Graphics, J.D. Foley and A.D. van,
. ,. Addison-V.lesley.
3. Hbw to Do Everything Adobe Photoshop cs4, chad perkins, Tata
McGraw Hill
4. corel Draw X4: The official Guide, (paperback), Gary David Bouton, Tata
McGraw Hill

Reference Books:
1. Photoshop cs4 Quicksteps, carole Matthews & Gary David Bouton, Tata
tvlcGraw Hill
2. Corel DRAW X4 , Deborah Miller, pearson Education
3. corel draw X5 ln Simpte steps, Hindi Ed., lsBN:9789350042g8s,
Kogent; Wley, Publiqations
4. Mathematical Elements for computer Graphics,, Rogers and Adam, Tata
McGraw Hill.
5. Th.e.g,ry,.&:Pro.blem.of,Oomplter,Graphics,, Plastock, Schaum Series-
6. Computer Graphics, Tosijasu, L.K., Springer-verleg
7. Principles of lnteractive Computer Graphics, Newman, Tata [VlcGraw Hill.

BILASPUR VISHWAVIDYALAYA, Bil_ASpUR (CHHATT!SGARH)


www. bi laspurun ivcrsity.ac. i n
'kghn C-drcr5
uandqeflffii1qrsq.
kj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
fr-drsgq (1fttrsq-6)
tt{il qr.dffiq
M.Sc. COMPUTER SCIENCE

SEMESTER - IV
PAPER.II
ELECTIVE .III
EMBEDDED SYSTEM
UNIT_I ".- ,
lntroduction to Embedded Systems
Embedded System Design Process, Formalisms for System Design, Processor
technology, lC technology, Design technology, General-Purpose Processor:
lntroduction, Basic Architecture, Operation, Super-Scalar & VLIW Architecture,
Application Specific lnstruction Set Processors, Microcontrollers, Digital Signal
Processors, Selecting a Microprocessor, Memory. lntroduction, [Vemory write
ability, Storage performance, Tradeoff s, Common memory types Memory
hierarchy and cache.

UNIT_II
AVR 851 5 microcontroller
Architecture and Programming in assembly and C, lnterfacing Analog and digital
blocks: Analog-to-Digital Converters (ADCs), Digital-to-Analog, Converters
(DACs). Microprocessor interfacing: l/O addressing, Port and Bus based, l/O,
Itltemory mapped l/O, Standard l/O interrupts, Direct memory access, Advanced
communication principles parallel, serial and wireless, Serial protocols l2C,
Parallel protocols PCI bus, Wireless protocol lrDA, blue tooth.

UNIT-III
The 8051 Micro controller & Embedded System Programming
8051 lr/icro controller Architecture, lnput / Output Ports and Circuits, External
Memory, Counter and Timers, Serial ddta lnput /Output, lnterrupts. Assembly
Language Programming Process, Programming Tools and Techniques,
Programming the 8051. Data Transfer and Logical lnstructions. Arithmetic
Operations, Decimal Arithmetic. Jump and Call lnstructions, lnterrupts.
Applications: lnterfacing with Keyboards, Displays, D/A and fuD Conversions,
Multiple lnterrupts, Serial Data Communication.

UNIT-IV
Embedded System Software
Design tradeoffs due to thermal considerations and Effects of EMI/ES etc.,
Software aspect of embedded systems: Challenges and issues in embedded
software development, Co-design, Embedded Software Development Tools:
Host and Target machines, Linkerilocators for Embedded Software, Embedded
software development environments. Real time operating systems, Kernel
architecture: Hardware, TasUprocess control subsystem, Device drivers, File
subsystem, system calls embedded operating systems.

UNIT-V
Development for embedded systems
Embedded system development process, Determine the requirements, Design
the system architecture, Choose the operating system, Choose the processor,
Choose the development platform, Choose the programming language, Coding
issues, Code optimization, Efficient inpuVoutput, Testing and debugging, Verify
the software on the host system, Verify the software on the embedded system.

BILASPUR VISHWAVIDYALAYA, BILASPUR (CHHATTISGARH)


www.bilaspurun iversi ty.ac. in
'kghn uafrdrsg{
ndqekjffiqraq.
iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
fr-dnTgq (trdrsre)
@ tteq qrgffi
M.Sc. COMPUTER SCTENCE

Text Books:
1. The 8051 I\4icrocontroller Architecture, programming & Applications, Kenneth
J. Ayala, Penram lnternational.
2. An Embedded software Primer, David E. simon, pearson Education, 2005.
Elnbedded systems: Architecture, programming and Design, Raj.Kamal;d,ata.,
l,McGraw-Hill
Education, 2008

BTLASP UR VtSHWAV|DYALAYA, BILASPU R (CHHATTISGARH)


www. b i I aspurunivers i ty. ac. i n
'kghn ua ndqekjMA-oroq,
fr-i{rs5 iVsy fo'ofo|ky;
frarwgt jk;x<+ ¼N-x-½
@;-ffisq-6)
frts qrdffiq
M.Sc. COMPUTER SCIENCE

SEMESTER-IV
PAPER-II
ELECTIVE.IV
NETWORK SECURITY & CRYPTOGRAPHY
uNlT-l -.;,oi
Security in Network
Model for Security: Threats in Networks, Stealing Passwords, Social
Engineering, Bugs and Backdoors, Authentication Failures, Protocol Failure,
lnformation Leakage; Elementary Cryptography: Terminology and Background,
Cryptography and network security. Concepts of Encryption and Decryption.
Cryptanalysis, Substation Cipher. Transpositions Good and Secure Encryption
Algorithm. Trust worthy Encryption systems Data encryption standards (DES)
and Advanced Encryption Standards (AES) Comparison of DES and AES.
UNIT-ll
Classical Encryption Technique
Syrnmetric and Asymmetric Eneryption Systems, Strearn and Block Ciphers,
Contemporary Symmetric Ciphers, Confidentidlity using Symmetric Encryption;
Public Key Encryption and HASH Functions: Public Key Cryptography and RSA,
N/essage Authentication and Hash Function, Hash Algorithms, Digital Signatures
and Authentication Protocols.
uNtT-ilt
Firewalls
Basic Concepts (for understanding the firewalls rules): TCP Segment format
lP Datagram format. lntroduction: Kinds of Firewalls, Packet Filters. Packet
Filtering. Dynarnic Packet Filters. Application-Level Filtering. Circuit-Level
Gateways, Firewall Conflgurations, Demilitarized Zone (Dl\ Z) Networks,
Distributed Firewalls, Limitation of Firewalls. Filtering Services: Reasonable
Services to Filter (Filter Rules to be applied): DNS, Web, FTP, NTP. DNS
(Domain Name Server): DNS overview, Protocol overview, Hierarchal Structure,
Root Servers, Practical Experience. DNS Security: Unpatched Servers, Mis-
configured Servers
UNIT-IV
Web Security
Overview of Web Seruer Security. Goal of Server Attack. Web site defacement.
Data corruption. Data heft. Types of Attacks. Web Server Protection. FTP (File
Transfer Protocol) STUTP (Simple Mail Transfer Protocol). NTP (Network
Time Protocol), lntrusion detection systems: Types of lDSs. Goal for lntrusion
Detection systems, IDS Strength and Limitation. Electronic tMail Security:
Security for E-mail. Designs, Example of Secure E- mail Systems, Pretty Good
Privacy (PGP), MIN/E overview. S/MIME functionality; Wireless Application
Protocol Security (WAP.)
UNIT_V
Gryptography
lntroduction to Cryptograph, Overview on Modern Cryptography, Number
Theory, Probability and lnformation Theory, Classical Cryptosystems,
Symmetrical Ciphers (DES, AES), Hash Functions and MACs ([\4essage
Authentication Codes), Digital Signatures l\rlodern Trends in Asymmetric Key
Cryptography Elliptic curve based cryptography, Elliptic curye based
cryptography.

BILASPUR VISHWAVIDYALAYA, BILASPUR (CHHATTISGARH)


rvrwv. bi laspurun i versity. ac. i n
'kghn ua ndqekj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
ftdrs'g{ ffirrqq, B-cTrflW @sq-d,)
@ tt{w qr.d{67
M.Sc. COMPUTER SCIENCE

Text Books: '

1. Network Security Essentials (Applications and Standards), William


Stallings Pearson Education.
, 2. Hapk.Prooling ypur network, Ryan Rusself, Dan Kaminsky,.Rain:,F_o.l:est
Puppy, Joe Grand, 'David Ahmad, Hal Flynn ldo Dubrawsky, Steve
W;Manzuik and Ryan Permeh, Wiley Dreamtech
3. B. A. Forouzan, "Cryptogr:aphy & NetworkrSecurity", Tata Mc Graw Hill.
4. Cryptography and Network Security: Pr,inciples and praetiges, William
Stallings-lll Edition, TMH.
5. The complete Reference Network Security, Bragg, Rhodes-Ousley,
Pearson.
Reference Books:
1. Network Security and Cryptography: Be-rnard Menezes , CENGAGE
Learnrng.
2. Nehruork Security - Private Communication in a Public World, Charlie
Kaufman, Radia Perlman and Mike Specinqr, Pear,senlPl-;ll.
3. Cryptography and network Security, Third edition, Stallings, PHl/Pearson

arLASpuR vtsHWAV|DYALAYA, BtLASPUR (CHHATTlSGARH)


www.bil aspurur ivcrsity.ac. i n
'kghn fr-drflg{
uandqefrrqfuorcrq,
kj iVsy fo'ofo|ky; jk;x<+ ¼N-x-½
frar$g{ (udwrd-)
tts rlkr{Erq
M.Sc. COMPUTER SCIENCE

SEMESTER.IV
MAJOR PROJECT
Note:
1. lt is compulsory, that students would have group of maximum of two students
and project should be done under Government Sectorsl Public'Sector; /. Pvl-'
LTD. SA/V Company.
2.Thestudents should not make any project under local or private institutions-
3. The students should make project themselves and project will not be copy of
other project.

Steps for Live Project


1. Getting customer's requirements
2. Preparing designs, database and business logics
3. Developing softwar:e application project
4. Testin$ and implementing the project
5. Troubleshooting the project application after implementation

The break-u p of marks for fourth semester's Major Project will be as under:
Sr. No. Argument Maximum .MinimUm
Passing Marks Passing Marks

1 Project Record 100

2 Viva-voce 100

3 Program Development and 200


Execution
Total Marks 400 144

BTLASPUR VISHWAVIDYALAYA. BILASPUR (CHHATTTSGARH)


www.bilasPuruniversitY.ac. in
. ,.,iii.r;.'.r ,!.:.. :.;'1. :

- -i::

You might also like