Junior Year

Junior Year/Fifth Semester
1. CSC-301: Computer Networks

Nature of course: Theory (3 Hrs) + Lab (3Hrs)Text Books:Computer Networking; A Top Down Approach Featuring The Internet, 2nd Edition, Kurose James F., Ross W. Keith PEARSON EDUCATION ASIA
Course Synopsis: Discussion on types of networking techniques, Internet, IPV.

Goal: This course introduces concept of computer networking and discuss the different layers of networking model.

Course Contents:

Unit 1. ( 33 Hrs)
1.1 Computer Network: Introduction to networking, computer network, Internet, the network edge: end system, clients, server, connection oriented and connectionless service, network core, network access and physical media, ISPs and back bone.

1.2 Protocol Layers: Introduction, layered architecture, The Internet protocol stack, network entities and layers.

1.3 Application Layer: Introduction, principles of application layer protocols, the web and HTTP, file transfer, Domain Name Service [DNS]: Working of DNS, DNS records, DNS messages.

1.4 Transport Layer: Introduction, relationship between transport layer and network layer, transport layers in the Internet, multiplexing and demultiplexing, connectionless transport, reliable data transfer: Building a reliable data transfer protocol, pipelined reliable data transfer protocol, Go-Back-N (GBN), selective repeat (SR), connection oriented transport: TCP, TCP connection, TCP segment structure, time estimation and time out, flow control, Principle of congestion control: The causes and costs of congestion, approaches to congestion control.

1.5 Network Layer: Introduction, network service model, datagrams and virtual circuit service, routing principles: A link state routing algorithm, the distance vector routing algorithm, hierarchical routing. The Internet protocol (IP): IPV4 addressing, datagram format, IP datagram fragmentation, Internet Control Message Protocol [ICMP], Network address translator, routing in the Internet, IPV6, Multicasting routing.

Unit 2. ( 12 Hrs)
2.1 Link Layer and Local Area Networks: Introduction, Data link layer: the services provided by the link layer, error detection and error correction techniques, multiple access protocols, LAN addresses and Address Resolution Protocol, Ethernet, Wireless Links: IEEE 802.11b, Bluetooth, point to point protocol (PPP), Asynchronous Transfer Mode (ATM), frame relay.

2.2 Multimedia Networking: Introduction, multimedia networking application, streaming audio and video.

2.3 Network Management: Introduction, The infrastructure for network management.

Laboratory works: Developing the network system in the small scale.

Homework

Assignment:
Assignment should be given from the above units in throughout the semester.

Computer Usage:
No specific

Prerequisite:
C, Digital Logic

Category Content: Science Aspect: 50% Design Aspect: 50%

2. CSC-302: Simulation and Modeling

Nature of course: Theory (3 Hrs) + Lab (3Hrs)Text Books:Jerry Banks, John S. Carson, Barry L. Nelson, David M. Nicol “Discrete-Event system simulation”, Pearson education.References:

G. Gorden, “System Simulation”, Prentice Hall of India M. Law and R.F. Perry, “Simulation: A problem-solving approach”, Addison Wesley publishing company. M. Law and W.D. Kelton, “Simulation Modeling and analysis”, McGraw Hill, 1991.

Course Synopsis: This course provides the discrete and continuous system, generation of random variables, analysis of simulation output and simulation languages.

Goal: This course will provide students the concepts of simulation.

Course Contents:

Unit 1. Introduction to Simulation (6 Hrs)

Continuous and discrete systems, System simulation, Real time simulation, Types of Simulation Models, Steps in simulation Study, Phases of a simulation study, Phases of a simulation study, Advantages of simulation, Limitations of the Simulation Technique, Areas of applications

Unit 2. Simulation of Continuous Systems (5 Hrs)
Queuing system, Markov chains, Differential and partial differential equations

Unit 3. Random Numbers (10 Hrs)
Random Numbers, Random Number Tables, Pseudo Random Numbers, Generation of Random Number, Testing Numbers for Randomness, Uniformity Test, Chi-square test, Testing for auto correlation, Poker Test

Unit 4. Verification and Validation of Simulation Models (6 Hrs)
Model building, verification and Validation, Verification of Simulation Models, Calibration and Validation of Models

Unit 5. Analysis of Simulation Output (8 Hrs)
Estimation methods, Simulation run statistics, Replication of runs, Elimination of internal bias

Unit 6. Simulation Languages (10 Hrs)
Basic concept of Simulation tool, Discrete systems modeling and simulation, Continuous systems modeling and simulation, Data and control, Hybrid simulation, Feedback systems: typical applications.

Laboratory works: Laboratory exercises using simulation and modeling packages and student also develop their own simulation software.

3. CSC-303: Design and Analysis of Algorithms
Nature of course: Theory (3 Hrs)

Text Books:T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 2nd Edition, MIT Press, 2001 ISBN: 0-262-530-910.

Reference:

G. Brassard and P.Bratley, Fundamentals of Algorithmics, Prentice-Hall, 1996 ISBN: 0-262-530-910.

Course Synopsis: Methods and tools for analyzing different algorithms. Different approaches of designing efficient algorithms like divide and conquer paradigm, greedy paradigm, dynamic programming. Algorithms pertaining various problems like sorting, searching, shortest path, spanning trees, geometric problems etc. NP-complete problems.

Goal:
Competency in analyzing different algorithms encountered. Ability to conquer the problem with efficient algorithm using the algorithm development paradigms.

Course Contents:

Unit 1. (10 Hrs)

1.6 Algorithm Analysis: worst, best and average cases, space and time complexities. Mathematical background: asymptotic behavior, solving recurrences.

1.7 Data Structures Review: linear data structures, hierarchical data structures, data structures for representing graphs and their properties. Search structures: heaps, balanced trees, hash tables.

Unit 2. (14 Hrs)

6.1 Divide and Conquer: Concepts, applications, sorting problems (quick, merge), searching (binary), median finding problem and general order statistics, matrix multiplications.

6.2 Greedy Paradigm: Concepts, applications, Knapsack problem, job sequencing, Huffman codes.

6.3 Dynamic Programming: Concepts, applications, Knapsack problem, longest common subsequence, matrix chain multiplications.

Unit 3. ( 21 Hrs)

3.1 Graph Algorithms: breadth-first and depth-first search and their applications, minimum spanning trees (Prim’s and Kruskal’s algorithms), shortest path problems (Dijkstra’s and Flyod’s algorithms), algorithm for directed acyclic graphs (DAGs).

3.2 Geometric Algorithms: Concepts, polygon triangulation, Convex hull computation.

3.3 NP Completeness: Introduction, class P and NP, cooks theorem, NP complete problems: vertex cover problem.

3.4 Introduction: Randomized algorithms concepts, randomized quick sort, approximation algorithms concepts, vertex cover problem.

Prerequisites: Good programming concepts (any language), Data structures and their properties, mathematical concepts like methods of proof, algorithmic complexity, recurrences, probability.

Assignment: This course deals with wide range of problem domain so sufficient number of assignments from each unit and subunit should be given to the students to familiarize the concepts in depth.

Labs: The motive of this course is to provide good theoretical and mathematical background of algorithms and their analysis, however it is advisable to provide programming assignments that aid the students learn the behavior of the algorithms.

4. CSC-304: Artificial Intelligence
Nature of course: Theory (3 Hrs) + Lab (3Hrs)

Text Books / References:E. Rich and Knight, Artificial Intelligence, McGraw Hill, D.W. Patterson, Artificial Intelligence and Expert Systems, Prentice Hall , P.H. Winston, Artificial Intelligence, Addison Wesley , Stuart Russel and Peter Norvig, Artificial Intelligence A Modern Approach, Pearson, Ivan Bratko, PROLOG Programming for Artificial Intelligence, Addison Wesley.

Course Synopsis: This course introduces the problem solving techniques, problem representation and machine learning.

Goal: The main objective of this course is to provide basic knowledge of Artificial Intelligence, with acquaintance of different search techniques and AI applications.

Course Contents:

