m.sc computers syllabus and model papers

M.Sc –Computer Science-2016 Admitted Batch-I Semester

ADIKAVI NANNAYA UNIVERSITY

RAJAHMAHENDRAVARAM

M.Sc COMPUTER SCIENCE

COURSE STRUCTURE AND SYLLABUS 2016-17 ONWARDS


ADIKAVI NANNAYA UNIVERSITY Master of Science in Computer Science(M.Sc.(CS))

Course Structure and Scheme of Valuation w.e.f. 2016-17 I Semester

Code Name of the subject Periods/week Max Marks Total

Marks

Credits

Theory Practical External Internal

MSCS1.1 Discrete Mathematical

Structures

4 - 75 25 100 4

MSCS1.2 Data Structures & File

Structures

4 - 75 25 100 4

MSCS1.3 Computer Organization and

Architecture

4 - 75 25 100 4

MSCS1.4 Object Oriented

Programming using C++ and

Java

4 - 75 25 100 4

MSCS1.5 Advanced Computer

Networks

4 - 75 25 100 4

MSCS1.6 Data Structure Using C++

Lab

- 3 50 50 100 2

MSCS1.7 Computer Organization Lab - 3 50 50 100 2

Total 700 24

II Semester


Marks

Credits


MSCS2.1 Formal Languages &

Automata Theory

4 - 75 25 100 4

MSCS2.2 Relational Data Base

Management Systems

4 - 75 25 100 4

MSCS2.3 Advanced Operating Systems 4 - 75 25 100 4

MSCS2.4 Elective I 4 - 75 25 100 4

MSCS2.5 Elective II 4 - 75 25 100 4

MSCS2.6 Advanced JAVA

Programming Lab

- 3 50 50 100 2

MSCS2.7 Relational Data Base

Management Systems Lab

- 3 50 50 100 2

Total 700 24

Elective I: Data Warehousing & Data Mining /Image Processing/Bio- Informatics/Computer Graphics

Elective II: Web Technologies/Mobile Computing/Wireless Sensor Networks/Soft Computing


III Semester


Marks

Credits


MSCS3.1 Artificial Intelligence 4 - 75 25 100 4

MSCS3.2 Object Oriented Software

Engineering

4 - 75 25 100 4

MSCS3.3 Information Security &

Cryptography

4 - 75 25 100 4

MSCS3.4 Elective III 4 - 75 25 100 4

MSCS3.5 Elective IV 4 - 75 25 100 4

MSCS3.6 Object Oriented Software

Engineering Lab

- 3 50 50 100 2

MSCS3.7 Network Programming and

Web Programming Lab

- 3 50 50 100 2

MSCS3.8 Seminar on Advanced Topics 100 100 3

Total 800 27

Elective III: Big Data Analytics/Statistical Quality Assurance Techniques/Geo Informatics/ Semantic

Web

Elective IV: Operations Research/Cloud computing/ Parallel Computing/ Pervasive Computing

IV Semester

Code Name of Subject Internal

Evaluation

External

Evaluation

Credits

MSCS4.1 Project work 50 100 15

Total: 90

Candidates can do their thesis work within the department or in any industry/research

organization for One Full Semester (4th semester). In case of thesis done in an industry/research

organization, one advisor (Guide) should be from the department and one advisor(CO-Guide)

should be from the industry/research organization.

Although credits are allotted for the thesis work they will not be taken for the calculation of

CGPA.

A publication of a paper on the thesis work in a National/International Conference proceedings

with presentation certificate or a paper on the thesis work be communicated to a

National/International Journal & accepted for publication for the submission of thesis at the end

of 4th semester is mandatory.

The candidate has to defend his dissertation in a Viva-voce examination to be conducted by the

above committee. The committee should submit a report, with signatures of all the members,

candidate wise, with grade A-Excellent/ Grade B-Good/Grade C- fair/ Grade D- Reappear.

The external examiner shall be nominated by the Chairman, Board of Examiner in CSE as per

the norms of the University.

