Teaching Scheme. L T P Total L T P

Size: px

Start display at page:

Download "Teaching Scheme. L T P Total L T P"

Emil Howard
5 years ago
Views:

1 PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER - IV [Computer Engineering] Effective from Academic year Sem IV Subject Code 2HS401 Name of Subject Mathematics for Computer Engineering & Information Technology Teaching Scheme Hrs. Credit L T P Total L T P Tot al Int. Asses Theory Sem End Examination Scheme Hrs Total Practical /TW Ass CE402 Operating System CE403 Database Management System-II CE4 Data Structures CE405 Application Development Tools Audit Course Grand Total TOTAL

2 2HS401: Mathematicsfor Computer Engineering & Information Technology [ ] Learning Outcomes: After successful completion of the course, student will be able to Express physical phenomenon in mathematical formulation Understand and solve differential equations Basic knowledge of widely used Fourier transform techniques and their applications in computer and IT Engineering Topics 1] Laplace Transforms: Definition, Laplace transform of elementary functions. Formulas of Laplace transform, Inverse Laplace transforms. Laplace transform of derivatives, Laplace transform of integration. Multiplication by tn, Division by t, Convolution theorem, Unit step and Heaviside s unit function, Dirac-delta function. Periodic functions, Solution of ordinary linear differential equations, simultaneous equation with constant co-efficient applied to electrical circuits 2] Fourier Series: Definition of periodic function, Euler s formula, Functions having points of discontinuity, Change of intervals, Odd and Even functions, Expansion of odd or even periodic functions, Half range sine and cosine series, Elements of harmonic analysis. 3] Fourier Transforms: Definition, Fourier integral, Fourier sine and cosine integration, complex form of Fourier integral, Fourier sine transform, Fourier cosine transform, Inverse Fourier transforms. 4] Theory Of Complex Variables: Analytic functions, Cauchy-Riemann equation, Line integral, Cauchy s theorem and Cauchy s integral formula, Simple form of conformal transformation with application of the solution of two-dimensional problems. 5] Finite Differences And Difference Equations: Finite differences interpolation, Newton s and LaGrange s formula, Difference equation with constants co-efficient, Solution of ordinary and partial differential equations with boundary conditions by finite difference method. 6] Numerical Methods: Roots of algebraic equations, Solution of linear simultaneous equations, Numerical differentiation and Numerical integration, Numerical methods to solve first order, first degree ordinary differential equations. Text Book: 1. Higher engineering mathematics By B.S.Grewal. Minimum Hours

3 Reference Books: 2. Engineering mathematics By Srivastava. 3. Textbook of engineering mathematics By A.B.Mathur and V.P.Jaggi. 4. Theory of functions of complex variables By Shanti Narayan. 5. Introductory Methods of Numerical Analysis By S.S.Sastry. 6. Advanced engineering mathematics By Erwin Kreyzing.

4 2CE402: Operating System [ ] Learning Outcomes: To give the fundamental knowledge of how operating system works, manages the applications that are running. To give fundamental principles of operating system design and its components To understand process management, memory management including virtual memory, protection and security management. Topics 1] Introduction: What is an OS? Evolution Of OS, services, Types of OS, Different view of OS, Basics of memory and architecture 2] Process Management: Process, Process Control Block, Process States Threads, Types of Threads, Multithreading 3] Inter process Communication: Race Conditions, Critical Section, Mutual Exclusion Hardware Solution, Strict Alternation, Peterson s Solution The Producer Consumer Problem, Semaphores, Event Counters, Monitors Message Passing and Classical IPC Problems: Reader s & Writer Problem, Dinning Philosopher Problem etc., Scheduling, Scheduling Algorithms. 4] Deadlock: Deadlock Problem, Deadlock Characterization Deadlock Detection, Deadlockrecovery Deadlock avoidance: Banker s algorithm for single & multiple resources Deadlock Prevention. 5] Memory Management: Paging: Principle Of Operation, Page Allocation, H/W Support For Paging Multiprogramming With Fixed partitions Segmentation Swapping Virtual Memory: Concept, Performance Of Demand Paging, Page Replacement Algorithms, Thrashing, Locality 6] Input Output Management: I/O Devices, Device Controllers, Direct Memory Access Principles Of Input/outputs, Interrupt Handler, Device Driver, Device Independent I/O Software Disks: RAID levels, Disks Arm Scheduling Algorithm Error Handling 7] File Systems: File Naming, File Structure, File Types, File Access, File Attributes, File Operations, Memory Mapped Files Directories: Hierarchical Directory System, Pathnames, Directory Operations File System Implementation, Contiguous Allocation, Linked List Allocation, Linked List Using Index, Inodes, Implementing Directories In C, MS-DOS, and UNIX. Shared Files Disk Space Management Minimum Hours