Unit 1. Introduction to Artificial Intelligence (4 Hrs)
Artificial Intelligence and related fields, brief history of AI, applications of Artificial Intelligence, Definition and importance of Knowledge, and Learning.

Unit 2. Problem Solving (6 Hrs)
Problem Definition, Problem as a state space search, Problem formulation, Problem types, Well-defined problems, Constraint satisfaction problem, Game playing, Production systems.

Unit 3. Search Techniques (9 Hrs)
Uninformed search techniques – depth first search, breadth first search, depth limit search, and search strategy comparison, Informed search techniques – hill climbing, best first search, greedy search, A* search, Adversarial search techniques-minimax procedure, alpha beta procedure.

Unit 4. Knowledge Representation, Inference and Reasoning (12 Hrs)
Formal logic-connectives, truth tables, syntax, semantics, tautology, validity, well-formed-formula, propositional logic, predicate logic, FOPL, interpretation, quantification, horn clauses, rules of inference, unification, resolution refutation system (RRS), answer extraction from RRS, rule based deduction system, Statistical Reasoning-Probability and Bayes’ theorem and causal networks, reasoning in belief network.

Unit 5. Structured Knowledge Representation (4 Hrs)
Representations and Mappings, Approaches to Knowledge Representation, Issues in Knowledge Representation, Semantic nets, frames, conceptual dependencies and scripts.

Unit 6. Machine Learning (4 Hrs)
Concepts of learning, learning from examples, explanation based learning, learning by analogy, learning by simulating evolution, learning by training neural nets, learning by training perceptrons.

Unit 7. Applications of Artificial Intelligence (6 Hrs)
Expert Systems, Neural Network, Natural Language Processing, Machine Vision

Laboratory works: Laboratory exercises should be conducted in either LISP or PROLOG. Laboratory exercises must cover the fundamental search techniques, simple question answering, inference and reasoning.

Elective

5. CSC-305: Microprocessor Based Design
Nature of course: Theory (3 Hrs) + Lab (3Hrs)

Text / Reference books:D.V. Hall, Microprocessors and Interfacing – Programming and Hardware, McGraw Hill , K. J. Ayala, The 8051 Microcontroller: Architecture, Programming and Applications, West Publishing , K.R. Fowler, “Electronic Instrument Design”, New York Oxford, Oxford University Press , E.O. Duebelin, “Measurement System Application and Design” Tata McGraw Hill, New Delhi.
Goal: The course objective is to apply the knowledge of microprocessor with other digital / analog system and interfacing to design a complete system.

Course Contents:

Unit 1. Interfacing Concept (4 Hrs)
Interfacing, Interfacing Types, Address Decoding, I/O Mapping, Memory Mapping, I/O Memory Mapping, Registers and Input/output Registers, PC Interfacing Techniques.

Unit 2. Digital Interfacing (12 Hrs)
Input/output and Microcomputer, Simple input, Simple output, Programmable Parallel Ports, Handshaking, Single handshaking IO, Double handshaking IO, Introduction to Programmable Peripheral Interface 8255 A, Functional Block Diagram, Different Modes of Operations, Introduction to Programmable Interval Timer 8253 and Difference between 8253 and 8254, Functional Block Diagram, Different Modes of Operation, Keyboard Interfacing, Alphanumeric Display Different Modes of Operation, Keyboard Interfacing, Alphanumeric Display Interfacing, Microcomputer ports Interfacing to high-power devices.

Unit 3. Interrupts & Interrupt Controller (6 Hrs)
Interrupt Vector Tables, Types of Interrupts, Assembly Language program and Interrupt Procedure Hardware interrupts and Applications, Examples of Various ISR, Introduction to Programmable Interrupt Controller 8259, Functional Block Diagram, Operations of Interrupt, Programming of 8259.

Unit 4. Analog Interfacing (5 Hrs)
Operational Amplifier Basics, Sensors and Transducers, Digital to Analog Conversion and Analog to Digital Conversion – Basics, Operations, Specification, Applications and Interfacing, A Microcomputer Based Industry-Process Control System.

Unit 5. Serial and Parallel Data Communication (6 Hrs)
Synchronous and Asynchronous Data Communication, Parity and other error control, Baud rates, Serial Interface Device, Serialization, RS 232 Interface Pin Description, Simplex Connection, Full Duplex Connection, Connection Between DTE to DTE, Connection to Printers and Zero Modem.

Unit 6. Microcontroller & Interfacing (8 Hrs)
General Microcontroller Concept, Pin Configuration, I/O Port Structure, Memory Organization, Special Function Registers, External Memory, Reset Operations, Instruction Set, Timer Operation, Serial Port Operation, Interrupt Design and Processing, Assembly Instructions and Programming.

Unit 7. Grounding and Shielding (4 Hrs)
Outline for grounding and shielding, Single point grounding and grouped loop, Noise, noise coupling mechanism and prevention, Filtering and smoothing, Different kinds of shielding mechanism, Protecting against electrostatic discharge, Line filters, isolators and transient suppressors.

Laboratory works: Assembly language based programming: PPI, ADC and various interfacing with RS232, Printer Port should be experimented. At the semester end, individual project work based on microcontroller for industry process control should be done.

Lab exercise may comprise some of the followings:
1. Assembly language programming
2. Simple data transfer using PPI
3. Handshake transfer using PPI
4. Interfacing of A/D converter using PPI
5. Interfacing of A/D using Micro controller
6. Interfacing of A/D converter using Printer port
7. Demonstration of other interfacing techniques and devices
8. Writing an interrupt Service Routine

6. CSC-306: Applied Logic
Nature of course: Theory (3 Hrs) + Lab (3Hrs)

Text / Reference books: Arindama Singh, Logics for Computer Science, Prentice Hall of India, Irving M. Copi, Symbolic Logic, 5th Edition, Prentice Hall of India.

Course Synopsis: This course contains the main feature of different logics.

Goal: The course objective is to provide the basic concepts and techniques of the logics used in computer science.

Course Contents:

Unit 1. Introduction (4 Hrs)
Introduction to Logic, Nature of Argument, Truth and Validity, Symbolic Logic, Statements, Conditional Statements, Statement Forms

Unit 2. Deduction and Deductive Systems (6 Hrs)
Formal Proof of Validity, The Rule of Replacement, The Rule of Conditional Proof, The Rule of Indirect Proof, Proofs of Tautologies, Formal Deductive Systems, Attribute of Formal Deductive Systems, Logistic Systems

Unit 3. Propositional Logic (6 Hrs)
Syntax of Propositional Logic, Semantics of Propositional Logic, Calculations, Normal Form, Applications.

Unit 4. Predicate Logic (8 Hrs)
Predicate Logic, Order of Predicate Logic, Syntax of Predicate Logic, Semantics of Predicate Logic, Consequences, Calculations, Normal Form

Unit 5. Resolution & Proofs (10 Hrs)
Resolution, Resolution in Propositional Logic, Unification of Clauses, Resolution in Predicate Logic, Horn Clauses, Proof in Propositional Logic and Predicate Logic, Axiomatic Systems, Adequacy, Compactness, Soundness.

Unit 6. Program Verification (5 Hrs)
Issue of Correctness, Partial Correctness, Hoare Proof, Total Correctness.

Unit 7. Some Other Logics (6 Hrs)
Intuitionistic Logic, Lukasiewicz Logic, Probabilistic Logic, Fuzzy Logic, Default Logic, Autoepistemic Logic.

Laboratory works: Laboratory exercises should be conducted in any logic programming language like LISP or PROLOG.

7. CSC-307: E-governance
Nature of Course: Theory (3 Hrs) + Lab (3 Hrs)

Text / Reference books:

E-Governance Concepts and Case Studies, C.S.R. Prabhu, Prentice-Hall of India Private Limited, 2004., Backus, Michiel, e-Governance in Developing Countries, IICD Research Brief, No.1 March, 2001.

Course Synopsis: This course contains concepts of E-Governance policies and data warehousing / data mining.

Goal: To provide the knowledge of good governance using information and communication technologies and case studies of different countries.

