ALL COMPETITION STUDY MATERIALS

Master of Science in Computer Science (M.Sc.) ANDHRA UNIVERSITY_Syllabus 2017-19 SECOND SEMESTER Paper 2.1:     Click Here For FORMAL LANGUAGES & AUTOMATA THEORY OF ANDHRA  UNIVERSITY SYLLABUS Paper 2.2:   Click Here For RELATIONAL DATA BASE MANAGEMENT SYSTEMS OF ANDHRA UNIVERSITY SYLLABUS Paper 2.3:   Click Here For ADVANCED OPERATING SYSTEMS OF ANDHRA UNIVERSITY SYLLABUS Paper 2.4:   Click Here For Elective I EMBEDDED SYSTEMS OF ANDHRA UNIVERSITY SYLLABUS Paper 2.5:   Click Here For Elective II WEB TECHNOLOGIES OF ANDHRA UNIVERSITY    SYLLABUS

MSCS 2.5   Elective II    WEB TECHNOLOGIES Instruction: 3 Periods + 1 Tut/week                                                                                      Credits:4 Internal: 30 Marks                             University Exam: 70 Marks                   Total: 100 Marks  1.       Introduction to HTML, Core Elements , Links and Addressing, Images , Text , Colors and Background, Lists, Tables and Layouts , Frames, Forms , Cascading Style Sheets.  2.       Introduction to Java Scripts, Elements of  Objects in Java Script, Dynamic HTML with Java Script  3.       Document type definition, XML Syntax,  XML Schemas, Document Object model, Presenting XML, Using XML Processors  4.       JDBC OBJECTS- JDBC Driver Types, JDBC Packages, Database Connection, Statement Objects, Result Set.  5.       JDBC and Embedded SQL - Tables, Inserting Data into Tables , Selecting Data from a Table, Meta Data ,Updating Table , Deleting data from Table , Joining Table , Cal

MSCS 2.4   Elective I   EMBEDDED SYSTEMS  Instruction: 3 Periods + 1 Tut/week                                                              Credits:4 Internal: 30 Marks                   University Exam: 70 Marks                    Total: 100 Mark 1.       Examples of Embedded Systems – Typical Hardware – Memory – Microprocessors – Busses – Direct Memory Access – Introduction to 8051 Microcontroller – Architecture Instruction set – Programming. 2.       Microprocessor Architecture – Interrupt Basics – The Shared-Data problem – Interrupt Latency. 3.       Round–Robin Architecture - Round–Robin with Interrupts Architecture  - Function Queue- Scheduling Architecture – Real-Time Operating Systems Architecture – Selection of Architecture. 4.       Tasks and Task States – Tasks and Data – Semaphores and Shared Data – Semaphore Problems – Semaphore variants. 5.       Message Queues – Mailboxes – Pipes – Timer Functions – Events – Memory Management – Interrupt R

MSCS 2.3   ADVANCED OPERATING SYSTEMS  Instruction: 3 Periods + 1 Tut/week                                                              Credits:4 Internal: 30 Marks                   University Exam: 70 Marks               Total: 100 Marks  1.      Introduction To Operating Systems , Types Of Operating Systems, Operating System Structures. Operating-System Services, System Calls, Virtual Machines, Operating System Design and Implementation.   2.      Process Management : Process Concepts, Operations on Processes, Cooperating Processes, Threads, Inter Process Communication, Process Scheduling, Scheduling Algorithms, Multiple -Processor Scheduling. Thread Scheduling.   3.      Process Synchronization & Deadlocks:   The Critical Section Problem, Semaphores, And Classical Problems Of Synchronization, Critical Regions, Monitors, Deadlocks,System Model, Deadlocks Characterization, Methods For Handling Deadlocks, Deadlock- Prevention, Avoidance, Detection,& Recover

MSCS 2.2   RELATIONAL DATA BASE MANAGEMENT SYSTEMS Instruction: 3 Periods + 1 Tut/week                                                    Credits:4 Internal: 30 Marks           University Exam: 70 Mark       Total: 100 Marks   1.       Database Systems: Introduction to the Database System, Introduction three layered Architecture, Data Modeling, Concepts of Relational Models and Relational Algebra.   2.       SQL: Introduction to SQL Queries, Integrity Constraints, Joins, Views, Intermediate and Advanced SQL features and Triggers.   3.       Database Design: Overviews of the Design process, E-R Models, Functional dependencies and other kinds of dependencies, Normal forms, Normalization Techniques and Schema Refinement.   4.       Database Application Design and Development: User Interfaces and Tools, Embedded SQL, Dynamic SQL, Cursors and Stored procedures, JDBC, Security and Authorization in SQL, Internet Applications.   5.       Query Evaluation:

MSCS 2.1   FORMAL LANGUAGES & AUTOMATA THEORY  Instruction: 3 Periods + 1 Tut/week                                                                                  Credits:4 Internal: 30 Marks                    University Exam: 70 Marks                             Total: 100 Marks  1.       Finite Automata and Regular Expressions: Basic Concepts  of Finite State Systems, Deterministic and Non-Deterministic Finite Automata, Finite Automata with        є-moves, Regular Expressions, Mealy and Moore Machines, Two-Way Finite Automate, Applications of FSM.  2.      Regular sets & Regular Grammars: Basic Definitions of Formal Languages and Grammars, Regular Sets and Regular Grammars, Closure Properties of Regular Sets, Pumping Lemma for Regular Sets, Decision Algorithm for Regular Sets, MyhillNerode Theorem, Minimization of Finite Automata.  3.      Context Free Grammars and Languages: Context Free Grammars and Languages, Derivation Trees, Simplification  o