5 File System Reliability File System Performance 8] Case Study: File System of Unix Operating System and Linux, Role Of Kernel & Function Of Kernel, Design Structure of Unix Operating System, System Calls, Elementary Shell Programming, Directory Structure, System Administration. Text Book: 1. Operating System Concepts ByAviSilberschatz, Peter Baer Galvin, Greg Gagne, Ninth Edition, Wiley Reference Books: 2. Modern Operating Systems By Andrew S. Tanenbaum, Third Edition PHI 3. Operating Systems, D.M.Dhamdhare, TMH 4. Operating Systems Internals and Design Principles, William Stallings, Seventh Edition, Prentice Hall 5. Unix System Concepts & Applications, Sumitabha Das, TMH 6. Unix Shell Programming, YashwantKanitkar By BPB Publications

6 2CE403: Database Management System- II [ ] Learning Outcomes: Enhance the previous knowledge of database systems by deepening the understanding of the theoretical and practical aspects of the database technologies. Apply the principles of query optimization to a database schema. Understand basic principles of database transaction processing and managing concurrent execution environment. Explain the various types of locking mechanisms utilized within database management systems. Explain the different types of database failures as well as the methods used to recover from these failures Describe various database architectures and distributed database management system. Get familiar with the currently available database processing environment (client server model)and query language to build business applications and services Develope practical skills in the use of this model and approach to be able to select and apply the appropriate methods for a particular. Be able to apply learned skills to solving practical database related tasks This course introduces students to PL/SQL and helps them to understand the benefits of this powerful programming Language. Students learns to create PL/SQL blocks of application code and are introduced various database objects. They learn about declaring variables, trapping exceptions and they also learn to declare and control cursors. Students learn to develop, execute and manage PL\SQL stored program units like procedures, functions, packages and database triggers. Topics 1] Query Processing & Query Optimization: Overview Query Evaluation Measure of Query Cost Query Optimization Overview 2] Transaction: Transaction concepts Transaction state ACID Property Implementation of Atomicity & Durability Concurrent executions Serializibility Conflict serializability View serializability Recoverability Recoverable schedules Cascade less schedules 3] Concurrency control: Lock based protocols Locks Granting of locks Two phase locking protocol Implementation of locking Minimum Hours

7 Graph based protocols Timestamp based protocols Timestamps Timestamp ordering protocol Thomas write rules Multiple granularity Deadlock handling Deadlock prevention 4] Recovery system: Failure classification Storage structure Storage type Stable storage implementation Data access Recovery & atomicity Log based recovery Deferred database modification Immediate database modification Checkpoints Shadow paging. 5] Database system architecture: Centralized & client server architectures Centralized systems Client server system Server system architecture Transaction server process structure Data servers Parallel systems Speedup & scale up Interconnection networks Parallel database architectures Shared memory Shared Disk Shared nothing Hierarchical Distributed systems An example of a distributed database 6] Distributed databases: Homogeneous & heterogeneous databases. Distributed data storage Data replication Data fragmentation Transparency Distributed transactions System architecture System failure modes Commit protocols Two phase commit protocol. Commit protocol Handling of failures Three phase commit protocol

