.

ir'ilt,:,

w
,:.i .g 'i

KRISHNA UNIVT]RSI.I.Y: :MACHII,IPATNAM

PROPOSED C'OURSE STRUCTURE FOR PG PROGRAMS (SCIENCE
SRTREAM)
UNDER CHOICE I}ASED CREDIT SYSTEM (CBCS)
W.E. F' 2022-23 (R22 Regutations)
I SEMESTER
Course Course Name Teaching Hours/ week CORE / lnternal External
l- Code l,ect u re Practiral
.l
utoriaI tD(7DSE/ Marks Marks
No. of
sF.c/ouC/ Clredits
!---
I

MOO(]S
IIIVIL 5IU I Data 4 0 0
l
Core 30 70 4
I
L Structu res
I
)2rrat5ioz
Programming and 4 0 0 Core 30 70 4
I
problem solving
l
Usins Pvthon
t-- ',tvtL )t(r-i Lomputer 4 0 0 Core 30
I
70 4
;;.;,; ;" *--i Networks
I

L____ ';;;-
lzlvtL 5 tu4 l-orrnal l-anguages 4 0 0
I l
Core 30 70
L- I

i and Automata l'heo

4

lz ;;;;;;;,-
ZZIVILS IU) -
COMPULSORY
rersonality J I 0 Core 30 70 J
Development through
Life Enlightenment
i

I
Skills
t_.
I

t2)litvr( 5t.,\utul -lI l)ata Structures

f-
l). llM(
l
I

l
:- -
-
sl_4ts t02
l.ab
Programrning and
problem solving using
0
0
6
6
0
0
Core
Core
30
30 ;rJ;]
70
-70 "-
'lt

