Go Back   2016 2017 EduVark > Education Discussion > Entrance Exams

Old April 24th, 2015, 04:53 PM
Guest User
Posts: n/a
Default Andhra University Msc Cs Syllabus

I am the student of M.Sc CS of Andhra University and I need the Syllabus of it for the preparation of exam can you please provide me this?
Reply With Quote
Have a Facebook Account? Ask your Question Here
Old April 24th, 2015, 05:55 PM
Super Moderator
Join Date: Mar 2012
Posts: 12,624
Default Re: Andhra University Msc Cs Syllabus

As you need the M.Sc Computer Science Syllabus of Andhra University so here it is as follows

Semester - I
MSCS 1.1 Discrete Mathematical Structures

MSCS 1.2 Computer Organization

MSCS 1.3 Data Structures & Algorithms

MSCS 1.4 Systems Programming

MSCS 1.5 Data Communications

MSCS 1.6 Computer Organisation Lab

MSCS 1.7 Data Structures and Algorithms Lab

Semester - II
MSCS 2.1 Computer Networks

MSCS 2.2 Computer Graphics

MSCS 2.3 Operating Systems

MSCS 2.4 Artificial Intelligence

MSCS 2.5 Object Oriented Programming

MSCS 2.6 UNIX Programming Lab

MSCS 2.7 Data Communiations Lab

Semester - III
MSCS 3.1 Object Oriented Software Engineering

MSCS 3.2 Relational Data Base Management Systems

MSCS 3.3 Network Security

MSCS 3.4 Theory of Computation

MSCS 3.5 Embedded Systems (Elective)

MSCS 3.5 Data Ware Housing (Elective)

MSCS 3.5 Bioinformatics (Elective)

MSCS 3.5 Image Processing (Elective)


MSCS 3.7 Visual Programming Lab