Course Contents:

Unit 1. Introduction (4Hrs)
E-Governance: Needs of E-Governance applications and the Digital Divide; Evolution of E-Governance, Its scope and content; Present global trends of growth in E- Governance: Other issues.

Unit 2. Models of E-Governance: (10 Hrs)
Introduction; Model of Digital Governance: Broadcasting/ Wilder Dissemination Model, Critical Flow Model, Comparative Analysis Model, Mobilization and Lobbying Model, Interactive-service Model /Government-to-Citizen-to-Government Model(G2C2G); Evolution in E-Governance and Maturity Models: Five Maturity Levels, Characteristics of Maturity Levels Key areas, Towards Good Governance through E-Governance Models.

Unit 3. E-Governance Infrastructure and Strategies (6 Hrs)
E-readiness: Digital System infrastructure ,Legal Infrastructural Preparedness, Institutional Infrastructural Preparedness, Human Infrastructural Preparedness, Technological Infrastructural Preparedness; Evolutionary Stage in E-Governance.

Unit 4.Data Warehousing and Data Mining in Government (5Hrs)
Introduction : National Data Warehouse :Census Data , Prices of Essential Commodities; Other areas for Data Warehousing and Data Mining: Agriculture, Rural Development, Health, Planning, Education Commerce and Trade, Other Sectors.

Unit 5. Case Studies (20 Hrs)
Nepalese Context: Cyber Laws, Implementation in the Land Reform, Human Resources Management Software; India: NICNET, Collectorate, Computer-aided Administration of Registration Department (CARD), Smart Nagarpalika, National Reservoir Level and Capacity Monitoring System, Computerization in Andra Pradesh,Ekal Seva Kentra, Sachivalaya Vahini, Bhoomi, It in Judiciary, E-Khazana DGFT, PRAJA , E-Seva, E-Panchyat, General information Services of National Informatics Center; E-Governance initiative in USA; E-Governance in China; E-Governance in Brazil and Srilanka. Project Work: Project work will be based on the topics covered in the text.

8. CSC-308: Wireless Networking
Nature of Course: Theory (3 Hrs)

Text /Reference books:Wireless Communications and Networking, Jon W. Mark and Weihua Zhuang, Prentice-Hall of India Private Limited, 2005 , Principles of Wireless Networks, Pahlavan, Prentice-Hall of India Private Limited, 2005.
Course Synopsis: This course contains the concept of wireless networking technology.

Goal: To provide the concept and working principle of wireless communication and networking.

Course Contents:

Unit 1. Introduction (4 Hrs)
History of wireless communication, Challenges in wireless communication networking, Wireless communication standards.

Unit 2. Wireless Channel Characterization (6Hrs)
Multipath propagation environment, Linear time invariant channel model, Channel correlation function, Large-scale path loss and shadowing, Small-scale multipath fading.

Unit 3. Bandpass Transmission Techniques (7 Hrs)
Introduction, Signal space and decision regions, Digital modulation, Power spectral density, Probability of transmission error.

Unit 4. Receiver Techniques for fading Dispersive Channels (5 Hrs)
Overview of channel impairment mitigation techniques, Diversity, Channel equalization.

Unit 5. Fundamental s of Cellular Communications (8Hrs)
Introduction, Frequency reuse and mobility management, Cell cluster concept, Cochannel and adjacent channel interference, Call blocking and delay at the cell-site, Other mechanism for capacity increase, channel assignments strategies.

Unit 6. Multiple Access Technologies (5 Hrs)
Multiple access in a radio cell, Random access, Conflict-free multiple access technologies, Spectral efficiencies.

Unit 7. Mobility Management in Wireless Networks (5 Hrs)
Introduction, Cell admission control (CAC), Handoff management, Location management for cellular networks, Location management for PCS networks, Traffic calculation.

Unit 8. Wireless/ Wireline Internetworking (5 Hrs)
Introduction, Mobile IP, Internet protocol (IP), Transmission control protocol (TCP), Network performance, Wireless application protocol (WAP), Mobile AD HOC networks.

9. MGT-309: International Business Management
Nature of Course: Theory (3 Hrs)

Textbooks:Daniels, John D., Radebaugh, Lee H. and Sullivan, Daniel P., International Business Environment and Operations, Pearson Education (Singapore), India, 2004 ISBN: 81-297-0411-0References:

Czinkota, Ronkainen and Mofet, International Business, 4th Edition, Dryden 1996. Hill, Charles, International Business: Competing in the Global Marketplace, 3rd Edition, Irwin. Bennett, Roger, International Business, 2nd Edition, Pearson Education.

Course Synopsis: Examination and analysis of international business in its historical theoretical, environmental, and functional dimensions. Topics include the nature of scope of international business; the institutional, socio-cultural, political legal, ethical, and economic environments, trade foreign investment, and development; transnational management, including global operations, strategic planning, human resources, marketing and finance; and international business diplomacy and conflict resolution.

Goal: To develop the student’s understanding of international business and the globalization of the economy. Students will learn fundamental concepts and procedure, which will help them analyzing the international opportunities.

Course Contents:

Unit 1. Introduction to International Business (4Hrs)

Unit 2. Global business Environment (7 Hrs)
The cultural environment, The political and legal environment, The economic environment

Unit 3. Global Trade and Investment (8Hrs)
International trade theory, Government influence on trade, Regional economic integration, Foreign direct investment, International business negotiations and diplomacy

Unit 4. Financial Environment (4 Hrs)
Foreign exchange market, Determination of exchange rates

Unit 5. Choosing Where to Operate (4 Hrs)
Country evaluation and selection, Collaborative strategies, Control strategies

Unit 6. Management of Business Functions (8 Hrs)
Marketing, Export and import strategies, Global manufacturing, Global supply chain management

Unit 7. International Finance, Accounting and Taxation (6Hrs)
Basic concepts of multinational companies, Multinational finance function, Multinational accounting and tax functions

Unit 8. International Human Resources Management (4Hrs)

Sharan, Vyuptakesh, International Business: Concept, Environment and Strategy, Pearson Education

Homework
Assignments: Home works shall be given to the students with emphasis on small cases.

10. MGT-310: International Marketing
Nature of Course: Theory (3 Hrs)

Textbooks:
Keegan, Warren J., Global Marketing Management, Prentice-Hall of India New Delhi, 2003 ISBN: 81-203-2066-2.References:

Cateora, Philip R. and Graham, John L., International Marketing, Burr Ridge, Illinois: McGraw-Hill Publishers, 2005 ISBN: 0-07-283371-8.

Course Synopsis: Introduction to global marketing environment and related issues.

Goal: This course helps developing understanding of international marketing terms and concepts and the students ability to think and communicate in creative innovative and constructive ways about the concepts within international marketing.

Course Contents:

Unit 1. Introduction to Global Marketing (4Hrs)
Marketing concept, Concept and importance of global marketing, Forces affecting global marketing

Unit 2. Global Economic Environment (4Hrs)
Economic system – Market allocation , command allocation and mixed system, Market development stages, Marketing and economic development, Trade patterns- Merchandise and services trades, International trade alliances, World Trade Organization (WTO), Regional trade group/ agreements

Unit 3. Social–Cultural Environment and Global Marketing (4Hrs)
Basic understanding of society and culture, Impact of social and cultural environment in marketing industrial and consumer product

Unit 4. Political and Legal Environment of Global Marketing (4 Hrs)
Political environment – Nation state and sovereignty, political risk, taxes dilution of equity control and expropriation, Legal environment – International law, intellectual property, antitrust, bribery and corruption and dispute settlement

Unit 5. Global Information System and Marketing Research (3Hrs)
Sources of market information, Marketing research

Unit 6. Segmentation, Targeting and Positioning (4Hrs)
Market segmentation, Global targeting, Global product positioning

Unit 7. Global Marketing strategy (3 Hrs)
Sourcing: Exporting and importing, Market expansion strategies