t-
if9r
,IAI., TUl( IIKS
python Lab
SEMIlS'I'ER 210
__t_
qoI
4eo zs
z_s___l
l

v &epvM
 II SEMESTER
i Course Code Course Teaching Houns/ week CORE / IDC/DSE/ lnternal External
Name Lcctu re l)ractica
No. of
I
I 1utorial SE(yOEC/MOOC Marks Marks
L__22MCS20
I

S
Credits

I
I
t Design and
Analysis of
4 0 0 Core 30 70 4

___-_
iI 22MCS202
I
Algorithms
Operating 4 0 0 Core 30 70 4
t 22MCS203 Systems
Database 4 0 0 Core 30 70 {-
Management
Systems
- -rrMas2oa-
Research J I 0 SEC 30 70
COMPULSORY Methodology 3

& IPR
"Y-l'_!llll irugl rru ILLIIUt lvu c()lJRSES ((]HOOSE: \NY ONIr)
22MCSDSE2O I T Mobr'te 4-.]---0 ---l OT DSE ---l 30 70
I comput_ing
4
S0rtware --l I

4 0 0 DSE 30 70 4
Engineering
22MCSDSE203 Data Ware 4 0 0 DSE 30 70 4
housing & Data
Mining
A5 TKAC'I'ICA LS
22MCSI,AB2O I Operating 0 6 0 Core 30 70 J
_SrlEn l!e!
Database 0 6 0 Core 30 70 J
2MCSI-AB2O2 Management
Systems Lab
I,l I AL I UR SF,(.]OND SEMESTER --r(
Ai the 6a- id ^_.. _
"f7
_lL
,oAp#m*nf#;;..1
490

i l*1,:::,::lj"T,,:",:g:.:::fl,i:$
*,.;l;d,r,;;"sl* ,u..r., and musr prepare a reporr concerned
as per approved project guidelines, and submit the same to
the univeisitf i+*ffi"#"dlJ",n.
gqmmelcement of thir ter end examinations.

\\ry M W
 III SEMESTER
Course Code Course Teaching Hours/ week
Name l,cctu re Practical
CORE/
IDC/DSE/
I nternal External I No. of
Marks Marks I Credits
sE(yoEC/MOO(l
l_:'- s I

22MC530 t
I Data Science _ l_4 0
L LLLL I IVL CUU RSES (CI OOSE A
lo E)_
\Y
THRE
Core 30 70
I
lq
-zMCSDSE3oI
[E g Dat, T.-4 0 T--o I DSE 30 70 I
I Analytics
22MCSDSE302 Artificial 4 0 DSE
0 30 70 4
Intelligence
22MCSDSEJO' Web
Technologies
4 0 0 DSE 30 i 4

2MC'SDSE Computer 4 0 0 DSE 30 70 4

Vision
2MCSDSE305 Applied Data 4 0 0 DSE 30 70 4
Analytics
zttvlt StJ5L,J Uloud 4 0 0 DSE 30 70 1
_C_o:rpr{1g__
t,)
IIMUSLAts30 Data Science 0 6 0 Core 30 70 .J
Lab
2M('St,AB Web 0 6 0 Core 30 70 J
Technologies
Lab
(rrLl\ t,l,L(_llvt, TERDISCIPLINARY/MUL l-r Dtscr Pt,tNARY) COURSES [' ANV r|N
22MCSOEC3O I R Programming J 0 0 OEC 30 70 3
ZIVIL 5UL,LJ Mobile a
J 0 0 OEC 30 70 J
Networks
Z]VILSUT,UJU LJnix J 0 0 OEC 30 70 J
Programmin
Z^!.IYIL )UL,LJ Uttice Iools 3 0 0 OEC 30 70 3
tz.Ytt 5Ut:t JU5l Python J 0
min
0 OEC 30 70 -_..,
Dr_lvtL5 I tK 210 490 25

V %,,%rye-;
 IV SEMESTER
Course Code Course Teaching Hours/ week CORE / I
lnternal External No. of
Name l,ectu rePractical Tutorial IDC/DSE/ Marks Marks Credits
sEC/OE(7MOOC
s
22MCS40 t Ob.iect Oriented 4 0 0 Core 30 70 4
Softrvare Design &
t_
l-
DOMAIN SPECIFIC ELECTIVE COURSES CHOOSE ANY THREE
22MCSDSE4OI Softw'are Testing 4 0 0 DSE 30 70 4
& Project
lvl4ggelnglt
22MCSDSE4O2 Dynamic web 4 0 0 DSE 30 70 I
programming

22]VICSDSE403 Technical Report 4 0 0 DSE 30 70 4

Writin
Fog Computing in 4 0 0 DSE 30 70 ,1

]! I IO'T
- --- - ----- -+ Inl'ormation
I llM(--SDSI:4051 4 0 0 DSE 30 "t0 4

I Sr'curity
I 2zl,,Icspst ao6l Distributed
Drsrrib{.rred 4 0 0 DSE 30 70 4

L_":
I,AB PRACTICALS
;--
z: rrutC s I a e4o [- ouj.Ci-ort.r't.o 0 6 0 Core 30 70 .,

] I Soliware Design
| & Dcvelopment
t.au
ENTREPRENURAL & INNOVAI'ION/IT SKILI, RELATED TO DOMAIN SPECIFIC ELECTIVE COURSES
-l (cHoosE ANY ONE)
1
22MCS Social Media 3 0 0 SEC 30 70 -1

Strc40l Analytics
a
22MC]S Applied Data J 0 0 SEC 30 70 J
SEC402 Analytics
22MCS Wireless Adhoc J 0 0 SEC] 30 70 3

SEC]403 Networks
* CHOOSE MOOCs FROM SWAYAM/NPTEL SOURCES
-- t
PROJECT WORK EVALUATION AND VIVA.VOCE 100 4
TOTAL FOR IV SEMESTER r80 520 JO

Note: Students may be allowed to register and appear for MOOCS from the third semester itself. However, students
are to complete the MOOCS successfully and subnrit pass certilicate of the same to the University through the
Principal of the College concerned for approval and endorsement of the same on gratte cards and PCs and
ODs as per the regulations of the [Jniversity.

W
 Krishna [Jniversity
M Sc., Computer Science
R22 Regulations
22MCS I 0 l-Data Structures

Course Name ta Structures IM TM

Course Code 2MCS IO I 4 I 30 170

- ,.r-.__t_ _ !__._1,.-.. ,_,L-- I I

L,LectJie-"T,'iutoiiut.'p,praCiiCai. C.ctieOiis,-rrr.r"lnienrai M*kr" EM.F:xrernat vtarks. TM,ioiat H,tarrs

Course Description and Purpose:

An overview of data structure concepts, arrays, stack, queues, trees, and graphs. Discussion of
various implementations of these data objects, programming styles, and run, time representations.
Course also examines algorithms tbr sorting, searching and some graph algorithms. Algorithm
analvsis and ef flcient code design is discussed.

Course Objectives:

,/ F.xploring basic data structures such as stacks and queues.

'/ Intt'oduces a variety of data structures such as search trees, and graphs.
,/ Introduces sorting and pattern matching algorithms

Course Lea rning Outcomes:

At the end ol'this course the students should be able to:

'/ Ability to select the data structures that efficiently model the information in a problem.

'/ Ability to assess efficiency trade,offs among different data structure

i rn p lementations orcombi nations.

'/ Irnplernent and know the application of algorithms tbr sorting and pattern matching.

{ Design programs using a variety of data structures. including hash tables, binary and
general treestructures. scarch trees, , graphs, and AVL,trees.

Course Content:

LINIT'-I
Introduction arrd Overvierv: [rlementary Data Organization. Data Structures. Data StructureOperations. and
Algorithrns: Complexity.'l'ime. and Space l-radeoftl L-inear Arrays. Representation and'f'raversing l.irrear
Arrays. Inserting and Deleting. l,inear Search, Binary Search, Multidimensional Arrays. Pointer Arrays^
Record Structures, Representation of records in memory. Parallel Arrays, Matrices, Sparse Matrices.

UNI'I"II
Stacks: Stacks. Array representation, Linked List representation, Evaluation of Arithmetic Expressions,
Quick sort, Recursion, Tolvers of l{anoi. Queues: I inked representation of Queues.
Deques" Prioritv Queues.

Linked [,ists: Representation. 'l-raversing, Scarching. Memory Allocation: Carbage Collection.

-1^r-
tr-4( ffi14-
 Insertion. Deletion, Header L.inked Lists.
Two Way Lists.

UNIT-III
Trees: Binary trees' Representing and traversing
binary trees, Traversal algorithms using
Binary Search Trees, Searching, lisertion stacks.
and Deietion in sinu.y Search -frees, AVL
Search Trees,
Insertion and Deletion in AVL trees. l-leap: .frees
Heap Sort, Huffman,s Algorithms, General
UNIT-IV
Multi-way Search Trees: M-way Search Trees,
Definition and properties, Searching an M-way
Tree' B-l-rees' Defiiition and.P.roperties, Search
Number of Elements in a ti-tre., irr..tio,
fiom a B-Tree. B+-Tree Definition, Searching into B-Tree, Deletion
a B+_Tree, Insertion into B+_tree, Deletion from a B+_.l.ree.
UNIT-V
craphs Algorithms Elementary Graph, Algorithms:
-. Topologicar sort, Single Source Shortest path
Algorithms: Diikstra's. Bellman-Fori. att-puirs
Shortesi paths: Floyd-warshall.s Algorithm

Reference Textbooks:

l' Seymour Lipschutz, Data Structures. Mc Craw Hill( Schaums

outlines), First Edition
2' Seymour Lipschutz,Theory and problems of
Data Structures, Mc Graw Hill( Schaums
outlines)
3' John R Ilubbard' Second Edition. Data Structures
with Java, Mc craw ilill( Schaums outlines)
4' Robert Lafore, Data Structures & Algorithms in
Java, Second Edition, pearson Education.

5' Fundamentals of DATA STRUCTURES in

c: 2nded, , Horowitz, Sahani, Anderson-fieed, Universities
Press
6' Data Structures. a Pseudocode Approach. Richard
F cilberg. Behrouz A Forouzan, ciengage,
 Krishna University
M Sc.,Computer Science
R22 Regulations
22MCS102: Programming and Problem Solving Using Python

Course Name Programming and Problem Solving L T P C IM EM TM

Using Python

Course Code 22MCS 102 4 0 0 4 30 70 t00

L.Lecture, T,Tutorial, P,Practical, C.Credits, IM,lnternal Marks, EM,External Marks. TM,Total Marks

Course Description and Purpose:

l'he course is designed to provide basic knowledge o1'Python. Python programming is

intended for SoftwareEngineers, system analysts, program managers and user support
personnel who wish to learn the Python Programming Language.

Course Objectives:

./ Master the fundamentals o{'writing Python scripts

./ Learn core Pyhon scripting elements such as variables and flow control structures
,/ Discover how to work with lists and sequence data
'/ Write Python functions to lacilitate code reuse
./ Use Python to read and write files
'/ Make their code robust by handling errors and exceptions properly
,/ Work with the Python standard library
'/ Explore Python's object,oriented features

Course Learning Outcomes:

At the end of this course the students should be able to:
,/ LJnderstand computer architecture and data representations (variables, representation of numbers and
character strings).
,/ Learn basic algorithmic problem, solving techniques (decision structures. loops, functions).
,/ Use and understand objects used in programming.
,/ Design" document. implement and test solutions to programming problems.
,/ Identify and repair coding errors in a program.

Course Content:

UNIT -I
Introduction: What is a programming language. Abstractions in programming languages, Computational
J
 qparadigms. [,anguage deflnition. [-anguage translation" l.anguage design.
Principles of Programming Languages: Attributes, binding and semantic functions. Declarations, blocks and
scope, 1'he symbol table, Name resolution and overloading, Allocation, Lifetimes and the environment.
Variables and Constants, Aliases, Dangling references and garbage.
UNIT-II
Basics of Python Programming, Features of Python, History of Python, The Future of Python, Writing and
Executing FirstPython Program, Literal Constants. Variables and ldentifiers, Data 1'ypes, Input Operation.
Comments, Reserved Words, Indentation, Operators and Expressions, Expressions in Python, Operations on
Strings, Other Data Types, Type Conversion.
'l'he
Decision Control Statements, Conditional Branching Statements, Basic Loop Structures, Nested [-oops.
break statement. The continue statement, The pass statement. The else statement used with loops.

UNIT-III
Functions and Modules, Function Definition, Function Call, Variable Scope and Lif'etime, The return
statement, More onDefining Functions. Recursive functions, Modules, Packages in Python, Standard
Library Modules.

Pyhon Strings Revisited,Concatenating, Appending and Multiplying Strings, String formatting operator.
Builtin String Methods and Functions, Comparing Strings, Regular Expressions.Sequence, Lists,
Functional Programming, Tuple, Sets, Dictionaries.

T]NIT-IV
Method and self Argument, Class variables and Object Variables, Public and
Cllasses and Objects, Class
Private Data Members, Private Methods, Calling a Class Method from Another Class Method. Built.in
Class Anributes,Class Methods, Static Methods.

UNIT-V
Inheritance, lrrheriting Classes in Python, Types of Inheritance, Abstract Classes and Interl'aces.
Error and Exception tlandling. Introduction to Errors and Exceptions, Handling Exceptions.
RaisingExceptions, Built. in and User defined Exceptions
Operator Overloading, Concept of Operator Overloading. Advantage of Operator Overloading,
I mp lementing OperatorOverload in g.

Reference Textbooks:

l. Kenneth C. Louden, Programming Languages Principles and Practice, Second Edition, Cengage
Learning(2008).
2. Reema Thareja. Python Programming using Problem Solving Approach, Oxford Llniversity Press
J. Wesley Chun, Core Python Programming, Prentice Hall

\t-+r
 Krishna University
M Sc.,Computer Science
R22 Regulations
22MCSl 03: Computer Networks

Course Name Computer Networks L T P C IM EM TM

Course Code 22MCS 103 4 0 0 4 30 70 r00

L.Lecture, T.Tutorial" P,Practical, C.Credits. IM,lnternal Marks, EM,External Marks, TM,Total Marks

Course Description and Purpose:

This course provides an introduction to computer networks, with a special focus on the lnternet architecture
and protocols. Topics include layered network architectures, addressing, naming, forwarding, routing,
communication reliability. the client,server model, web and email protocols.

Course Objectives:

,/ Become familiar with layered communication architectures (OSI and I'CP/lP).

,/ ljnderstand the client/server modeland key application layer protocols.
,/ Understand the concepts of reliable datatransfer and how TCP implements these concepts.
'/ Learn the principles of routing and the semantics and syntax of IP.
,/ L.Jnderstand the basics of error detection including parity. checksums, and CRC.

Course Learning Outcomes:

At the end of this course the students should be able to:
,/ Understand and describe the layered protocol model.
,/ Describe, analyse and evaluate a number of datalink, network, and transport layer protocols.
,/ Program network communication services for client/server and other application layouts.
,/ Describe" analyse and evaluate various related technical, administrative and social aspects of specitic
computer network protocols fiom standards documents and other primary materials fbund through
research.
,/ Design, analyse, and evaluate networks and services for homes, data centres, loT/loE, LANs and WANs

Course Content:

UNIT -I
Uses of Computer Networks" Connection Oriented and Connectionless Services, Retbrence Models: The OSI
Ref-erence Model. The I'CP/lP Ret-erence Model. A Comparison of OSI and TCP/lP ref.erenceModel.

Physical Layer: ALOHA, CSMA, CSMA/CA

Data Link Layer Design Issues: Services Provided to the Network Layer, Framing , Error correcting Codes ,

Error Detecting Codes. An unrestricted Simplex Protocol , A simplex Stop and wait Protocol , Sliding
Window Protocols: A one, bit sliding Window Protocol , A Protocol using Co Back N , A protocol using
selective repeat.

t.-+-
UNIT-II
Ethernet: Ethernet Cabling. The f:thernet MAC sublayer Protocol . Bluetooth: Bluetooth Architecture.
Bluetooth Applications. Remote Bridges. Repeaters. Hubs.Bridges. Switches. Routers and Gateways.
Virtual LANs.

UNIT-III
Network Layer Design Issues : Store and Forward Packet Switching ,Services Provided to the
Transport Layer , Implementation of Connectionless Services ,lmplementation of Connection
Oriented Services . Comparison of Virtual Circuit and Datagram subnets.

Routing Algorithms:The Optimality Principle, Shortest Path Routing, Flooding, Distance Vector
Routing , Link State Routing, Hierarchical Routing , Broadcast Routing , Multicast Routing. Routing for
Mobile Hosts.

The Network Layer in the Internet IP address, IPV6 features and advantages.

UNIT-IV
'I'he Transport Service: Services provided to the Upper Layers. Transport Services Primitives Berkeley
"
Sockets. Elements o1'Transport Protocols:Addressing, Connection Establishment, Connection Release,
Flow Control and Bulfering , Multiplexing , Crash Recovery.

Transport Protocols TCP : Introduction to TCP , The TCP Service Model , the TCP Protocol , The TCP
segment header, TCP connection establishment, TCP connection release, TCP congestion Control "
Comparison of TCP and UDP..

UNIT-V
Wireless l"CP: Classical improvement in WTCP.

DNS : The Domain Name System : The DNS Name Space, Resource Records , Name Servers.
[rlectronic Mail : Architecture and Services , The User Agent , Message Formats , Message Transfer,
Final Delivery. TheWorld Wide Web: Architecture Overview , Static Web Documents , Dynamic Web
Documents.

Reference Text books:

l. Andrew S. Tanenebaum, Computer Networks, PHI

2. James F.Kurose, Keith W Ross, Computer Networking, 3'd edition Pearson Edition
3. Michael A. Callo. William M. Hancock. Data Communications and Networking, 4th edition.TMH

\tq fifi.' K*-

 Krishna University
M Sc., Computer Science
R22 Regulations
22MCSl04: F'ormal Languages and Automata Theory

Course Name Formal Languages and Automata Theory L T P C IM EM TM

Course Code 22MCS 104 4 0 0 4 30 70 r00

L"Lecture. T,Tutorial, P,Practical, C,Credits, IM,lnternal Marks, EM,Extemal Marks, TM,Total Marks

Course Description and Purpose:

Formal Languages and Automata Theory deals with the concepts of automata, formal languages, grammar,
algorithms, computability, decidability, and complexity. To develop methods by which computer scientists
can describe and analyze the dynamic behavior of discrete systems, in which signals are sampled
periodically.

Course Objectives:

'/ Understand basic properties of formal languages and formalgrammars.

'/ Understand basic properties of deterministic and nondeterministic finite automata
'/ LJnderstand the relation between types of languages and types of flnite automata
'/ Understanding the Context free languages and grammers. and also Normalising CFG.
,/ Understanding the minimization of deterministic and nondeterministic finite automata.
'/ Understand basic properties of Turing machines and computing with Turing machines.
'/ Understand the concept of Pushdown automata and its application.

Course Learning Outcomes:

At the end of this course the students should be able to:
,/ Acquire a full understanding and mentality of Automata Theory as the basis of all computer science
languages design Have a clear understanding of the Automata theory concepts such as RE's, DFA's,
NFA's, Turing machines, Grammar,halting problem, computability and complexity
,/ Be able to design FAs, NFAs, Crammars. languages modelling, small compilers basics. be able to
design sampleautomata and be able to minimize FA's and Crammars of Context Free Languages.
,/ Perceive the power and limitation of a computer; solve the problems using formal language
,/ Develop a view on the importance of computational theory.

Course Content:

UNIT .I

Finite Automata: Deterministic finite automaton. Non deterministic finite automaton and NFA with e
transitions - Signiticance, equivalence between NFA with and without e transitions, NFA to DFA
conversion.minirnization of FSM, equivalence between two FSMs, Finite Automata with output- Moore and

\\-4a-
Mealy machines.

UNIT.II
Regular Languages: Regular sets, regular expressions, identity rules, construction
of finite automata for a
properties of
given regular expressions and its inter conversion. Pumping lemma of regular sets. closure
regular sets (proof's not required).

UNIT-III
free grammars'
Context free grammar: Context free grammar. derivation trees, Ambiguity in context
Minimization of Context Free Grammars. Chomsky normal form, Creibach normal lorm.

Push down Automata: Definition. model, design of PDA'

and recursive
Turing Machine: Definition, model. design of TM, recursively enumerable languages
languages,Chomsky h ierarchy of languages

Unit-IV
Lexical Analysis,
Compiler, Structure of a compiler, Design issues of compiler, Phases of Compiler,
of Tokens
Role of [.exical Analyzer,lnput Buffering, Specification of Tokens, Recognition

Unit-V
with
Lex .Finite Automata, Regular Expressions to Automata. Minimizing DFA, An Example
L.exical analysis with Lex, Grammar analysis with YACC'

Reference Text books:

J' D. Pearson
L Hopcroft. H.E. and Ullman, tntroduction to Automata Theory Languages and Computation,
Education.

2. John C Martin, lntroduction to Languages and the'theory of Computation'

l'MH

3. Mishra and Chandrashekaran, Theory of Computer Science and Automata Langugaes and
Computation, 2^d Edition,PH I

4. Daniel l.A. cohen, lntroduction of computer Theory, John wiley

\t-4<
 Krishna University
M Sc., Computer Science
R22 Regulations
22MCS105: Personality Development through Life Enlightenment skills

ourse Name Personal ity Development Through I D

M M TM
Life Enlightenment Skills
ourse Code 22MCS r05 0 I J l0 70 100
L,Lecture, T,Tutorial, P,Practical, C,Credits, IM,lnternal Marks, EM.External Marks, TM,Total Marks

Course Description and Purpose:

Personality development is the development of your behavior patterns and attitude. It is the result of
where we are born" the circle we interact with and our personal temperament. Every person is
diffbrent. l.here are some characteristics traits that make you .,you". Personality development
through lifb enlightenment course aims to help students identify negative behaviors which may be
stopping them fiom reaching their desired goals. This course will help students both in their
personal and desired professional life. The other purposes of personality development through life
enlightenment course are to enable you lead stress-free and healthier life, ethical decision making
ability" enhanced confidence level, and building a more pleasing personality.

Course Objectives:

'fhe Course will introduce the students to

,/ I.eam to achieve the highest goal happily.
'/ Become a person with stable mind, pleasing personality and determination.
'/ Learn to build positive attitude. self-motivation, enhancing self-esteem and emotional
intelligence
'/ Learn to develop coping mechanism to mange stress through Yoga and meditation techniques
,/ Awaken wisdom among them.
Course Learning Outcomes:

At the end of this course the students should be able to:

r' Develop their personality and achieve their highest goals of life.
,/ Lead the nation and mankind to peace and prosperity
,/ Practice emotional self regulation.
./ Develop a positive approach to work and duties
,/ Develop a versatile personality
Course Content:
T]NIT- I
Introduction to Personality Development
The concept of personality - Dimensions of Personality - Theories of Personality development
(Freud & Erickson) -'fhe concept of Success and Failure - Factors responsible for Success -
Hurdles in achieving Success and Overcoming Hurdles Causes of failure - Conducting SWOT
-
(Strengths" Weaknesses, Opportunities and Threats) analysis.

UNIT- II
Attitude. Motivation and Self-esteem
Conceptual overview of Attitude * Types of Attitudes - Attitude Formation -.
Advantages/Disadvantages of Positive,4ltregative Attitude - Ways to Develop Positive Attitude
C'oncept of motivation: Definition and Nature of Motivation/Motive * Internal and external
motives - Theories of Motivation - Importance of self- motivation- Factors leading to de-

\\*4--
motivation.
Self'-esteem - Definition and Nature of self'-esteem - Do's and Don"ts to develop positive self-
esteem - Low self esteem - Personality having low self esteem - Positive and negative self esteem.

UNIT- III
Other Aspects of Personality Development
Body language - Problem-solving - Contlict Management and Negation skills - Decision-making
skills - Leadership and qualities of a successlul leader - Character building -Team-work - Time
management - Work ethics - Good manners and etiquette - Emotional Ability/lntelligence -
Dimensions of, Emotional Intelligence - Building Emotional Intelligence.

UNIT- IV
Neetisatakam-Hol istic Development of Personal ity
Verses- 19.20,21"22 (wisdom) - Verses- 29.31,32 (pride and heroism) - Verses- 26.28.63.65
(virrue)
Personality of Role Model - Shrimad Bhagwadgeeta

Chapter2-Verses 17 - Chapter 3-Verses 36,37,42 - Chapter 4-Verses 18, 38,39 - Chapterl8 -

Verses 37,38,63

UNIT- V

Yoga & Stress Management

Meaning and definition of Yoga - Historical Perspective of Yoga - Principles of Astanga Yoga by
Patanjali- Meaning and Definition of Stress - Types of Stress - Eustress and Distress -stress
Vlanagement -- Pranayama- Pranayama: Anulom and Vilom Pranayama - Nadishudhi Pranayama
- Kapalabhati-Pranayama - Bhramari Pranayama - Nadanusandhana Pranayama * Meditation
techniques: Om Meditation - Cyclic meditation : Instant Relaxation technique (QRT). Quick
Relaxation'l'echnique (QR'f). Deep Relaxation J'echnique (DRT) (Theory & Practical).

PRACTICAL COMPONENTS:
/ Students should identify diflerent types of personality to know their own personality. Students are
to describe the characteristics of their personalities and submit the same for assessment.
/Students are to form in groups (a group consists of 4-6 students) to identify and write a brief note
on famous personalities of India and World.
/ Students are required to identify diff-erent types of attitudes and give any five examples of each.
/ Students are expected to check their attitudes and develop ways to improve their attitudes at work
place and home.
/ Students are required to identify keys to self--motivation to achieve their goals.
/ Students are expected to identify at least seven types of body language and conduct activitieswith
the following:

l. No. )ose Possible Interpretations

I ing with your hands on your hips Aggressive, disgusted
itanding upright onfldence
\rms crossed on your chest )efensive
Resting your hand on your cheek fhinking
Iouching or rubbing your nose )oubt, lying
) esting your head in your hands Boredom, tired
apping your fingers mpatience
iting your nails ous. insecure

l0

\t-4a---
 Playing with your hair nsecure
l0 Rubbing your eyes Disbelief. doubt

Conduct the following exercise to develop communication skills - Negotiation Skills and
Empathy

\rJ5 ll W 56c^--
 Exercise: Card Pieqes

In this activity. team members trade pieces of playing cards to put together complete cards.
Uses -'fhis exercise is useful for showing team members others'perspectives. It builds
communication and negotiation skills , and helps people to develop empathy .
Pepple and Materials
. Enough people for at least three teams of two.
. Playing cards - use between fbur and six for each person.
. A private room.
l'ime -l 5 minutes. Instructions:
L Cut each playing card into half diagonally, then in half diagonally again, so you have
fbur triangular pieces fbr each card.
2. Mix all the pieces together and put equal numbers of cards into as many envelopes as
you have teams.
J. Divide people up into teams of three or four. You need at least three teams. If you're
short of people, teams of two will work just as well.
4. Give each team an envelope of playing card pieces.
5, E,ach team has three minutes to sort its pieces, determine which ones it needs tomake
complete cards, and develop a bargaining strategy.
6. After three minutes, allow the teams to start bartering for pieces. People can bafter on
their own or collectively with their team. Give the teams eight minutes to barter.
7. When the time is up, count each team's completed cards. Whichever team has themost
cards wins the round.
Advice for the Teacher/Facilitator
After the activity, ask your team members to think about the strategies they used. Discussthese
questions:

l) Which negotiation strategies worked? Which didn't?

2) What could they have done better?
3) What other skills. such as active listening orgJl!.pAlhy " did they need to use?

Conduct lollowing Time management activity - Ribbon of Life

Take a colored ribbon length of approximately I meter/100 cm. and scissors. Start with the
lollowing questions:
'/ If the lifb span of an individual is say. 100 years. Consider that each cm represents one year,
Theresponsewill bethatfewlivethatlong.Assumingalifeof 75to90 years,cut 10to25
cm ofl'the ribbon, accordingly.
'/ What is the average age of the participants sitting here, the response would be 25 to 30
depending on the group, in that case, cut another 25 cms of the ribbon and say that is gone
you cannot do anything.
'/ What is left is 50 years? People will say. "Yes"" but the answer is NO.
'/ Every year we have 52 weeks, that is 52 Sundays. If we multiply that by 50 years. i1 comes
to 7.14 years. Reduce the ribbon by another 7.14 cm.
'/ We also usually have Saturdays off, so reduce another 7. cms.
'/ Public,t',trationalholidays are l0 multiple with 50 years. That comes to another 1.5 years.
Reduce ribbon by another 1.5 cms.
'/ Your casual leave, sick leave, and annual holidays approx. 40 days ayear, multiplied by 50.
Cut off another 5 cms. Now you are left with about 29.5 years. But, the calculation is not
over yet.
'/ You sleep an average of 8 hours daily; multiply that by 365 days and again by 50 years ( i.e.
122 days X 50 : almost l7 y'ears). Cut off another l7 cm.
,/ You spend time eating lunch, breakfast, snacks, and dinner tolal2 hours daily (i.e.

\t4r- l2

fi/
 year X 50 years: 4 years or so). Cut off another 4 cm.
Last, let"s figure we spend about I 'hour a day traveling from place to place for activities and
such. (that"s about 2 more years). We"re down to 6 (SIX ) years of life to make it or break it.

\\-4r- ay l3 Nioo*
%5\/
 o Exercise Decision making skills - Create Your Own
In this exercise, teams must create their own, brand new, problem-solving activity.
Uses
This game encourages pafticipants to think about the problem-solving process. It builds skills such as
creativity, negotiation and decision making, as well as communication and time management. After the
activity, teams should be better equipped to work together, and to think on their feet.

What You'llNeed

. Ideally four or five people in each team.

e A large, private room.

. Paper, pens and flip charts.

Time -Around one hour.

Instructions:
L As the participants arrive, you announce that, rather than spending an hour on a problem-
solving team building activity, they must design an original one of their own.

2. Divide participants into teams and tell them that they have to create a new problem-solving
team building activity that will work well in their organization. The activitymust not be one
that they have already participated in or heard of.

3. After an hour, each team must present their new activity to everyone else, and outline its
key benefits.

There are l'our basic steps in problem solving : defining the problem, generating
solutions, evaluating and selecting solutions, and implementing solutions. Help your
team to think creatively at each stage by getting them to consider a wide range of
options. If ideas run dry, introduce an alternative brainstorming technique, such as brain
writing . This allows your people to develop one others' ideas, while everyone has an
equal chance to contribute.
After the presentations, encourage teams to discuss the different decision-making
processes they followed. You might ask them how they communicated and managed
their time . Another question could be about how they kept their discussion focused. And
to round up, you might ask them whether they would have changed their approach after
hearing the other teams' presentations.

Advice fbr the J'eacher/F acilitator:

. Students are asked to recite verses: 26.28,63,65 (virtue) of Neetisatakam-Holistic

development of personality.
. Studentsare asked to identify personality of role Mmodels from Shrimad Bhagwadgee ta and portray the

t4

\t--4.- ffi*.*
 roles of the same.
. Students are asked to practice Yoga and meditation techniques

\t4.- cY
l5

gta"^--
Reference Textbooks:

L Hurlock, E.B. Personality Development, 28th Reprint. New Delhi: Tata McGraw Hill, 2006.
2. Gopinath,Rashtriya Sanskrit Sansthanam P, Bhartrihari"s ThreeSatakam, Niti-sringar- vairagya, New
Delhi, 2010
3. Swami Swarupananda, Srimad Bhagavad Gita, Advaita Ashram,Publication Deparlment, Kolkata, 2016.
4. Lucas, Stephen. Art of Public Speaking. New Delhi. Tata - Mc-Graw Hill.200l
5. Mile, D.J Powerof positive thinking. Delhi. Rohan Book Company,(2004).
6. Pravesh Kumar. Allabout Self- Motivation. New Delhi. Goodwill Publishing House. 2005.
7. Smith. B. Body Language. Delhi: Rohan Book Company.2004
8. Yogic Asanas for Group Training - Part-l: Janardhan Swami Yogabhyasi Mandal, Nagpur.
9. Rajayoga or Conquering the lnternal Nature by Swami Vivekananda, Advaita Ashrama (Publication
Department), Kolkata.
10. Nagendra H.R nad Nagaratna R, Yoga Perspective in Stress Management, Bangalore, Swami Vivekananda
Yoga Prakashan.
C)nline Resources:
I. https://on I i necourses.nptel.ac. in/noc I 6_ge04/prev i ew
2. https: I I freev i deo I ectu res. com/cou rse/3 5 3 9/i nd i an -ph i I osophy/ I I

\t-fa" -Y t6

1u
 Krishna University
M Sc., Computer Science
R22 Regulations
22MCSLABl0l: Data Structures Lab

Course Name Data Structures Lab L T P C IM EM TM

22MCSLABIO Z2MCSLABIOI 0 0 6
a
J 30 70 100

L,Lecture,T,Tutorial,P,Practical,C,Credits.IM,lnternalMarks,E,r'

List of Programs

I . Java program to implement Stack operations using Arrays

2. Java program to implement Queue operations using Arrays

3. Java programto implement linked list operations using Arrays

4. Java Program to implement tree traversal techniques

5. Java program to convert infix expression to postfix expression

6. Java program to evaluate postfix expression

7. Java program to implement Binary search.

8, Jar,a program to implement Selection sort

9. Java programto implement Inserlion sort

10. Java program to implement quick sort

I l. Java program to implement Merge Sort

12. Java Program to perform the following operations:

a) Insertion into a B-Tree b) Searching in a B-Tree.

It3- aY
t7
 Krishna University
M Sc.,Computer Science
R22 Regulations
22MCSLAB102: Programming and problem solving using python Lab

Course Name Programming and problem L T P C IM EM TM

solving using python Lab

Course Code 22MCSLAB I02 0 0 6 J 30 70 100

,InternalMarks,EM,ExternalMarks,TM,TotalMarks

l,ist of Programs

l. Write Python program to reverse a numberand also find the sum of digits in the reversed number.
Prompt the user forinPut.

2. Write Python code to check the given year is leap year or not.

3. Write Python code to determine whether the given string is Palindrome or not using slicing

4. Write Python code to add two matrices and also find the transpose of the resultant matrix.

5. Write Python code to swap two numbers without using intermediate variable.
6. Consider a rectangle class and create two rectangle objects. Write a python program to check whether
the area of flrstrectangle is greater than the second by overloading greater than operator.

7. Write Python program to count the number of times an item appears in the list.

8. Write Python code to convert uppercase letters to lowercase and vice versa
g. Write python codeto performa linear search for agiven key number in the list and report success or
failure.

10. Write python code to sort numbers in a list in ascending order using Bubble sort by
passing the list as
an argument tothe function call.

I I . Write python code to calculate the area and perimeter of different shapes using polymorphism.

tt-+a-- r8

q6*L _.-/-
 Krishna University
M Sc., Computer Science
R22 Regulations
22MCS20l: Design and Analysis of Algorithms

Course Name Design and Analysis of Algorithms L T P C IM EM TM

Course Code 22MCS20 r 4 0 0 4 30 70 r00

L-Lecture. T-Tutorial. P-Practical. C-Credits, IM-lnternal Marks. EM-External Marks, TM-l'otal Marks

Course Description and Purpose:

This course introduces basic methods for the design and analysis of efficient algorithms
emphasizing methods useful in practice. Different algorithms for a given computational task are
presented and their relative merits evaluated based on performance measures.

Course 0bjectives:
Upon completion of this course. students will be able to do the lollowing:

r' Analyzethe asymptotic performance of algorithms.

/ Write rigorous correctness proofs for algorithms.
/ Demonstrate a familiarity with major algorithms and data structures.
/ Apply important algorithmic design paradigms and methods of analysis.
/ Synthesize efficient algorithms in common engineering design situations.
Course Learning Outcomes:
At the end of this course student will:
./ Understand the basic notation for analyzing the performance of the algorithms.
./ Use divide-and-conquer techniques for solving suitable problems
,/ Use greedy approach to solve an appropriate problem for optimal solution.
./ Apply dynamic programming approach to solve suitable problems
,/ l.-Jnderstand the limitations of algorithm power and study how to cope with the
limitations of'algorithm power for various problems.

Course Content:

UNIT -I
Introduction to Algorithm : Algorithm definition" properties, Different areas to study about
algorithms,Pseudo code expressions for an algorithm, Performance Analysis, Time Complexity &
Space Complexity, Asymptotic notations.

\t-4.-- V l9
ffl/ M
Elementary Data Structures: Stacks and Queues, Trees: Terminology - Binary Trees, Dictionaries :
Binary Search Trees, Heaps, Heapsort, Sets and disjoint set Union: Introduction - union and find
operations. ;Graphs: Introduction - Definitions - Graph Representations.

ffiL'
\t-+r- -Y
20
UNIT-II
Introduction to Divide and Conquer : Binary search, Binary search analysis, Quick sort. Quick sort
analysis, Merge sort. Merge sort Analysis, Strassen's matrix multiplication, Finding Maximum and
minimum.
Greedy Method : Introducticln. General rnethod. Job sequencing with deadlines" single source
shortest pathproblem. Optimal storage on tapes" Knapsack problem, Minimum cost spanning trees:
Prim's Algorithm, Kruskal's Algorithm.

UNIT-III
Dynamic Programming : Single source shortest path problem, Multi stage graphs, All pairs shortest
path. Optimal Binary search tree,0il Knapsack problem, Reliability design" Travelling person
Problem. Flow shop scheduling.
Basic Traversal and Search Techniques: Techniques fbr Binary Trees, Techniques for graphs: Breadth
First Search and Traversal-Depth First Search; Connected Components and Spanning Trees -Bi-
connected components and DFS

UNIT-IV
lntroduction to Backtracking: General method, N-queens problem, sum of sub sets problem, Graph
coloring. [{amiltonian cycles, Knapsack problem.
Branch and Bound : The Method: Least Cost search -The I 5 puzzle - control abstractions fbr LC
search - Bounding - FIFO Branch and Bound - LC Branch and Bound; 0/l knapsack problem: l-C
Branch and Bound solution - FIFO Branch and Bound solution;Traveling Sales person.

TJNIT-V
NP-tlard and NP-Complete problems: Basic concepts:Non deterministic algorithms -The classes
NP hard and NP complex; Cook's theorem

Reference Text books:

l. Sarraj Sahni ,Fundamentals of Computer Algorithms. 2nd Edition, University Press.

2. Anany Levitin. Introduction to the Design & Analysis of Algorithms, 2nd Edition, Pearson Education

3. I Clhandra Mohan. Design and Analysis of Algorithms, PHI

4. Prabhakar Gupta and Vineet Agarwal, Design and Analysis of Algorithms, PHI

5. Parag Himanshu Dave, Design and Analysis of Algorithms, Pearson Education

It3.--
Gy
2l
 Krishna University
M Sc.,Computer Science
R22 Regulations
22MC5202 Operating Systems

Course Name Operating Systems L T P C IM EM TM

Course Code 22MCS202 4 0 0 4 30 70 r00

L-Lecture. T-'futorial. P-Practical. C-Credits. IM-lnternal Marks, EM-lrxternal Marks, TM-'fotal Marks

Course Description and Purpose:

Covers the classical internal algorithms and structures of operating systems, including CPU
scheduling. memory management, and device management. Considers the unifying concept of the
operating system as a collection of cooperating sequential processes. Covers topics including file
systems. virtual memory, disk request scheduling, concurrent processes, deadlocks, security, and
integrity.

Course Objectives:

,/ T'o understand the services provided by and the design of an operating system.
,/ To understand the structure and organization of the file system.
,/ To understand what a process is and how processes are synchronized and scheduled.
,/ To understand dilferent approaches to memory management'
,/ Students should be able to use system calls tbr managing processes, memory and the file system.
,/ Students should understand the data structures and algorithms used to implement an OS.

Cou rse Learning Outcomes:

At the end of this course the students should be able to:

./ Understand t'undamental operating system abstractions such as processes, threads, files,

semaphores,lPC abstractions, shared memory regions, etc'.

,/ Analyze important algorithms eg. Process scheduling and memory management

algorithms.

,/ Categorize the operating system's resource management techniques, dead lock management
techniques,memory management techniques

Course Content:

UNIT- I
Operating-System Structures: Operating System Services, User and Operating System lnterface. System

tt-4.-- &
22

w
Calls" Types of System Clalls. System Programs. Operating System Design and Implementation. Operating
System Structure.

Processes: Process Concept, Process Scheduling, Operations on Processes, lnter Process Communication,
Communication in Client-Server Systems.
UNIT- II
Threads: Overview, Multicore Programming, Multithreading Models, Thread L.ibraries. Implicit
Threading. Threading Issues.
'l'hread Scheduling.
CPU Scheduling: Basic Concepts. Scheduling Criteria, Scheduling Algorithms,
M ultiple Processor Schedul ing,

Background. The Critical SectionProblem, Peterson's Solution,

Process Synchronization:
Synchronization Hardware, Mutex Locks, Semaphores, Classic Problems of Synchronization, Monitors.

UNIT -III
Deadlocks: System Model, Deadlock Characterization, Methods for tlandling Deadlocks, Deadlock
Prevention. Deadlock Avoidance. Deadlock Detection. Recovery from Deadlock.

Main Memory: Swapping, Contiguous Memory Allocation, Segmentation, Paging, Structure of the Page
Table. lntel 32 and 64-bit Architectures.

Virtual Memory: Background, Demand Paging, Copy-on-Write, Page Replacement, Allocation of

Frames. Thrashing.

UNIT- IV
Mass Storage Structure: Overview of Mass Storage Structure, Disk Structure, Disk Attachment. Disk
Scheduling, Swap Space Management, RAID Structure.

File System Implementation: File System Structure, File System Implementation. Directory
Implementation. Allocation Methods. Free Space Management.

UNIT -V
I/O Systems: Hardware, Application I/O Interface, Kernel I/O Subsystem, Transforming l/O Requests to
Hardware operations, STREA M S, Performance'

Protection: Goals of Protection, Principles of Protection, Domain of Protection, Access Matrix,

Implementation of the Access Matrix. Security and protection.

A review of Mobile Operating Systems, Featttres of Android Operating Systems.

Reference Text books:

l. Abraham Silberschatz,&Perer Baer Galvin, Greg, Operating System Concept, Ninth Edition. Wiley.
20t5
2. William Stallings, Operating Systems-lnternals and Design Principles" Fifth Edition.
Pearson
Education. 2007
3. Achyut S Godbole, Operating Systems, Second Edition. TMH' 2007
4. Fynn/McFJoes. Operati ng Systems. Cen gage Learn i n g, 200-8 :
I

5. Oeitet & Deitel. Operating System. T'hird Edition. Pearson Education. 2008

23 ?W #"'/"'
\t-+; &
 Krishna University
M Sc., Computer Science
R22 Regulations
22MC5203: Database Management Systems

Course Name Database Management Systems L T P C IM EM TM

Course Code 22MC5203 4 0 0 4 30 70 r00

L-Lecture. T-Tutorial, P-Practical, C-Credits, IM-lnternal Marks, EM-External Marks, TM-Total Marks

Course Description and Purpose:

This course introduces the core principles and techniques required in the design and implementation
of database systems. This course focus on relational database management systems, lt also covers
essential DBMS concepts such as: Transaction Processing, Concurrency Control and Recovery and
various types of databases like distributed database, and intelligent database, Client/Server. It also
provides students with theoretical knowledge and practical skills in the use of'databases and
database management systems in infbrmation technology appl ications.

Course 0bjectives:

,/ To understand basic concepts ofdatabases and database users.

./ To learn the basics of Functional Dependencies and Normalization fbr Relational Databases &
'['ransaction Processi ng Concepts.
,/ T'o learn Concurrency Control Techniques and Distributed Database Concepts,
,/ To know Querying, Creating, Updating & Deleting Documents in Mongo DB, Data Lakes.

Course Outcomes:

Upon successful completion of the course, the student will be able to:

'/ l,earn the concepts of databases and database users.

,/ Learn the basics of normalization.
'/ Learn entity relationship models.
,/ To understand the relational algebra and relational calculus.
,/ To know Querying, Creating, Updating & Deleting documents in SQL.

Course Content:

UNIT-I
Databases and Database Users: lntroduction, Characteristics of the Database Approach, Actors on the Scene,
workers behind the scene, Advantages of the using the DBMS Approach.
Database System Concepts and Architecture: Data Models, Schemas and Instances, Three Schema
architecture and Data lndependence, Database Languages and Interfaces, Centralized and Client/Server
Architecture for DBMS, Classification of Database Management Systems.

T]NIT-II -['ypes,
Data Modeling Using the ER Model:Conceptual Data models, Entity Entity Sets, Attributes and
Keys. Relationship types, Relationship sets, roles and structural Constraints, Weak Entity types,

24

\t-+7
Relationship Types of Degree Higher than Two, Refining the ER Design for the COMPANY Database.

The Relational Algebra and Relational Calculus: Unary Relational Operations: SELECT and PROJECT',
Relational Algebra Operations fiom set Theory, Binary Relational Operations: JOIN and DIVISION,
Additional Relational Operations, Examples, The Tuple Calculus and Domain Calculus.
UNIT- III
f:unctional Dependencies and Normalization flor Relational Databases: Informal Design Guidelines for
Relation Schemas, Functional dependencies, Normal Forms Based in Primary Keys, General Definitions of
Second and Third Normal Forms, Boyce-Codd Normal Form, Multivalued Dependencies and Fourth
Normal Form, Join Dependencies and Fifth Normal Form, Inclusion Dependencies.

UNIT-IV
lntroduction to Transaction Processing Concepts and Theory: Introduction to Transaction Processing.
'l'ransaction
and System Concepts, Desirable Properties of Transactions, Characterizing Schedules Based on
Recoverability. Characterizing schedules Based on Serializabi lity.

Concurrency Control Techniques: Two Phase Locking Techniques for Concurrency Control, Concurrency
Control Based on Timestamp Ordering, Multiversion Concurrency control techniques, Validation
concurrency control Techniques,

UNIT.V
SQL-99: Schema Definition, Constraints, Queries and Views: SQL Data Definitions and Data Types,
Specifying Constraints in SQL, Schema Change Statements on SQL, Basic Queries in SQL, More Complex
SQL Queries, INSERT, DELETE and UPDATE statements in SQL, Triggers and Views.
F-merging Database Technologies and Applications- Mobile Databases, Multimedia Databases" Geographic
infbrmation Systems.

Reference Text books:

l. Ramez Elmasri& Shamkant B. Navathe, Fundamentals of Database Systems, Pearson, Seventh Edition.
20t6.
2. Pramod J.sadalage & Martin Fowler. No SQL Distilled . Addison-Wesley, Second Edition. 2013
3. Kristina Chodorow, Mongo DB. O'Reilly, Second Edition, 2013
4. MandyChessell Ferd Scheepers, Maryna Strelchuk, Ron van der Starre,Seth Dobrin,Daniel Hernandez
From Data Lake to Data Driven Organization. IBM-Red Guide,2Ol8

:t":tl"-

\tY 25
W v\n
 Krishna University
M Sc., Computer Science
R22 Regulations
22MCS204: Research Methodology & Intellectual Property Rights (lPR)

Course Name Research Methodology & & L T P C IM EM TM

Intellectual Property Rights ( IPR)
Course Code 22:jMC5204 J 0 I J 30 70 r00

L-Lecture, T-Tutorial, P-Practical, C-Credits, IM-lnternal Marks, EM-External Marks, TM-Total Marks

Course Description and Purpose:

The aim of this course is to develop research bent of mind (spirit ol'inquiry) and impart research skills to the

all Post graduate students. It also encompasses the series of research methodology contents: from problem
fbrmulation, to design, to data collection, analysis, reporling and dissemination. This course also covers
intellectual property rights (lPR), and intended to equip students with conceptual understandings of current
scenario of lPR. and the practical issues encountered in filing patents, trademarks and copyrights.

Course Objectives:
,/ To understand some basic concepts of research and its methodologies
,/ To develop an understanding of the basic framework of research process.
,/ To develop an understanding of various research designs and techniques.
,/ To identify various sources of information for literature review and data collection.
,/ Ability to write a research Proposal, report and thesis

,/ To demonstrate knowledge and understanding of IPR Filing and Rights

Course Learning Outcomes:

At the end of this course the students should be able to:
,/ Understand some basic concepts of research and its methodologies

'/ ldentify appropriate research topics

'/ Select and define appropriate research problem and parameters
,/ Demonstrate the ability to choose methods appropriate to research aims and objectives

'/ Have adequate knowledge on measurement & scaling techniques

./ Have basic awareness of data analysis-and hypothesis testing procedures

'/ Prepare a project proposal (to undertake a project)

,/ Write a research reporl and thesis
./ File Patents.'frademarks and Copy Rights

Course Content:

26
UNIT I
Foundations of Research
Meaning of Research - Definitions of Research - Motivation in Research - Ceneral Characteristics of'Research
- Criteria of Cood Research - Types of Research - ResearchProcess * Research Methods vs. Methodology
Defining and Formulating the Research Problem - Review of Literature - Approaches to Critical Literature
Review - Importance of Literature Review in ldentifying Research Gaps and Defining a Problem
Development of Working Hypothesis.
TJNIT II
Research Design. Sampling Concepts. and Data Collection Methods
Meaning. Significance and Characteristics of Good Research Design - Types of'ResearchDesign: lrxploratory.
Conclusive Research and Experimental - Sampling Theory: 'l'ypes of Sampling and Errors in Sampling _' Data
Collection: Types of Data - Data Collection Methods and Techniques for Primary and Secondary Data.
UNIT III
Measurement & Scaling Techniques, Hypothesis Formulation and Testing, Overview of Data Analysis and
Report Writing

Basic measurement scales - Reliability & Validity - Definition and Types of Hypothesis I-lypothesis
Formulation and Testing Procedure - Overview of Data Analysis: Methods, Process and Types -- Report
Writing: Significance of Report Writing, Different Steps in Writing Report, Layout of the Research Report,
-fypes
of Reports, Oral Presentation, Mechanics of Writing a Research Report, Precautions for Writing Research
Repofts - Howto Write a Research Proposal.Research Ethics, Conflict of Interest and Plagiarism.

UNIT IV
Intellectual Property Rights (l PR)
Deflnition and Nature and Features of Intellectual Property Rights (lPR) - Types of IntellectualProperty Rights -
Procedure for Crants of Patents - Rights of a Patent - Scope of a Patent Rights
t-icensing and Transfer of Technology - Why protection of intellectual property is important?

- Enforcement of IPR - Infiingement of IPR.

UNIT V
Indian and lnternational Scenario and New Developments in IPR

IPR Developments in India fbr the past Five Years - Development of IPR Laws in India - International
Cooperation on IPR - New Developments in IPR - Administration of Patent System -lnternational Patent
protection - Case Studies in Indian and Global Contexts.

PRACI'ICA L- COM PON ENTS :

,/ Students should identify different research problems with examples and describe the characteristics of
researchable problems in their academic arealsociety/communitylorganization concerned.
./ Students are to form in groups (a group consists of 4-6 students) and conduct critical literature survey
with regard to the identified research problems and prepare a brief literature review coupled with
research gaps and working hypothesis.

{uM
./ Students are required to identify and develop good research design to address the defined resedrch
problems.

27

\L-+- eY
'/ Students are expected to write the researih design on Exploratory and DescriptiveResearch.

'/ Students are required to develop practical experience in writing a research proposal byconducting a

thorough critical review of any three research proposals (examples).

,/ Students are expected to develop templates for technical report writing.

'/ Students should conduct a team based mini research project, which is a unified andpractical case
on a topic of their choice, with approximately 4-6 students per group.

'/ Students are expected to identify types of plagiarism in academic research, and how toavoid
plagiarism in research.
,/ Students are asked to identify and submit a brief report on Indian patents of Internationalrepute.
,/ Students are asked to write on Patent registration procedure, and visit Official website of
lntellectual Property India https://ipindia.gov.in to know how to get IPR in India.
,/ Students are asked to identity and summarise remedies available against the infringementol'intellectual
property rights in lndian and global contexts.
,/ Students are asked to submit any five examples of ethical issues in copyright and patents.

Reference Text Books:

L Garg,8.L., Karadia, R., Agarwal, F. and Agarwal, U.K.,2002, An introduction to Research

Methodology, RBSA Publ ishers.
2. Cohen. L. Lawrenc€, M.o & Morrison, K. (2005). Research Methods in Education (5thedition). Oxford:
Oxlord University Press.
3. Kothari. C.R., 1990, Research Methodology: Methods and Techniques, New Agelnternational.
4. Dornyei, Z. (2007). Research Methods in Applied Linguistics. Oxford: Oxford UniversityPress.
5. Anthony, M., Craziano, A.M. and Raulin, M.L., 2009. Research Methods: A Process oflnquiry,

Allyn and Bacon.

6. Fink, A., 2009. Conducting Research Literature Reviews: From the Internet to Paper. Sage

Publications.

7 . Day, R.A., I 992, How to Write and Publish a Scientific Paper, Cambridge University Press.
8. Wadehra, B.L.2000, Law relating to patents, trade marks, copyright designs and geographicalindications.
Universal Law Publishing.
9. Coley, S.M. and Scheinberg, C. A., 1990, Proposal Writing, Sage Publications.
10. Carlos, C.M.,2000. Intellectual property rights, the WTO and developing countries: the
TRIPS agreement and policy options, Zed Books, New York.

ll. Leedy. P.D. and Ormrod. J.8..2004, Practical Research: Planningand Design, Prentice l{all.
t2. Satarkar, S.V., 2000. Intellectual property rights and Copy right. Ess Publications.

r3. Important Websites:

tr3{
28

di
> www.ipindia.nic.in - Intellectual Property Office. India
> www.patentoffice.nic.in - Patent office, lndia
> http://copyright.gov.in/ - Copyright Office, India
> ipr.icegate.gov.in - Automated Recordation & Targeting for IPR Protection
>- http://www.icegate.gov.in- E- Commerce portal of Central Board of Excise and Customs
>. www.ipab.tn.nic.in - Intellectual Property Appellate Board, India
> www.mit.gov.in _- Department of lnfbrmation Technology, India
> http:i/www.m it.gov. in/content/office-semiconductorintegrated-circuits-layout-designregistry
> Semiconductor I ntegrated C i rcu its Layout-Desi gn Regi stry (S I C LDR)

\t 3.-
29
 Krishna University
M Sc., Computer Science
R22 Regulations
22MCSDSE20l : Mobile Computing

Course Name Mobile Computing L T P C IM EM TM

Course Code 22MCSDSE2O I 4 0 0 4 30 70 r00

L-[,ecture. T-Tutorial. P-Practical. C-Credits. IM-lnternal Marks, EM-External Marks, TM-Total Marks

Course Description and Purpose:

Mobile Computing is a course that illustrates basic concepts of Wireless Networks, Generation of Mobile
Nodes, Mobile System Architecture, GPRS, Mobility Management, Wireless Access Technologies. IPv4,
Mobile IP, Mobile Transport Layer, Wireless TCP, Next Generation Networks, File Systems.

Course Objectives:
This course will help enable the students to understand the basic concepts of wireless networks, Mobile
Computing architecture, GPRS. Mobility Management and wireless access and various transpofi layers
and file systems.

Specifi c objectives include:

'/ 'fo understand the basic concepts of Worldwide Networks, Wireless Transmission and Generations of
Mobile Systems.
,/ To perceive the architecture and common technologies for mobile communication.
'/ 1'o Grasp the IP Network Protocols and methods used in IP Routing of Packets.
'/ 'l-o apprehend the working of Mobile Transport Layer and Wireless TCP.
'/ To Gain knowledge regarding the Next Ceneration Networks and File Systems.

Course Learning Outcomes:

Upon successful completion of the course, the student will be able to:
'/ Gain knowledge on the concepts of Worldwide Networks, Wireless Transmission and Generations of
Mobile Systems.
,/ Understand architecture and common technologies for mobile communication.
,/ Know the IP Network Protocols and methods used in IP Routing of Packets.
'/ Understand the working of Mobile Transport Layer and Wireless TCIP.
'/ Apprehend regarding the Next Generation Networks and File Systems.
UNIT-I
Introduction: World Wide Networks: Computer Networking, Significance of TCP/lP Protocol Stack in
World Wide Networking, lnternet Applications.
Wireless Networks: Limitations, Mobile Computing Paradigm, Promises,Novel Application.
Generation of Mobile Systems: Features of First Generation, Second Generation, Third Generation,
Fourth Ceneration and Comparison.

UNIT-II
Mobile System Architectures: GSM:System Architecture, Functional Subsystems of GSM: Radio
Interfaces, Protocols, Handover, New Data Services.
30

\t-+5- dU
GPRS: System Architecture, Protocol Layers, Comparison of GSM & GPRS
Mobility Management: Location Management, Handover, Mobility Management in GSM & GPRS.
Wireless Access Technologies: WPAN, Bluetooth. WLAN, Wi-F'i, WMAN, Wi-MAX.

Ttsf/
\t-2.- eY 3r
UNIT-III
IPV4: Features of IPV4, Classes in lPV4 Addressing.
Mobile IP: Entities and Terminology, IP Packet Delivery, Agent Discovery, Registration, Tunneling and
Encapsulation, IPV6, IPV4 versus IPV6.

UNIT. IV
Mobile Transport Layer: Traditional TCP: Congestion Control, Slow Start, Fast Retransmit/Fast
Recovery. Impl ications of Mobi I ity.
Wireless TCP: Indirect TCP, Snooping TCIP. Mobile TCP. Fast Retransmit/Fast Recovery,
Transmission/Time out Freezing. Selective Retransmission. Transaction Oriented TCP. TCP over 2.5/3G
Wireless Networks.

UNIT-V
Next Generation Networks: Architecture of NGN, Core Network, Access Network, Capabilities of NGN,
Characteristics of NGN, Generalized Mobility on NGN, Transport Independent Service Paradigm.
File Systems: Coda, Little Work, Ficus, Mio-NFS, Rover Mobile Operating Systems: Symbian, Android
Wireless Markup Language (WML) and WML Script, Extensible Markup L.anguage and its Applications.

Reference Text books:

l. Jochen Schiller, Mobile Communications, Pearson Education, Second Edition 2002

2. Raj Kamal, Mobile Computing, Oxford Press(2008)
3. Ashok K Talukder and Roopa R Yavagal, Mobile Computing, TMH(2008)

ffi/ o'W.6-;
\\3a S/
32
 Krishna University
M Sc., Computer Science
R22 Regulations
22MCSDSE 2022 Softwa re En gineerin g

Course Name Software Engineering L T P C IM EM TM

Course Code 22MCSDSE202 4 0 0 4 30 70 100

L-Lecture, T-Tutorial, P-Practical, C-Credits, IM-lnternal Marks, EM-External Marks, TM-Total Marks

Course Description and Purpose:

Almost every computer science and computer engineering curriculum now includes a required team-
based software development project. In some cases, the project is only one semester or quarter in length,
but a year-long team based software development project is fast becoming the norm.
In present world, every student would complete a course in software engineering before starting his or
her team-based project. In practice, however, many students have to start their projects partway through
their software engineering course.

Course Objectives:

Specific objectives include:

,/ J'o understand the basic concepts of Software Engineering and its concepts.
,/ To understand various life cycle models.
'/ To grasp the knowledge software process and requirements workflow.
'/ To apprehend the knowledge of software metrics.
'/ To gain the knowledge of Object Oriented Paradigm.

Course Learning Outcomes:

Upon successful completion of the course, the student will be able to:
,/ Gain knowledge on the concepts of Software Engineering requirements, analysis and design.
,/ Understand different life cycle models.
,/ Known the concept of object oriented paradigm .

./ tJnderstand the working of software Architecture and their design patterns

Unit-l
The Scope of Software Engineering- Requierments, Analysis and Design Aspects, Object Oreinted
Paradigm, Iteration and incrementation, Risks and other aspects of lteration and Incrementation"
Managing Iteration and Incrementation. Code and fix life cycle model, Waterfall lile cycle model, Open
source life cycle model, Agile processes, spiral life cycle model, Comparison of life cycle models.

Unit-ll
'fhe software process- The unified process lteration and inceremetation with in the Object-Oriented
Paradigm. T-he requirements workflor.v, The Analysis Workf'low. The design Workflow, The
Implementation workflow, The phases of the Unified Process, Capability Maturity Models.

JJ

ffi/ q6,"" --t'-

\L-4r- Y
Unit-lII
Software Metrics, CASE, Taxonomy of CASE, Scope of CASE, Soflware Versions, Configuration
Control.
Testing quality issues, Non Execution Based Testing, Execution based testing.

\t-+7 d/ 34
Unit-lv
Modules to Objects- What is a Module?, Cohesion, Copuling, Data Encapsulation, Abstract Data Types,
lnformation fliding. Objects. Inheritance, Polymorphism, and Dynmaic Binding, Object-Oriented
Paradigm.

Unit-V
Reuse concepts, Objects and Reuse , during design and implementation, Design Reuse, Application
Frameworks, Design Patterns, Software Architecture, More on Design patterns'

Reference Textbooks:

l. Stephen. R. Schach, Object-oriented and classical software Engineering, Eight Edition.

2. Stephen. R. Schach, Object-oriented and classical software Engineering, Seventh Edition'

\t4"-- d 35
,6L'"eM#
-^- -
 Krishna University
M Sc.,Computer Science
R22 Regulations
22MCSDSE203: Data Warehousing & Data Mining

Course Name Data Warehousing & Data Mining L T P C IM EM TM

Course Code 22MCSDSE2O3 4 0 0 4 30 70 t00

L.Lecture. T.Tutorial. P.Practical, C.Credits" IM.lnternal Marks. EM.External Marks" TM.Total Marks

Course Description and Purpose:

T'his course gives an introduction to methods and theory for development of data warehouses and data
analysis using data mining. Data quality and methods and techniques for preprocessing of data. Modeling
and design of data warehouses. Algorithms for classification, clustering and association rule analysis.

Course Objectives:
,/ To understand basic concepts of data mining and overview
,/ To learn the basics of mining patterns.
,/ To learn the concepts of advance pattern mining.
,/ To understand the classification and various methods.
'/ To know cluster analysis mechanism.
Course Learning Outcomes:
At the end of this course the students should be able to:
,/ Understand the basics of data mining and data pre-processing techniques.
'/ Aware of constructing the data warehouse, relevant data model concepts.
./ ljnderstand the Frequent Item set Mining Methods and different levels in association rules
./ Understand the basic concepts in classiflcation and advanced classification methods by implementing
various algorithms.
,/ Shoutd be able to find the similarities among the data using clustering algorithms and outlier analysis.

Course Content:

Unit-I
Data Mining Concepts- Overview of Data Mining Technology, Association Rules. Classification,
Clustering, Approaches to Other Data Mining Problems, Applications of Data Mining, Commercial Data
Mining Tools.

Unit-ll
Overview of Data Warehousing and OLAP- Introduction, Definitions and Terminology, Characteristics of
Data Warehouses, Data Modeling for Data Warehouses, Building aData Warehouse, Typical
Functionality of a Data Warehouse, Data Warehouse versus Views, Problems and Open Issues in Data
Warehouses.

Unit-III
36
sfif/
\\--1a-
Mining Frequent patterns, Associations: Basic concept- Market basket analysis: A Motivational Example,
Frequent ltemsets, closed itemsets and Association Rules, Frequent itemset Mining Methods

Advanced Pattern Mining: Pattern Mining: A Road Map. Pattern Mining in Multilevel, Multidimensional
Space-Mining Multilevel association rules, Mining Multi Dimensional Associations, Mining Quantitative
Association Rules.
Unit-Iv
Classification: Basic Concepts:Basic concepts-What ls Classiflcation? Gcneral Approaches to
classification. Decision tree Induction- Decision tree induction, Attribute selection measures, tree pruning.
Scalability and Decision Tree Induction, Bayes Classification Methods - Bayes Theorem, Navie Bayesian
c lassification.
Advanced Methods: Bayesian Belief Networks-Concepts and mechanisms, Training Bayesian Belief
Networks Classification by Back Propagation.

UNIT V
Cluster Analysis Introduction: What is Cluster Analysis? Requirements fbr Cluster Analysis. A
Partitioning Methods-k-means. K-medoid, l-{ierarchical Methods- Agglomerative versus Divisive
llierarchical clustering, Distance measures in Algorithmic methods, BRICH: Multiphase hierarchical
Clustering using Clustering Feature Trees, Chameleon Hierarchical Clustering, Density Based Methods:
DBSCAN.

Reference Textbooks:

l. Jiawei Han. MichelineKamber. Data mining:Concepts &Techniques, Morgan Kaufnrann 3'd Edition.
2. Ramez, Elmasri, ShamKant B.Navathe, Fundamentals of Database Systems, Fourth Edition.
3. Ralph Kimball, The Data Warehousing, Wiley
4. S.N.Sivanandam, S.Sumathi, Data Mining-Concepts, Tasks and Techniques, Thomson.

\u4t-" c 37 n>
 Krishna University
M Sc.,Computer Science
R22 Regulations
22MCSLAB20I: Operating Systems Lab using Linux

Course Name Operating Systems Lab L T P C IM EM TM

Course Code 22MCSLab20 | 0 0 6 J 30 70 100

L,Lecture, T,Tutorial, P,Practical, C,Credits, IM,lnternalMarks, EM,External Marks, TM,TotalMarks

List of Programs

I .
Write programs using the following system calls of Linux operating system:
fbrk. exec, getpid, exit, wait, close, stat, opendir, readdir
2. Write programs using the I/O system calls of Linux operating system (open, read,
write. etc)
3. Write C programs to simulate Linux commands like ls, grep, etc.
4. Civen the list of processes, their CPU burst times and arrival times, display/print
the Cantt chart for FCFS and SJF. For each of the scheduling policies, compute
hnd print the average waiting time and average turnaround time.
5. Given the list of processes, their CPU burst times and arrival times, display/print
rhe Gantt chart for Priority and Round robin. Foreach of the scheduling policies,
compute and print the average waiting time and average turnaround time.
6. Developing Application using Inter Process communication (using shared
memory, pipes or message queues)
7. Implement the Producer - Consumer problem using semaphores (using UNIX system calls).
8. lmplement some memory management schemes - I
9. lmplement some memory management schemes - II
10. Implement any file allocation technique (Linked, lndexed or Contiguous)

\t-4r -Y M/
 Krishna UniversifY
M Sc.,Computer Science
R22 Regulations
22MCSLAB202: Database Management Systems Lab

Course Name Database Management Systems Lab L T P C IM EM TM

Course Code 22MCSLab202 0 0 6 3 30 10 100

I-J-ect r*ruutorial, P,Practical, C,Credits, IM,lnternal Marks, EM,External Marks, TM,Total Marks

List of Programs

Cycle-l: Aim: Marketing company wishes to computerize their operations by using fbllowing
Tables.

Table Name: Client- Master

ion: Used to store client in formatilon
Column Name Data Type Size Attribute
Primary key and flrst letter must start
CLIENT- NO YarcharZ 6
with"C'
NAME Varchar2 20 Not null
ADDRESS I YarcharZ 30
ADDRESS S Yarchar2 30
CITY Varcha12 l5
PINCODE Yarchar2 8

STATE Varchar2 l5
BAL DI.,]I1 Number 10,2

Table Name: Product Master

Description: Used to store product infbrmation
Column Name Data Type Size Attribute
Primary key and first letter must start
PRODUCT Yarchar2 6
with'P'
-NO
DESCRIPTION Varcha12 l5 Not null
PROFIT PERCENT Number 4.2 Not null
LJNIT MEASIJE Yarchar2 l0
QTY ON HAND Number 8

REORDER LVL Number 8

SELL PRICE Number 8,2 Not null, cannot be 0
COST PRICE Number 8.2 Not null, cannot be 0

'l'able Name: Salesman master

Description: Used to store salesman information workin fbr the company.

Column Name

\t3.- &
 Prtmary keyind first letter must start with
SALESMAN-NO
SNIESN NN NAM
ADDRESS I

\t--4.- cY
40 wM
 STATE Yachar2 20
SAL_AMT Number 8,2 Not null, cannot be 0
TGT TO CET Number 6,2 Not null, cannot be 0
YTD SALES Number 6,2 Not null
REMARKS Varcha12 20

Table Name: SALES-ORDER

Descnptlon: Used to store client's orders
_ Description:
Column Name Data Type Size Attribute

ORDER- NO Varcha12 6 Primary key and first letter must start with 'S'

CLIENT NO Varcha12 6 Foreign Key

ORDER DATE Date
DELY ADDRESS Yarchar2 25
SALESMAN NO Varchar2 6 Foreign Key
DELY TYPE Char I Delivery: part(p)/ full(0 and default 'F'
BILL YN Char I

DEI Y DATE Date Can't be less than order date

Values ("ln Process", " Fulfilled'",
ORDER *STATUS Varchar2 t0 "Back Order", "Cancelled.

Table Name: SALES ORDER- DETAILS

Description: Used to store clien :'s order with detail h product ordered.

Column Name Data Type Size Attribute

ORDER NO Varchar2 6 Primary key references SALES-ORDER table

PRODUCT NO Varchar2 6 roreign rcev refereniei SeLeS=qE E

OTY ORDERED Number 8

QTY DISP Number 8

PRODUCT RATE Number 10,2 Foreign Key

Solve the fbllowing queries by using above tables'

l. Retrieve the list of names. city and the state of all the clients.
2. List all the clients who are located in 'Mumbai" or'Bangalore'.
3. L-ist the various products available fiom the product-master table.
4. Find the names of sales man who have a salary equal to Rs.3000.
5. List the names of all clients having 'a' as the second letter in their names'
6. L,ist alt clients whose Bal due is greater than value 1000.
7. List the clients who stay in a city whose first letter is'M'.
g. [-ist all intbrmation from sales-order table fbr orders placed in the month of July'
g. t.istthe products whose selling price is greaterthan 1000 and lessthan orequalto 3000'
10. Find the products whose sellirig price is"greaterthan
1000 and also find the new selling price as original
selling price 0.50.
I L Find tne pl"odr.ts in the sorted order of their description.

4t frt-
'Pen drive''
12. Find the products with description as '540HDD' and

\t-? sy
13. Count the total number of orders.
14. Print the description and total qty sold for each product.
15. Calculate the average qty sold for each client that has a maximum order value of 15,000.
16. Find all the products whose quantity on hand is less than reorder level.

Nff
\\q M 42
17. List the order number and day on which clients placed their order.
18. Find out the products and their quantities that will have to deliver in the current month.
19. Find the names of clients who have placed orders worth of 10000 or more.
20. Find the client names who have placed orders before the month of June,2008.

Cycle-lI
Aim: A manufacturing company deals with various parts and various suppliers supply these parts. It consists ol'
three tables to record its entire information.
'fhose are as fbllows.

Supplier (Supplier_No, Sname, City, status)

Part( Part_no, pname, color, weight, city, cost)
Shipment (supplier_No, Part_no, city)
JX( project_no. pro.iect_name, city)
SPJX (Supplier_no, part_no, project_no, city)

l. Get supplier numbers and status for suppliers in Chennai with status > 20.
2. Get project names for projects supplied by supplier S.
3. Get colors of parts supplied by supplier Sr.
4. Get part numbers for parts supplied to any project in Mumbai.
5. Find the id's of suppliers who supply a red or pink parts.
6. Find the pnames of parts supplied by London supplier and by no one else.
7. Get the namesofthe parts supplied bythe supplier'Mart'and'Miller'.
8. Get supplier names for suppliers who do not supply part Pz.
9. Get allparirs of supplier numbers such that the suppliers concerned are "colocated".
10, Cet suppliers names for the suppliers who supply at least one red part.

Cycle -III Employee Database

Aim: An enterprise wishes to maintain a database to automate its operations. Enterprise divided into a certain
departments and each department consists of employees. The following two tables describes the automation
schemas.

l'.mp(Empno. Ename, Job, Mgr, Hiredate, Sal. Comm, Deptno)

Dept(Deptno, Dname, Loc)

l. Listthedetailsof employeeswho have joined beforetheend of September'81.

2. List the name of the employee and designation of the employee, who does not report to anybody.
3. List the name, salary and PF amount of all the employees (PF is calculated as l0% of salary)
4. List the names of employees who are more than2 years old in the organization.
5. Determine the number of employees, who are taking commission.
6. Update the employee salary by 20%, whose experience is greater than l2 years.
7. Determine the department does not contain any employees.
8. Create a view, which contains employee name and their manager names working in sales department.
9. Determine the employees, whose total salary is like the minimum salary of any department.
10. List the department numbers and number of employees in each department.
I L Determine the employees, whose total salary is like the minimum salary of any department.
12. List average salary for all departments employing more than five people.
13. Determine the names of employees, who take highest salary in their departments.
43

tu'-la-=
14. Determine the names of employees, who earn more than their managers'
15. Display ename, dname, even if no employee belongs to that department ( use outer join)

\t{ 44
 MODAL QUESTION PAPER
PG DEGREE EXAMINATION
(Examination at the end of First Semester)
M Sc., ComPuter Science
22MCS I 0 l-Data Structu res
(Regulation 2022-23)

-fime: Max. Marks: 70

3 Hours

SECTION-A (5 X 4:20 Marks)

Short Answer Questions
Answer any Five of the Following

l. (a)

(b)
(c)

(d)

(e)

(f)
(e)
(h)

SECTION-B (5 X l0 = 50 Marks)
EssaY tYPe Questions
Answer ALL Questions

UNIT-I
2. (a).
(oR)
(b).

UNIT-II

3.(a)
(OR)

(b)

1,r{5
 I.JNIT-III
4. (a)

(oR)
(b)

UNIT-IV

5 (a).

(oR)
(b).

UNIT-V
6 (a)
(oR)

(b)

\t-1/ 2

*y '6rM
 MODAL QUESTION PAPER
PG DEGREE EXAMINATION
(Examination at the end of First Semester)
M Sc., Computer Science
22MCS102: Programming and Problem Solving Using Python

(Regulation 2022-23)

Time: 3 Hours Max. Marks: 70

SECTION-A (5 X 4:20 Marks)

Short Answer Questions
Answer any Five of the Following

l. (a)

(b)

(c)

(d)
(e)

(0
(e)

(h)

SECTION-B (5 X l0 = 50 Marks)
Essay type Questions
Answer ALL Questions

UNIT-I
2. (a).
(oR)
( b).

UNIT-I I

3.(a)
(oR)

(b)

tt-4<-- V
 4. (a)

(OR)
(b)

UNIT-IV

s (a).
(oR)
(b).

UNIT-V
6 (a)
(oR)

(b)

\tJ.- 4

.y
w
^v
 MODAL QUESTION PAPER
PG DEGREE EXAMINATION
(Examination at the end of First Semester)
M Sc., Computer Science
22MCSl03: Computer Networks
(Regulation 2022-23)
Time: 3 Hours Max. Marks: 70

SECTION-A (5 X 4= 20 Marks)
Short Answer Questions
Answer any Five of the Following

l. (a)

(b)
(c)

(d)

(e)

(r)
(e)
(h)

SECTION-B (5 X 10 = 50 Marks)
Essay type Questions
Answer ALL Questions

UNIT-I
2. (a).
(oR)
(b).

UNIT-II

3.(a)
(OR)

(b)

Ir# {61/
 4. (a)
(oR)
(b)

UNIT-IV

5 (a).
(oR)
(b).
UNIT-V
6 (a)
(oR)

(b)

\t-1/ sy
6 y.*
itv'
 MODAL QUESTION PAPER
PG DEGREE EXAMINATION
(Examination at the end of First Semester)
M Sc., Computer Science
22MCSl04: Formal Languages and Automata Theory

(Regulation 2022-23)

Time: 3 Hours Max. Marks: 70

SECTION-A (5 X 4=20 Marks)

Short Answer Questions
Answer any Five of the Following

l. (a)

(b)

(c)

(d)

(e)

(f)
(e)

(h)

SECTION-B (5 X 10 = 50 Marks)
Essay type Questions
Answer ALL Questions

UNIT-I
2. (a).
(oR)
(b).

UNIT-II

3.(a)
(oR)

(b)

\r--16
7

sy
4. (a)
(oR)
(b)

UNIT-IV

5 (a).
(oR)
(b).

UNIT-V
6 (a)
(oR)

(b)

\t_a.- M/
 MODAL QUESTION PAPER
PG DEGREE EXAMINATION
(Examination at the end of First Semester)
M Sc., Computer Science
22MCSl05: Personality Development th rough Life Enlightenment Skills
(Regulation 2022-23)

Time: 3 Hours Max. Marks: 70

SECTION-A (5 X 4=20 Marks)

Short Answer Questions
Answer any Five of the Following

l. (a)

(b)

(c)

(d)
(e)

(f)
(e)

(h)

SECTION-B (5 X l0:50 Marks)

Essay type Questions
Answer ALL Questions

UNIT-I
2. (a).
(oR)
(b).

UNIT.II

3.(a)
(oR)

(b)

\t--1-- 9

-y {6/W
 4. (a)
(oR)
(b)

UNIT-IV

5 (a).

(oR)
(b).

UNIT-V
6 (a)
(oR)

(b)

\t-1a
 MODAL QUESTION PAPER
PG DEGRBE EXAMINATION
(Examination at the end of Second Semester)
M Sc., Computer Science
22MCS201: Design and Analysis of Algorithms

(Regulation 2022-23)

Time: 3 Hours Max. Marks: 70

SECTION-A (5 X 4=20 Marks)

Short Answer Questions
Answer any Five of the Following

l. (a)

(b)

(c)

(d)
(e)

(0
(e)
(h)

SECTION-B (5 X l0 = 50 Marks)
Essay type Questions
Answer ALL Questions

UNIT-I
2. (a).
(oR)
( b).

UNIT-II

3.(a)
(OR)

(b)

ll
\t-+.= dfil
 4. (a)

(oR)
(b)

UNIT-IV

s (a).

(oR)
(b).

UNIT-V
6 (a)
(oR)

(b)

\\-4.- l2
@Yw-
 MODAL QUBSTION PAPER
PG DEGREE EXAMINATION
(Examination at the end of Second Semester)
M Sc., Computer Science
22MC5202 Operati n g Systems
(Regulation 2022-23)
'fime: 3 Hours Max. Marks: 70

SECTION-A (5 X 4=20 Marks)

Short Answer Questions
Answer any Five of the Following

l. (a)

(b)
(c)

(d)

(e)

(f)
(g)

(h)

SECTION-B (5 X l0 = 50 Marks)
Essay type Questions
Answer ALL Questions

UNIT-I
2. (a).
(oR)
(b).

UNIT-I I

3.(a)
(oR)

(b)

\r-+. t3
@xffi/
4. (a)

(oR)
(b)

UNIT-IV

5 (a).

(oR)
(b).

UNIT-V
6 (a)
(oR)

(b)

tt+( 14

ey ML-%56;
 MODAL QUESTION PAPER
PG DEGREE EXAMINATION
(Examination at the end of Second Semester)
M Sc.o Computer Science
22MCS203: Database Management Systems
(Regulation 2022-23)

Time: 3 Hours Max. Marks: 70

SECTION-A (5 X 4: 20 Marks)
Short Answer Questions
Answer any Five of the Following

l. (a)

(b)
(c)

(d)
(e)

(0
(e)
(h)

SECTION-B (5 X l0 = 50 Marks)
Essay type Questions
Answer ALL Questions

UNIT.I
2, (a).
(oR)
(b).

UNIT-II

3.(a)
(oR)

(b)

tt-45 l5
4. (a)
(oR)
(b)

UNIT-IV

5 (a).

(oR)
(b).

UNIT-V
6 (a)
(oR)

(b)

\\3< 16
@y
flT,>
ffi
 MODAL QUESTION PAPER
PG DEGREE EXAMINATION
(Examination at the end of Second Semester)

22MC5204 - Research Methodology & IPR

(Regulation 2022-23)

Time: 3 Hours Max. Marks: 70

SECTION-A (5 X 4=20 Marks)

Short Answer Questions
Answer any Five of the Following

l. (a)

(b)

(c)

(d)
(e)

(0
(e)
(h)

SECTION-B (5 X 10 = 50 Marks)
Essay type Questions
Answer ALL Questions

UNIT.I
2. (a).
(oR)
(b).

UNIT-II

3.(a)
(oR)

(b)

:;;-''-

[\3.-- tl
@Y
,gf---
4. (a)
(oR)
(b)

UNIT-IV

5 (a).
(oR)
(b).

UNIT.V
6 (a)
(oR)

(b)

\\-+< 8

-y xr;-
 MODAL QUESTION PAPER
PG DEGREE EXAMINATION
(Examination at the end of Second Semester)
M Sc., Computer Science
22MCSDSE20l - Mobile Computing
' (Regulation 2022-23)

Time: 3 Hours Max. Marks: 70

SECTION-A (5 X 4=20 Marks)

Short Answer Questions
Answer any Five of the Following

l. (a)

(b)
(c)

(d)

(e)

(0
(e)
(h)

SECTION-B (5 X 10 = 50 Marks)
Essay type Questions
Answer ALL Questions

UNIT-I
2. (a).
(oR)
(b).

UNIT-II

3.(a)
(oR)

(b)

t\-1- l9 @y
4. (a)
(oR)
(b)

UNIT-IV

5 (a).

(oR)
(b).

UNIT-V
6 (a)
(oR)

(b)

\ \-1.-- 20
 MODAL QUESTION PAPBR
PG DEGREE EXAMINATION
(Examination at the end of Second Semester)
M Sc., Computer Science
22MCSDSE 202 - Software E ngineering

(Regulation 2022-23)

Time: 3 Hours Max. Marks: 70

SECTION-A (5 X 4:20 Marks)

Short Answer Questions
Answer any Five ofthe Following

l. (a)

(b)
(c)

(d)
(e)

(0
(e)
(h)

SECTION-B (5 X l0 = 50 Marks)
Essay type Questions
Answer ALL Questions

UNIT-I
2. (a).
(oR)
(b).

UNIT-TI

3.(a)
(()R)

(b)

\t3--- 2l

ffifr--'
4. (a)

(oR)
(b)

UNIT-IV

5 (a).

(oR)
(b),

UNIT.V
6 (a)
(oR)

(b)

tt--j- 22
@P
 MODAL QUESTION PAPER
PG DEGREE EXAMINATION
(Examination at the end of Second Semester)
M Sc., Computer Science
22MCSDSE 203 - Data Ware housing & Data Mining

(Regulation 2022-23)

Time: 3 Hours Max. Marks: 70

SECTION-A (5 X 4:
20 Marks)
Short Answer Questions
Answer any Five ofthe Following

l. (a)

(b)

(c)

(d)
(e)

(f)
(e)

(h)

SECTION-B (5 X 10 = 50 Marks)
Essay type Questions
Answer ALL Questions

UNIT-I
2. (a).
(oR)
(b).

UNIT-II

3.(a)
(oR)

(b)

23

t\-+-
4. (a)
(oR)
(b)

UNIT-IV

5 (a).
(oR)
(b).

UNIT-V
6 (a)
(oR)

(b)

@*
&/
24