Semester - IV
MSc (CS) Project Work
External Evaluation: 100 Marks
Andhra University M.Sc CS Syllabus
MSCS 1.1 Discrete Mathematical Structures
Instruction: 3 Periods/week External Assessment: 70Marks
Internal Assessment: 30 Marks Time: 3 Hours
Logic – Propositional Equivalences predicates- and quantifiers – Methods of Proof –
Sets- Set Operations- Functions- Algorithms- Complexity of Algorithms- Integers-
Applications of Number Theory- Matrices.
Proof Strategy- Recursive and Summation- Mathematical Summations- Mathematical
Structures – Recursive Definitions- Recursive Algorithms- Program Correctness.
Basics of Counting-Pigeon hole principle permutation and combinations- Binomial
Coefficients- Generalized Permutations and Combinations-
Recurrence relations- Solving Recurrence Relations - Divide-and-Conquer Algorithms
and Recurrence Relations - Generating Functions- Inclusion Exclusion-Applications of
Inclusion- Exclusion.
5 RELATIONS: 3 Periods
Relations- Properties-n-any Relations. Representing Relations-Closures of Relations
Equivalence Relations- Partial Orderings.
6 .GRAPHS: . 6 Periods
Introduction- Terminology- Representing- Isomorphism- Connectivity-Euler and
Hamilton Paths-Shortest-Path Problems- Planar Graphs- Graph Coloring
7) TREES: 5 Periods
Introduction- Applications of Trees- Traversals- Spanning trees- Minimum Spanning
Boolean Functions- Representing of Boolean Functions- Logic Gates- Minimization of
Languages and Grammars Finite- State Machines With Output and No Output Language
Recognition- Turing Machines.
Text Book:
Discrete Mathematics and its applications (Fifth Edition),Kenneth H. Rosen
Tata McGraw-Hill Publishing Company.
Discrete Mathematics for computer Science & Mathematics( Second Edition),
J.L.Mott, Abroham Kandel, & T.P.Baker. Prentice-Hall of India(Ltd).
MSCS 1.2 Computer Organization
Instruction: 3 Periods/week External Assessment: 70Marks
Internal Assessment: 30 Marks Time: 3 Hours
1.Digital Logic Circuits (Review) 4 Periods
Digital Computers, Logic Gates, Boolean Algebra, Map Simplification, Combinational
Circuits, Flip-Flops, Sequential Circuits
2.Digital Components 5 Periods
Integrated Circuits, Decoders, Multiplexers, Registers, Shift Registers, Binary Counters,
Memory Unit
3.Data Representation 4 periods
Data Types, Complements, Fixed-Point Representation, Floating-Point Representation,
Other Binary Codes, Error Detection Codes
4.Basic Computer Organisation and Design 9 Periods
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
5.Microprogrammed Control 4 periods
Control Memory, Address Sequencing, Microprogram Example
6.Central Processing Unit 10 periods
Introduction, General Register Organisation, Stack Organisation, Instruction Formats,
Addressing Modes, Data Transfer and Manipulation, Program Control, Reduced
Instruction Set Computer (RISC)
7.Input-Output Organisation 6 Periods
Peripheral Devices, Input-Output Interface, Asynchronous Data Transfer, Modes of
Transfer, Priority Interrupt, Direct Memory Access (DMA)
8.Memory Organisation 6-Periods
Memory Hierarchy, Main Memory, Auxiliary Memory, Associate Memory, Cache
Text Book:
Computer System Architecture (Third Edition),. Morris Mono - Pearson Prentice
MSCS 1.3 Data Structures & Algorithms
Instruction: 3 Periods/week External Assessment: 70Marks
Internal Assessment: 30 Marks Time: 3 Hours
1.Overview of C++ features: 8periods
Concepts of class & objects, I/O Streams, Constructors & Destructors, Parameter passing
options, Functions & operator overloading, Inheritance, Virtual functions
2. Stacks & Queues: 10 periods
Introduction to Data Structures, ADT Stack and its implementation in C++, Evaluation
of postfix expressions, ADT Queue and its implementation in C++, Generalising a
Stack and its implementation using Templates.
3.Linked Lists: 4 periods
Defining & Implementing linked lists with creation, insertion and deletion operations
in C++
4. Searching Algorithms 4 periods
Sequential search & Binary search algorithms, Implementation in C++, Estimation of
Time complexity in Best, Worst and average cases, Classification of algorithms, Big-OH
5. Sorting Algorithms 6 period
Methodology, Implementation and Algorithm Analysis of Insertion sort, Selection sort,
Merge Sort and Quick Sort
6.Trees: 8 periods
Definition and Implementation of ADT Binary tree, AVL Trees, Heaps, Heap sort and
Priority Queues.
7.Graphs: 8 periods
Definition of Graph, Representation of Graphs, Graph Traversal methods, Topological
sorting, Minimum cost Spanning trees, Implementation of Kruskal’s Algorithms, Finding
shortest paths in a di-graph
Text Book:
Introduction to Data Structures & Algorithms with C++, GLENN W.ROWE,
Prentice Hall India,2003
Reference Book:
1. Data Structures in C++, N.S.KUTTI & P.Y.PADHYE, Prentice Hall India, 2003
2. Data Structures & Algorithms in C++, Adam Drozdek, Vikas Publishing House, 2002.
MSCS 1.4 Systems Programming
Instruction: 3 Periods/week External Assessment: 70 Marks
Internal Assessment: 30 Marks Time: 3 Hours
1. Introduction to Systems Programming 6 Periods
Machine Structure - Machine and Assembly Language Programming with IBM 360/370 -
Grammars -Types of Grammars –Languages, FSM
2.Concepts of Single Pass, Two- Pass and Multi- Pass Assemblers 11 Periods
Design of a Single and Two-Pass Assembler
3.Macros and Macro Processors 11 Periods
Definition - Types of Macros - Macro Instructions - Features of Macro Facility like
conditional Macro Expansion - Macros Calls within Macros - Macro Definitions within
Macros - Design of Macro Processors: Single - Pass and Two - Pass.
4. Loaders: 11 Periods
Absolute Loader - Relocation Loader - Binders - Dynamic Loading and Linking - Design
of Absolute Loader and Direct Linking Loaders.
5. General Model of Compiler 6 Periods
Phase of a Compiler - Detailed Discussion of different Phases
Introduction to Software Tools 3 Periods
Text editors, Interpreters, Program Generators, Debug Monitors.
Text Books:
Systems Programming , John J. Donovan
Systems Programming and Operating Systems, D.M.Dhamdhere

For detailed syllabus here is the PDF file atteched;
Attached Files
File Type: pdf Andhra University M.Sc CS Syllabus.pdf (130.2 KB, 15 views)
Reply With Quote
Sponsored Links

Powered by vBulletin® Version 3.8.7
Copyright ©2000 - 2017, vBulletin Solutions, Inc.
Content Relevant URLs by vBSEO 3.6.0

1 2 3