CS-103 -Advanced Database Management Concepts
Objectives of the course (Total hours 48)
1. Understanding Database management issues such as concurency, security
etc.
2. Understanding issues related to distributed databases
3. Getting acquainted with Data Warehousing and Data Mining Concepts
Prerequisites
1. Database Fundamentals
Topics
1. Introduction
Review of Database Concepts, File Organization co neepts, Normalization.
2. Physical Database Design and Tuning
Index Selection, Overview of Database Tuning,
Choices in Tuning the conceptual schema, Choices in Tuning Queries and vienvs,
DBMS Benchmarking.
3. Concurrency Control
Transactions and schedules,
Serialisability, Lock based codeurrency control, Lock Management, Specialized
locking Techniques, Coricurrency control without locking.
4. Crash Recovery
Introduction to crash recovery, Log, CheckpointinL, Recovery from a system
crash.
5. Parallel and distributed databases
Architectures for parallel
databases, Parallel query Evaluation and optimization, Parallelizing individual
operations, Introduction to distributed databases, Architecture,.Fragmentation
and Replication, Calalog management, Distributed. Query processing, Updating
distributed data, Distributed transaction management, Distributed Concurcency
control, Distributed recovery.
6. Object database systems
Objects, Identity, inheritance, Database Design for an ORDBMS, Storage and access
methods, Query processing and optimization, Comparing RDBMS with OODBMS and
ORDBMS.
7. Data -Warehousing
8. Data Mining.
Books
1.Database Management Systems - Raghu Ramkrishnan McGraw-Hill International
editions
2. Introductions to Database Systems-C. G. Date
Projects
1. Implementing Concurrency control / Recovery protocols
2. Object-Relational Database
CS-105 General Laboratory Projects
Write a your own C++ classes to wrap ODBC functionality.
Write a DLL containing all date manipulation functions Provide a table name,
columns to select from the table and a where clause to a program.
The program should select rows matching only the where clatise and show it in a
tabular form.
Calculator Program
Program to Program Communication using DDE
CS-201 Design & Analysis of Algorithms
1. Understanding Different Algorithm design techniques
2. Understanding use of data structures in improving efficiency of algorithms.
3. Comparative study of different algorithms
Prerequisites
1. Data Structures
Topics
1. Algorithms and their Complexity Definition Notation.
2. Divide and Conquer
Linear/Binary Search , sorting,method, strassen's matrix multiplication method.
3. Greedy method
Knapsack problerh , Job scheduling with Deadlines, Spanning trees, Prim and Kruskal's algorithms.
4. Dynamic Programming
Shortest path algorithm, Travelling Salesman Problem.
5. Backtracking
8-Queen's problem, Graph colouring problem, Hamilton Cycles.
6. Graph Algorithms
Depth first Search, Breadth first search, Strongly Connected, Cut-set algorithms.
7. Network flow algorithms
Max Flow, Min cut Algorithms, Sink- source.
8. Branch and Bound
Knapsack problem, Travelling Salesman problem.
9. Complexity Theory
The classes P and NP, The NP-Complete,class, Non- Deterministic Algorithms, Cook's Theorem, NP-Hard Problems.
Books
1. Fundamentals of Computer Algorithms-Horowitz and Sahni
CS-203 Information System for Decision Making
Topics
1. System Concepts
General Model, Types of systems, subsystems.
2. Information Concepts
Definition, Quality of information, Value if information, Information needs of managers at different levels.
3. Management Information Systems
Definition, Integrated system, MIS vs Data Processing, MIS and other academic disciplines, structure Of MIS based on management activity and functions, System concepts to MIS.
4. Planning and control processes
Control on systems, Feedback control, Law of requisite variety, Management control through reporting.
5. Humans as information processors
Newell-Simon model, Limits on 14urnan Information .Processing, Characteristics of Human Information Processing performance.
6. Information systems for functional areas
Information for financial, marketing, inventory control, I functions production and personnel
7. MIS design approaches
Prototyping; Life-cycle approach, Project management, Case-studies. S. Management support systems - Overview Decision making phases, Concepts of decision making, Decision Support Systems, Differences between MIS and DSS.
8. Decision making systems and modeling
Modeling process, Information need3ed for different phases and decision-making, Sensitivity analysis, Static and dynamic models, Simulation, Operations Research Techniques, HeuristAc programming, case studies.
9. Executive Information and Support Systems
Needs, Characteristics, Software and Hardware, Integrated EIS and DSS, EIS implementation.
Books
1. Management Information Systems--Gordan Devis, Margrethe H. Oison.
2. Information Systems for modern management (Ch-6)-- Robert Murdick, Joel E.Ross
3. Decision Support & Expert Systems (Ch- 1,2,3,4,8,10)- Efrairn Turban
CS-302 : Client Server And Component Based Architectures
Objectives of the course ( Total hours 45)
1. Understanding of N-tier client server architecture
2. Understanding of component based architectures COM/DCOM and CORBA
3. Internet Programming
Prerequisites
1. C++ Language or JAVA-Intermediate Level
2. Windows Programming - I and II
Topics
1. Introduction to Client Server Architecture (2)
Definition of 2 and 3 tier architectures, Fat and thin clients, Advantages and disadvantages of 2-tier architectures, Why N-tier architecture?, Middle tier messaging methods: Conversations, Request-response, Queues, Publish-and-subscribe, Broadcasts and datagrams
2. TCP/IP (3)
Introduction, Stream and Datagram sockets, TCP/IP server calls, TCP/IP client calls, Polling using select call.
3. Transaction Processing Monitor (1)
Definition of a TP Monitor. ACID properties, Load balancing, Distributes transactions and two-phase commit protocol.
4 Introduction to CORBA (2)
Why CORBA, Structure of Object Request Broker (ORB) and Object Request Interfaces Definition of Dynamic Invocation Interface (DII), Interface and Implementation Repositories, Object Adapters.
5. Implementation Structures (2)
ORB Implementations: Client Resident, Server based, Library based, System based, Client Structure and Object Implementation Structure, Object Adapter Structure: Portable Object Adapter ( POA ) and Basic Object Adapter (BOA), Integration of Foreign Object Systems.
6. Interface Definitkon Language (IDL) (3)
What is IDL ?, IDL syntax for Module and Interface Declarations, Interface Inheritance, Basic Types such as integer, char, string, short, long, array, boolean, do-vble, Exception, Operation and Parameter declarations, Names and Scoping, Differences from C++ , Standard Exceptions Definitions.
7. ORB Interface (3)
Introduction, Conversion of Object to Strings and vice versa, Object Reference Operations, ORB Initialization, Initial -Object References, Current and Policy Objects, Thread Related Operations.
8. Dynamic Invocation Interface(DII) (4)
Introduction, Common Data Structures, Request Operation, List Operations, Context Objects and Operations, Native Data Manipulations.
9. Interface Repository (TR) (3)
Scope of an TR, Managing IR, IR: Names and Identifiers, Types and Type Codes, Interface Objects and Navigation, TR Interfaces, Repository IDS.
10. Portable Object Adapter ( POA ) (3)
Introduction, POA model description, POA Interfaces, POA Usage Scenarios.
11. Interoperability (3)
Introduction, Definitions of General Inter-ORB Protocol (GIOP) and Internet Inter-ORB Protocol (IIOP), ORBs and ORB Services, Domains, Object Addressing, Information model for Object references.
12. COM/DCOM
Evolution of COM (1), Problems with simple DLL, Separation of Interface and Implementation
13. Interfaces (3)
IDL syntax, unknown Interface, Definitions of GUID, CLSID, Data types boolean, byte, short, long, double, char, VARIANT, BSTR, Interface Pointer, Attributes and Properties, Exceptions.
14. Classes (3)
Activation, Classes and Servers, I class Factory Interface, Monikers and Compositions, Component Categories.
15. Objects (3)
Symmetric, Transitive and Reflexive properties of Query Interface, Dynamic and Binary Composition, Containment.
16. Apartments (3)
Introduction, Cros-s-Apartment access, Standard Marshaling Architecture, Lifecycle management.
17. Applications
Service Control Manager ( SCM ), Activation by SCM, Server Lifetime, COM and Security.
Books
1. 3-tier client/server at work Jerry Edwards with Deborah DeVoe John Wiley and Sons, Inc, 1997
2. The Common Object Request Broker Architecture and Specification Revision 2.2 Feb 1998
Publisher: Object Management Group The book can be freely downloaded from HYPERLINK http://www.omg.org
3. Essential COM-Don Box Addison Wesley, April, 1998
Projects
1.Write a TCP/IP based talk server. Also write a TCP/ IP client to send messages addressed to some other client via the TCP/IP server.
2. COM based Database administration using ODBC. The program can show all tables in a data source. All colunms, data type and length can be shown of chosen table. Allow for data upload or download from the chosen table.
3.CORBA based Library system.
CSD12 - Computer Simulation Techniques Topics
( Group I )
1. Introduction
Digital filter, Frequency domain, Description of signals and systems, Some typical applications of digital filters.
2. Discrete time signals and systems
Discrete time signals-sequences, Linear shift-invariant systems, Stability and casuality, Linear constant coefficient difference equation, frequency 'domain representation, discrete time systems and signals, symmetric pro erties of Fourier transforms, sampling . p of continuous time signals, introduction to z-transforms.
3. Discrete Founier Transform
Definition, computing discrete transform from discrete time sequence, properties of DFTS, performing linear convolution with DFfs, Goetzel algorithms, decimation in time FFT algorithm, derivation of FFT algorithm, decimation in frequency FFT algorithm, general computational consideration in FFT algorithm.
Books
1. Digital Signal Processing-Alan Oppenheim, Ronald Schafer.
2. Introduction to Digital Signal Processing-Roman Kue.
3. Digital Signal Processing-Andrew Batman, Warren Yates.
CSD13 - Computer Simulation Techniques
( Group I )
Topics
1. Introduction to Simulation
Elements of Simulation, Uses and purposes, Pitfalls of Si ulation, Classification of models, Simulation
2. Simulation Examples
Stochastic systems, Dynamic Continuous Systems, Dynamic systems
3. Systems Description
System description, Open and closed systems, Open loop and feedback systems, Dynamic & Static systems, Linear and non-linear systems, Casual loop diagrams.
4. The Monto Carlo method and Simulation
5. Discrete Event Simulation
6. Discrete Systems and Markov Process
7. Parameter Estimates
8. Computer Simulation Methodology
9. Verification and validation
Book
1. Compute Simulation of Dynamic Systems-Marice F. Aburdene.
CSD21- Advanced Architecture
( Group II )
Objectives of the course (Total hours. 45)
1. Study of Parallel Architectures.
2. Prerequisites
3. Computer Organization
Topics
1. Introduction to Parallel Processing
Parallelism in uniprocessor systems, Parallel computer structures, Architectural Classification, Application of Parallel processing.
2. Vector processors
Vector processors and principles of pipelining, Principles of linear pipelining, Classification of pipeline processors, General pipeline of reservation table, Interleaved memory Organization, Design aspect of Arithmetic and Instruction pipelines, Instruction pretech and branch control strategies, Data buffering and busing structures, Characteristic of vector processing, Study of CRAY Architecture as an example.
3. Array Processors
SIMD computer Organization, Masking and Data network mechanisms, Inter PE communication Static vs Dynamic networks, Niesh connected illiac network, Cube Interconnection network, Study of Illia- TV system architecture, Massively parallel processors, Performance enhancement methods for SIMD Computers.
4. Parallel Algorithms for Array Processor
SIMD Matrix multiplication, Parallel sorting on array processors, Parallel FORTRAN OCCAM features, Multiprocessor Architecture, Loosely coupled multiprocessor, Tightly coupled multiprocessor, Processor characteristics for multiprocessors, Interconnection network, Time shared common bus, Cross-bar switch and multipart memories, Study of CRAY-XMP and Req. of OS for MP CMMP architectures.
5. Parallel Algorithms for Multiprocessors
Classification of parallel algorithms, Synchronized parallel algorithms, Asynchronized parallel algorithms, Performance of parallel algorithms.
6. Dataflow Architecture
Dataflow Concept, Dataflow program graph, Dataflow operators, Dataflow languages and Data Structures Static dataflow computers, Advantages and potential problems, Systolic array architecture, Study of Manchester data flow machine.
Books
1. Computer Architecture and parallel processing - Kai Hwang and Brigs
2. Computer Architecture - a modern synthesis- S. Dasgupta
|
|
CS-104 Event-Driven Programming (Windows)
Objectives of the course ( Total hours 48
)
1. Understanding of event driven programming model
2. Familiarization with basic Graphical User Interface elements such as Menus, Dialog boxes, Buttons, List boxes etc.
3. Understanding of Open Database Connectivity(ODBC)
4. Hands-on training on Windows Application Interface (APT)
Prerequisites
1. 'C' Language - Intermediate Level
Topics
1. Fundamentals of Graphical User Interface (2)
Difference between Character User Interface and Graphical User Interface, Event/Message driven architecture, Definition of a window, Window c1ass registration, creation, destruction, Window procedure for message processing Types of messages such as WM-PAINT, WM-SIZE, WM-VS.CROLL,
WM-HSCROLL
2. Graphics Device Interface ( GDI ) (4)
GDI Basics, GDI types of function and primitives, Device Context and device context information, Drawing shapes and curves, Mapping Mode, Device and Logical Coordinates,
viewport and window Bitmap fonnat and handling, Meta file handling, Text and Fonts.
3. Input Device Handling (3)
Input focus concept, Keyboard handling and different keyboard messages, Caret Functions Mouse Handling: Client area and non-client area -mouse messages, Capturing the mouse.
4. Child Window Controls (4)
Parent window and child window communication, Push
button,. Check box, Radio Button, Group Box; Edit box, Scroll Bar, List Box,
Enabling and disabling controls, Setting colors of controls, Icons, cursors and
Message box.
5. Menus and Accelerators (4)
Menus and messages, Loading menu from resource file, System menu, Keyboard accelerators for menus Enabling and Disabling menu items.
6. Dialog Box (4)
Modal and Modeless dialogs, Dialog box templates, Adding window controls to dialog box OK and Cancel
buttons, Tab stops and groups.
7. Common Controls (4)
Tool bar, Tool tips and status bar, Property Sheets, Tree view control.
8. Memory Management (2)
Movable memory, Virtual Memory, File I/O functions, Memory mapped I/O.
9. Multithreading (3)
Multithreading Concepts, Thread Synchronization,
Critical section, Event Signaling, event object, Thread local storage, Race
condition and deadlock.
10. Printer Handling (3)
Printer Spooling & Print functions, Printer Device Context, Printer Properties Call, Printing
Graphics and Text, Canceling Printing, Handling error codes
11. Clipboard (3)
Clipboard Data Formats, Transferring/getting text to/from clipboard,
Opening/Closing clipboard, Using clipboard with bitmaps, Adding multiple data
items to clipboard, Private data formats, Clipboard viewer functions and
messages.
12. Dynamic Data Exchange.(DDE) (4)
DDE conversations and messages, DDE server messages , DDE client messages, DDE Management Library
13. Multiple Document , Interface ( MDI ) (3)
MDI Basics, Frame Window
Messages, Child Document Windows.
14. Dynamic Link Libraries ( DLL) (2)
Advantages of DLL, Exporting functions from DLL, Library entry/exit points.
15. Open Database Connectivity (ODBC) (3)
Why ODBC?, ODBC Standard, ODBC elements-. Environment, Connection and Statement, ODBC Administration, SQL statement processing in ODBC, Getting Information from a data source(Metadata):
All tables, All columns of a table, Type and size of a column etc..
Books
1. Programming Windows 95
2. Charles Petzold
3. Microsoft Press 1996
4. Microsoft ODBC 2.0 Programmer's Reference and SDK Guide
5. Microsoft Professional Edition
6. Microsoft Press
CS-202 Operating System Concepts (UNIX)
Topics
1. Introduction to Unix
Evolution of UNIX: past, present and future, Philosophy of Unix: System's internal structure, the process interface, OS features, OS system concepts: File systems, processes.
2. Implementation of buffer cache
Structure and philosophy of the cache implementation. Algorithm used by the buffer cache
3. File System
The file system switches table, VFS architecture, File systems implementation on disk, File system handling kernel algorithms, Issues for the system handling, System calls for file systems manipulations.
4. Process
State transitions, Process structure and layout, Multiprocessing details-context, context switches, memory management concepts, System Calls.
5. Process Scheduler
Class specific implementation, Priorities, system calls.
6. Memory Management Techniques
Swapping, Demand paging, Hybrid, Virtual memory. Time and Clock
7. I/O Subsystems
Concepts, data structures, device drivers, streams.
8. Inter process communication
Pipes, Signals, Semaphores , Shared Memory.
Books
1. Design of UNIX system--Bach.
2. Operating System-Bawn.
CS-301 Software Project Management
Topics
1. Planning of Software Project
Introduction, Defining the problem, Developing solution strategy, Planning the development pyocess (Phased lifecycle model, Milestones, Documents etc.), Planning Organizational stmeture, Programming Team structure, Planning for configuration management & Independent verification , Planning phase dependent tools and techniques.
2. Project Management
Characteristics of project management, Selection of a project manager, Team stmctum, Team size Project plan and review, Project management Tool, Rules for project management.
3. Software Cost Estimation
Introduction, Software Cost factors, Software Cost Estimation techniques, Staffing Level Estimation, Estimating Software Maintenance Cost, Feedback Control & Feedback stages at various levels
4. Risk analysis and Reduction
Risk Analysis And Reduction,Software project scheduling, Software Acquisition, Organizational planning.
5. Matrices for software Quality and Productivity
Measuring software, ArgumeDis for software matrices Matrices for software quality, Matrices for software productivity, Software quality assurance & factors
6. Software design Techniques
Fundamental Design Concepts, Modules & Modulari- zation Criteria, Design Techniques, Real Time & Distributed System Design, Test plans, Design guidelines.
7. Software Implementation
Introduction, Structured coding Techniques, Single entry single exit Constructs, Efficiency considerations, Data encapsulation, Recursion, Coding styles, Documentation guidelines, Supporting guidelines, International documentation.
8. Verification and Validation techniques
Introduction, Quality Assurance, Static Analysis, Sym- bolic execution, System Testing techniques & strategies.
9. Evaluation and Maintenance
Evaluation of processing, Why do system need maintenance?, setting maintenance priorities, Maintenance 'Management, Managerial aspects of software maintenance, Configuration management, Maintenance Tools and techniques.
Books
1.Software Engineering-R. S. Pressman
2.Software Project Management-Edwin Bennatan
CS-303 Advanced
Networking
Topics
1. Local Area Network (LAN)
IEEE standards 800.2, 900.3, 800.4 800.5, CSMA/ CD, Hubs, Bridges , routers, fiber Optic Networks.
2. Wide Area Network (WAN)
X-25, Message switching, Packet switching protocols, Gateways( X.75)
3. Transport Layer
TCP/IP protocol
4. Session Layer protocols
RPC's (Remote procedure calls)
5. Presentation Layer
Network security & privacy
6. Application Layer
WEB Browsers
7. ATM
Satellite Networking V-SAT, Cellular phones, Mobile Networking.
8. Network Management
SNMP, Network selection, Installation, Maintenance, Modem/ Intemetworking
9. WEB
Directory services, Web Server, Firewalls, FFP.
References
1. Local Area Networking-Stalling
2. Computer Networks-Tanenbaum
CSD11- Windows Programming Using Class Libraries
( Group I )
Objectives of the course ( Total hours 45 )
1. Understanding Microsoft Foundation Classes (MFC)
2. Basic understanding of Active X and COM
3. Hands-on training on Microsoft Foundation Classes (MFC)
Prerequisites
1. C++ Language - Intermediate Level
2. Windows Programming - I
Topics
1.Introduction to MFC (5)
MFC Class hierarchy, CwinApp, CWnd, CMainFrame classes, Handling Windows messages in MFC , Document/View Architecture: CDocum'ent and Cview, C++ Template classes review, Basic MFC classes: CString, CPoint, CSize, CRect, CArray and Clist.
2. Graphics Device Interface ( GDI ) (3)
CClientDC, CWindowDC and CPaintDC classes, Stock GDI Objects, Colors and Fonts,Draning shapes and curves, CBitmap, CBrush, CFont, CPalette, CPen, CRgn Classes.
3 . Dialog Box (3)
CDialog, CEdit, CButton, ClistBox, CComboBox classes , Data exchange tolfrom variables and controls OK and Cancel buttons, Tab stops and groups, Modeless dialogs.
4. Windows Controls and Dialogs (7)
Cprogressttri, CsliderCtrl, CspinButtonCtrl, ClistCtrl, CtreeCtrl classes
CfileDialog, CcolorDialog, CfontDialog, CprintDialog classes
Tool, bar, Tool tips and status bar: CtoolBar, CcontrolBar, CstatusBar
Property Sheets: CpropertyPage class
MFC Text Editing: CeditView, CrichEditView, CrichEditCtri
Date time picker, Month calendar, IP Address control, extended combo box controls
Exception Handling: Cexception
5. Menus and Accelerators (2)
Command Processing
Cmenu, CcmdUl classes
Floating Pop-Up Menus
Keyboard accelerators for menus
Enabling and Disabling menu items
6. Multithreading (3)
Multithreading Concepts : CwinThread Thread Synchronization, Critical section: CeriticalSection, Cmutex, Csemaphore Event Signaling, event object: Cevent
7. Advanced Document Handling (6)
ClistView, CtreeView, CforrnView and CrecordView Document templates: CdocTemplate, CsingleDoc Template and CmultiDocTemplate
CframeWnd, CMDIFrameWnd, CchildFrame, CMDIChildWnd and CsplitterWnd
User defined message handling
Drag and Drop
Context-Sensitive Help
8. Dynamic Link Libraries ( DLL ) (2)
MFC Extension DLL: Exporting classes
MFC Regular DLL
9. Basic Component Object Model (COM) (8)
What is COM and why COM?
Interfaces definition language
IUnknown, IClassFactory Interfaces
In-process and out-of-process servers
Marshaling
Containment and Aggregation
Difference between ActiveX controls and ordinary controls
Wrapper classes for ActiveX controls
Data exchange between variables and ActiveX control properties
Mapping ActiveX control events
Case study: Calendar and Web Browser controls
10. Database Connectivity (6)
ODBC: CDatabase and CRecordset, Data binding, Dynamic data binding, snapshots, dynaset
Data Access Objects( DAO ):CDaoWorkspace, CDaoDatabase, CDaoRecordset, CDaoTableDef, CDaoQueryDef
OLE DB Consumer: CDataSource, CEnumerator, CSession, CAccessor, CDynamicAccessor, CDynamicParameterAccessor, CManualAccessor OLE DB Provider.
Books
1. Programming Microsoft Visual C++. 5th Edition
David J Kruglinski
George Shepherd
Scot Wingo
Microsoft Press 1998
Projects
1. Simple Windows based Text Editor
2. Video Cassette Library
3. Write your own button control
4. Pattern matching in multiple files: Get a pattern and a set of files from user. The program highlights all lines where the given pattern is found. Use multithreading for better throughput.
CSD22- Computability and Complexity Theory
( Group II )
Objectives of the course ( Total hours 48 )
1. Understanding the theory of computer Science
2. Understanding Complexity theory
Prerequisites
1. Theoretical Computer Science
Topics
1. Mathematical Prerequisites(4)
Sets, Cardinality and Countability, Relations, Functions, Induction and Recursion, Strings, Directed Graphs, Graphs, Godel Numbering.
2. Turing Machines(12)
The formal definition, Further Turing Comutability Functions, A Non-computable function, Multitape turing Machine, Restricted Turing Machines.
3. Solvability and Unsolvability(8)
A universal Turing Machine, The Halting problem, Post's correspondence problem, Further unsolvable problems.
4. Formal Languages(8)
Turing machine as recognizers, Non-Deterministic Turing machines, Phase structure Grammers, Context-sensitive Grammers, Context-free grammers, Regular grammers
5. Recursive functions(8)
Defining functions, Primitive Recursive Functions and predicates, Partial recursive functions.
6. Complexity theory (8)
Algorithm Analysis, The classes P and NP, The NP- complete Class, A sample of further NP-complete problems, Number problem and pseudo-polynomial algorithms, Complementary problems, The polynomial Hierarchy, Space-Constraint.
Books
1. A First Course in Computability, Blackwell Scientific Publications, Computer Science Tests- V. J. Rayward- Smith.
2. Computability, Complexity and Languages, Academic Press-Martin Davis and Elaone Weyuker.
|
Download MCS Syllabus(MS-Word)
