






























Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student Masters Exam samples for the student
Typology: Exams
1 / 38
This page cannot be seen from the preview
Don't miss anything!
M. Sc. Computer Science - First Year
Subjects Lect/ Pract/ Paper Pract Total Week Week Hours Marks 1 Section ñ I : Principles of Compiler Design-I 4 4 Section ñ II : 3 75 50 125 Principles of Compiler Design-II 4 4 2 Section ñ I : Digital Signal Processing-I 4 4 Section ñ II : 3 75 50 125 Digital Signal Processing-II 4 4 3 Section ñ I : Mobile Computing 4 4 Section ñ II : 3 75 50 125 Computer Simulation and Modeling 4 4 4 Section ñ I : Data Warehousing and Mining 4 4 Section ñ II : 3 75 50 125 Advanced Database Systems 4 4 Total : I Year ñ I Term 16 16 - Total : I Year ñ II Term 16 16
300 200 500
M. Sc. Computer Science - Second Year
Subjects Lect/ Pract/ Paper Pract Total Week Week Hours Marks 1 Section ñ I : Artificial Intelligence 4 4 Section ñ II : 3 75 25 100 Image Processing 4 4 2 Section ñ I : Distributed Computing 4 4 Section ñ II : 3 75 25 100 Embedded Systems 4 4 3 Elective I I Term 4 4 II Term 4 4 3 75 25 100 4 Elective II I Term 4 4 II Term 4 4 3 75 25 100 5 Project, I Term - 6 - - 100 100 Total : II Year ñ I Term 16 16 - Total : II Year ñ II Term 16 16^300 200
Elective-I Elective-II 1 Parallel Processing, (I Term) 1 Pattern Recognition, (I Term) Advanced Computer Networks, (II Term) Computer Vision, (II Term) 2 System Security (I Term) 2 Virtual Reality & Virtual Environment (I Term) Internet security (II Term) Java Technology (II Term) 3 Enterprise Networking (I Term) 3 Bio Informatics (I Term) Satellite Communications, (II Term) Intelligent Systems (II Term) 4 Fuzzy Logic & Neural networks (I Term) 4 Optimization Techniques (I Term) Multimedia systems and convergence of technologies (II Term)
Customer Relations Management (II Term)
CLASS: M. Sc (Computer Science) (^) Year I
SUBJECT: PRINCIPLES OF COMPILER DESIGN, Paper I, Term I
Lecture 4 TW/Tutorial/Practical 4
Periods per week
Hours Marks Theory Examination 3 75 TW/Practical -- 50
Evaluation System
Term I Introduction to Compilers o Compilers and translators o Why do we need translators? o The structure of a compiler o Lexical analysis o Syntax analysis o Intermediate code generation o Optimization o Code generation o Book keeping o Error handling o Compiler writing tools o Getting started Programming languages o High-level programming languages o Definitions of programming languages o The lexical and syntactic structure of a language o Data elements o Data structures o Operators o Assignment o Statements o Program units o Data environments o Parameter transmission o Storage management Finite automata and lexical analysis o The role of the lexical analyzer o A simple approach to the design of lexical analyzers o Regular expressions o Finite automata o From regular expressions to finite automata o Minimizing the number of states of a DFA o A language for specifying lexical analyzers o Implementation of a lexical analyzer o The scanner generator as Swiss army knife The syntactic specification of Programming Languages o Context-free grammars o Derivations and parse trees o Capabilities of context-free grammars
Introduction to code optimization o The principle sources of optimization o Loop optimization o The DAG representation of basic blocks o Value numbers and algebraic laws o Global data-flow analysis More about loop optimization o Dominators o Reducible flow graphs o Depth-first search o Loop-invariant computations o Induction variable elimination o Some other loop optimizations More about data-flow analysis o Reaching definitions again o Available expressions o Copy propagation o Backward flow problems o Very busy expressions and code hoisting o The four kinds of data-flow analysis problems o Handling pointers o Interprocedural data-flow analysis o Putting it all together Code generation o Object programs o Problems in code generation o A machine model o A simple code generator o Register allocation and assignment o Code generation from DAGís o Peephole optimization
Practical Debug C++ / JAVA Programs using debugger provided by different vendors along with IDE Make a comparative study of Different features of at least two Integrated Development Environment(IDE) and compilers Manipulation of IDEís and restoring the original setting
CLASS: M. Sc (Computer Science) Year I SUBJECT: Digital Signal Processing , Paper II, Term I Lecture 4 TW/Tutorial/Practical 4
Periods per week
Hours Marks Evaluation System Theory Examination 3 75 TW/Practical -- 50
Term I
Sequences-Representation of arbitrary sequences-Linear time variant systems-causality, stability- difference equations-frequency response-first order systems-second order systems- Discrete Fourier series-relation between continuous and discrete Systems. The z Transform- the Relation between the z Transform and the Fourier transform of a sequence-Solution of differences equation using one sided transform-geometric evaluation of the Fourier Transform- Digital Filter Realizations-structures for all zero filters-the discrete Fourier transform ñ convolution of sequences-linear convolution of finite duration sequences-the discrete Hilbert transform.
The Theory and approximation of finite duration impulse response digital filters-issues in Filter design-FIR filters Design techniques for Linear phase FIR filters-windowing-issues with windowing-frequency sampling-solution for optimization-linear programming-linear phase filters-Maximal ripple FIR Filters ñRemez exchange algorithm- Multiple band optimal FIR Filters-Design of filters with simultaneous constrains on the time and frequency response.
Theory and approximation of infinite impulse response digital filters- IIR filters-filter coefficient- Digital Filter Design ñMapping of differentials-Transformations-Direct design of digital filters- comparison between FIR filters and IIR filters
Finite word length effects in digital filters-analog to digital conversions-digital to analog conversions-types of Arithmetic in digital systems. Types of quantization in digital filters- Dynamic range Constraints-Realizations-ordering and pairing in cascade realizations-round of noise-fixed point analysis-Coefficient quantization ñ Limit cycle oscillations
Spectrum analysis and the fast fourier Trans form-introduction to Radix-2 FFTís-data shuffling and bit reversal-FFT computer programming-Decimation ñin-Frequency Algorithm ñComputing an Inverse DFT by doing a Direct DFT-Radix2 Algorithm-Spectrum analysis at a single point in the z plane-spectrum analysis in FFT Analysis-Windows in spectrum Analysis-Bluesteinís Algorithm-The chirp z transform algorithm- convolution and correlation using number theoretic transforms.
CLASS: M. Sc (Computer Science)
SUBJECT: MOBILE COMPUTING, Paper III, Term I
Lectures: 4 Hrs per week Practical: 4 Hrs per week
Theory: 75 Marks Term work / Practical: 50 Marks Objective: Recent developments in portable devices and high-bandwidth, ubiquitous wireless networks has made mobile computing a reality. Indeed, it is widely predicted that within the next few yearsí access to Internet services will be primarily from wireless devices, with desktop browsing the exception. Such predictions are based on the huge growth in the wireless phone market and the success of wireless data services. This course will help in understanding fundamental concepts, current developments in mobile communication systems and wireless computer networks. DETAILED SYLLABUS
Text Books:
References :
TERM WORK
CLASS: M. Sc (Computer Science)
SUBJECT: COMPUTER SIMULATION AND MODELING, Paper III, Term II Lectures: 4 Hrs per week Practical: 4 Hrs per week
Theory: 75 Marks Term Work / Practical: 50 Marks Objective : In the last five decades digital computer simulation has developed from infancy to a full-fledged discipline. The field of modeling and simulation is as diverse as of man. The application of simulation continues to expand, both in terms of extent to which simulation is used and the range of applications. This course gives a comprehensive and state of art treatment of all the important aspects of a simulation study, including modeling, simulation software, model verification and validation, input modeling.
TERM WORK
CLASS: M. Sc (Computer Science)
SUBJECT: DATA WAREHOUSING AND MINING, Paper IV, Term I
Lectures: 4 Hrs per week Practical: 4 Hrs per week
Theory: 75 Marks Term work/Practical: 50 Marks Objectives of the course: The data warehousing part of module aims to give students a good overview of the ideas and techniques which are behind recent development in the data warehousing and online analytical processing (OLAP) fields, in terms of data models, query language, conceptual design methodologies, and storage techniques. Data mining part of the model aims to motivate, define and characterize data mining as process; to motivate, define and characterize data mining applications.
DETAILED SYLLABUS
Data Warehousing:
1. Overview And Concepts: Need for data warehousing, Basic elements of data warehousing, Trends in data warehousing. 2. Planning And Requirements: Project planning and management, Collecting the requirements. 3. Architecture And Infrastructure: Architectural components, Infrastructure and metadata. 4. Data Design And Data Representation: Principles of dimensional modeling, Dimensional modeling advanced topics, data extraction, transformation and loading, data quality. 5. Information Access And Delivery: Matching information to classes of users, OLAP in data warehouse, Data warehousing and the web. 6. Implementation And Maintenance: Physical design process, data warehouse deployment, growth and maintenance.
Data Mining:
Text Books:
References:
TERM WORK
CLASS: M. Sc (Computer Science)
SUBJECT: ADVANCED DATABASE SYSTEMS, Paper IV, Term II
Lectures: 4 Hrs per week Practical: 4 Hrs per week
Theory: 75 Marks Term work/ Practical: 50 Marks Objectives: To study the further database techniques beyond which covered in the second year, and thus to acquaint the students with some relatively advanced issues. At the end of the course students should be able to: gain an awareness of the basic issues in objected oriented data models, learn about the Web-DBMS integration technology and XML for Internet database applications, familiarize with the data-warehousing and data-mining techniques and other advanced topics, apply the knowledge acquired to solve simple problems
DETAILED SYLLABUS
CLASS: M. Sc (Computer Science)
SUBJECT: PARALLEL PROCESSING (Elective)
Lectures: 4 Hrs per week Practical: 4 Hrs per week
Theory: 75 Marks Term Work/Practical : 25 Marks
Objective: Upon completion of this course students will be able to understand and employ the fundamental concepts and mechanisms which form the basis of the design of parallel computation models and algorithms, recognize problems and limitations to parallel systems, as well as possible solutions
DETAILED SYLLABUS
Text Books:
References:
CLASS: M. Sc (Computer Science)
SUBJECT: ADVANCED COMPUTER NETWORKS (ELECTIVE)
Lectures: 4 Hrs per week Practical: 4 Hrs per week
Theory: 75 Marks Term work/Practical: 25 Marks
Objectives: In first part, Advanced technologies like High speed Devices etc. are to be considered. Second part Network programming is to be studied. Not just SOCKETS but also protocols, Drivers, Simulation Programming. In third part we should study Network Design, Protocols designs and analysis considering deterministic and non-deterministic approach. We expect natural thinking from student. For example he should able to consider different constraints and assume suitable data and solve the problems.
DETAILED SYLLABUS
CLASS: M. Sc (Computer Science)
SUBJECT: INFORMATION & SYSTEM SECURITY (Elective) Lectures: 4 Hrs per week Practical: 4 Hrs per week
Theory: 75 Marks Term work/Practical: 25 Marks
Objectives of the course: Learn about the threats in computer security. Understand what puts you at a risk and how to control it. Controlling a risk is not eliminating the risk but to bring it to a tolerable level.
Text Books:
References :
CLASS: M. Sc (Computer Science) SUBJECT: NETWORK AND INTERNET SECURITY (Elective)
Lectures: 4 Hrs per week Practical: 4 Hrs per week
Theory: 75 Marks Term Work/Practical: 25 Marks
Objectives of the course: Learn about the threats in Network and Internet security. Understand what puts you at a risk and how to control it. Controlling a risk is not eliminating the risk but to bring it to a tolerable level.
DETAILED SYLLABUS
1. Security in Network: Model for Security: Threats in Networks, Stealing Passwords, Social Engineering, Bugs and Backdoors, Authentication Failures, Protocol Failure, Information Leakage.
CLASS: M. Sc (Computer Science)
SUBJECT: Enterprise Networking (Elective)
Lectures: 4 Hrs per week Practical: 4 Hrs per week
Theory: 75 Marks Term Work/Practical: 25 Marks
Introduction Growth of Computer Networking, Complexity in Network Systems, Mastering the Complexity, Resource Sharing, Growth of the Internet, Probing the Internet, Interpreting A Ping Response
PART I DATA TRANSMISSION
Transmission Media Copper Wires, Glass Fibers, Radio, Satellites, Geosynchronous Satellites, Low Earth Orbit Satellites, Low Earth Orbit Satellite Arrays, Microwave, Infrared, Light Form a Laser
Local Asynchronous Communication The Need for Asynchronous Communication, Using Electric Current to Send Bits, Standards for Communication, Baud Rate, Framing, and Errors, Full Duplex Asynchronous Communication, Limitations of Real Hardware, Hardware Bandwidth and the Transmission of Bits, The Effect of Noise On Communication, Significance for Data Networking
Long-Distance Communication (Carriers, Modulation and Modems) Sending Signals across Long Distances, Modem Hardware Used for Modulation and Demodulation, Leased Analog Data Circuits, Optical, Radio Frequency, And Dialup Modems, Carrier Frequencies and Multiplexing, Base band And Broadband Technologies Wave Division Multiplexing, Spread Spectrum, Time Division Multiplexing
PART II PACKET TRANSMISSION
Packets, Frames and Error Detection The Concept of Packets, Packets and Time-Division Multiplexing, Packets and Hardware Frames, Byte Stuffing, Transmission Errors, Parity Bits and Parity Checking, Probability, Mathematics And Error Detection, Detecting Errors With Checksums, Detecting Errors With Cyclic Redundancy Checks, Combining Building Blocks, Burst Errors, Frame format And Error Detection Mechanisms
LAN Technologies and Network Topology Direct Point-To-Point Communication, Shared Communication Channels, Significance of LANs and Locality of Reference, LAN Topologies, Bus Network: Ethernet Carrier Sense on Multi- Access Networks (CSMA), Collision Detection and Back off With CSMA/CD, Wireless LANs And CSMA/CA, Bus Network: Local Talk
Hardware Addressing and Frame Type Identification Specifying a Recipient, How LAN Hardware Uses Addresses to Filter Packets Format of a Physical Address, Broadcasting, Multicasting, Multicast Addressing, Identifying Packet Contents, Frame Headers And Frame Format, Using Networks That Do Not Have Self- Identifying Frames, Network Analyzers
LAN Wiring, Physical Topology, and Interface Hardware Speeds of LANs and Computers, Network Interface Hardware, the Connection between A NIC and A Network, Original Thick Ethernet Wiring, Connection Multiplexing, Thin Ethernet Wiring Twisted Pair Ethernet, the Topology Paradox, Network Interface Cards and Wiring Schemes,
Extending LANs: Fiber Modems, Repeaters, Bridges and Switches Distance Limitation and LAN Design, Fiber Optic Extensions, Repeaters, Bridges, Frame Filtering Startup and Steady State Behavior of Bridged Networks, Planning a Bridged Network, Bridging Between Buildings, Bridging Across Longer Distances, A Cycle Of Bridges, Distributed Spanning Tree, Switching, Combining Switches And Hubs, Bridging And Switching With Other Technologies
Long-Distance Digital Connection Technologies Digital Telephony, Synchronous Communication, Digital Circuits and DSU, Telephone Standards DS Terminology and Data Rates, Lower Capacity Circuits, Intermediate Capacity Digital Circuits Highest Capacity Circuits, Optical Carrier Standards, the C Suffix, Synchronous Optical Network (SONET), the Local Subscriber Loop, ISDN, Asymmetric Digital Subscriber Line Technology Other DSL Technologies, Cable Modem Technology, Upstream Communication, Hybrid Fiber Coax
Wan Technologies and Routing Large Networks and Wide Areas, Packet Switches, Forming A WAN, Store and Forward Physical Addressing In A WAN, Next-Hop Forwarding, Source Independence, Relationship of Hierarchical Addresses to Routing, Routing In A WAN, Use of Defaults Routes, Routing Table Computation, Shortest Path Computation in a Graph, Distributed Route Computation, Distance Vector Routing
Network Ownership, Service Paradigm, and Performance Network Ownership, Virtual Private Networks, Service Paradigm, Connection Duration and Persistence, Examples of Service Paradigms, Addresses and Connection Identifiers, Network Performance Characteristics
Protocols and Layering The Need for Protocols, Protocol Suites, A Plan for Protocol Design, the Seven Layers, Stacks: Layered Software, How Layered Software Works, Multiple, Nested Headers, the Scientific Basis for Layering,
TERM WORK Term work should consist of at least 10 assignments from the aforementioned topics. A Seminar to be presented by each student as part of term works carrying 15 marks. REFERENCE Computer Network, Tuekeun, PHI Networking Technology, Jaiswal, Galgotia. Data Networking, Bertsekas, PHI Computer Networks and Internets, Douglas E. Comer Pearson Education Asia