Major and Allied practical Examinations at the end of even semester. Major Total –2100 Allied Total –1200 Part I/Part II Total - 400 Others Total - 300 Grand total -4000 Major Papers
C PROGRAMMING Semester: I (Major) Duration: 60 hours Aim: To understand the concept of procedure oriented programming and helps to implement functions and modules of OO Languages Objective:
Unit I: 12 hours] The C declarations: Introduction-The C character set- Delimiters-The C keywords-Identifiers-Constants-Variables-Rules for defining variables -Data types- Declaring variables-Initializing variables-type conversion-Constant and volatile variables. Operators and Expressions: Introduction-priority of operators and their clubbing-Comma and conditional operator-Arithmetic operators-Relational operators- Logical operators- Bitwise operators. Input and Output in C: Introduction-Formatted functions- Unformatted functions- Commonly used Library functions. Unit II: 12 hours] Decision statements: Introduction – the IF statement- the IF…ELSE Statement-Nested IF…ELSE statement-the BREAK statement-the CONTINUE statement-the GOTO statement-the SWITCH statement-nested SWITCH-the SWITCH case and nested IF. Loop Control statement: Introduction- the FOR loop-nested FOR loops-the While loop- the do- While loop- the Do-While statement with While loop. Unit III: 14 hours] Arrays: Introduction-Array initialization-Definition of Array-Characteristic of array- One-Dimensional array-predefined streams-Two-Dimensional array- Three or multi dimensional arrays – the sscanf() and sprintf() functions. Pointers: Introduction – features of pointers – pointer declaration – arithmetic operations with pointers – pointers and arrays - pointers and two-dimensional arrays – array of pointers. Unit IV: 12 hours] Introduction – Definition of function – Declaration of function and function prototypes – the return statement – types of functions – call by value and reference – function returning more values – function as an argument – function with operators – function and decision statements – function and loop statements- function with arrays and pointers – recursion – pointer to function. Storage class: Introduction – Automatic variables – External variables – static variables – register variables. Unit V: 12 hours] Structure: introduction – features of structures – declaration and initialization of structures – structure within structure – array of structures. Files: Introduction – streams and file types- steps for file operations – file I/O. Text Book: Programming with ANSI and Turbo C- Ashok N. Kamthane, Pearson education. Reference Books:
OBJECT ORIENTED PROGRAMMING WITH C++ Semester: II (Major) Duration: 60 hours] Aim: To understand the concept of Object oriented programming and discuss the important elements of C++ Objective:
Unit I: 12 hours] Classes and Objects:Introduction – structures in C – structures in C++ - classes in C++ - declaring objects – the public keyword – the private keyword – the protected keyword – defining member functions – characteristics of member functions – outside member function inline – rules for inline functions – data hiding or encapsulation – classes, objects and memory – static member variables and functions – static object – array of objects – objects as function arguments – friend functions – the const member function – local classes – empty, static and const classes – member functions and non-member functions – the main() as a member function – overloading member functions – overloading main() function – the main(), member function and indirect recursion – bit fields and classes. Unit II: 12 hours] Constructors and destructors:Introduction – constructors and destructors – characteristics of constructors and destructors – application s with constructors – constructors with arguments – overloading constructors – constructors with default arguments – copy constructors – the const objects – destructors – calling constructors and destructors – qualifier and nested classes – anonymous objects – private constructors and destructors – dynamic initialization using constructors – dynamic operators and constructors – the main() as a constructor and destructor – recursive constructor - program execution before main() – constructor and destructor with static members – local vs. global object. Unit III: 12 hours] Operator overloading and type conversion:Introduction – the keyword operator – overloading unary operator – operator return type – constraint on increment and decrement operators – overloading binary operators – overloading with friend function – type conversion – rules for overloading operators . Inheritance:Introduction – access specifiers and simple inheritance – protected data with private inheritance – types of inheritance – single inheritance – multilevel inheritance – multiple inheritance – hierarchical inheritance – hybrid inheritance – multipath inheritance. Unit IV: 12 hours] Pointers and Arrays:Introduction – pointer declaration – void pointers – Wild pointers – pointer to class – pointer to object – the this pointer – pointer to derived classes and base classes – pointer to members – accessing private members with pointers – arrays – characteristics of arrays – initialization of arrays using functions – arrays of classes – binding in C++ - pointer to derived class objects. Unit V: 12 hours] Virtual functions and Files:Virtual functions – rules for virtual functions – arrays of pointers pure virtual functions abstract classes – working of virtual functions – virtual functions in derived classes- file stream classes – steps of file operations – checking for errors – finding end of a file – file opening modes – file pointers and manipulators – manipulators with arguments – sequential read and write operations – binary and ASCII files – random access operation. Text Book: Object-Oriented Programming with ANSI & Turbo C++ , Ashok n. Kamthane ,Pearson Education. Reference Books:
OPERATING SYSTEMS Semester: III (Major) Duration: 60 hours] Aim: To have through knowledge of process, scheduling concepts, memory management, I/O and file system in an OS Objective:
Unit I: 12 hours] OVERVIEW: Introduction operating system software –Machine Hardware-Types of operating system-Brief History of Operating systems Development. MEMORY MANAGEMENT, EARLY SYSTEMS: Single-User Contiguous Scheme-Fixed Partitions- Dynamic Partitions – Best-Fit versus First-Fit Allocation-Deallocation - Relocatable Dynamic Partitions- -Exercises for self-study. MEMORY MANAGEMENT, RECENT SYSTEMS: Paged Memory Allocation-Demand Paging-Page Replacement-Policies and Concepts-Segmented Memory Allocation-Segmented/Demand Paged Memory Allocation-Virtual Memory – Exercises for self-study Unit II: 12 hours] PROCESSOR MANAGEMENT: Job Scheduling Versus Process Scheduling-Processor Scheduler-Process Scheduling Policies-Process Scheduling Algorithms-Cache Memory-A Word about Interrupts – Exercises for self-study PROCESS MANAGEMENT: Deadlock-Seven Cases of deadlock –Conditions for deadlock – Modeling deadlock -Strategies for Handling deadlock -Starvation-Exercises for self-study Unit III: 12 hours] CONCURRENT PROCESSES: What Is Parallel Processing?-Typical Multiprocessing Configurations-Process Synchronization Software-Process Cooperation-Concurrent Programming- -Exercises for self study. DEVICE MANAGEMENT:System Devices-Sequential Access Store Media-Direct Access Storage Devices-Components of the I/O Subsystem-Communication among Devices- Management of I/O Requests- Exercises for self study Unit IV: 12 hours] FILE MANAGEMENT: The File Manager-Interacting with the File Manager-File Organization-Physical Storage Allocation-Data Compression-Access Methods-Levels in a File Management System –Access Control Verification Module- Exercises for self study. MANAGEMENT OF NETWORK FUNCTIONS: History- Comparison of Network and Distributed Operating System-DO/S Development-NOS Development Unit V: 12 hours] UNIX OPERATING SYSTEM: History-Design Goals-Memory Management-Processor Management-Device Management-File Management-User Interface Text Book: UNDERSTANING OPERATING SYSTEMS, Ida M.Flynn / Ann Mclver McHoes,THIRD EDITION, THOMSON BROOKS/COLE Reference books:
JAVA PROGRAMMING Semester: IV (Major) Duration: 60 hours] Aim: To describe the object oriented development domain for Internet applications and three tier software systems Objective:
Unit I: 12 hours] Data Types: Simple types – Integers – Floating point types – Characters – Booleans – A Closer Look at Literals – Variables – Type Conversion and Casting – Automatic type Promotion in Expressions - Strings. Arrays: One Dimensional Array – Multi Dimensional Array. Operators: Arithmetic Operators – Bitwise operators – Relational Operators – Boolean Logical Operators – Assignment Operator – Conditional Operator – Operator Precedence. Unit II: 12 hours] Introducing Classes: Class Fundamentals – Declaring Objects – Assigning Object Reference Variables – Introducing Methods – Constructors – Garbage Collection – finalize() Method – Stack Class. A Closer Look at Methods and Classes: Overloading Methods – Using Objects as Parameters – Argument Passing – Returning Objects – Recursion – Introducing Access Control – Understanding static – Introducing final – Nested and Inner classes – String Class – Using command line arguments. Inheritance Basics – Using super – Creating Multilevel Hierarchy – Method Overriding – Dynamic Method Dispatch – Using Abstract class – Using final with Inheritance – The Object class. Unit III: 12 hours] Packages and Interfaces: Packages – Access Protection – Importing Packages – Interfaces. Exception Handling: Introduction – Exception Types – Uncaught Exceptions – Using try and catch – Multiple catch Clauses – Nested try Statements – throw – throws – finally – Java’s Built-in Exceptions – Creating Your Own Exception Subclasses. Multithreaded Programming: Java Thread Model – Main Thread – Creating a Thread – Creating Multiple Threads – Using isAlive () and join () – Thread Priorities – Synchronization – Interthread Communication – Suspending, Resuming, and Stopping Threads – Using Multithreading. Unit IV: 12 hours] The Applet Class: Applet Basics – Applet Architecture – Applet Skeleton – Applet Display Methods – Requesting Repainting – HTML APPLET tag – Passing Parameters to Applet – AudioClip Interface. Event Handling: Event Handling Mechanisms – Delegation Event Model – Event Classes – Sources of Events – Event Listener Interfaces – Handling Mouse Events and Keyboard Events. Unit V: 12 hours] Introducing the AWT: AWT Classes – Window fundamentals – Working with Frame Windows-Working with Graphics – Working with color – Working with Fonts Using AWT Controls: Controls Fundamentals – Labels – Using Buttons – Applying Check Boxes – Check Box Group – Choice Contols – Using a TextField –Using a Text Area – Understanding Layout Managers – [Flow Layout Only] – Menu Bars and Menus Text Books
Reference Books
COMPUTER NETWORK AND COMMUNICATION Semester: IV (Major) Duration: 60 hours] Aim: To cover the fundamental concepts of technologies used in data communication and computer networking Objective:
Unit I: 12 hours] COMPUTER NETWORKS AND THE INTERNET:What is Internet-The Network Edge-The Network Core-Access Networks and Physical Media-ISPs and Internet Backbones-Delay and Loss in Packet Switched Networks-Protocol layers and their Service Models-History of Computer Networking and the Internet. APPLICATION LAYER:Principles of Network Applications-File Transfer:FTP-Electronic Mail in the Internet-DNS. Unit II: 12 hours] TRANSPORT LAYER: Introduction and Transport Layer Services-Multiplexing and De-Multiplexing-Principles of Reliable Data Transfer-Connection Oriented-Transport: TCP-Principles of Congestion Control-TCP Congestion Control. Unit III: 12 hours] THE NETWORK LAYER:Introduction-Virtual Circuit and Datagram Networks-What is Inside a Router? -The Internet Protocol(IP):Forwarding and Addressing in the Internet-Routing Algorithms-Routing in the Internet-Broadcast and Multicast Routing. Unit IV: 12 hours] THE LINK LAYER AND LOCAL AREA NETWORKS:Error detection and Correction Techniques-Multiple Access-Protocols-Link Layer Addressing-Ethernet. WIRELESS AND MOBILE NETWORKS:Introduction-Wireless Links and Characteristics-WiFi: 802.11Wireless LANs-Cellular Internet Access-Mobility Management: Principles-Mobile IP- Managing Mobility in Cellular Networks. Unit V: 12 hours] SECURITY IN COMPUTER NETWORKS:What is Network Security-Principles of Cryptography-Authentication-Integrity-Key Distribution and Certification-Access Control: Firewalls - Attacks and Countermeasures-Security in many layers: Case Studies. TEXT BOOK: ”COMPUTER NETWORKING”, JAMES F.KUROSE ,KEITH W.ROSS, Pearson Education Publication, Third Edition. CHAPTERS 1,2,3,4,5,6,8. REFERENC BOOKS:
INTRODUCTION TO PROBLEM SOLVING USING VB Semester: IV (Major) Duration: 60 hours] Aim: To make the students to understand windows programming concepts Objective:
Unit I: 12 hours] Getting Started With Visual Basic: Integrated Development Environment- Renaming And Saving the Project - The Elements Of User Interface - Designing the User Interface - Programming An Application Visual Development & Event Driven Programming - Customizing the Environment. Visual Basic Projects: Building A Loan Calculator - Building A Math Calculator - An Application With Multiple Forms - A Project's File Visual Basic: The Language - Variables - Arrays - Collections - Procedures - Constants - Arguments - Function Return Values - Control Flow Statements - Loop Statements - Nested Control Structures - Exit Statement. Unit II: 12 hours] Working With Forms: Appearance Of Forms - Designing Menus - Building Dynamic Forms At Runtime - Drag Drop Operations - The Type Of Keywords - Mouse Conflict - Dragging List Items. Basic ActiveX Controls: Text Box - List Box - Combo Box - Scrollbar And Slider Controls - File Controls. Advanced ActiveX Controls: The Common Dialog Control – TreeView and ListView Controls Unit III: 12 hours] Multiple Document Interface: MDI Applications: The Basics - Accessing Child Forms - Implementing Scrolling Forms. More advanced ActiveX Controls: The Rich Text Box control – MS Flex Grid control. Unit IV: 12 hours] OLE Automation & VBA :OLE Container Control - OLE Drag And Drop Operations - OLE Automation - Automating Word, Excel. Building ActiveX Controls: Designing ActiveX Controls - Building Flex Label Custom Control - Interacting With The Container - Designing Property Pages - Building A Generic Control - Enhancing Existing Controls. Unit V: 12 hours] Database Programming: Using Visual Data Manager - Validating - Data Entering - Accessing Fields In Record Sets - SQL-Advanced Data Bound Controls- Mapping Databases. Active Data Objects: Creating Data Project - Designing With Data Environment - ActiveX Designer - ADO Data Control. Textbook:Evangelos Petroutsos, “Mastering Visual Basic”, BPB Publications Reference books:
OBJECT ORIENTED SOFTWARE ENGINEERING Semester: V (Major) Duration: 60 hours] Aim: To bring in the methodology involved in the development and maintenance of software Objective:
Unit I: 12 hours] SOFTWARE AND SOFTWARE ENGINEERINGThe nature of software-What is software engineering?-Software engineering as a branch of the engineering profession-Stake holders in software engineering-Software quality-Software engineering projects-Activities common to software projects-The eight themes emphasized in this book-Difficulties and risks in software engineering as a wholeREVIEW OF OBJECT ORIENTATION What is object orientation?-Classes and objects-Instance variables-Methods, operations and polymorphism-Organizing classes into inheritance hierarchies The effect of inheritance hierarchies on polymorphism and variable declarations-Concepts that define object orientation-Detailed example: a program for manipulating postal codes-Detailed example: classes for representing geometric points-Difficulties and risks in programming language choice and object-oriented programming (Project exercises.-self study) Unit II: 12 hours] DEVELOPING REQUIREMENTSDomain analysis-The starting point for software projects-Defining the problem and the scope- What is a requirement?-Types of requirements-Some techniques for gathering and analyzing requirements-Types of requirements document-Reviewing requirements-Managing changing requirements-Detailed example: GPS-based Automobile Navigation Assistant (GANA)-Detailed example: requirements for a feature of the Simple chat instant messaging program-Difficulties and risks in domain and requirements analysis –( Project exercises-self study). Unit III: 12 hours] MODELLING WITH CLASSES: What is UML?-Essentials of UML class diagrams –Associations and multiplicity-Generalization-Instance diagrams-More advanced features of class diagrams-Detailed example: a class diagram for genealogy- The process of developing class diagrams MODELLING INTERACTIONS AND BEHAVIOUR Interaction diagrams-State diagrams-Activity diagrams-Implementing classes based on interaction and state diagrams difficulties and risks in modeling interactions and behavior –(Project exercises-self study). Unit IV: 12 hours] ARCHITECTING AND DESIGNING SOFTWARE: The process of design-Principles leading to good design-Techniques for making good design decisions-Software architecture-Architectural patterns-Writing a good design document –Detailed example: design of a feature for the Simple Chat instant messaging application-Difficulties and risks in design- (Project exercises-self study). Unit V: 12 hours] TESTING AND INSPECTING TO ENSURE HIGH QUALITY:Basic definitions-Effective and efficient testing-Defects in ordinary algorithms-Defects in numerical algorithms-Defects in timing and co-ordination: deadlocks, livelocks and critical races- Defects in handling stress and unusual situations-Documentation defects-Writing formal test cases and test plans – Strategies for testing large systems-Inspections-Quality assurance in general –Detailed example: test cases for phase 2 of the Simple Chat instant messaging system-Difficulties and risks in quality assurance –(Project exercises-self study). MANAGING THE SOFTWARE PROCESS:What is project management? -Software process models-Cost estimation Building software engineering teams-Project scheduling and tracking-Contents of a project plan-Difficulties and risks in project management- (Project exercises for self study). Text Book: OBJECT ORIENTED SOFTWARE ENGINEERING, TIMOTHY C.LETHBRIDGE AND ROBERT LAGANIERE, TMH 2004 Reference book: Object oriented and Classical Software Engineering, Fifth Edition, Stephen R.Schach, TMH INTRODUCTION TO COMPUTER GRAPHICS & MULTIMEDIA Semester: V (Major) Duration: 60 hours] Aim: To impart the fundamental concepts of computer graphics and Multimedia Objective:
Unit I: 12 hours] Overview of Graphics System: Video Display Devices – Hard Copy Devices – Graphics Software. Output Primitives: Points and Lines –Line drawing algorithms – Circle drawing algorithm Unit II: 12 hours] Attributes of Output Primitives: Line attributes – Curve attributes – Character attributes. Two-Dimensional Geometric Transformation: Basic Transformations – Matrix Representations and homogenous co-ordinates – Composite and other Transformations. Unit III: 12 hours] Two-Dimensional Viewing: The viewing pipeline, Viewing co-ordinate reference frame – Window to view port co-ordinate transformation – Two-dimensional viewing function. Clipping Operations: Point clipping – Line clipping (only Cohen-Sutherland line clipping) – Polygon Clipping (only Sutherland-Hodgeman polygon clipping). Unit IV: 12 hours] Interactive Input Methods: Input of graphical data – Input functions – Three dimensional display methods. Three Dimensional Viewing: Projections. Visible surface deduction methods: Back- face deduction – Depth buffer method. Unit V: 12 hours] Multimedia Introduction: What is Multimedia? – Hardware components of a Multimedia system. Multimedia Elements: Text and Graphics – Sound – Animation – Video – Issues and trends in Multimedia. Text Book:
WEB TECHNOLOGY AND DESIGN Semester: V (Major) Duration: 60 hours] Aim: To explain the Internet programming concept, related programming and scripting language Objective:
Unit I: 12 hours] Internet principles: Introduction to Internet – protocol-IP address-Internet services –Email-WWW-Internet security-EDI and E-commerce Introduction to HTML: History-Tags-Images and pictures-List-Tables Unit II: 12 hours] Frames and forms: Definition-HTML forms-Elements of forms Elements of JavaScript: Data types-variables-operators-Conditional statements-Array, Date and String objects Unit III: 12 hours] Objects and events: Document object model-The document object-Image object-Forms and Elements –Event Handling-Browser object –Submit event and data validation User Input processing: ParseInt() Function-ParseFloat() Function-Recursive function-Examples Unit IV: 12 hours] Server side script with JSP: Client –Server Responsibilities –JSP Architecture –JSP servers-tags-Request and Response object - Business processing with JSP JSP with JDBC: Introduction-Simple application Unit V: 12 hours] Java servelet: Protocol support-HTML support-Replacing CGI Scripts-Installing serve lets-Using Java web server-Servelet API- Life cycle-HTML to servelet communication Case studies: Online Railway reservation – Web enabled banking Textbook:
DATABASE MANGEMENT SYSTEMS WITH ORACLE Semester: V (Major) Duration: 60 hours] Aim: To provide the storng foundation in database terminology and an introduction to current trends in the filed Objective:
Unit I: 12 hours] Introduction: Database System Applications-Database Systems versus File Systems-View of Data-Data models –Database Languages –Database Users and Administrators – Transaction Management –Database System Structure – Application Architectures – History of Database System. Entity-Relationship Model: Basic Concepts – Constraints –Keys Design Issues-Entity –Relationship Diagram –Weak Entity Sets-Extended E-R Features – Design of an E-R Database Schema – Reduction of an E-R Schema to Tables – The Unified Modeling Language (UML). Unit II: 12 hours] SQL Basic Structure – Set Operations- Aggregate Functions- -Null Values- Nested Subqueries – Aggregate Functions- Null Values – Nested Subqueries – Views Complex Queries – Modification of the Database – Joined Relations – Data-Definition Language –Embedded SQL –Dynamic SQL-Other SQL Features. Unit III: 12 hours] Integrity and Security:Domain Constraint – Referential Integrity – Assertions –Triggers-Security and Authorization in SQL –Encryption and Authentication. Relational –Database Design: First Normal Form-Pitfalls in Relational-Database Design –Functional Dependencies-Decomposition – Desirable Properties of Decomposition – Boyce-Codd Normal Form – Third Normal Form-Fourth Normal Form – Normal Forms–Overall Database Design Process. Unit IV: 12 hours] Schema Objects Data Integrity – Creating and Maintaining Tables – Indexes –Sequences – Views –Users Privileges and Roles –Synonyms. Unit V: 12 hours] PL/SQL:PL/SQL –Triggers – Stored Procedures and Functions – Package – Cursors -Transaction Text Books:
Reference Books:
Optional papers FOUNDATIONS OF ARTIFICIAL INTELLIGENCE Semester: V (Major) Duration: 60 hours] Aim:To develop computer applications which encompasses, perception, reasoning and learning and to provide in depth understanding of major techniques used to simulate intelligence Objective:
Unit I: 12 hours] PROBLEMS: What is AI? – AI problems – Underlying Assumption - AI Techniques – Level of the Model – Criteria for Success. Defining the problem as a State Space Search – Production Systems – Problem Characteristics – Production System Characteristics – Issues in the design of Search Programs. Case Study: Analyze TRAVELING SALESMAN problem with respect to the seven problem characteristics. Unit II: 12 hours] HEURISTIC TECHNIQUES:Generate – and-Test – Hill Climbing – Best-First Search – Problem Reduction – Constraint Satisfaction – Means-Ends Analysis. Case study: Trace the constraint satisfaction procedure solving the following crypt arithmetic problem CROSS +ROADS ---------- DANGER Unit III: 12 hours] KNOWLEDGE REPRESENTATION Knowledge Representation Issues: Representations and Mappings – Approaches to Knowledge Representation: Simple Relational Knowledge, Inheritable knowledge, Inferential Knowledge, Procedural Knowledge Using Predicate Logic: Representing Simple Facts in Logic – Computable Functions and Predicates – Resolution: Conversion to Clause Form, Resolution in Propositional Logic, Unification Algorithm and Resolution in Predicate Logic. Unit IV: 12 hours] REPRESENTING KNOWLEDGE USING RULESProcedural versus Declarative knowledge – Forward versus Backward Reasoning. - Matching SYMBOLIC REASONING UNDER UNCERTANITY:Introduction to Nonmonotonic Reasoning – Logics for Nonmonotonic Reasoning. Case Study: Try to formulate the ABC Murder story [in Nonmonotonic Reasoning] in Predicate Logic and see how far you can get. Unit V: 12 hours] GAME PLAYING AND EXPERT SYSTEMMinimax Search Procedure – Adding Alpha-Beta Cutoffs. – Additional Refinements – Iterative Deepening. Introduction to Expert System – Limitations of Expert System – Expert System Development. Case Study: Apply DFID to the water Jug problem. Text Book : Elaine Rich and Kevin Knight “ARTIFICIAL INTELLIGENCE “ 2/e TMH ASP.NET PROGRAMMING Semester: V (Optional) Duration: 60 hours] Aim: To cover the fundamental concepts of .NET framework Objective:
Unit I: 12 hours] THE .NET FRAMEWORK-The .NET :Programming Framework-VB.NET, C#, and the .NETLanguage-The Common Language Runtime-The .NET Class Library-ASP.NET-Visual Studio.NET LEARNING THE .NET LANGUAGE:-Data Types-Declaring Variables-Scope and Accessibility-Variable Operations-Object-Based Manipulation-Conditional Structures-Loop structures-Functions and Subroutines Unit II: 12 hours] ASP.NET APPLICATIONS- ASP.NET Applications-Code-Behind-The Global. asax Application File-Understanding ASP.NET Classes-ASP.NET Configuration WEB FORM FUNDAMENTALS- A Simple Page Applet-Improving the Currency converter-A deeper Look at HTML Control Classes-The Page Class- Assessing HTML Server Controls. Unit III: 12 hours] WEB CONTROLS- Stepping Up to Web Controls-Web Control Classes-Auto Post Back and Web Control Events- A Simple Web Page Applet- Assessing Web Controls. USING VISUAL STUDIO. NET- The promise of Visual Studio. NET- Starting a Visual Studio .NET Project-The Web Form Designer-Writing Code- visual Studio .NET Debugging- Working Without Visual Studio .NET. Unit IV: 12 hours] STATE MANAGEMENT-The Problem of State-Viewstate- Transferring Information-Custom cookies- Session State-Session State Configuration-Application State. TRACING AND LOGGING-Logging Exceptions-Error Pages-Page Tracing Unit V: 12 hours] COMPONENT-BASED PROGRAMMING-Why Use Components?-Creating a Simple Component-Properties and State-Database Components-A Simple Database Component-Using COM Components. Text Book:-THE COMPLETE REFERENCE ASP.NET, MATHEW MACDONALD, TMH 2002 Reference bookMicrosoft ASP.NET Step by step, G,Andrew Duthie, PHI CLIENT/SERVER COMPUTING Semester: V (Optional) Duration: 60 hours] Aim: To under the basic client server architecture, Components and Application development Objective:
Unit I: 12 hours] What is client/Server computing? – Benefits – Hard ware trends –Software trends –Components of client/Server Applications-Classes and categories. Unit II: 12 hours] The Client components – Client Operating Systems-Database access-Application logic –GUI environments- GUI design and standards –Interface independence –Testing interfaces- Development aids Unit III: 12 hours] Categories of servers-Features and classes of server machines –Server environment Unit IV: 12 hours] Server Operating systems–Server requirements- Server data management and access tools Unit V: 12 hours] LAN Hardware and Software –Future Hardware/Software trends Text book Client/Server Computing, Dawna Travis Dewire, TMH Edition 2003 Reference book Client/Server Computing, Patrick N Smith & Stevel Guengerich, PHI, Second Edition MOBILE COMPUTING Semester: V (Optional) Duration: 60 hours] Aim: To provide basics for various techniques in mobile communications and mobile content services Objective:
Unit I: 12 hours] MOBILE COMPUTING ARCHITECTUREHistory of Computers-History of Internet-Internet the Ubiquitous Network-Architecture for Mobile Computing-Three-Tier Architecture-Design Considerations for Mobile computing-Mobile Computing through Internet-Making Existing Applications Mobile-Enabled Unit II: 12 hours] EMERGING TECHNOLOGIESIntroduction- Blue tooth-Radio Frequency Identification (Rfid) -Wireless Broadband (WiMAX) –Mobile IP GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS (GSM)Global System for Mobile Communications-GSM Architecture-GSM Entities-Call Routing in GSM-PLMN Interfaces-Gsm Addresses and Identifiers-Network Aspects in GSM-GSM Frequency Allocation-Authentication and Security Unit III: 12 hours] SHORT MESSAGE SERVICE (SMS) Mobile Computing over SMS-Short Message Services (SMS)-Value Added Services through SMS GENERAL PACKET RADIO SERVICE (GPRS)GPRS and Packet Data Network-GPRS Network Architecture-GPRS Network Operations-Data Services in GPRS-Applications for GPRS-Limitations of GPRS-Billing and Charging in GPRS Unit IV: 12 hours] CDMA & 3GIntroduction-Wireless Data –Third Generation Networks WIRELESS LANIntroduction-Wireless LAN Advantages- IEEE 802.11 Standards-Wireless LAN Architecture-Mobility in Wireless LAN-Deploying Wireless LAN-Mobile Ad Hoc Networks and Sensor Networks-Wireless LAN Security-WiFi Versus 3G Unit V: 12 hours] SECURITY ISSUES IN MOBILE COMPUTING:Introduction-Information Security-Security Techniques and Algorithms-Security Protocols-Public key Infrastructure-Trust-Security Models-Security Frameworks for Mobile Environment Text Book MOBILE COMPUTING by ASOKE K TALUKDER, ROOPA R YAVAGAL TECHNOLOGY, APPLICATIONS AND SERVICE CREATION@ 2005, TATA McGraw-Hill Publishing Company Limited, First reprint 2006 DATA WAREHOUSING AND MINING Semester: V (Optional) Duration: 60 hours] Aim: To serve as an introductory course to UG students with an emphasis on the desing aspect of Data warehousing and data mining Objective:
Unit I: 12 hours] INTRODUCTION- What is a data Warehouse? DELIVERY PROCESS -Data warehouse delivery method SYSTEM PROCESSES - Introduction-Overview-Typical process flow within a data warehouse-Extract and load process-Clean and transform data-Backup and archive process-Query management process. PROCESS ARCHITECTURE - Introduction-Load manager-Warehouse manager-Query manager Unit II: 12 hours] SYSTEM AND DATA WARE HOUSE PROCESS MANAGERS Introduction-Why you need tools to manage a data warehouse-system managers-Data warehouse process managers-Load manager-Warehouse manager-Query manager CAPACITY PLANNING, TUNING AND TESTINGIntroduction-Process-Estimating the load TUNING THE DATA WAREHOUSEIntroduction -Assessing performance-Tuning the data load-Tuning queries Unit III: 12 hours] INTRODUCTION:Introduction-Basics of Data Mining - Data Mining Versus Knowledge Discovery in Database –Data Mining Issues-Data Mining Metrics-Social Implications of Data Mining-Data Mining from a Database Perspective Unit IV: 12 hours] RELATED CONCEPTSDatabase/OLTP Systems-Fuzzy Sets and Fuzzy Logic-Information Retrieval-Decision Support Systems-Dimensional Modeling-OLAP-Web Search Engines DATA MINING TECHNIQUESIntroduction-A Statistical Perspective on Data Mining-Similarity Measures-Decision Trees-Neural Networks-Genetic Algorithms Unit V: 12 hours] ASSOCIATION RULESIntroduction-Large Item sets-Basic Algorithms-Parallel and Distributed Algorithms-Comparing Approaches-Incremental Rules- Advanced Association Rule Techniques - Measuring the Quality of Rule Techniques-Measuring the Quality of Rules- Text Books:
Reference Book:
SYSTEM PROGRAMMING FUNDAMENTALS Semester: V (Optional) Duration: 60 hours] Aim: To have an understanding of foundation of design of assemblers, loaders, linkers , macro processors and compilers Objective:
Unit I: 12 hours] BACKGROUND:Introduction – System Software and Machine Architecture – The simplified Instructional Computer(SIC) – Traditional CISC Machines – RISC Machines. Unit II: 12 hours] ASSEMBLERSBasic Assembler functions – Machine Dependent Assembler features - Machine Independent Assembler features – Assembler Design Options – Implementation Examples. Unit III: 12 hours] LOADERS AND LINKERSBasic Loader functions – Machine Dependent Loader features - Machine Independent Loader features – Loader Design Options – Linkage Editors – Dynamic Linking – Bootstrap Loaders - Implementation Examples. Unit IV: 12 hours] MACROPROCESSORSBasic Macro Processor functions – Machine Independent Macro Processor Features – Macro Processor Design Options – Implementation Examples. Unit V: 12 hours] SYSTEM SOFTWARE TOOLSDatabase Management Systems – Text Editors – Interactive Debugging systems. TEXT BOOK : Leland L.Beck,” System Software – An introduction to System programming”, Third Edition, Pearson Education Asia,2000 Chapters : 1 – 5. REFERENCE BOOKS :
NEURAL NETWORKS Semester: VI (Optional) Duration: 60 hours] Aim: To know the basic building blocks and applications of artificial neural networks in real life problems Objective:
Unit I: 12 hours] Introduction to Neural networks: Neural processing – Neural networks – an overview – the raise of neuro computing – introduction to artificial neural networks: introduction – artificial neural networks – historical development of neural networks – biological neural networks – comparison between the brain and the computer – artificial and biological neural networks – basic building blocks of artificial neural networks - artificial neural network terminologies. Unit II: 12 hours] Fundamental models of artificial neural networks : McCulloch – Pitts neuron model – Learning rules . Perceptron network: Introduction – single layer percetron – brief introduction to multi layer perceptron networks. Unit III: 12 hours] Feedback networks : Introduction – discrete Hopfield net – continuous Hopfield net – relation between BAM and Hopfield nets. Feed forward networks: introduction – Back propagation networks. Unit IV: 12 hours] Kohonen self-organizing feature maps – counter propagation network: introduction – Full counter propagation network – Forward only counter propagation network. Unit V: 12 hours] Applications of neural networks: Applications of neural networks in Arts – Bioinformatics – Knowledge Extraction – Forecasting – Bankruptcy forecasting – Healthcare – Intrusion – Detection. Text Book: Introduction to Neural Networks using MATLAB 6.0., S N Sivanandam S Sumathi S N Deepa Tata McGraw Hill,2006 Reference Books
PRINCIPLES OF COMPILER DESIGN Semester: VI (Optional) Duration: 60 hours] Aim: To have an understanding of foundation of design of compilers and make the students to design and implement a simple compiler Objective:
Unit I: 12 hours] Introduction to compilers:Compilers and translators – Need of translators – The structure of a compiler – Lexical analysis – Syntax analysis – Intermediate code generation – Optimization – Code generation – Book keeping – Error handling – Compiler writing tools. Lexical Analysis:The role of the lexical analyzer – A Simple approach to the design of lexical analysis – Regular expressions – Finite automata – From regular expressions to finite automata – Minimizing the number of states of a DFA. Unit II: 12 hours] Syntactic Specification of Programming Languages:Context free grammars – Derivations and parse trees – Parsers – Shift-reduce parsing – Operator-precedence parsing – Top-down parsing – Predictive parsers. Automatic Construction of Efficient Parsers:LR parser – Canonical collection of LR(0) items – Constructing SLR parsing tables. Unit III: 12 hours] Syntax-Directed Translation: Syntax-directed translation schemes – Implementation of syntax-directed translators – Intermediate code – Postfix notation – Parse trees and syntax trees – Three address code, quadruples, and triples. Symbol Tables:The contents of a symbol table – Data structures for symbol tables – Representing scope information. Unit IV: 12 hours] Error Detection and Recovery:Errors – Lexical-phase errors – Syntactic-phase errors – Semantic errors. Code Optimization:The principle sources of optimization – Loop optimization – The DAG representation of basic blocks. Unit V: 12 hours] Code Generation:Object programs – Problems in code generation – A simple code generator – Code generation from DAG’s – Peephole optimization. Text Book:Principles of Compiler Design, Alfred V. Aho & Jeffrey D. Ullman, Narosa Publishing House. Reference Book:Compilers-Principles, techniques and tools,Alfred V. Aho, Ravi sethi and Jeffrey D. Ullman, Pearson Publications. CRYPTOGRAPHY AND NETWORK SECURITY Semester: VI (Optional) Duration: 60 hours] Aim: To understand the principles of encryption algorithms, conventional and public key cryptography. Objective:
Unit I: 12 hours] Services, mechanisms and attacks – The OSI security architecture – A model for network security – Symmetric Cipher model – Substitution techniques – Transposition techniques – Simplified DES – Block Cipher principles – the strength of DES – Block Cipher design principles and modes of operation. Unit II: 12 hours] Triple DES – Blow fish – RC5 – Advanced Symmetric Block Ciphers – RC4 Stream Cipher Confidentiality using symmetric encryption - Introduction to Number theory – Public _ key cryptography and RSA. Unit III: 12 hours] Key Management – Diffie Hellman key exchange – Message authentication and hash function – Hash algorithms – Digital signatures and authentication protocols – Digital signature standard. Unit IV: 12 hours] Authentication applications – Pretty good privacy – S/MIME – IP security – Web security considerations – Secure sockets Layer Transport layer security – Secure Electronic transaction. Unit V: 12 hours] Intruders – intrusion detection – password management – Viruses and Related threats – Virus countermeasures – Fire wall design principles – Trusted systems. Textbook: William Stallings, “Cryptography and Network Security Principles and Practices”, Fourth edition, Pearson Education Asia. References:
J2EE Semester: VI (Optional) Duration: 60 hours] Aim: To serve as an introductory course to UG students with an emphasis on the architecture and design aspect of J2EE Objective:
Unit I: 12 hours] J2EE MULTI-TIER ARCHITECTURE Distributive System-The Tier-J2EE Multi-Tier Architecture-Client Tier Implementation-Web Tier Implementation-Enterprise Java Beans Tier Implementation-Enterprise Information System Tier Implementation J2EE BEST PRACTICESJ2EE Best practices- enterprise Application Strategy-The Enterprise Application Strategy-The Enterprise Applications-Clients-Sessions Management-Web Tier and Java Server Pages J2EE DESIGN PATTERNS AND FRAMEWORKSJ2EE Design Patterns and Frameworks-The Pattern Concept-Pattern Catalog-Handle-Forward pattern-Translator Pattern-Distributor Pattern Unit II: 12 hours] JDBC OBJECTS JDBC Objects-The Concept of JDBC –JDBC Driver Types-JDBC Packages-A Brief Overview of the JDBC Process-Database Connection-Associating the JDBC /ODBC Bridge with the Database-Statement Object-Result Set-Transaction Processing-Metadata-Data Types Unit III: 12 hours] XML and XHTML XML and XHTML-HTML-XML-Why Use XML?-The XML Flow-XML Parsers-Browsers and XML-The Design of an XML Document-Nesting Elements-Processing Instructions-Attributes- Create a Document Type Definition (DTD)- Create an XML Schema-Referencing an XML Schema-Crate an XSLT-Planning an XML Database Program –Objectives of an XML Database Types of XML Database Schemas- XHML Unit IV: 12 hours] JAVA SERVLETS:Java Servlets-Java Servlets and Common Gateway Interface Programming –A Simple Java servlet-Anatomy of a Java servlet-Reading Data from a Client-Reading HTTP Request Headers-Sending Data to a Client and Writing the HTTP Response Header-Working with Cookies JAVA SERVER PAGES:Java Server Pages-JSP-JSP Tags-Tomcat-Request String-User Sessions JAVA MAIL API:Java Mail API-Java Mail-Protocols-Exceptions-Send Email Message-Retrieving Email Message-Deleting Email Message-Replying to and Forwarding an Email Message-Forwarding an Email Message sending Attachments-Receiving Attachments- Searching an Email Folder Unit V: 12 hours] ENTERPRISE JAVA BEANSEnterprise Java Beans- -Deployment Descriptors-Message-Driven Bean-The JAR File Text Book: THE COMPLETE REFERENCE J2EE, JIM KEOGH, TMH 2002 EMBEDED SYSTEM Semester: VI (Optional) Duration: 60 hours] Aim: To give sufficient background for undertaking the embedded system Objective:
Unit I: 12 hours] Introduction to embedded system – Examples of Embedded systems –Typical hardware -Gates-Timing diagram-Memory Unit II Advanced hardware fundamentals: 12 hours] Microprocessors Buses-DMA-Interrupts-Built ins on the microprocessor –Conventions used on schematic –Schematic interrupts microprocessor Architecture-Interrupt basics-Shared data problem-Interrupt latency Unit III 8051 Micro controllers : 12 hours] Micro controllers and Embedded processors –Overview of 8051 family- Block diagram –PIN description Unit IV Software Developmen: 12 hours] Round-Robin, Round Robin with interrupts, function-queue-scheduling architecture, Algorithms, introduction to assembler, compiler, cross compilers and IDE, Recursion, Debugging strategies, Simulators Unit V RTOS: 12 hours] Task and Task states, Task and data, Semaphores and shared data.OS services-Message queues-Timer function-Events-Memory management -interrupt routines in RTOS environment- Basic design using RTOS. Text Books
BIO INFORMATICS Semester: VI (Optional) Duration: 60 hours] Aim: To expose the students to the basics of bio information processing and the computational techniques needed for the purpose Objective:
Unit I INTRODUCTION: 12 hours] Life in space and time, Dogmas, data Archives, WWW, Computers, Biological classification, Use of sequences, Protein structures, Clinical implications Unit II GENOME ORGANIZATION : 14 hours] Genomics and proteomics, Eavesdropping on transmission of genetic information, Genomes of prokaryotes, Genomes of Eukaryotes, Human Genome, SNP’s, Genetic diversity, Evolution of Genomes Unit III ARCHIVES AND INFORMATION RETRIEVAL: 8 hours] Introduction-the actives-Gate ways to archives Unit IV ALIGNMENTS AND PHYLOGENETIC TREES: 12 hours] Introduction to sequence alignment, The dotplots, Dotplots and sequence alignments, measure of sequence similarity, computing the alignment, the dynamic programming algorithm, significance of alignments, multiple sequence alignment, applications, Phylogeny, Phylogenetic trees Unit V PROTEIN STRUCTURE AND DRUG DISCOVERY: 12 hours] Protein stability and folding, Application of hydrophobicity, Super position of structures, DALI, Evolution of protein structures, Classification of protein structures, protein structure prediction and modeling, Assignment of protein structures to genomes, prediction of protein function, Drug discovery and development Textbook
Reference
Allied I-Computer Hardware Allied Papers DIGITAL PRINCIPLES AND APPLICATIONS Semester: I (Allied I) Duration: 60 hours] Aim: To provide an in-depth knowledge of the design of digital circuits Objective:
Unit I: Numbers Systems and Discrete Logic : 12 hours] Why Binary– binary to decimal – decimal to binary – octal – hexa decimal – ASCII code – Excess-3 Code – Gray Code – transistor inverter – OR gates – AND gates – Boolean Algebra – NOR gates – NAND gates Unit II Circuit Analysis and Design: 12 hours] Boolean Law and theorems –sum of product method – K-Map truth tables – Pairs, Quads, Octets – K-Map simplifications – Don’t care – product of sum method – product of sum simplificationsb Unit – III Data Processing and Arithmetic circuits : 12 hours] Multiplexers – De-multiplexers – 1-of- 16- Decoders – BCD-to-Decimal Decoders – 7 segment decoders – Encoders – Exclusive-OR gates – parity generators-checkers – Binary Addition – Binary Subtraction – 2’s & 1’s complement representation – Complement Arithmetic – Arithmetic building blocks. Unit – IV Flip-Flops, Clocks and timers : 12 hours] RS flip-flop – D Flip-Flop – JK Flip-Flop – JK Master Slave Flip-Flop – Schmitt Trigger – 555 Timer Astable – 555 Timer Monostable – 555 Timer Schmitt Trigger. Unit – V Shift Registers and Counters: 12 hours] Types of Registers – Serial in serial out – serial in parallel out – parallel in serial out – parallel in parallel out– Ring counter – Ripple Counter – Synchronous Counter – MOD counters – Preset-able counters Text Book
Unit II: Chapters: 2 Unit III: Chapters: 3.1 to 3.8, 5.1 to 5.7 Unit IV: Chapters: 8.1, 8.3,8.6,8.7,8.8, 9.3,9.4 Unit V: Chapters: 10, 11.1,11.3,11.5,11.6 Reference books
MICROPROCESSOR & ASSEMBLY LANGUAGE PROGRAMMING Semester: II (Allied I) Duration: 60 hours] Aim: To have an in depth knowledge of the architecture and programming and 8bit microprocessor and to study how to interface various peripheral devices with them. Objective:
Unit I: 12 hours] MICROPROCESSOR, MICROCOMPUTERS AND ASSEMBLY LANGUAGE:Microprocessors-Microprocessor Instruction Set and Computer Languages-From Large Computers to Single Chip Micro Controllers-Application: MCTS INTRODUCTION TO 8085 ASSEMBLY LANGUAGE PROGRAMMING :The 8085 Programming Model-Instruction Classification - Instruction, Data Format and Storage-How to Write, Assemble and Execute a Simple Program-Overview of the 8085 Instruction Set-Writing and Hand Assembling a Program. Unit II: 12 hours] 8085 MICROPROCESSOR ARCHITECTURE AND MEMORY INTERFACING:The 8085 MPU-Example of an 8085 Based Microcomputer-Memory Interfacing-Interfacing the 8155 Memory Segment-Designing memory for the MCTS Project-Testing and Troubleshooting Memory Interfacing Circuits. INTRODUCTION TO 8085 INSTRUCTIONS:Data transfer operations-Arithmetic Operations-Logic Operations - Branch Operations-Writing Assembly Language Programs-Debugging a Program. Unit III: 12 hours] PROGRAMMING TECHNIQUES WITH ADDITIONAL INSTRUCTIONS :Programming Techniques: Looping, Counting and Indexing- Additional Data Transfer and 16 bit Arithmetic Instructions-Arithmetic Operations Related to Memory-Logic Operations: Rotate, Compare-Dynamic Debugging. COUNTERS AND TIME DELAYS:Counters and Time Delays-Hexadecimal Counter-Modulo ten Counter-Generating Pulse Waveforms-Debugging Counter and Time Delay Programs Unit IV: 12 hours] STACKS AND SUBROUTINES:Stack-Subroutine-Restart, Conditional Call and Return Instruction-Advanced Subroutine Concepts. CODE CONVERSION, BCD ARITHMETIC AND 16 BIT DATA OPERATIONS:BCD to Binary Conversion-Binary to BCD Conversion-BCD to Seven Segment LED Code Conversion-BCD Addition-BCD Subtraction-Multiplication- Subtraction with carry. INTERRUPTS : 8085 Interrupts-Vectored Interrupts-Restart as Software Instruction. Unit V: 12 hours] MICROPROCESSOR APPLICATIONS: Interfacing Scanned Multiplexed Displays and Liquid Crystal Displays-Interfacing a Matrix Keyboard-Memory Design-MPU design-Designing a System: Single Board Microcomputer-Software Design-Development and Trouble- Shooting Tools. Introduction to 8085 Assemblers and Simulators. TEXT BOOK :RAMESH GAONKAR, “MICROPROCESSOR ARCHITECTURE, PROGRAMMING AND APPLICATIONS WITH THE 8085”, 5TH edition, Penram International Publishing Private Limited. CHAPTERS 1,2,4,6,7,8,9,10,12,17, Appendix H. REFRENCE BOOK:N.K.SRINATH, “MICROPROCESSOR PROGRAMMING AND INTERFACING.”, PRENTICE HALL OF INDIA PUBLICATION. COMPUTER ARCHITECTURE Semester: III (Allied I) Duration: 60 hours] Aim: To describe the basic structure of digital computer and to study the detail organization of control unit, Arithmetic unit, Memory unit and Input –output unit. Objective:
Unit I: Basic Computer Organization: 12 hours] Instruction Codes – Computer Registers – Computer Instructions – Timing and Control – Instruction Cycle – Control Memory – Address Sequencing Unit II CPU: 12 hours] General Register Organization – Stack Organization – Instruction Formats – Addressing Modes – Program control Unit III Computer Arithmetic: 12 hours] Hardware Implementation and Algorithm for Addition, Subtraction, Multiplication, Division – Booth Multiplication Algorithm – Floating Point Arithmetic Unit IV I/O and Memory Organization: 12 hours] I/O Interface – Asynchronous Data Transfer – Modes of I/O Transfer – Priority Interrupt – Direct Memory Access - Memory Hierarchy – Main Memory – Auxiliary Memory – Associative Memory – Cache Memory – Virtual Memory Unit V Advanced Processing: 12 hours] RISC, CISC Characteristics - Parallel Processing – Pipe Lining – vector processing – array processors – Multi processors – Interconnections structures Text Book:- M. Morris Mano, “Computer System Architecture”, Third Edition, Reprint 2003 Pearson Education. Unit I Chapters: 5.1 to 5.5, 7.1 to 7.2 Unit II Chapters: 8.1 to 8.5, 8.7 Unit III Chapters: 10.1 to 10.5 Unit IV Chapters: 11.2 to 11.6, 12.1 to 12.6 Unit V Chapters: 8.8, 9.1, 9.2, 9.6, 9.7, 13.1, and 13.2 PC TROUBLE SHOOTING Semester: IV (Allied I) Duration: 60 hours] Aim: To have an in depth knowledge of the assembling a personal computer and to know the method of identifying the errors in the PC Objective:
Unit I: 12 hours] PC HARDWARE OVERVIEW Introduction – Hardware BIOS – DOS Interaction – The PC Family – PC Hardware – Product Engineering – Inter connections between Boxes – Inside the System Box – Mother board Logic – Memory Space – I/O Port Addresses – Wait state – Interrupts – I/O Data Transfer - DMA Channel – Peripheral Interfaces and controllers – Keyboard interface –Parallel Interface-Serial Interface – CRT Display controller – FDC – HDC – Memory Refresh – Post sequence – Overview of advanced PCs. Unit II: 12 hours] MICROPROCESSORS IN PCIntel 8086 Vs 8088 – Intel’s new Generation Microprocessors – Intel 80286 – Intel 80386 – Intel 80386 SX Microprocessor – Math Coprocessors 80287 and 80387 – Intel 80486 – Pentium Microprocessors – Pentium – Pentium MMX Technology – Pentium Pro – Pentium II – Pentium II Xeon – Pentium III – Pentium III Xeon – Celeron Processors – Pentium 4 – Itanium processor – Processor packing styles. SUPPORT CHIPS IN THE MOTHER BOARD :Introduction – Dumb and smart chips – clock generator – Bus controller – Interrupt Controller 8259A – Programmable Interval Timer – 8255A – 5 Programmable Peripheral Interface - DMA controller 8237A_5 – Support chips for advanced Microprocessors. Unit III: 12 hours] INSTALLATION AND PREVENTIVE MAINTENANCE Introduction – System configuration – Pre_Installation Planning – Installation Practice – Routine checks - PC Assembling and Integration – BIOS setup – Engineering versions and compatibility – Preventive maintenance – Disk operating system – Virus – Data Recovery. Unit IV: 12 hours] TROUBLESHOOTING Introduction – Compiler Faults – Nature of Faults – Types of Faults – Diagnostic Programs and Tools – Microprocessor and Firmware – Programmable LSIs – Bus Faults – Faults Elimination Process – Systematic Troubleshooting – Symptoms observation – Symptoms Analysis – Fault Diagnosis – Fault rectification-Trouble shooting levels-Post-PC Diagnostic Software-Layman Checks-I/O Slot Checks-Motherboard problems Diagnosis-Printer Interface Problems (Parallel Port)-Serial Port Problems. Unit V: 12 hours] TROUBLESHOOTING:FDC problems-HDC problems-Display Adapter problems-Dot Matrix Printer Problems-CRT Monitor Problems-Floppy Disk Drive Problems-Hard Disk Drive Problems-CD-ROM Drive Problems-Reliability Problems-Circuit Tips-IC Faults-Handling Procedures-Problem Diagnosis: Case Studies-8088 PC-Virus Attacks. TEXT BOOK: R.GOVINDARAJULU, ”IBM PC AND CLONES HARDWARE, TROUBLESHOOTING AND MAINTENANCE” , Tata McGraw Hill Publications, Second Edition. CHAPTERS: 3,5,6,13,14 REFERENCE BOOKS:
Allied II-Computer Applications COMPUTER ORIENTED NUMERICAL METHODS Aim: To have an in depth knowledge of the Computer oriented mathematical method of problem solving Semester: I (Allied II) Duration: 60 hours] Objective:
Unit I: 12 hours] The solution of numerical algebraic and transcendental equations: Bisection method – Method of Successive Approximations or the iteration method – Regula Falsi method – Newton Raphson method. Unit II: 12 hours] Simultaneous Linear Algebraic Equations: Gauss Elimination method - Gauss Jordan Elimination method – Gauss Jacobi method – Gauss Seidel method. Unit III: 12 hours] Interpolation: Gregory Newton Forward and Backward Interpolation formula.Interpolation with Unequal Intervals: Divided differences – Lagrange’s Interpolation formula –Inverse Interpolation. Unit IV: 12 hours] Numerical Differentiation and Integration: Newton’s Forward and Backward Difference formulae to compute the derivatives – Trapezoidal rule – Simpson’s 1/3 rule. Unit V: 12 hours] Numerical Solution of Ordinary Differential Equations: Taylor series method – Euler’s method – Runge-Kutta methods – Milne’s predictor-corrector method. Text Book: “Numerical Methods in Science and engineering”, Dr. M.K.Venkataraman , Fifth Edition, The National Publishing Company. Reference Books:
DISCRETE MATHEMATICS Semester: II (Allied II) Duration: 60 hours] Aim: To develop the skills of the students in the areas of Mathematical logic, set theory and Graphs Objective:
Unit I: 12 hours] Set theory: Basic concepts of set theory – Inclusion and Equality of sets – power set – Some operations on sets – Cartesian products – Relations – Equivalence relations Unit II: 12 hours] Functions: Definition – Examples – One-one and onto functions – Bijective functions – Identity functions – Composition of functions – Inverse functions. Unit III: 12 hours] Mathematical logic: Connectives – Negation – conjunction – Disjunction – Truth tables – Conditional and Biconditional statements. Unit IV: 12 hours] Graph: Definition – Examples – Subgraphs – finite and infinite graph – Degree of a vertex – Isolated and pendent vertices – Types of Graphs – Examples Unit V: 12 hours] Paths and Circuits: Walk, path and circuits – Connected and disconnected graphs – Euler graphs – Operations on graphs – Trees, properties of trees –Rooted and Binary trees Reference Books
DATA STRUCTURES Semester: III (Allied II) Duration: 60 hours]` Aim: To serve as an introductory course for UG students to know the basic data structures and algorithms Objective:
Unit I: 12 hours] INTRODUCTION - Pseudocode-The Abstract Data Type-A Model for an Abstract DataType-Algorithms Efficiency SEARCHING -List Searches-Hashed List Searches-Collision Resolution (Projects for self study) Unit II: 12 hours] LINKED LISTS - Linear List Concepts – Linked List Concepts-Linked List Algorithms-Processing a Linked List-complex Linked List Structures – (Projects for Self study) Unit III: 12 hours] STACKS AND QUEUES -Basic Stacks operations-Stack Linked List Implementation – Stack Applications-Queue operations-Queue Linked List Design (Projects for self study) Unit IV: 12 hours] TREES -Basic Tree Concepts-Binary Trees- Binary Tree Traversals-Expression Trees-General Trees-Binary Search Trees-Heap Definition-Heap Structure – Basic Heap Algorithms. –Heap Data Structures – Heap Algorithms (Projects for self study) Unit V: 12 hours] GRAPHS -Terminology-Operations-Graph storage Structure-Graph Algorithms-Networks (Projects for self study) SORTING-Quick sort –merge sort – (Projects for self study) Text Book
RESOURCE MANAGEMENT TECHNIQUES Semester: IV (Allied II) Duration: 60 hours]` Aim: To develop the skills of the students in the areas of LPP, Game theory, Queuing theory and project scheduling Objective:
Unit I: 12 hours] Linear Programming: The Simplex method of solving a L.P.P – The Simplex Procedure- Restricted variables. Game Theory: Definitions – Maximum and Minimax Principle – Mixed strategies – Dominance property – Graphical method for m * 2 games. Unit II: 12 hours] Replacement Problem: Replacement of items that Determine with time – Replacement age of a machine taking money value into - replacement of items that fall completely-mortality and staffing attributes. Unit III: 12 hours] Inventory Models: Necessity for maintaining Inventory variables in an inventory problem – Various Costs in inventory problem – Other variable involved – EOQ with uniform rate of demand and infinite rate of production – Finite rate of production (no storage) – EOQ with uniform rate of demand and infinite rate of production – Finite rate of production (storage allowed) – Models with probabilistic demand – Newspaper boy problem – Buffer stock or safety stock. Unit IV: 12 hours] Project Scheduling: Terms used in network – Network constructions – Numbering the events – CPM calculations – Floats determinations – Stack and float compared – PERT Computations – CPM and PERT compared – applications of network techniques. Unit V: 12 hours] Queuing Theory: Characteristics of queuing models – Basic queuing process – Customer’s behaviors in the queue – Postulate for the Poisson process – Distribution of arrival time – Symbols and notations – Classification of queuing models – Solutions of queuing models – Basic characteristic of model 1. Text Book:P.K.Gupta, “OPERATIONS RESEARCH”, S.Chand & Company Ltd. Reference Books: OPERATIONS RESEARCH , TAHA OPERATIONS RESEARCH , R.PANEER SELVAM, Prentice Hall of India ALLIED SUBJECTS FOR STUDENTS OTHER THAN B.SC (CS), B.SC (SE), B.Sc(IT) & BCA Allied -Computer science
Semester: I (Allied ) Duration: 60 hours]` INTRODUCTION TO COMPUTER SCIENCE Aim: To serve as an introductory course for UG students to gain fundamental knowledge of computers Objective:
Unit I: 6 hours] Introduction –Characteristics-Evoluation-Generation-Classification-Applications Unit II: 14 hours] Compute Architecture: Introduction – CPU – Memory - Primary memory - Secondary memory Unit III: 14hours] Input Devices-Output devices-Algorithm-Flowchart- Pcode - Testing, Debugging and documenting Unit IV: 14 hours] Computer languages –Computer Software –Operating system –Data base fundamentals Unit V: 12 hours] Data communication and computer network –Internet basics Textbook: Introduction to computer science, ITL Education Solutions limited, Pearson education Chapters: 1,3,4,5,6,7,8,9,10,11,13,12,14 OFFICE AUTOMATION Semester: II (Allied ) Duration: 60 hours]` Aim: The aim of this paper to gain fundamental knowledge of Office automation package Objective:
Unit I: 10 hours] Introduction to office 2000-Opening and closing office programs- Microsoft office shortcut bar –Using tool bars-Customizing office applications-Files and folders-Configuring printers-Installation programs-System tools Unit II: 12hours] Features of MSWORD 2000-Components of word window-Creating a document- Saving and protecting the documents- opening an existing file-printing and previewing document-Switch between multiple documents-Quitng word-Editing text using cut, copy and paste-Finding and replacing a text-Styles, fonts, and font sizes-creating lists and numbering headings Unit III: 12 hours] Creating headers and footers-Inserting page breaks-Setting auto text spelling check and grammar tools-Working with columns-Inserting page numbers, Book marks, Symbols and Dates-Working with text box and frames –Working with pictures-Working with objects –Inserting comments-Working with tables-Working with mail merge-Master document –Merging envelops and labels Unit IV: 12 hours] Introduction to electronic spreadsheets –Excel 2000 basics –Creating and saving a work book –Entering data into the worksheet (Manual and automatic) –Basic formatting Unit V: 12 hours] Advanced formatting –Formulas and Macros-Excel functions-Charts How to present an information using power point Textbook:Office 2000: the complete reference, Stephen L.Nelson, TMH Reference book Fundamentals of computing C programming and MS office, Alexis Leon, Mathews Leon,Chitra,Jeyaraj, Vijay Nicole Private Limited PROGRAMMING IN C ` Semester: III (Allied ) Duration: 60 hours]` Aim: The aim of this paper to know the concept of procedure oriented programming and discusses the important features of C Objective:
Unit I: 12 hours] C language – Elementary Programming: Declarations – Assignments and Variable – Integers Arithmetic Expressions – More data types – Relational and logical Operators – if and if-else Statements – Switch Statement – while and do-while statements. Unit II: 12 hours] For loop – escape sequences and control characters – conversion specifications – user defined functions – local & global variables – parameters – Boolean functions. Unit III: 12 hours] Arrays – strings and character arrays – break and continue – conditional expression – multidimensional arrays – Pointers and direction pointers – Address operator – Array and pointers. Unit IV: 12 hours] Strings and string functions – static and auto classes –strcpy, strlen, malloc, sizeof, strcmp. Structures: concepts – initialization – tag – pointers to structures – period and arrow operators. Unit V: 12 hours] Standard input and output – putchar, getchar, - header files – getc, putc, file input and output – C pre-processor. Text Book:“Programming in ANSI C”, Edition 2.1, E. Balagurusamy, Tata McGraw Hill Publishing Company, 2002. Reference bookProgramming with ANSI and Turbo C- Ashok N. Kamthane, Pearson education. INTERNET AND WEB DESIGN Semester: III (Allied ) Duration: 60 hours]` Aim: To explain the Internet programming concept and related programming language Objective:
Unit I: 12 hours] Introduction to Internet: Computers in business –Network- Internet- Electronic mail- Resource sharing –Gopher-WWW-Usenet-Telnet-Bulletin services-Wide Area information service Internet browsers: Internet Explorer –Netscape Navigator Unit II: 12 hours] Introduction to HTML: Designing a Home page – History of HTML – HTML generations- HTML Documents-Anchor tag –Hyper links –Sample HTML documents Head and Body section: Header Section –Title-Prologue-Links-Colorful web page –Comments lines Designing the body: Heading printing –Aligning the headings-Horizontal rule-paragraph-Tab settings-Image and pictures-Embedding PNG format Images Unit III: 14 hours] Ordered and unordered lists: List-Unordered lists- headings in a list –ordered lists- Nested lists Table handling: Tables- table creation in HTML- Width of the Tables and cells-Cells spanning multiple rows/Columns- Coloring cells –Column specification Unit IV: 14 hours] DHTML and Style sheets: Defining styles –Elements of styles-Linking a style sheet to an HTML document –Inline styles –Internal & External style sheets –Multiple styles Frames: Frameset -Definition – Frame definition –Nested Framesets Unit V: 8 hours] Forms: Action attributes –Method attributes –Enctype attribute –Drop down list Textbooks:
 |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