Although credits are allotted for the Dissertation work they will not be taken for the calculation

of CGPA.


Detailed Syllabus for M.Sc. (CS)

MSCS1.1: Discrete Mathematical Structures

Instruction: 4 Periods/week Credits: 4

External: 75 Marks, Internal: 25 Marks External Exam: 3 Hrs

------------------------------------------------------------------------------------------------------------- ----------------

UNIT I: Sets, relations and functions: Operations on sets, relations and functions, binary relations, partial

ordering relations, equivalence relations, principles of mathematical induction. Permutations and

combinations; recurrence relation and generating functions.

Unit II: Algebraic structures and morphisms: Algebraic structures with one binary operation -

semigroups, monoids and groups, congruence relation and quotient structures. Free and cyclic monoids

and groups, permutation groups, substructures, normal subgroups.

Algebraic structures with two binary operations, Lattices, Principle of Duality, Distributive and

Complemented Lattices, Boolean Lattices and Boolean Algebras, Uniqueness of Finite Boolean Algebras,

Boolean Functions and Boolean Expressions, Propositional Calculus.

Unit III: Mathematical logic: Syntax, semantics of Propositional and predicate calculus, valid, satisfiable

and un satisfiable formulas, encoding and examining the validity of some logical arguments.

Proof techniques: forward proof, proof by contradiction, contra positive proofs, proof of necessity and

sufficiency.

Unit IV: Graph Theory: Graphs and digraphs, trees, Eulerian cycle and Hamiltonian cycle, adjacency

and incidence matrices, vertex colouring, planarity.

Text Book

J. P. Tremblay and R. P. Manohar, Discrete Mathematical Structures with Applications to Computer

Science, Tata McGraw-Hill, 2001.

Reference Books:

Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw-Hill.

C. L. Liu, Elements of Discrete Mathematics, 2nd Edition, Tata McGraw-Hill, 2000.


MSCS1.2 Data Structures & File Structures



---------------------------------------------------------------------------------------------------- ------------------------

Unit I: Introduction to Data Structures

The Stack: Primitive operations – Asan Abstract Data Type–Implementing the Stack operations using

Arrays, and Structures

Queues:TheQueueasAbstractDataType–SequentialRepresentation,TypesofQueues – Operations –

Implementation using Arrays, and Structures Linked List: Operations – Implementation of Stacks, Queues and priority Queues. CircularLists:Insertion,DeletionandConcatenationOperations_StacksandQueuesas Circular Lists_ Doubly Linked Lists Applications.

Trees: Binary Trees Operations and Applications. Binary Tree Representation: Node Representation–

Implicit array Representation–Choice of Representation–Binary Tree Traversal–Threaded Binary Trees

and their Traversal–Trees and their Applications

TreeSearching:InsertionintoaBinarySearchTree–DeletingfromaBinarySearchTree– Efficiency of Binary

Search Tree operation

Unit II: File Processing Operations Physical and logical files, opening, reading & writing and closing files in C, seeking and special characters

in files, physical devices and logical files, file-related header files in C

Secondary Storage

Disks – organization, tracks, sectors, blocks, capacity, non-data overhead, cost of a disk access, Magnetic

Tape – types, performance, organization estimation of tape length and data transmission times

Journey and buffer Management

File manager, I/O buffer, I/O processing, buffer strategies and bottlenecks

UNIT III: File Structure Concepts A stream file, field structures, reading a stream of fields, record structures and that uses a length indicator,

Mixing numbers and characters – use of a hex dump, reading the variable length records from the files

Managing records in C files

Retrieving records by keys, sequential search, direct access, choosing a record structure and record length,

header records, file access and file organization

Organizing files for performance

Data compression, reclaiming space – record deletion and storage compaction, deleting fixed-length

records for reclaiming space dynamically, deleting variable-length records, space fragmentation,

replacement strategies.

UNIT-IV : Indexing

Index, A simple index with an entry sequenced file, basic operations on an indexed, entry sequenced file,

indexes that are too large to hold in memory, indexing to provide access by multiple keys, retrieval using