Unit 8. Product and pricing Decisions (5 Hrs)
Basic concepts of products, Product positioning and product design considerations, Basic concepts of pricing, Environmental influence on pricing decisions, Global pricing objectives and strategies

Unit 9. Global Channel and Logistic (4Hrs)
Basic concepts of global marketing channels, Basic concepts of physical distribution and logistics

Unit 10.Global Advertising and E-Marketing (4Hrs)
Global advertising and branding, Basic concepts of e. marketing

Unit 11. Management of Global Marketing (4Hrs)

Homework
Assignments: Home works shall be given to the stude4nts with emphasis on small cases.

11. CSC-311: Neural Networks

Nature of course: Theory (3 Hrs) + Lab (3 Hrs)
Reference Books:

Artificial Neural Networks, Robert J. Schalkoff, McGraw-Hill International Editions, Computer Science Series, 1997 , Neural Networks and Fuzzy Systems, Bart Kosko, Prentice Hall of India Private Limited, 1996 , Neural Networks for Pattern Recognition, Christopher M. Bishop, Indian Edition, Oxford University Press, 2003.

Course Synopsis: This course contains concepts of Neural Networks.

Goal: To provide the knowledge of Neural Networks and more emphasis on back propagation algorithm.

Course Contents:

Unit 1. Introduction (6 Hrs)
Neural computing, Neural computing applications, Overview of neural computing, Engineering approaches to neural computing, ANNs: The mapping viewpoint, The structure viewpoint, learning approaches, Relationship of ANN to other technologies, Historical efforts.

Unit 2. Mathematical Fundamentals for ANN (6 Hrs)
Vector and Matrix fundamentals, Geometry for state-space visualizations, Optimization, Graphs and diagraphs.

Unit 3. ANN Building Blocks (5 Hrs)
Overview and objectives, Biological neural units, Artificial unit structures, Unit net activation to output characteristics, Artificial unit model extension.

Unit 4. Single-Unit Mapping and the Perception (6 Hrs)
Introduction, Linear separability, Techniques to directly obtain linear unit parameters, Perceptrons and Adaline/Madaline units and networks, Multilayer perceptrons (MLPs), Gradient descent training using sigmoidal activation functions.

Unit 5. Neural Mapping and Pattern Associator Applications (5 Hrs)
Neural network-based pattern associators, The influence of psychology on PA design and evaluation, Linear associative mapping, training, and examples, Hebbian or correlational-based learning.

Unit 6. Feedforward Networks and Training (7 Hrs)
Multilayer-feedforward network structure, The delta rule and generalized delta rule, Architecture and training extensions, Ramifications of hidden units, General multilayer FF network mapping capacity, Examples of FF network design.

Unit 7. Feedforward Network: Extensions and Advanced topics (8 Hrs)
Feedforward pattern associator design: Achieving desired mapping, Weight space, effort spaces, and search, Generaliztion, Non-Euclidean (output) error norms, Higher-order derivatives-based training, Stochastic optimization for weight determination, The network architecture determination problem, Genetic algorithms for network training, Cascade correlation networks and algorithms, Network minimization, Network inversion.

Unit 8. Introduction to Fuzzy Neural Networks (2 Hrs)
Warning, The strict Pragma, Other Perl Pragma, Perl Internals, Perl’s Internal Structures, Extending Perl, Embedding Perl, Cooperating with other languages.

Laboratory: Exercise covering all features of above.

12. CSC-312: Computer Hardware Design
Nature of course: Theory (3 Hrs)

Text Books:

David A. Patterson and John L. Hennessy. “Computer Organization and Design: The

Hardware/Software Interface”References:

M. M. Mano “Digital Logic Design”

Course Synopsis: To introduce students to theoretical and practical concepts relevant to the structure and design of modern digital computers. The course covers computer architecture from gate-level logic through processor design to multiprocessor and network issues.

Goal: This course will make the student able to design the hardware components.

Course Contents:

Unit 1. Introduction, Computer Abstractions and Technology (2 Hrs)
Hierarchical approach to understanding & designing a complex system, Software, Hardware, Computer components, Processor: Control, Data path. Memory, Input & output, Components of retail price in the computer industry, Overview of computer hardware, IO, Computer processors; CISC, RICS, DSP, Hybrid, Measuring performance. Execution time, Operations per second, Throughput, Real-time computing and performance metrics

Unit 2. Digital Logic Design (6 Hrs)
Gates, truth tables, and logic equations, Combinational logic and basic components. PlAs and ROMs, Memory elements. Finite state machines

Unit 3. Data Representation, Manipulation and Addressing (6 Hrs)
Signed and unsigned numbers, Addition and subtraction. Design of ALUs. Multiplication. Floating-point representation, Addressing: An application of unsigned integers: Byte-addressed memory, Byte ordering conventions, Big-endian, Little-endian, Pointers: Address vs. Contents, Signed representations of integers.

Unit 4. Basic Processor Design (12 Hrs)
Design of the datapath of an ALU that executes the add, sub, and , or instructions, Control signals for the ALU, State elements and clocking, Block view of a single-clock-cycle processor datapath, Control of the single-clock-cycle implementation, Control of the multiple-clock-cycle implementation, Exceptions and interrupts, Karnaugh maps, Multiplexors, Adders, Decoders, Data paths. Single-cycle control. Multi-cycle control, Microprocessor design: Microprogramming, Hardwired programming. Parallel processors, SIMD computers – Single Instruction Stream, Multiple Data Streams; Programming MIMDs, MIMDs connected by a single bus, MIMDs connected by a network, Future directions for parallel processors, Programming for parallel processors in a higher-level language

Unit 5. Sequential Logic Circuits (5 Hrs)
Outputs and next state as vectors of Boolean functions of inputs and present state, Latches: Set and reset latches, SR latch, CSR latch, JK latch, D latch, Master-slave D flip-flop, Lightning introduction to finite state machines

Unit 6. Pipelining (5 Hrs)
A pipelined data path, Pipelined control, Visualization of pipelined data flow, Pipeline diagrams, Gantt charts, Data hazards, Compiler elimination of data hazards, Hardware control for data hazards: Reducing data hazards: Forwarding, Branch hazards, Performance of pipelined systems, Programming for a pipelined processor in a higher-level language.

Unit 7. Memory Hierarchies (3 Hrs)
Hardware implementations of 1-bit memory, DRAM, SRAM, ROM, Hardware implementations of multiple-bit memory, DRAM, SRAM, ROM, SRAM and DRAM chip and system architectures, System bus architectures (processor to/from memory), Hierarchical memory systems, The processor-memory speed gap, Interleaved memory, Caches, Direct-mapped caches, Fully associative caches, Fully associative caches, Set-associative caches, Virtual memory, A common framework for memory hierarchies

Unit 8. Multiprocessors (2 Hrs)
Single-bus networks, Cache consistency, Networks and clusters.

Unit 9. Introduction to Assembly Language (4 Hrs)
Instructions, The fetch-execute cycle, Format of an assembly-language program, Comments, Directives, Data declarations in SPIM, Executable instructions, Survey of differences between SAL (Simple Abstract Language), human-coded MIPS assembly language, and true MIPS assembly language, Load-store architectures, Addressing modes, MIPS addressing modes and the corresponding formats in assembly language and object code, Implementation of I/O, Arrays, Usage of arithmetic and logical instructions in SAL, Branch instructions in SAL and SPIM, Stacks, Support for procedures in computer hardware, Alternatives to the MIPS approach

Prerequisite(s):
Fundamentals of design methodology and descriptive tools; performance and cost; overview of instruction set issues; processor implementation techniques; memory hierarchy; input/output; parallel computer systems, introduction to formal computer aided designs tools and simulations.

13. CSC-313: Cryptography
Nature of course: Theory (3 Hrs) + Lab (3Hrs)

Text Books:D.R. Stinson. Cryptography: Theory and Practice. CRC Press, William Stallings, Network Security Essentials – Applications & Standards, Peason , Charlie Kaufman, Radia Perlman, Mike Speciner, Network Security Private Communication in a Public World, Second Edition, 2004, Pearson , Matt Bishop, Computer Security, Art and Science, Pearson, Bruce Schneier, Applied Cryptography, Pearson.
Goal: The course objective is to familiarize basic concepts of cryptography so as the students can use their understanding for information security purpose.