8 7] PL/SQL: Theoretical Fundamentals 05 Text Book: 1. Database System Concepts5th Edition By, Silberschatz, Korth and Sudarshan Reference Books: 2. An Introduction to Database Systems: 7th Edition By C. J. Date. 3. Practical Book : - SQI, PL/SQL 2nd Edition By Ivan Bayross

9 2CE4: Data Structures [ ] Learning Outcomes: To explain concepts of Data structure such as stack, link list, tree, queue, searching and sorting. To explain importance and applications of data structures. Topics 1] Overview of C: Arrays, Functions Strings Structures Pointers 2] Introduction to Data Structures: Importance Applications Algorithm & Algorithmic Notation 3] Stack: Definition & Concept Operations on Stacks (Push, Pop, Peep, Change -Algorithm & Implementation). Applications of Stack. Polish expression and Conversions 4] Queue: The queue and its sequential representation. Simple Queue, Circular Queue, Double ended Queue, Priority Queue 5] Sorting: Elementary sorts: Bubble sort, Quick sort, Selection sort, Insertion sort, Merge sort, Radix sort Worst case and average behavior 6] Searching: Basic search techniques-sequential searching, Binary Search 7] Linked List: Concept. Sequential Allocation method Vs linked Allocation method. Dynamic Data structure Vs Static Data structure. Pointer and Linked Allocation. Singly Linked List Storage Structures & Basic Operations. Circular Linked List Storage Structures & Basic Operations. Doubly Linked List Storage Structures & Basic Operations. Application of Linked List Storage Structures. 8] Graph Theory: Definition Graph Representation. Graph Terms Graph Traversal Minimum Hours 9] Tree:

10 Tree & Graph Binary trees Binary tree representation Binary tree traversals Threaded binary tree Different binary tree Tree applications Text Book: 1. An Introduction to Data Structures with Application By Jean-Paul Tremblay,Paul G. Sorenson (second Edition) Reference Books: 2. Data Structures using C and C++ By Aaron M. Tenenbaum, Moshe J. Augenstein, YedidyahLangsam (Second Edition) 3. Classic Data Structure By D. Samanta

11 2CE405: Application Development Tools [ ] Learning Outcomes: The main objectives for offering the course are: Explain the architecture of.net Framework. Explain features of C# using Console Application. Develop Windows based applicationusing MicrosoftVisual Studio. Develop ADO.net based database driven.net application Develop simple web application. Topics 1] Introduction To.Net Framework: The Common Language Runtime Compilation in.net (MSIL and JIT), CTS, CLS Cross language Integration Garbage Collection Assemblies, Name spaces Versioning and deployment Framework class Library 2] C# Basics using Console Application: Variables and Constants Data Types, Scope of variables Formatting Data Handling Exceptions Conditions Input Validation Loops,Arrays Functions 3] Windows Forms and Controls: Creating Windows Forms, Windows Forms Properties and Events Controls (Properties and Events of Controls):Button, Label, TextBox, NumericUpDown, CheckBox, RadioButton, DateTimePicker, GroupBox ListBox, ListView, ComboBox, TabControl, PictureBox, ProgressBar ToolTips, RichTextbox, Timer DatagridView 4] Working With ADO.NET: Introduction to ADO.NET, ADO.NET Architecture Understanding SqlConnection, SqlCommands, SqlDataReaders DataSet and DataAdapter 5] Introduction to ASP.NET: Introduction to ASP.NET, Working with Web and HTMLControls Minimum Hours References Books: 1. Beginning Visual C# Programming By Wrox publication 2. Professional C# and.net By Wrox Publication

GUJARAT TECHNOLOGICAL UNIVERSITY B.E Semester: 4 Information Technology

GUJARAT TECHNOLOGICAL UNIVERSITY B.E Semester: 4 Information Technology Information Technology Subject Code 140702 Subject Name OPERATING SYSTEM Sr.No Course content 1. Introduction: What is an OS?, Evolution Of OS, OS Services, Types Of OS, Concepts of OS, Different Views