combination of secondary keys, improving the secondary index structure – inverted lists

Indexed sequential file access and prefix B+ Trees

Indexed sequential access, maintaining a sequence set, adding a simple index to the sequence set, the

content of the index: separators instead of keys, the simple prefix B+ tree, simple prefix B+ tree

maintenance, index set block size, internal set block size, internal structure of index set blocks: a variable

order B-tree, loading a simple prefix B+ tree

Hashing

Collisions in hashing, a simple hashing algorithms, hashing functions and record distributions, memory

requirements, collision resolution by progressive overflow, buckets, deletions

Textbooks:

1.DataStructures Using C and C++Yddish Langsam, Moshe J. Augenstein and Aaron M. Tanenbaum,

Prentice Hall Of India (2ndEdition)(Chapters1to8)

2. Data Structures, Algorithms and Applications with C++, Sahani Mc-GrawHill.

Text Book: File Structures – An Object Oriented Approach with C++ by Michael J. Folk, Bill Zoellick

and Greg Riccardi,, Pearson


MSCS1.3: Computer Organization& Architecture


External: 75 Marks, Internal: 25 M External Exam: 3 Hrs

-----------------------------------------------------------------------------------------------------------------------------

Unit I: Register Transfer and Micro operations

Register Transfer Language, Register Transfer, Bus and Memory Transfers, Arithmetic Micro operations,

Logic Micro operations, Shift Micro operations, Arithmetic Logic Shift Unit.

Basic Computer Organization and Design:

Instruction Codes, Computer Registers, Computer Instructions, Timing and Control, Instruction Cycle,

Memory-Reference Instructions, Input-Output and Interrupt, Complete Computer Description, Design of

Basic Computer, Design of Accumulator Logic.

Unit II: Micro programmed Control:

Control Memory, Address Sequencing, Micro program Example, Design of Control Unit.

Central Processing Unit:

Introduction, General Register Organization, Stack Organization, Instruction Formats, Addressing

Modes, Data Transfer and Manipulation, Program Control, Reduced Instruction Set Computer(RISC)

Unit III: Input/output Organization:

Peripheral Devices, I/O interface, Asynchronous data transfer, Modes of transfer, priority Interrupt,

Direct memory access, Input-Output Processor (IOP), Serial Communication.

Memory Organization:

Memory Hierarchy, Main memory, Auxiliary memory, Associate Memory, Cache Memory, and Virtual

memory, Memory Management Hardware.

Unit IV: Overview of Computer Architecture:

Evolution of Computer Systems, Parallelism in uni- processor System, Parallel Computer Structures,

Architectural Classification Schemes, Parallel Processing Applications.

Text Book:

1. Computer System Architecture, M. Morris Mano, Prentice Hall of India Pvt. Ltd., Third Edition,

Sept. 2008

2. Computer Architecture and Parallel Processing, Kai Hwang and Faye A. Briggs, McGraw Hill,

International Edition1985.

Reference Book:

1. Computer Architecture and Organization, William Stallings, PHI Pvt. Ltd., Eastern Economy

Edition, Sixth Edition, 2003.

2. “Computer System Architecture”, John. P. Hayes.

3. Computer Architecture A quantitative approach 3rd edition John L. Hennessy & David A. Patterson

Morgan Kufmann (An Imprint of Elsevier).


MSCS1.4: Object oriented Programming Using C++ & JAVA



---------------------------------------------------------------------------------------------------------------------- -------

Unit I:

Fundamentals of object oriented programming: Introduction to Object Oriented Paradigm, procedural

Paradigm, Benefits Of OOP, An Overview Of Classes, Objects and Methods, Inheritance and

Polymorphism.

Basics of C++: Structure Of C++ Program, Data Types And Declaration, Expressions And Operator

Precedence, Program Flow Control, Functions, Scope of Variables, Inline Functions and Default

Arguments, Dynamic Allocation New And Delete Operators.

Unit II: Classes & Objects:

Classes And Objects, User Defined Data Types, Constructors & Destructors, Controlling and Accessibility,