Course Contents:

Unit 1. Introduction (4 Hrs)
Security, Attacks, Attack Types, Viruses, Worms, Trojan Horses, Classical Cryptography

Unit 2. Basics of Modern Cryptography ( 5 Hrs)
Plaintext, Ciphertext, keys, simple ciphers, public key cryptography, digital signatures

Unit 3. Conventional Encryption / Secret Key Cryptography (10 Hrs)
Cryptography, Cryptanalysis, Cipher Structure, Encryption Algorithms, Data Encryption Standard (DES), International Data Encryption Algorithm (IDEA), Advance Encryption Standard (AES), Modes of Operation, Symmetric Block Ciphers, Cipher Block Chaining (CBS), Multiple Encryption DES

Unit 4. Public Key Cryptography (6 Hrs)
Basic Number Theory, Factorization, Diffie-Hellman Key Exchange, Public Key Cryptography Algorithms, RSA

Unit 5. Digital Signatures (4 Hrs)
One-time signatures, Digital Signature Standard (DSS).

Unit 6. Hashing and Message Digests (6 Hrs)
Hashes, Motivation and applications. Cryptographically Secure Hashing, Secure Hash Algorithm (SHA), Encryption with Message Digest (MD), MD5.

Unit 7. Authentication and Public Key Infrastructure (PKI) (5 Hrs)
Overview of Authentication Systems (Password, Address, Cryptographic), Security Handshake Pitfalls, Authentication Standards, Kerberos, PKI Trust Models.

Unit 8. Network Security (5 Hrs)
IP Security, Web Security, Secure Socket Layer (SSL), Transport Layer Security (TLS), Different versions of SNMPs, PGP.

Junior Year/Sixth Semester
1. CSC-351: Software Engineering
Nature of course: Theory (3 Hrs) + Lab (3 Hrs)

Text Books:Software Engineering, 7th Edition, Jan Sommerville, PEARSON EDUCATION ASIA

Course Synopsis: Discussion on types of software, developing process and maintaining the software.

Goal: This course introduces concept of software development paradigm and implementing these in real world.

Course Contents:

Unit 1: (11 Hrs)
1.1 Introduction to Software Engineering: Definition of software ,software engineering. Comparing between other engineering and software engineering.

1.2 System Engineering: Introduction to System, System properties, system and their environment, system modeling.

1.3 Software Process: Introduction, software process model, process iteration, software specification, software design and implementation, software validation, software evolution.

1.4 Project Management: Introduction, management activities, project planning, project scheduling, risk management.

Unit 2: (12 Hrs)
2.1 Software Requirements: Introduction, Types of requirements, requirements engineering process: Feasibility study, requirements elicitation and analysis, requirement validation, requirement management.

2.2 Software Prototyping: Introduction, prototyping in the software process, rapid prototyping techniques, user interface prototyping.

2.3 Formal Specification: Introduction, formal specification in software process, interface specification, behavioral specification.

Unit 3: (6 Hrs)
3.1 Architectural Design: Introduction, system structuring, control models, modular decomposition, domain specific architecture.

3.2 Object Oriented Design: Introduction, Features of object oriented design, object oriented software engineering.

Unit 4: (16 Hrs)
4.1 Verification & Validation: Introduction, verification & validation planning, software inspection, cleanroom software development.

4.2 Software Testing: Introduction. types of testing, testing work benches.

4.3 Critical system validation: Introduction, formal methods and critical systems, reliability validation, safety assurance, security assessment.

4.4 Software Cost Estimation: Introduction, productivity, estimation techniques.

4.5 Software Reengineering: Introduction, source code translation, reverse engineering.

Laboratory works: Developing the software techniques explained in the course.

Reference: Software Engineering: A Practitioner’s Approach, 6th Edition, Roger S. Pressman, McGraw hill International Edition.

Assignments: Assignments should be given from the above units in throughout the semester.

Computer Usage: No Specific

Prerequisites: C, C++, data structure, Automata Theory, System analysis & Design

Category Content:
Science Aspect: 60%
Design Aspect: 40%

2. CSC-352: Compiler Design and Construction
Nature of course: Theory (3 Hrs) + Lab (3 Hrs)

Text / Reference books:

Compilers, Principles, Techniques, and Tools, Pearson Education Asia.

Course Synopsis: Analysis of source program. The phases of compiler.

Goal: This course introduces fundamentals concept of compiler and its different phases.

Course Contents:

Unit 1: (6 Hrs)
1.5. Introduction to compiling: Compilers, Analysis of source program, the phases of compiler, compiler-construction tools.

1.6 A single One-Pass Compiler: syntax Definition, Syntax directed translation, Parsing, Translator for simple expression, Symbol Table, Abstract Stack Machines.

Unit 2: (19 Hrs)
2.4 Lexical Analysis: the role of lexical analyzer, Input buffering, specification of tokens, Recognition of tokens, Finite Automata, Regular Expression to an NFA, Design of a lexical analyzer generator 5 hrs.

2.5 Syntax Analysis: The role of parser, Context free grammars, Writing grammars, Top- down parsing, Bottom-up parsing, Operator-preceding parsing, LR parsing, Ambiguous grammar.

2.6 Syntax Directed Translation: Syntax-directed definition, syntax tree and its construction, Evaluation of S-attributed definitions-attributed, Top-down translation, recursive evaluators.

2.7 Type Checking: Type systems, specification of a single type checker, Type conversions.

Unit3: (13 Hrs)
3.3 Intermediate Code Generation: intermediate languages, Declarations, Assignments Statements, Boolean Expressions, Back Patching.

3.4 Code generator: Issue in design of a code generator, the target machine, Run-time storage management, Basic blocks and flow graphs, a simple code generator, peephole organization, Generating code from dags, Dynamic programming code generation algorithm, Code-generator generators.

3.5 Code Optimization: The principle sources of code optimization, Optimization of basic blocks, loops in flow graphs.

Unit 4: ( 7 Hrs)
4.6 Writing a Compilers: Planning a compiler, Approaches to compiler development, the compiler development environment, Testing and Maintenance.

4.7 Comparing some compilers: Pascal Compiler, C compiler, C++ compiler

Laboratory works:
1. Writing a compiler, optimization techniques, comparing the compilers.
2. Construction of Lexical Analyser.
3. Construction of Parser.
4. Development of Code Generator
5. Write a code to show the function of symbol table.
6. Implement the parsing techniques.
7. Show the application of different types of grammar.
8. Implement the lexical analyzer generator.
9. Implement the type conversation.
10. The course instructor is allowed to create a group two students.
a. Assign them to write a small compiler.

Homework

Assignments: Assignments should be given from the above units in throughout the semester.

Computer Usage: No Specific

Prerequisite: C, C++, Data Structure, Automata Theory

Category Content:
Science Aspect: 25%
Design Aspect: 75%

3. CSC-353: Web Technologies
Nature of course: Theory (3 Hrs) + Lab (3 Hrs)

Text/ Reference Books:

Matt J. Crouch, ASP.NET and VB.NET Web Programming, Pearson Education Asia, 2002. Rahul

Banerjee, Internetworking Technologies, Prentice-Hall of India Limited, Fourth Edition, 2000.
Course Synopsis: This course introduces the client server web technology.

Goal: To expose the students with the client and server side web programming.

Course Contents:

Unit 1. Introduction: ( 6 Hrs)
Review of web technology, review of HTML and JAVA Script

Unit 2.Issue of Web Technology: (6 Hrs)
Architectural issue of web layer, HTTP & FTP Protocols, Tier Technology: 2-Tier, 3-Tier and n-Tier

Unit3. The Client Tier: (12 Hrs)
Representing content, XML, DTD’s, Schemas, Stylesheets and Transformation: CSs, XSL/XSLT, SAX and DOM, Client-side Programming

