Prerequisites: Fundamental of Data Structures.
Type: Lecture.
Course Assessment Methods: Midsemester exam, Endsemester exam, Assignment/Quiz
Course Outcomes: Upon successful completion of this course, the students are expected to:

Design a database for a given set of requirements.

Use SQL.

Apply normalization techniques on given database.

Have knowledge of ‘indexing and hashing’ mechanisms in a database management system.

Have idea of the backend activities involved in extracting data from a database.

Have knowledge of transaction and concurrency control mechanisms in a database management system.
Topics Covered:
Module – I
Introduction: Purpose of Database System; View of Data, Database Languages, Transaction Management, Database architecture, Database Users Administrator
Database Design and Entity  Relational Model: Overview of Design process, ER model, Constraints, ER diagrams, Week Entity Sets, Extended E – R Features.
Module – II
Relational Model: Structure of Relational Database, Fundamental Relational Algebra, Operation, Additional Operations, , Tuple Relational, Calculus.
Module – III
SQL and Advanced SQL: Data definition, Basic structure of SQL queries, Set Operations, Aggregate Functions, NULL values, Nested Subqueries, complex queries, views, modification of database, SQL data types & schemas, Integrity constraints, Authorization, Embedded SQL.
Module – IV Relational Database Design: Atomic domains and First Normal form, Decompositions using functional dependencies, Functional dependencies, Decomposition using multivalued dependencies, more normal forms.
Module – V
Indexing and Hashing: Basic concepts, Ordered Indices, B+ Tree Index Files, B Tree Index files, Multiple Key Access, Hashing, Comparison of Ordered Indexing and Hashing
Module VI
Query processing Overview, measures of query cost, selection operation, sorting join operations
Module – VII
Transaction & Concurrency Control: Transaction Concepts & ACID Properties, Transaction States, Concurrent Executions, Serializability & Its Testing, Recoverability, Introduction to Concurrency Control, Locked Base Protocol & Deadlock Handling. TimestampBased Protocols. ValidationBased Protocols. Multiple Granularity.
Text Book:

A.Silberschatz et.al  Database System Concepts, 5^{th} Ed^{n}, Tata McGraw Hill, New Delhi – 2000.
Reference Books:

Date C.J.  An Introduction to Database System, Pearson Education, New Delhi, 2005.

R.Elmasri, Fundamentals of Database Systems, Pearson Education, New Delhi, 2005.
Prerequisites: Fundamental of Data Structures, Computer System Architecture, Design and Analysis of Computer Algorithms.
Type: Lecture.
Course Assessment Methods: Midsemester exam, Endsemester exam, Assignment/Quiz
Course Outcomes: Upon successful completion of this course, the students will be able to:

Assess various operating systems and their functionalities.

Illustrate as well as design a CPU scheduler.

Analyze the resource management strategies of an OS.

Compile or extend memory management module of an OS.

Analyze and implement file system.
Topics Covered:
MODULE – I
Introduction: What is an Operating System? Simple Monitor, Performance, Multiprogramming, timesharing, Real Time systems, Protection.
File Systems: File Concept and support, Access and allocation methods, directory systems, File protection.
MODULE – II
CPU Scheduling: Scheduling concepts and algorithms, Algorithms evaluation, and Multiple processor scheduling.
MODULE – III
Memory Management: Preliminaries, Bare Machine, Resident Monitor, Swapping, Multiple partitions, Paging, Segmentation, Combined systems.
MODULE – IV
Virtual Memory : Overlays, Demand paging, Performance of demand paging, Page replacement, Virtual memory concepts, Page replacement algorithms, Allocation algorithms, and Thrashing.
MODULE – V
Disk Scheduling: Physical characterization, Disk Management, SwapSpace Management, RAID structure, FCFS scheduling and ShortestSeekTimeFirst.
MODULE – VI
Deadlocks: The deadlock problem, Deadlock characterization, Deadlock prevention, Deadlock avoidance; Deadlock detection, Recovery from deadlock, and combined approach to deadlock handling.
MODULE – VII
Process Synchronization: Semaphores, OS Synchronization, Atomic Transaction.
Security: The Security Problem, User Authentication, Cryptography.
Text Book:

Silver Schatz, A and Golvin, P.B. ‘Operating System Concepts’, 5^{th} Edn. John Wiley, New Yark, 2000.
Reference Books:

Deitel H.M., ‘An Introduction to Operating System’, Addison Wesley, Inc., London, 1995.

Mandinck S.E., ‘Operating System’ McGraw Hill., London, 1993.
MA 4109 Probability, Statistics & Numerical Techniques (Compulsory)
(Department of Applied Mathematics)
Pre – requisites: Knowledge of sets, Algebra, Calculus
Type: Lecture.
Course – Assessment Methods: Theory, practical Examination and Individual Assignment/Internal Quiz
Course Outcomes: Enable the student to

understanding the concepts of Probability, Statistics

Identify the strength and weakness of different theories.

Design and employ appropriate method for solving computing problems

Thinks critically

Solve computing problems independently
Topic Covered: Probability, Descriptive and Inferential Statistics, Numerical Analysis
Text Books and /or Reference Materials
Text Books