Class Members, Member Functions, Friend Functions, This Pointer, Static and Constant Member Functions,

Type Conversions, Function selection, Friend Functions , Function Adapters, String Library, Class

Templates, Function Templates, Member Function Templates, Inheritance & Polymorphism: Derived

Classes, Syntax Of Derived Classes, Making Private Members Inheritable, Single, Multilevel, Multiple,

Hierarchical, Hybrid Inheritance, Polymorphism, Operator Overloading, Function Overloading , Pointers,

pointers to objects, this pointer, pointers to derived classes, virtual and pure virtual functions.

Unit III: Introduction to JAVA: Applets & Applications, Structure of Java Program, Introduction to

Classes and Objects, Arrays, strings and Vectors,

Packages and Interface, and Multi threading: Packages, Interfaces, creating, extending, stopping,

blocking threads, thread states, thread methods, exceptions, priority in threads, synchronization, Runnable

interface.

Unit IV: Exception Handling In C++ &Java: Exception, Handling, Throwing Exceptions, Try Blocks,

Handlers, Exception Specification, Standard Exceptions And Uses.

Streams & Files: Managing Console I/O Operations, Working With Files Using Assert. H, Signal. H,

Managing I/O Files In Java,

TextBooks:

1. Object Oriented Programming in C++,Robert Lafore 2. Introduction to JAVA PROGRAMMING byY.Daniel Liang (PHI)

References:

1. Object Oriented Programming in C++: N. Barkakati, PHI 2. Object Oriented Programming using C++,IraPohl, PEARSONEDUCATIO 3. JAVA2.0-Complete Reference :Herbert Schildt & F.Naughton. 4. Object Oriented Programming using C++: E. Balagurusamy, PHI. 5. Programming with JAVA-Aprimer: E.Balagurusamy, PHI


MSCS 1.5: Advanced Computer Networks



-------------------------------------------------------------------------------------------------------------------------------------------

Unit I: Introduction to Computer Networks: Introduction, Network Hardware, Network Software,

Reference Models, Data Communication Services & Network Examples, Internet Based Applications.

Data Communications: Transmission Media, Wireless Transmission, Multiplexing, Switching,

Transmission in ISDN, Broad Band ISDN , ATM Networks,

Unit II: Data Link Control, Error Detection & Correction, Sliding Window Protocols, LANs & MANs:

IEEE Standards for LANs & MANs-IEEE Standards 802.2, 802.3, 802.4, 802.5, 802.6, High Speed

LANs.

Design Issues in Networks: Routing Algorithms, Congestion Control Algorithms, Network Layer in the

Internet, IP Protocol, IP Address, Subnets, and Internetworking.

Unit III: Internet Transport Protocols: TRANSPORT Service, Elements of Transport Protocols, TCP

and UDP Protocols, Quality of Service Model, Best Effort Model, Network Performance Issues.

Over View of DNS, SNMP, Electronic Mail, FTP, TFTP, BOOTP, HTTP Protocols, World Wide Web,

Firewalls.

Unit IV: Network Devices: Over View of Repeaters, Bridges, Routers, Gateways, Multiprotocol

Routers, Brouters, Hubs, Switches, Modems, Channel Service Unit CSU, Data Service Units DSU, NIC,

Wireless Access Points, Transceivers, Firewalls, Proxies.

Advanced Concepts in Networks: Over View of Cellular Networks, Adhoc Networks, Mobile Adhoc

Networks, Sensor Networks, Virtual Private Networks .Delay Tolerant Networks DTN, Ipvs,.

Text Book:

1. Computer Networks, Andrews S Tanenbaum,, Edition 5, PHI, ISBN:-81-203-1165-5

References:

2. Data Communications and Networking , Behrouz A Forouzan , Tata McGraw-Hill Co Ltd ,

Second Edition, ISBN: 0-07-049935-7

3. Computer networks, Mayank Dave, CENGAGE.

4. Computer networks, A system Approach, 5thed, Larry L Peterson and Bruce S Davie, Elsevier.