Unit 4. The Server Tier: (20 Hrs)
Web Server Concept, Creating Dynamic Content, Using Control Flow to control Dynamic Control Generation, Sessions and State, Error handling, Authentication, Architecting web application, Using tag libraries, Writing tag libraries.

Unit 5. Introduction to Advanced Server Side Issues (3 Hrs)
Laboratory works: The laboratory should cover all the topics mentioned above.

4. CSC-354: Real Time System
Number of course: Theory (3 Hrs)

Text / Reference book:Real-Time Systems, Jane W.S. Liu, Pearson Education Asia, 2003
Course Synopsis: This course introduces the real time technology.

Goal: The main objective of this course is to address issue in scheduling, resource access control, and communication in real time system

Course Contents:

Unit 1. Introduction (3 Hrs)
Digital control, High-level controls, Signal processing, Real time applications

Unit 2 Hard versus Soft Real-Time Systems (4 Hrs)
Jobs and processors, Release times, Deadlines, and timing constraints, Hard and soft timing constraints, Hard real-time systems, Soft real-time constraints.

Unit3. Reference Model of Real-Time Systems (4 Hrs)
Processor and resources, Temporal parameter of real-time workload, Periodic task model, precedence constraints and data dependency, Other dependencies, Functional parameters, Resource parameters of jobs and parameters of resources, Scheduling hierarchy

Unit 4. Approaches to Real-Time Scheduling (4Hrs)

Clock-driven approach, Weighted round-robin approach, Priority-driven appropriate, Dynamic versus static system, Effective release times and deadlines, Optimality of the EDF and LST algorithms, Nonoptimality of the EDF and LST algorithms, Challenges in validating timing constraints in priority-driven systems, Off-line versus on-line scheduling.

Unit 5. Clock-Driven Scheduling (5 Hrs)
Notations and assumptions, Static, Timer-driver scheduler, General structure of cyclic schedules, Cyclic executives, Improving the average response time of aperiodic jobs, Scheduling sporadic jobs, Practical considerations and generalization, Algorithm for constructing static schedules, Pros and cons of clock-driven scheduling

Unit 6. Priority-Driven Scheduling of Periodic Tasks (6 Hrs)
Static assumption, Fixed-priority versus dynamic-priority algorithms, Maximum schedule utilization, Optimality of the RM and DM algorithms, A schedulability test for fixed-priority task with short response times, schedulability test for fixed-priority task with arbitrary response times, Sufficient schedulability conditions for the RM and DM algorithms, Practical factor

Unit 7. Scheduling Aperiodic and Sporadic Jobs in Priority-Driven Systems (6 Hrs)
Assumptions and approaches , Deferrable servers, Sporadic servers, Constant utilization, total bandwidth, and weighted fair-queuing servers, Slack stealing in deadline-driven systems, Slack stealing in fixed-priority systems, Scheduling of sporadic jobs, Real-time performance for jobs, with soft timing constraints, low-level scheme for integrated scheduling

Unit 8. Resources and Resource Access Control (5 Hrs)
Assumptions on resources and their usage, Effects of resources contention and resource access control, Nonpreemptive critical sections, Basic priority-inheritance protocol, Basic priority- ceiling protocol, Stack-based, priority-ceiling (ceiling-priority) protocol, Use of priority-ceiling protocol in dynamic-priority system, Preemption-ceiling protocol, Controlling accesses to multiple-unit resources, Controlling concurrent accesses to data objects,

Unit 9. Multiprocessor Scheduling, Resource Access Control and Synchronization (5 hrs)
Model of multiprocessor and distributed systems, Task assignment, Multiprocessor priority-ceiling protocol, Elements of Scheduling algorithms for end-end periodic tasks. End-to-end task in heterogeneous systems, Predictability and validation of dynamic multiprocessor systems.

Unit 10. Real-time Communication (6 Hrs)
Model of real-time communication, Priority-based service disciplines for switched networks, Weighted round-robin service disciplines, Medium access-control protocols of broadcast networks, Internet and resources reservation protocols, Real-time protocol, Communication in multi computer systems

Elective – Students have to select minimum of 2 courses.
5. CSC-355: Knowledge Management

Number of course: Theory (3 Hrs)

Text / Reference books:The Knowledge Management Tool Kit, Amrit Tiwana, Pearson Education Asia.
Course Synopsis: Study of knowledge intensive organization, knowledge management issues.

Goal: This course introduces fundamental concept of knowledge and different managerial issues in managing the knowledge.

Course Contents:

Unit 1. (16 Hrs)
1.7 Introduction of Knowledge Management: Knowledge and its importance, Definition of Knowledge, Knowledge management, from information to knowledge

1.8 The Knowledge Edge: A common theme, Intellectual Capital, Drivers of Knowledge Management, Knowledge-centric drivers, Technology drivers, Organizational structure based drivers, Personnel focused drivers, Process drivers, Economic drivers, Creating the knowledge edge.

1.9 From Information to Knowledge: Different between knowledge and information, from data to knowledge, Types of knowledge, the three fundamental steps, Knowledge management systems and existing technology. Business and Knowledge.

Unit 2: (20 Hrs)
2.8 Implementing Knowledge Management: The 10 step knowledge management road map, Infrastructure evaluation, Knowledge management system analysis Development, Metrics for performance evaluation.

2.9 The Leverage Infrastructure: Leveraging the Internet, Aligning knowledge management and business strategy. 2.10 Knowledge Management System Analysis, Design & Development:
Infrastructural foundation, Knowledge audit and analysis, Designing the knowledge management team, Creating knowledge management system blue print, Developing the knowledge management system.

Unit 3: (9 Hrs)
3.6 Knowledge Management System Development: Prototyping & development, Reward structure.

3.7 Metrics for Knowledge Work: Traditional Metrics, Pitfalls in choosing metrics.

3.8 Code Optimization: The principle sources of optimization, Optimization basic blocks, loops in flow graphs.

Laboratory works: Developing small scale KM project.

Homework
Assignment: Assignments should be given from the above units in throughout the semester.

Computer Usage: No Specific

Prerequisites: C, Management Information System

Category Content:
Science Aspect: 60%
Design Aspect: 40%

6. CSC-356: Fundamentals of E-Commerce

Number of course: Theory (3 Hrs)
Text/Reference books:

  • Frontiers of Electronic Commerce, 5th Edition, Kalkotia and Whinston, Pearson Education Asia.

Course Synopsis: Discussions on types of commerce, doing business in electronics, infrastructure of electronic commerce.

Goal: This course introduces basic concepts of commerce and discusses the basic needs of electronic commerce.

Course Contents:

Unit 1. (14 Hrs)
1.10 Introduction of Electronic Commerce: Introduction of commerce, Electronic commerce framework, electronic commerce and media convergence, the anatomy of e-commerce application.
1.11 The Network for Electronic Commerce: Need of network, market forces influencing the I-way, components of I-way, network access equipment, and global information distribution network.
1.12 The Internet as a Network Infrastructure: Introduction, the Internet terminology, NSFNET: Architecture and Components, Internet governance: The Internet Society.

Unit 2: (23 Hrs)
2.11 Network Security & Firewalls: Client-Server network security, security threats in client-server, firewalls and network security, data &message security, encrypted documents and electronic mail.
2.12 Electronic Commerce &World Wide Web: Introduction, architectural framework for electronic commerce, WWW as architecture, security in the web.
2.13 Consumer Oriented Electronic Commerce: Introduction, consumer oriented application, mercantile process models, mercantile models from the consumer’s perspective, mercantile models from the merchant’s perspective.
2.14 Electronic Payment Systems: Introduction, types of electronic payment system, digital token based electronic payment systems, smart cards and electronic payment systems, credit cards systems, Threat on electronic payment system.

Unit 3: (8 Hrs)
3.9 Inter-organizational Commerce & Electronic Data Interchange: Introduction, EDI application in the business, EDI: legal, security, and privacy issues, EDI and electronic commerce.
3.10 The Corporate Digital Library: Introduction, dimensions electronic commerce systems, types of digital documents, Issues behind document infrastructure, corporate data warehouses.

