Courses & Schemes
CS305 : Organizational Structure & Personnel Management
Organization Structure: Classical theories of Management: Scientific management theory, Fayol's 14 principles of Management Webar's bureaucratic theory. Definition of organization and organization Structure.
Some Concepts Regarding Organization Structure: Line and Staff authority, Centralization and Decentralization, Span of control, Formal and Informal Organization. Forms of Organization Structure and Feature: Function bases, Product bases, Geography based, Project based (Matrix). Organization Design: Mechanistic and Organic Structure, Virtual and Network organization Structure. Motivation: Definition of Motivation, Importance of Motivation, Motivation and behaviour, Theories of Motivation Maslows need Hierarchy, Two-Factor Theory, McClelland's Need Theory, Theory X and Theory Y.
Nature and Scope of Human Resource Management: Scope of HRM, HRM-function and objectives, HRM model.
Personnel Function: Personnel polices and principles, duties and responsibilities of personnel manager, differences between HRM and PM Emerging trends of personnel management in India
Human Resource Planning: Meaning, definition and importance of HRP. Job Analysis: Meaning and definition, process of job analysis Recruitment: Meaning and definition, importance, sources of recruitment. Indian scenario. Selection: Meaning and definition, selection process, types of interview.
Training and Development: Nature of training and Development, Inputs in training and Development, importance of training and Development, training process, training of International assignment.
References:
1. L.M. Prasad "Organizational Behavior", S.Chand
2. V.S.P. Rao, P.S. Narayana, "Organizational Theory and Behaviour" Konark Publishers Pvt. Ltd.
3. Tripathi, Reddy, "Principles of Management:. TMH
4. Koontz, Weihrich, "Essentials of Management:, TMH
5. Fred Luthans, :Organizational Behaviour", McGraw Hill
6. K. Aswathappa, "Human Resources and Personnel Management", TMH
7. L.M. Prasad, "Human Resource management", S.Chand
CS401 : ERP System
Enterprise wide information system, Custom built and packaged approaches, Needs and Evolution of ERP Systems, Common myths and evolving realities, ERP and Related Technologies, Business Process Reengineering and Information Technology, Supply Chain Management, Relevance to Data Mining and OLAP, ERP Drivers, Decision support system.
ERP Domain, ERP Benefits classification, Present global and Indian Market scenario, milestones and pitfalls, Forecast, Market players and profiles, Evaluation criterion for ERP product, ERP Life Cycle: Adoption decision, Acquisition, Implementation, Use and Maintenance, Evolution and Retirement phases, ERP Modules.
Framework for evaluating ERP acquisition, Analytical Hierarchy Processes (AHP), Applications of AHP in evaluating DRP, Selection of Weights, Role of consultants, vendors and users in ERP implementation; Implementation vendors evaluation criterion, ERP Implementation approaches and methodology, ERP Customization.
Critical success and failure factors for implementation, Model for improving ERP effectiveness, ROI of ERP implementation. Hidden costs, ERP success inhibitors and accelerators, Management concern for ERP success, Strategic Grid: Useful guidelines for ERP Implementations.
References:
1. A. Lexis Leon, "Enterprise Resource Planning" TMH
2. Brady, Manu, Wegner, "Enterprise Resource Planning", TMH
CS402 : Computer Based Optimization Techniques
Preliminaries: Inventory Models and Replacement Problems: Inventory models, various costs deterministic inventory models, Single period inventory model with shortest cost, stochastic models, Application of inventory models, Economic lot sizes-price breaks, Replacement problems capital equipment discounting cost replacement in anticipation of failure group replacement-stochastic nature underlying the failure phenomenon.
Linear Programming Problems (LPP): Definition of LPP, Graphical Solutions of Linear Programming Problems, Simplex Method, and Artificial Variable Method, Two Phase Method, Big-M Method, Sensitivity Analysis, Revised Simplex Method, Duality, Dual Simplex Method.
Integer Linear Programming Problems: Integer Linear Programming Problems, Mixed Integer Linear Programming Problems, Cutting Plane Method, Branch and Bound Method, 0-1 integer linear programming problem.
Transportation Problems: Introduction to Transportation Model, Matrix Form of TP, Applications of TP Models, Basic Feasible Solution of a TP, Degeneracy in TP, Formation of Loops in TP, Solution Techniques of TP, Different Methods for Obtaining Initial Basic Feasible Solutions viz. Matrix Minima Method, Row Minima Method, Column Minima Methods, Vogel's Approximation Method, Techniques for Obtaining Optimal Basic Feasible Solution.
Assignment Problems: Definition, Hungarian Method for AP.
Dynamic Programming: Bellman's Principle of optimality of Dynamic Programming, Multistage decision problem and its solution by Dynamic Programming with finite number of stages, Solution of linear programming problems as a Dynamic Programming problem.
References:
1. Hadley, G. "Linear Programming and Masschusetts, Addison-Wesley
2. Taha, H.A. "Operations Research-An Introduction" Macmillian
3. Hiller, F.S., G.J. Lieberman "Introduction to Operations Research
4. Harvey M Wagner, "Principles of Operations Research with Applications to Managerial Decisions, Prentice Hall India Pvt. Ltd.
5. Swarup Ketal, "Operation Research" S.Chand
CS403 : Network Security and Cryptography
Introduction of Cryptography: Introduction To security: Attacks, Services & Mechanisms, Security, Attacks, Security Services, Conventional Encryption: Classical Techniques, Conventional Encryption Model, and steganography, Classical Encryption Techniques. Modern Techniques: Simplified DES, Block Cipher Principles, DES Standard, DES Strength, Differential & Linear Cryptanalysis, Block Cipher Design Principles, Block Cipher Modes of Operations.
Conventional Encryption Algorithms: Triples DES, Blowfish, International Data Encryption Algorithm, RCS, CAST-128, CR2 Placement & Encryption Function, Key Distribution, Random Number Generation, Placement of Encryption Function.
Public Key Encryption: Public-Key Cryptography: Principles of Public-Key Cryptosystems, RSA Algorithm, Key, Key Management, Fermat's & Euler's Theorm, Primality, Chinese Remainder Theorem.
Hash Functions: Message Authentication & Hash Functions: Authentication Requirements, Authentication Functions, Message Authentication Codes, Hash Function Birthday Attacks, Security of Hash Function & MACS, MD5 Message Digest Algorithm, Secure Hash Algorithm (SHA), Digital Signatures: Digital Signature, Authentication Protocol, Digital Signature Standard (DDS) Proof of Digital Signature Algorithm.
Network & System Security: Authentication Applications: Kerberos X-509, Directory Authentication Service, Electronic Mail Security, Pretty Good Privacy (PGP),S/Mine Security: Architecture, Authentication Header, Encapsulating Security Payloads, Combining Security Associations, Key Management, Web Security: Secure Socket Layer & Transport Layer Security, Secure Electronic Transaction (Set), System Security: Intruders, Viruses, Firewall Design Principles, Trusted Systems.
References:
1. William Stallings, "Cryptography and Network Security: Principles and Practice"' Prentice hall, New Jersey
2. Johannes A. Buchmann, "Introduction to Cryptography" Springer-Verlag
3. Atul Kahate, "Cryptography and Network Security" TMH
4. Network Security Bible : Eric Cole, Wiley dreamtech India Pvt. Ltd.
5. Practical Cryptography “Bruce Schneier” Wiley dreamtech India Pvt. Ltd.
CS404 : Graphics and Animation
Graphics Primitives: Display Devices: Refresh Cathode Ray Tube, Raster Scan Display, Plasma display, Liquid Crystal display Plotters, Printers. Input Devices: Keyboard, Trackball, Joystick, Mouse, Light Pen, Tablet, and Digitizing Camera.
Input Techniques: Positioning techniques, Potentiometers, Constraints, Scales & Guidelines, Rubber-Band techniques, Dragging Dimensioning techniques and Graphical Potentiometers, Pointing and Selection: the use of selection points defining a boundary rectangle, multiple selections, Menu selection.
Mathematics for Computer Graphics: Point representation, Vector representation, Matrices and operations related to matrices, Vector addition and vector multiplication, Scalar product of two vectors, Vector product of two vectors.
Line Drawing Algorithms: DDA Algorithms, Bresenham's Line algorithm.
Segment & Display files: Segments, Functions for segmenting the display file, Posting and posting a segment, segment naming schemes, Default error conditions, Appending to segments, Refresh concurrent with reconstruction, Free storage allocation, Display file structure.
Graphics Operations: Clipping, Point Clipping, Line Clipping, Polygon Clipping. Filling: Inside Tests, Flood fill algorithm, Boundary-Fill Algorithm and scan-line polygon fill algorithm.
Conics, Curves and Surfaces: Quadric surfaces: Sphere, Ellipsoid, and Torus. Superquadrics: Superellipse, superellipsoid, Spline & Bezier Representations: Interpolation and approximation splines, parametric continuity conditions, Geometric Continuity Conditions, Spline specifications. Bezier curves and surfaces.
Transformation: 2D transformation, Basic Transformations, Composite transformations: Reflection, Shearing, Transformation between coordinate systems. 3D Graphics: 3D Display Methods, 3D transformations, Parallel projection, Perspective projection, Visible lines and surfaces identification, Hidden surface removal.
References:
1. Donald Hearn and M Pauline Baker, "Computer Graphics" PHI
2. Steven Harrington, "Computer Graphics: A Programming Approach" TMH
3. Prajapati A.K. "Computer Graphics" PPM Ed2
4. Foley James D, "Computer Graphics" AW Ed2
5. Newman and Sprould, "Principle of to Interactive Computer Graphics" McGraw Hill
6. Rogers, "Procedural Elements of Computer Graphics", McGraw Hill
7. Rogers and Adams, "Mathematical Elements of Computer Graphics" McGraw Hill
8. Practical Multimedia “Nigel Chapman” Wiley dreamtech India Pvt Ltd.
CS405(i) : Visual Programming ( Visual C++, Visual Basic)
Visual C++: Introduction to Visual C++, getting started with Visual C++, reading Keystrokes from keyboard, handling mouse in VC++, creating menus, Toolbars buttons, status bar prompts, Dialog Boxes: Using Buttons and Text Boxes, creating check box and radio Buttons, List Boxes, Combo boxes and Sliders, File handling, Multiple Documents and Multiple Views, creating Internet Programs- including a Web Browser, creating Active X controls.
COM: Introduction, Building and using COM Servers in VC++, Building and Using Active X controls in VC++, Building Internet COM components with VC++, COM Security, New COM features, Features in Windows 2000, Debugging and profiling COM components, Deploying COM Applications.
Visual Basic: Introduction, Analyzing, controls and properties, coding, loops, dialog boxes, additional controls-option buttons, frames, check boxes, scroll bars, timer control, procedures and functions, using debugging windows, database programming, crystals reports, simple Active X controls.
References:
1. Murray, et.al “The Visual C++ Handbook”, 2nd edition. Osborne MCGraw Hill, New York, 1996.
2. COM/DCOM Primer Plus by Waite Group (Techmedia)
3. Using Visual Basic 6 by Reselman and other (PHI)
4. VC++ 6 Programming Bible, Wiley dreamtech India Pvt. Ltd.
5. VB 6 Black Book, Steven Holzer, Wiley dreamtech India
CS405(ii) : Theory of Computation
A brief review of Finite Automata, Regular expressions, Regular languages, Deterministic and non-deterministic computations. Pumping Lemma for Regular languages, Context free languages, Pushdown automaton, Pumping Lemma for Context free languages, Grammar types and Chomsky Hierarchy. Turing Machines (TM), Variations of TM’s, Universal Turing Machines (UTM), Church-Turing Thesis, Relation of Languages to Automata. Turing computable functions, Halting problem, Solvability, Undecidability and Computability.
References:
1. J.E.Hopcraft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory, Languages and Computation”, Pearson Education
2. Cohen, “Introduction to Computer Theory”, John Wiley.
3. M. Sipser, Introduction to Theory of Computation, PWS Publishing Corporation, 1997.
4. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wisley, 1979.
5. T.C. Martin, Theory of Computation, Tata McGraw-Hill
6. H.R. Lewis, C.H. Papadimitrou, Elements of the Theory of Computation, PHI.
CS405(iii): Unified Modeling Language
Introduction: The Evolution of Technology, Structured Analysis and Design, Object-Oriented Technologies, Comparison between the main technologies.
The Unified Process and Features: Unified Process, Static Structure: Process Representation, Dynamic Structure: iterative development, an architecture-centric process, A use-case-driven process, Use case models, Notations and Terminology.
Process Components (Workflows): Business Modeling Workflow, Requirement Workflow, Analysis and Design Workflow, Deployment workflow. Understanding Object –Oriented Technologies, Current status of Object Technologies, The static object model- Class, Collaborations and Object Diagrams, Generalization, Composition, Aggregation, Multiplicity & Association with concept and examples.
Use Case Analysis: Discussion on use cases, terminology, notations and analysis, what they are and aren’t, Use case- an example, Use case- formal Scenario template. Static chart Diagram: Composite states, nested states, Events, Simple transitions.
UML Activity and sequence diagrams: Usage and Syntax, Guarded Transitions, Synchronization Bars, Swim lanes Purpose, Proper Usage of Activity diagram. Transition time sequence diagram: Objective and Modeling guidelines, Objective Interaction, Sequence diagram- UML notation, Object and Stereotypes.
References:
1. UML distilled by Martin Fouler- Pearson Education.
2. Object –Oriented Modeling by James Raumbaugh, PHI.
3. UML a nutshell by Dan Pillone, O’Reilly Publication.
4. The elements of UML by Scott Amber, Cambridge University Press.
5. Designing Object-Oriented Software by Rebecca Wirf Brock, PHI.