5. An Engineering Approach to Computer Networks-S.Keshav, 2nd Edition, Pearson Education.

6. Understanding communications and Networks, 3rd Edition, W.A. Shay, Thomson.


MSCS1.6: Data Structures using C ++ and Java Lab



----------------------------------------------------------------------------------------------------------------------- ------

Implementation of Data Structures and Algorithms using C++

1. To perform various operations such as insertion, deletion, display on single linked lists.

2. To implement

(i) Stacks using linked list. (ii) Queues using linked list.

3. To perform different types of searching techniques on a given list

(i) Sequential search (ii) Transpose sequential search (iii) Binary search(iv) Fibonacci search

4. To perform different types of sortings on a given list

(i) Bubble sort (ii) Insertion sort (iii) Selection sort(iv) Merge sort

5. To perform different types of sortings on a given list

(i) Quick sort (ii) Shell sort (iii) Radix sort (iv) Topological sort

6. To perform the following

(i) To convert the given infix expression to postfix expression

(ii) To evaluate the given postfix expression.

7. To perform various operations on graphs

i) Vertex insertion.

ii) Vertex deletion.

iii) Edge insertion.

iv) Edge deletion.

v) BFS.

vi) DFS.

8. To implement dictionaries using hashing technique

9. To perform various operations on binary heap.

10. To perform various operations on Binary search tree.

11. To perform operations on AVL trees.

12. To perform various operations on B-tree.


MSCS1.7: Computer Organization Lab

Instruction: 3 Periods/week Credits: 2 External: 50 Marks, Internal: 50 Marks Ext Exam: 3 Hrs -----------------------------------------------------------------------------------------------------------------------------

I–CYCLE: Digital Logic Design Experiments:

1. TTL Characteristics and TTL IC Gates

2. Multiplexers &Decoders

3. Flip-Flops

4. Counters

5. Shift Registers

6. Binary Adders & Subtractors

7. ALU

II–CYCLE: 8085 Assembly Language Programming:

1. 8085 Assembly Language Programming according to theory course Microprocessors-I using the

following trainers:

Keyboard Monitor of 8085µP Trainer.

Serial Monitor of 8085µP Trainer with Terminal

8085 Line Assembler of 8085µP Trainer with PC as Terminal 8085 Cross Assembler using In-Circuit Emulator(ICE) with 8085µP Trainer and PC as

Terminal

Graded Problems are to be used according to the syllabus of COMPUTER

ORGANIZATION

2. PENTIUM CLASS PC ARCHITECTURE FAMILIARIZATION HARDWARE &

SOFTWARE PARTS DEMONSTRATION


ADIKAVI NANNAYA UNIVERSITY, RAJAMAHENDRAVARAM

MSc Computer Science Semester I MSCS 1.1 DISCRETE MATHEMATICAL STRUCTURES

MODEL QUESTION PAPER Time: 3 Hrs Max Marks : 75

SECTION- A

Answer ALL Questions with internal choice (4 X 15 = 60 M)

1. a) Discuss properties of relations with examples (6 Marks) b) Let R be an equivalence relation on a set A. then prove that the following statements

are equivalent for any element a, b in A

i. aRb

ii. [a] = [b]

iii. [a][b]≠ ( 9 Marks)

OR

c) Solve the recurrence relation an=an-1+an-2 , n≥0 with a0=0, a1=1. (8 marks)

d) Using mathematical induction prove that 𝟏 + 𝟐 + 𝟑 + − − − + 𝒏 = 𝒏(𝒏+𝟏)

𝟐

( 7 Marks) 2. a) If H is a sub group of G and N is a normal subgroup of G then prove that

I. HN is normal subgroup of H

II. N is normal subgroup of HN (15 Marks)

OR

b) State and prove properties of Lattices (15 marks)

3. a) Prove that (PQ), (PR), (QS)SR (5 marks) b) “If there was a ball game, then travelling was difficult. If they arrived on time, then

travelling was not difficult. They arrived on time. Therefore, there was no ballgame.”