Laboratory works: Developing the small electronic payment system.

Homework

Assignments: Assignments should be given from the above units in throughout the semester.

Computer Usage: No Specific

Prerequisites: C, C++, Data Structure, System Analysis & Design

Category Content:
Science Aspect: 60%
Design Aspect: 40%

7. CSC-357: Society and Ethics in information Technology
Number of course: Theory (3 Hrs)
Text/Reference Books:

  • Chitrakar, Roshan and shrestha, Deepanjal (Compilation), A Manual of Social and Professional Issues in Information Technology, PAI, Kathmandu, 2005
  • Johnson, D.G., Computer Ethics, Pearson Education Asia, 2001 ISBN: 81-7808-306-X
  • Laudon, Kenneth C. and Laudon Jane P., Management Information Systems , Prentice Hall of India, New Delhi,1999 ISBN: 81-203-1282-1 Kanter. Jerome, Managing with Information, Prentice Hall of India, New Delhi, 1998 ISBN: 81-203-1012-8
  • Patnaik, Srikanta, First Text Book on Information Technology, Dhanpat Rai & Co., New Delhi, 2001 Govindarajan, M., Natarajan, S., and Senthilkumar, V. S., Engineering Ethics, Prentice Hall of India, New Delhi, 2004 ISBN: 81-203-2578-8

Course Synopsis: General introduction to society, ethics and profession and general understanding of professional environment.

Goal: This course provides general understandings of the social and ethical issues related with the practice of a profession taking special reference of IT profession.

Course Contents:

Unit 1. Society and Technology (8 Hrs)
Meaning of society and its characteristics, Theories of social change – Socio- cultural evolution , functional and conflict theory, Concept of technology and technological change ,General impact of technology on society, Impact of computer on society, Application, security, crimes and ethical issues related with IT

Unit2. Profession and Ethics (10 Hrs)
Meaning and characteristic of Profession, define ethics and distinguish between moral and non-moral action , Discussion on moral dilemma, Discussion ethical theories-Utilitarianism, Universalism, distributive justice and personal liberty, Introduction to professional society – its registration procedure, code of ethics applicable to IT profession and disciplinary action

Unit 3. Law, Policy and Institutions (15 Hrs)
Sources of law, Overview of law/policies/institutions affecting practice of IT profession, Types of business firms and their characteristics-private partnership and company, Introduction multinational companies and joint ventures, Define contract, Essentials of a valid contract, Void and voidable contract, Introduction to labor Act and Trade Union Act, Introduction to Nepalese cyber law and IT policy taking general reference to other countries-US, England, Japan, India and China

Unit 4. Introduction to Intellectual Property Rights (2 Hrs)
Copy rights, patent, trademarks, industrial design

Unit 5 Case Studies/ Group Discussions and Seminars (10 hrs)
In each unit, related cases will be discussed and group discussion will be held in the class as well as students will make presentations covering wide areas of society, ethics and profession.

Homework
Assignments: Assignments includes preparation for cases, group discussions and presentations in th class.

8. CSC-358: Automation and Robotics

Nature of course: Theory (3 Hrs) + Lab (3 Hrs)
References:

  • Jain K.C. and Aggarwal B.E., Robotics – Principles and Practice, Khanna Publishers
  • Mikell P. Weiss G.M., Nagel R.N., Odraj N.G., Industrial Robotics, McGraw Hill.
  • Ghosh, Control in Robotics and Automation: Sensor Based Integration, Allied Publishers.
  • Schuler, C.A. and McNamee, W.L. Modern Industrial Electronics, Macmillan/McGraw-Hill
  • Klafter R.D., Chimielewski T.A., Negin M., Robotic Engineering – An integrated approach, Prentice Hall of India.

Course Synopsis: This course has the idea of automation and robotics.

Goal: To provide students with information on how to apply robots and manufacturing automated systems with the basic principles underlying the design, analysis and synthesis of robotic systems.

Course Contents:

Unit 1. Introduction (6 Hrs)
Robot definition, Major Components, Human arm characteristics, Geometric motion configuration, Robot Classification, Direct and Indirect Drives, Characteristics of Robot Performance, Historical development of Robot, Degrees of freedom, Asimov’s laws of robotics, dynamic stabilization of robots.

Units 2. Power Sources and Sensors (8 Hrs)
Hydraulic, pneumatic and electric drives, determination of HP of motor and gearing ratio, variable speed arrangements, path determination, micro machines in robotics, machine vision, ranging, laser, acoustic, magnetic, fiber optic and tactile sensors.

Units 3. Manipulators, Actuators, and Grippers (8 Hrs)
Manipulators, Classification, Construction of Manipulators, Manipulator dynamics and force control, Electronic and pneumatic manipulator control, End effectors, Loads and Forces, Grippers, design considerations, Robot motion control, Position Sensing.

Unit 4. Kinematic Analysis (10 Hrs)
Manipulator Kinematics, Manipulator Geometry and Degrees of Freedom, Workspace and Joint Spaces, Coordinate Transformation, Rotation Matrices, and Transformation, Homogeneous Transformation, Translation Matrices, Orientation Specification, Rotation Matrices.

Units 5. Process Control (9 Hrs)
Process Control and Types, On-Off Control Systems, Proportional Control Systems, Proportional Plus Integral (PI) Control Systems, Three Mode Control (PID) Control Systems, Process Control Tuning.

Units 6. Other Issues
Robot Safety, Safety Hazards, Safety Measures, Economic Analysis and Installation, Robot Manufacturing Systems, Selection of a robot

9. CSC-359: Digital System Design

Nature of course: Theory (3 Hrs) + Lab (3 Hrs)
Text / References books:

  • Wolf, Wayne, Modern VLSI Design-Systems on Silicon, Third Edition, Pearson
  • Comer, David J. Digital Logic State Machine Design, Third Edition, Oxford University Press
  • Ashenden, Peter J., The Student’s Guide to VHDL, Morgan Kaufman

Course Synopsis: This course introduces the concepts of VLSI design and testing.

Goal: The course objective is to provide ample knowledge on digital design process with the VLSI design procedures and to enhance the knowledge of hardware design applying subsystem design with VHDL and FPGA.

Course Contents:

Unit 1. Introduction (5 Hrs)
Digital Systems and Integration, Electronic Design Automation, IC Manufacturing, Logic Families, IC Design Techniques, IC characteristics: fan-out, power dissipation, propagation delay, and noise margin of TTL and CMOS integrated circuit logic devices.

Unit 2. Logic Manipulation (5 Hrs)
DeMorgan’s Theorem, Canonical Forms, Minterm and Maxterm, implicant, prime implicant, K-Maps, Quine-McCluskey Method

Unit 3. Application Specific Devices (8 Hrs)
PROMs and EPROMs, Programmable Array Logic (PAL), Programmed Logic Array (PLA), Gate Arrays, Programmable Gate Array, Full Custom Design.

Unit 4. State Machine and Design (7 Hrs)
Mealy and Moore machines, state transition tables and diagrams, algorithmic state machine charts, Synchronous State Machine Design, Design of Input Forming Logic and Output Forming Logic of state machine.

Unit 4. VLSI Design (8 Hrs)
Transistors and Layouts, Fabrication Process, Design Rules, Layout design and tools, Logic gates, Combinational Logic Networks and Design, Sequential Systems and Design, Subsystem Design, Various Floor planning Methods, Off-Chip Connections.

Unit 5. Testing (6 Hrs)
Testing and Verification, Testing logic circuits, Combinational gate testing, Combinational network testing, Sequential Testing, Test vector generation, fault, fault model and fault detection, SA0, SA1, Design for Testability.

Unit 6. Hardware Description Languages (6 Hrs)
VHDL and its uses in programmable logic devices (PLDs) like FPGA

10. CSC-360: Net Centric Computing

Nature of course: Theory (3 Hrs) + Lab (3 Hrs)
Text / Reference book:

  • Active Server Pages 3, a Russell Jones, BPB Publications, New Delhi 2003.