Jain, M.K., et.al., Numerical Methods for Scientic and Engineering Computation,3^{rd} Ed, New Age pub., New Delhi, 1999
2. S.C. Gupta and V.K. Kapoor, Fundamental of mathematical statistic, Sultan Chand and sons, New Delhi, 2002
Reference Materials

Sastry, S.S., Introductory Methods of Numerical Analysis, 4^{th} Ed, PHI, New Delhi,2005

Hines, W.W. et.al., Probability, and Statistics in Engineering ,4^{th} Ed, John Wiley, Singapore(Indian Reprint),2003

Veerarajab, T., Probability, Statistics & Random Processes, 2^{nd} ed, TMH, New Delhi 2003
MA 4110 Numerical Techniques Lab (Compulsory)
(Department of Applied Mathematics)
Pre – requisites: Programming Language like C/C++ etc
Type: Practical
Course – Assessment Methods: practical Examination and Individual Assignment/Internal Quiz
Course Outcomes: Enable the student to

understanding the concepts of Probability & Statistics

Identify the strength and weakness of different algorithms above

Design and employ appropriate method for solving computing problems

Thinks critically

Solve computing problems independently
Topic Covered: Probability, Statistics, Numerical Techniques
Text Books and /or Reference Materials
Text Books

Jain, M.K., et.al., Numerical Methods for Scientific and Engineering Computation,3^{rd} Ed, New Age pub., New Delhi, 1999

S.C. Gupta and V.K. Kapoor, Fundamental of mathematical statistic, Sultan Chand and sons, New Delhi, 2002
Reference Materials

Sastry, S.S., Introductory Methods of Numerical Analysis, 4^{th} Ed, PHI, New Delhi,2005

Hines, W.W. et.al., Probability, and Statistics in Engineering ,4^{th} Ed, John Wiley, Singapore(Indian Reprint),2003

Veerarajab, T., Probability, Statistics & Random Processes, 2^{nd} ed, TMH, New Delhi 2003
SEMESTERV
CS 5101 FORMAL LANGUAGES AND AUTOMATA THEORY (Compulsory)
Prerequisites: Discrete Mathematics.
Type: Lecture and Tutorial.
Course Assessment Methods: Midsemester exam, Endsemester exam, Assignment/Quiz
Course Outcomes: After successful completion of the course, the students will be able to:

Demonstrate an ability to apply the knowledge for solving real world problems.

Relate practical problems to languages and automata.

Design an appropriate abstract machine to solve a problem.

Design a grammar for a given formal language.

Develop a clear understanding of undecidability and computational efficiency.
Topics Covered:
MODULE  I
Introduction to Automata: Study and Central concepts of automata theory, An informal picture of finite automata, deterministic and nondeterministic finite automatas, applications of finite automata, finite automata with epsilon – transitions.
MODULE  II
Regular expression and languages: Regular expressions, finite automata and regular expressions, applications of regular expressions, algebraic laws of regular expressions.
MODULE  III
Properties of Regular Languages: Proving languages not to be regular, closure properties of regular languages, equivalence and minimization of automata.
MODULE  IV
Context – free Grammars and Languages: Parse trees, Applications of context free grammars, Ambiguity in grammars and languages.
MODULE  V
Pushdown Automata: Pushdown automation (PDA), the language of PDA, equivalence of PDA’s and CFG’s, Deterministic Pushdown Automata.
MODULE  VI
Properties of Context – Free Languages: Normal forms of context free grammars, pumping lemma for context free languages, close properties of context free languages.
MODULE  VII
Introduction to Turing Machine: The Turing machine, programming techniques for Turing machine, extensions to the basic Turing machine, restricted Turing Machines, Turing Machines and Computers.
Text Books:

J.E. Hopcroft , et.al.  Introduction to Automata Theory, Languages and Computation, 2^{nd} Edn. Pearson Education , New Delhi 2001
Reference Books:

K.L.P. Misra – et.al.  Theory of Computer Science, 2^{nd} Edn. PHI, New Delhi, 2000

J.C. Martin  Introduction to Languages and the Theory of Computation 2^{nd} Edn, TMH, New Delhi, 2000.
EC4205 MICROPROCESSOR AND MICROCONTROLLER (Compulsory)
Department of Electronics and Communication Engineering
Prerequisites: Digital Electronics
Course Assessment Methods: Midsemester exam, Endsemester exam, Assignment/Quiz
Course Outcomes:
a) An understanding of how a microprocessor is designed using various digital logic units.
b) Knowledge of how a microprocessor actually executes various instructions.
c) Significance of clock and how synchronization and sequencing are effected.
d) Acquiring the proficiency to write and execute Assembly Language Programmes to achieve
various tasks.
e) Understanding about how I/0 operations can be practically performed.
f) Knowledge about peripheral chips and acquiring the ability to design and build microprocessor based systems, which can be used for Industrial applications.
g) Understanding about the evolution process of various microprocessors starting with 8085 to Pentium, and concepts about CISC and RISC processors.
h) Knowledge about concepts of Virtual memory addressing.
i) Familiarity with a typical microcontroller 8051, and the how it is different from a typical microprocessor.
Topics Covered:
Share with your friends: 