Show that these statements constitute a valid argument. (10 marks)

OR

c) Discuss various proof techniques in detail (15 marks)

4. a) Prove that a connected graph is called Euler graph if and only if each of its vertex is of even degree (10 marks)

b) Prove that a tree with n vertices has n-1 edges (5 marks) OR

c) State and prove Euler’s formula for planar graphs (10 marks)

d) Is the following graphs are isomorphic or not (5 marks)


SECTION – B ( 5 X 3 = 15 M)

5. Answer any Five Questions of the following

a. Prove that AB = (A-B) (B-A) (AB) b. Find the number of ways of arranging 5 boys and 4 girls in a line so that the line

begins and ends with boys

c. State Modular inequality in lattices

d. Let (G, *) be an algebraic structure and if e is an identity of S with respect to * then

prove that it is unique.

e. Prove P, PQ Q

f. Define well formed formula and hence give an example

g. State and prove Handshaking theorem

h. Define Hamiltonian circuit and Hamiltonian graph give examples to each



M.Sc Computer Science Semester I MCS 1.2 DATA STRUCTURES AND FILE STRUCTURES


SECTION- A


1. a) What are Binary Search Trees? With an example show how insertions and deletions are

done on a binary search tree. ( 15 Marks)

OR

(b) Give the ADT for Stacks and Queues. ( 6 Marks)

(c)Explain insertion, deletion and concatenation operations on a circular list. ( 9 Marks)

2. a) Explain with neat block diagrams how a byte of data in memory is written onto the hard

disk ( 15 Marks)

OR

(b)Explain the different buffering strategies ( 7 Marks)

(c)Explain disks and magnetic tape organization. ( 8 Marks)

3. a) How are records deleted? Explain the methods of reclaiming the space occupied by

deleted records ( 15 Marks)

OR

b) Explain how records are retrieved by sequential search method and direct access

method ( 15 Marks)

4. a) Explain Indexed Sequential file access. ( 15 Marks)

OR

b) What is hashing? With appropriate examples explain how collisions can be resolved.

( 15 Marks)

SECTION – B ( 5 X 3 = 15 M)

5. Answer any FIVE Questions of the following

a) Explain binary tree traversal techniques

b) Give and explain the syntax of functions in C used for performing file operations

c) Explain the different methods of data compression

d) Differentiate internal and external fragmentation.

e) Write short notes on inverted lists

f) Explain about B+ Trees

g) Write short notes on buffer management

h) Explain about threaded binary tress.



M.Sc Computer Science Semester I MCS 1.3 COMPUTER ORGANIZATION & ARCHITECTURE


SECTION- A

Answer ALL Questions ( 4 X 15 = 60 M)

1. a) Explain arithmetic and logic micro operations with examples.

( Or )

b) Describe the design of basic computer. Explain the phases of instruction cycle.

2. a) Explain how a simple digital computer is micro programmed.

( Or )

b)Explain instruction formats and addressing modes.

3. a) Explain (i) how I/O bus connected to input-output devices (ii) Asynchronous data transfer with

handshaking (iii) DMA

( Or )

b) A digital computer has a memory unit of 64K X 16 and a cache memory of 1K words. The cache

uses direct mapping with a block size of four words.

(i) How many bits are there in the tag, index, block and word fields of the address format?

(ii) How many bits are there in each word of cache, and how are they divided into functions?

Include a valid bit.

(iii) How many blocks can the cache accommodate?

4 . a) Explain how computer systems have evolved over time.

( Or )

b) Describe parallel computer architectural classifications.

SECTION – B ( 5 X 3 = 15 M)


a) A digital computer has a common bus system for 16 registers of 32 bits each. The bus is connected

with multiplexers. How many selection inputs are there in each multiplexer? What size of

multiplexers are needed?

b) Block diagram of control unit of basic computer

c) Show how a 9-bit micro operation field in a microinstruction can be divided into subfields to specify

46 micro operations. How many micro operations can be specified in one microinstruction?

d) Convert the expression A B C D E F G + x + x + x from reverse polish notation to infix notation.