Course Synopsis: This course explores the concepts of developing web technology.

Goal: To provide the knowledge of Web Centric Computing Using Active Server programming.

Course Contents:

Unit 1. Introduction (4 Hrs)
Behind the scenes: Introduction, benefit and application of ASP; Introduction to IIS: Features, properties and application of IIS and MMC, Virtual directory properties; ASP requirements: Need for ASP, Scripting capabilities, Recognizing individuals, Database access, State maintenance, ASP extensibility.

Unit 2. Intrinsic ASP Objects (6 Hrs)
The response object: ASP objects, Sending text with the response object and embedded quotes, Using variables, Other response; The request object; The application and server objects: Threads, Application variables and use, The server object, Limitation of application variables; The session object.

Unit 3. Writing Server-Side Code (8 Hrs)
Coding using VBScript and Jscript, The Scripting dictionary object, File access with ASP, Debugging ASP and error-handling

Unit 4. Using Components (5 Hrs)
The browser capabilities components: Difference between browser, Components properties/methods, working and capabilities; Other ASP components; Sending and receiving E-mail with ASP.

Unit 5. Accessing Database with ASP and ADO (7 Hrs)
Introduction to relational databases and SQL, Introduction to ADO, Accessing data with ADO, Controlling transactions in ASP

Unit 6. ASP Applications (7 Hrs)
Introduction to ASP applications, State maintenance in ASP applications, Controlling access and monitoring, Planning application, Develop a sample project using ASP.

Unit 7. Advanced ASP (8 Hrs)
Client-side scripting, Building own components, Automating active server pages, Efficiency and scalability

Laboratory works: Exercises covering all features of above.

11. CSC-361: Web Centric Computing

Nature of course: Theory (3 Hrs) + Lab (3 Hrs)
Text / Reference book:

  • The Complete Reference: Perl, Martin C. Brown, Tata McGraw-Hill Publishing Company Limited, 2001.

Course Synopsis: This course introduces the web data communication.

Goal: To provide the knowledge of Web Centric Computing Using Perl programming.

Course Contents:

Unit 1. Introduction (6 Hrs)
Net programming, Introduction to Perl, Parsing rules, Variables and data, Statements and control structures, Subroutines, packages and modules, Working with files, Data manipulation.

Unit 2. Complex Data Structure (4 Hrs)
Accessing packed data structures, References, Complex Structures, Objects, Using tie.

Unit 3. Networking (5 Hrs)
Obtaining networks information, the socket module, Socket communication, Using IO Socket, Graham Barr’s libnet bundle, Gisle Aas’ LWP Bundle, Application of system.

Unit 4. Database Systems (4 Hrs)
Text databases, DBM databases, Database file locking, Using the DBI and Win32 ODBC toolkits, SQL refresher.

Unit 5. Interprocessor Communication and Execution Enhancements (6 Hrs)
Processes, Signals, Pipes, Executing additional processes, Other function calls, System VIPC, Perl on the command line, Perl environment variables, Perl in Perl, Threads, Security.

Unit 6. User Interface Tools (4 Hrs)
Processing commands line arguments, Perl’s reporting mechanism, Working with a terminal, Using Tk.

Unit 7. Developing World Wide Web (6 Hrs)
HTML, Uniform resources locator, Web operation overview, The environment, The common gateway interface, Smarter web programming, The CGI module, Parsing HTML, Parsing XML, Debugging and testing CGI applications, Security.

Unit 8. Controlling, Extending and Embedding Perl (5 Hrs)
Warning, The strict Pragma, Other Perl Programs, Perl Internals, Perl’s Internal Structures, Extending Perl, Embedding Perl, Cooperating with other languages

Unit 9. Debugging, Tuning, Compiling, Documenting, and Distributing (5 Hrs)
Debugging techniques, Using a debugger, Traps for programmers of other languages, Optimization, Using dump, Using the compiler, Comparing script and executable speeds, Using the supplied documentation, Writing POD documentation, Converting POD to other formats, Functions support, Perl make files.

Laboratory works: Exercises covering all features of above.

12. CSC-362: Embedded System Programming

Nature of course: Theory (3 Hrs) + Lab (3 Hrs)
Text / Reference Book:

  • 1997, ISBN0-75063-237-2 S Heath, Embedded System Design, Butterworth-Heinemann
  • David E. Simon, An Embedded Software Primer, Pearson Education, 2001

Course Synopsis: This course explores the system integration and its issues.

Goal: To allow the student to study the design and development process for dedicated computer systems in relation to the environment in which they operate.

Course Contents:

Unit 1. Introduction (8 Hrs)
Overview of dedicated and automated systems and their specific requirements (robust design, environmental issues, temporal constraints, technological constraints, software systems); the product design cycle

Unit 2. System Specification and Integration (12 Hrs)
Developments of a system specification, including case studies, Evaluation and justification of the available levels of system integration (custom chip design through to turnkey-systems) and technological choice

Unit 3. Software Issues (11 Hrs)
Developments environment: compilers, linkers, debuggers, emulators, real time operating systems and kernels, Designing and implementing code for dedicated systems.

Unit 4. Hardware Issues (14 Hrs)
Choice of processors: I/O, memory, speed, integration, development facilities, economics; DSP devices, Interfacing to commonly used peripheral devices, Backplane Bus standards, Transducers: sensors for measuring physical phenomena, output devices such as power actuators and motors, Data transformation, signal conditioning and data conversion. The impact of EMC regulations on design practice

Laboratory works: The laboratory exercises should cover all the features mentioned above.

13. CSC-363: Image Processing

Nature of course: Theory (3 Hrs) + Lab (3 Hrs)
Text / Reference book:

  • K. Castlemann. “Digital Image Processing”, Prentice Hall of India Ltd., 1996
  • A. K. Jain, “Fundamental of Digital Image Processing”, Prentice Hall of India Pvt. Ltd., 1995
  • C. Gonzalez and P. Wintz, “Digital Image Processing”, Addision-Wesley Publishing, 1987
  • Sing_Tze Bow, M. Dekker, “Pattern Recognition and Image Processing”, 1992
  • M. James, “Pattern Recognition”, BSP professional books, 1987
  • P. Monique and M. Dekker, “Fundamentals of Pattern Recognition”, 1989

Course Synopsis: This course deals with image components.

Goal: To be familiar with processing of images, recognition of the pattern and their applications.

Course Contents:

Unit 1. Introduction to Digital Images Processing (4 Hrs)
Digital image representation, Digital image processing: Problems and applications, Elements of visual perception, Sampling and quantization, relationships between pixels.

Unit 2. Two-Dimensional Systems (5 Hrs)
Fourier Transform and Fast Fourier Transform, Other image transforms and their properties: Cosine transform, Sine transform, Haar transform.

Unit 3. Image Enhancement and Restoration (8 Hrs)
Point operations, contrast stretching, clipping and thresholding, digital negative, intensity level slicing, bit extraction, Histogram modeling: Equalization modification, specification, Spatial operations: Averaging, directional smoothing, median, filtering spatial low pass, high pass and band pass filtering, magnification by replication and interpolation.

Unit 4. Image Coding and Compression (4 Hrs)
Pixel coding: run length, bit plan, Predictive and inter-frame coding.

Unit 5.Introduction to Pattern Recognition and Images (3 Hrs)

Unit 6. Recognition and Classification (5 Hrs)
Recognition classification, Feature extraction, Models, Division of sample space

Unit 7. Grey Level Features Edges and Lines (6 Hrs)
Similarity and correlation, Template matching, Edge detection using templates, Edge detection using gradient models, model fitting, Line detection, problems with feature detectors.

Unit 8. Segmentation (3 Hrs)
Segmentation by thresholding, Regions for edges, line and curve detection

Unit 9. Frequency Approach and Transform Domain (3 Hrs)

Unit 10. Advanced Topics (4 Hrs)
Neural networks and their application to pattern recognition, Hopfield nets, Hamming nets, perception

Laboratory works: Developing programs of above features.