Give the decimal equivalent of binary number A = 01000001 assuming that it is signed.

e) Write short notes on daisy chaining priority.

f) A virtual memory system has an address space of 8K words, a memory space of 4K words, and

page and block sizes of 1K words. Determine the 4 pages that are resident in main memory with

FIFO and LRU page replacement algorithms for the page string 4 2 0 1 2 6 1 4 0 1 0 2 3

g) Explain logical to physical address mapping.

h) Write short notes on applications of parallel processing.


ADIKAVI NANNAYA UNIVERSITY, RAJAMAHENDRAVARAM MSc Computer Science Semester I

MSCS 1.4 OBJECT ORIENTED PROGRAMMING USING C++ AND JAVA MODEL QUESTION PAPER

Time: 3 Hrs Max Marks: 75

SECTION- A


1. a) Why do we need OOP? ( 5 Marks)

b) Explain the characteristics of Object Oriented Language System? ( 10 Marks)

Or

c) Explain about overload function with suitable program. (8 Marks)

d) What is an in-line function? Why we use it. What are its benefits? Give an example

program that declares an in-line function? ( 7 Marks)

2. (a) Automatic initialization is carried out using a special member function called a constructor.

What is the duty of that Constructor? Write a C++ program using constructor. (8 Marks)

(b) Non-member functions should not be able to access an object’s private data. How can you

solve this? Show with an example program. (7 Marks)

Or

c) Explain the concept of pointers to derived class and virtual functions. (8 Marks)

d) Explain the concept of type conversion and member function template. (7 Marks)

3. a) Write a java program which interacts with the input given by the user and computes the

results.( Use text boxes, menu bars, strings and whatever necessary to your program)

( 8 Marks)

b) Explain about strings and vectors in java. ( 7 Marks)

Or

c) What is meant by Access protection? Explain about different access protection modifiers?

Give the access protection details. (5 Marks)

d) Explain about Runnable interface in java with a java program. (10 Marks)

4. a) Why do we need Exceptions? Explain briefly about the Exception handling in c++

(8 Marks)

b) Explain briefly about console I/O operation in java with java program. (7 Marks)

Or

c) Briefly explain about Managing input and output files in java (Explain about all stream

classes, creation of files and handling primitive data types). (15 Marks)

SECTION-B (3x5=15Marks)


a) Explain about scope of variable.

b) Write short note on pointers to objects.

c) Explain Synchronization of Threads.

d) Write short note Input output classes.

e) Where Function adapters are used. Explain.

f) Describe Structure of a Java Program

g) Explain about String Library

h) Write short note Class Templates



M.Sc Computer Science Semester I MSCS 1.5 ADVANCED COMPUTER NETWORKS

MODEL QUESTION PAPER Time: 3 Hrs Max Marks: 75

SECTION-A Answer ALL Questions ( 4 X 15 = 60 M)

1. a) Compare OSI and TCP/IP reference models ( 7 Marks)

b) Explain all the layers in OSI reference models ( 8 Marks)

Or

c) Explain different Guided transmission media and wireless transmission media. ( 15 Marks)

2. a) Explain about all Sliding window protocols. ( 15 Marks)

Or

b) Explain Distance Vector and hierarchical Routing Algorithms ( 15 Marks)

3. a) Briefly about the elements of transport protocols. (15 Marks)

Or

b) Explain about DNS and SNMP (SNMP-Simple Network Management Protocol). ( 15 Marks)

4. a) Briefly explain the following network devices in detail

i). Repeaters ii).Routers, iii). Bridges, (15 Marks)

Or

b) Compare and Contrast Adhoc Network, Sensor Networks, Virtual Private Networks. (15 Marks)

SECTION-B (5x3=15Marks)


a) ATM Networks

b) Subnet masking

c) Firewalls

d) Delay Tolerant Networks

e) Gateways

f) Multiprotocol Routers

g) Multiplexing

h) Data Service Units and Channel Service Units

m.sc computers syllabus and model papers

Documents