university of engineering & management, jaipur course ... · hygiene theory, alderfer’s erg...

UNIVERSITY OF ENGINEERING & MANAGEMENT, JAIPURCourse Description

Title of Course: Organizational BehaviorCourse Code: HU801L-T Scheme: 3-0 Course Credits: 2

Introduction:This course helps students to learn about the intricacies of work and politics within an organization. Thebasic outcome of this course would be:

• To understand the term organization• To understand how it works in professional field.• To brush up skills that will lead to success• To understand Leadership• To learn theories that will help to relate• To handle stress• To avoid conflicts• To understand the basics of workplace and beyond.

Objectives:Students in this course learn to get accustomed to workplace and they understand how to keep going inthis world called profession. This course teaches them to be more confident and the theories which talksabout the basic survival within the professional world.

Learning Outcomes:Knowledge:

1. Learning about organization2. Personality development3. Job satisfaction and factors responsible for the same4. Motivation theories5. Group behavior6. Communication process7. Organizational politics8. Handling stress

Course Contents:Unit 1: Organizational Behaviour: Definition, Importance, Historical Background, FundamentalConcepts of OB, Challenges and Opportunities for OB. Personality and Attitudes: Meaning ofpersonality, Personality Determinants and Traits, Development of Personality, Types of Attitudes, JobSatisfaction. Perception: Definition, Nature and Importance, Factors influencing Perception, PerceptualSelectivity, Link between Perception and Decision Making. Motivation: Definition, Theories ofMotivation Maslow’s Hierarchy of Needs Theory, McGregor’s Theory X & Y, Herzberg’s Motivation-Hygiene Theory, Alderfer’s ERG Theory, McClelland’s Theory of Needs, Vroom’s Expectancy Theory

Unit 2: Group Behaviour: Characteristics of Group, Types of Groups, Stages of Group Development,Group Decision Making. Communication: Communication Process, Direction ofCommunication, Barriers to Effective Communication. Leadership: Definition, Importance, Theories ofLeadership Styles.


Unit 3: Organizational Politics: Definition, Factors contributing to Political Behaviour. ConflictManagement: Traditional vis-a-vis Modern View of Conflict, Functional and Dysfunctional Conflict,Conflict Process, Negotiation – Bargaining Strategies, Negotiation Process.

Unit 4: Organizational Design: Various Organizational Structures and their Effects on Human Behaviour,Concepts of Organizational Climate and Organizational Culture.

Text BooksRobbins, S. P. & Judge, T.A.: Organizational Behavior, Pearson Education, 15th Edn.Resources, PHI, 10th Edn.


Title of Course: Advanced Computer ArchitectureCourse Code: CS801AL-T Scheme: 3-0 Course Credits: 3

Introduction:

This course focuses on modern advancements in parallel computer architecture, with emphasis onadvanced instruction level parallelism (ILP) and multiprocessor architectures. Topics include: advancedbranch prediction, data speculation, computation reuse, memory dependence prediction, trace caches,dynamic optimizations, checkpoint architectures, latency-tolerant processors, simultaneousmultithreading, speculative multithreading,virtual machines, message passing multiprocessors, UMA, NUMA and COMA shared-memorymultiprocessors, single-chip multiprocessors, wormhole routing techniques, cache coherence, memoryconsistency models, high performance synchronization methods, speculative lock elision andtransactional memory.

Objectives: 1. To enable students to understand the need for parallel processing.2. To give an exposure to the problems related to multiprocessing.3. To get an understanding of the recent trends in the field of Computer Architecture and identifyperformance related parameters.4. To impart understanding on different types of multi core architectures and multithreading.

Learning Outcomes: Upon successful completion of the course student should be able to:1. Modern multi-core processor micro-architectures and interconnect technologies, and be able to explaintheir evolution and be able to critically evaluate their design decisions.2. Be familiar with a variety of parallel architectures including high performance computing architectures.

Course Contents:

Unit 1: Computer Architecture and Organization- Review, Fundamentals of Computer Design,Technology Trends Cost Performance Analysis

Parallel Processing Architectures-Taxonomy-SISD, MISD, SIMD, MIMD,PRAM models Data andResource, Dependencies, Program Partitioning and Scheduling, Control Flow vs. Data Flow.

Unit 2: Network topologies - Static, Dynamic, Types of Networks RISC vs. CISC, Memory Hierarchy,Virtual Memory Concepts of Pipelining, Instruction Pipelining, dynamic pipelining, arithmetic pipelines.

Unit 3: Multiprocessors- Multi stage Networks, Cache Coherence, Synchronization, Message – passing,Vector Processing Principles – Instruction types, Compound, Vector Loops, ChainingArray Processors- Structure, Algorithms.

Unit 4: Data Flow Architecture -Graphs. Petri Nets, Static and Dynamic DFA, VLSI Computations,Parallel Programming Models, Languages, Compilers


Text Books1. Computer Architecture and Parallel Processing- Kai Hwang and A.Brigggs International Edition,McGrawHill2. Advanced Computer Architecture : D. Sima, T. fountain, P. Kacsuk, Pearson publication


Title of Course: Parallel ComputingCourse Code: CS801BL-T Scheme: 3-1 Course Credits: 3

Introduction:This course examines the environment of parallel processing, organization, pipelining, algorithms, andparallel programming basics. The Topics to be covered (tentatively) include:

• Pipelining and Data Parallelism• Parallel Processing organization• Parallel Algorithms• Linear system of equations• Parallel Programming Languages

Objectives:This is an introductory course on parallel computing, meant for graduate students in Computer Science.This course will teach practical aspects of parallel computing, so that you will be able to effectively useparallel machines. It will be particularly useful for those who plan to perform research on parallelcomputing. It should also be useful for those who want to learn programming multicore processors.

Learning Outcomes:Knowledge:At the end of this course, you should be able to accomplish the objectives given below.

Define terminology commonly used in parallel computing, such as efficiency and speedup. Describe different parallel architectures, inter-connect networks, programming models, and

algorithms for common operations such as matrix-vector multiplication. Given a problem, develop an efficient parallel algorithm to solve it. Given a parallel algorithm, analyze its time complexity as a function of the problem size and

number of processors. Given a parallel algorithm, an input to it, and the number of processors, show the steps performed

by that algorithm on that input. Given a parallel algorithm, implement it using MPI, OpenMP, pthreads, or a combination of MPI

and OpenMP. Given a parallel code, analyze its performance, determine computational bottlenecks, and

optimize the performance of the code. Given a parallel code, debug it and fix the errors. Given a problem, implement an efficient and correct code to solve it, analyze its performance,

and give convincing written and oral presentations explaining your achievements.Application:

1. To develop an efficient parallel algorithm to solve it2. To implement an efficient and correct code to solve it, analyze its performance, and giveconvincing written and oral presentations explaining your achievements.3. Given a parallel algorithm, implement it using MPI, OpenMP, pthreads, or a combination of MPIand OpenMP.

Course Contents:Unit 1: Introduction.-Parallel Processing Environment- Pipelining and Data Parallelism, Scalability,Flynn’s Taxonomy. Parallel Processing organization- Mesh, Hyper-tree, Pyramid, Butterfly, Hypercubenetwork.


Unit 2: Parallel Algorithms –Structure, cost, Analysis; Elementary Algorithms: Broadcast, Prefix sums,All sums Algorithms on Selection problem, Merging-Odd-even merging network, CREW Merging, N-arysearching Matrix Transposition, Matrix Multiplications- 2D Mesh SIMD, Hypercube SIMD, Shuffle-Exchange SIMD models. Discrete Fourier Transform, Fast Fourier Transform

Unit 3: Linear system of equations- Gaussian Elimination, Gauss-Seidel algorithm, Jacobi algorithmSorting – Enumeration sort, Odd-even transposition sort, Bitonic merge Ellis’s Algorithm

Unit 4: Graph Algorithms, Spanning Tree Algorithms, Parallel Programming Languages –FORTRAN 90,OCCAM

Text Books1. Parallel Computing –Theory and Practice -Michael J.Quinn (McGraw Hill Inc.)2. Design and Analysis of Parallel Algorithms- S.G. Akl (PH)


Title of Course: Natural Language ProcessingCourse Code: CS801CL-T Scheme: 3-0 Course Credits: 3

Introduction:This course examines the concepts of automata theory, regular expression, Word tokenization, LanguageModeling, Text Classification and context free grammar, Computational Lexical Semantics and manymore.Objectives:This course is designed to introduce you to some of the problems and solutions of NLP, and their relationto linguistics and statistics. You need to know how to program and use common data structures. It mightalso be nice—though it's not required—to have some previous familiarity with automata andprobabilities. At the end you should agreed that language is subtle and interesting, feel some ownershipover some of NLP's formal and statistical techniques, and be able to understand research papers in thefield.Learning Outcomes:Knowledge:1. The student will grow in confidence in their mathematical and statistical abilities. In particular, thestudent will understand the models, methods, and algorithms of statistical Natural Language Processing(NLP) for common NLP tasks, such as speech recognition, machine translation, spam filtering, textclassification, and spell checking.2. The student will apply core computer science concepts and algorithms, such as dynamic programming3. The student will gain understanding of linguistic phenomena and will explore the linguistic featuresrelevant to each NLP task.4. The student will apply the methods to new NLP problems and will be able to apply the methods toproblems outside NLP.5. The student will be familiar with some of the NLP literature and will read and suggest improvements topublished work. The student will see where opportunities for research await and prepare to conductresearch in NLP or related fields.Application:1. To implement probabilistic models in code, estimate parameters for such models, and run meaningfulexperiments to validate such models.2. To analyze experimental results and write reports for each course project to develop scientific writingskills.Course Contents:Unit-IIntroduction to NLP, Regular Expression, Finite State Automata. Word Tokenization, Normalization,Sentence Segmentation, Named Entity Recognition, Multi Word Extraction, Spell Checking – BayesianApproach, Minimum Edit Distance.Morphology – Inflectional and Derivational Morphology, Finite State Morphological Parsing, TheLexicon and Morphotactics, Morphological Parsing with Finite State Transducers, Orthographic Rulesand Finite State Transducers,Porter Stemmer.Unit-IILanguage Modeling :Introduction to N-grams, Chain Rule, Smoothing – Add-One Smoothing, Witten-Bell Discounting; Backoff, Deleted Interpolation, N-grams for Spelling and Word Prediction, Evaluationof language models. Hidden Markov Models and POS Tagging- Markov Chain, Hidden Markov Models,Forward Algorithm, Viterbi Algorithm, Part of Speech Tagging – Rule based and Machine Learningbased approaches, Evaluation


Unit-IIIText Classification, Naïve Bayes’ Text Classification, Evaluation, Sentiment Analysis – Opinion Miningand Emotion Analysis, Resources and Techniques. Context Free Grammar and Constituency, Somecommon CFG phenomena for English, Top-Down and Bottom-up parsing, Probabilistic Context FreeGrammar, Dependency Parsing.Unit-IVIntroduction to Lexical Semantics – Homonymy, Polysemy, Synonymy, Thesaurus – WordNet,Computational Lexical Semantics – Thesaurus based and Distributional Word Similarity. BooleanRetrieval, Term-document incidence, The Inverted Index, Query Optimization, Phrase Queries, RankedRetrieval– Term Frequency – Inverse Document Frequency based ranking, Zone Indexing, Query termproximity, Cosine ranking, Combining different features for ranking, Search Engine Evaluation,Relevance Feedback.

Text Book:1. Speech and Language Processing, Jurafsky and Martin, Pearson Education

Reference Book:1. Foundation of Statistical Natural Language Processing, Manning and Schutze, MIT Press


Title of Course: Cryptography & Network SecurityCourse Code: CS801DL-T Scheme: 3-0 Course Credits: 3

Introduction:With the growth of the Internet, the need for secured data transmission increased manifold. In fact itbecame a pre-condition to the usage of the Internet for business transaction. Therefore security is amajor concern in the Internet World.

Objectives:

We will study security from multiple perspectives. We will consider a variety of security policies,authentication before access, integrity of information, and confidentiality of information. The coursewill focus on the models, the tools, and the techniques for enforcement of security policies, with someemphasis on the use of cryptography. And because today’s implementation approaches are typicallyflawed, we will also address the penetration and disruption of information systems in the context ofoperating systems and networks.


1. You will understand the basic security services e.g. Authentication, Access Control,Confidentiality, Integrity, and Non repudiation)2. You will understand the concepts of risk, threats, vulnerabilities and attack.3. You will know the important ethical and legal issues to consider in computer security.4. You will know the goals of end-to-end data security.5. You will understand the role of random numbers and prime numbers in security.You will learn standard symmetric encryption algorithms6. You will learn the architecture for public and private key cryptography and how public keyInfrastructure (PKI) supports network security.7. You will learn the methods of digital signature and encryption.8. You will learn key management and how key exchange protocols work.9. You will learn security protocols at different layers of Network layer heirachy.10. You will learn futuristic cryptographic techniques like Eliptic Curve and quantum cryptography.11. You will learn the concept of trusted computing.12. You will learn the Web security Protocol.

Application :

1. Apply appropriate known cryptographic techniques for a given scenario.2. You will be able to analyze the tradeoffs of balancing key security properties.3 You will be able to design a security solution and do the cryptanalysis. .

Course Contents:

Unit 1: Attacks on Computers & Computer Security: Introduction, Need for Security, Securityapproaches, Principles of Security, Types of attack.

Unit 2: : Cryptography: Concepts & Techniques


Introduction, Plaintext & Cipher text, Substitution Techniques, Transposition Techniques, Encryption& Decryption, Symmetric & Asymmetric key Cryptography, Key Range & Key Size.Unit 3: Symmetric Key Algorithm Introduction, Algorithm types & Modes: Overview of SymmetricKey Cryptography, DES(Data Encryption Standard) algorithm, IDEA(International Data EncryptionAlgorithm) algorithm, RC5(Rivest Cipher 5) algorithm..Unit 4: Asymmetric Key Algorithm, Digital Signature and RSA Introduction: Overview ofAsymmetric key Cryptography, RSA algorithm, Symmetric & Asymmetric key Cryptographytogether, Digital Signature, Basic concepts of Message Digest and Hash Function (Algorithms onMessage Digest and Hash function not required).

Unit 5: Internet Security Protocols: User Authentication Basic Concepts, SSL protocol,Authentication Basics, Password, Authentication Token, Certificate based Authentication, BiometricAuthentication

Unit 6 : Electronic Mail Security :Basics of mail security, Pretty Good Privacy, S/MIME.

Unit 7 : Firewall: Introduction, Types of firewall, Firewall Configurations, DMZ Network

Text Books

1. “Cryptography and Network Security”, William Stallings, 2nd Edition, Pearson Education Asia2. “Network Security private communication in a public world”, C. Kaufman, R. Perlman and M.Speciner, Pearson3. Cryptography & Network Security: AtulKahate, TMH.

Reference :

1. “Network Security Essentials: Applications and Standards” by William Stallings, Pearson2. “Designing Network Security”, MerikeKaeo, 2nd Edition, Pearson Books3. “Building Internet Firewalls”, Elizabeth D. Zwicky, Simon Cooper, D. Brent Chapman, 2ndEdition, Oreilly4. “Practical Unix & Internet Security”, SimsonGarfinkel, Gene Spafford, Alan Schwartz, 3rd Edition,Oreilly


Title of Course: Cyber Law & Security PolicyCourse Code: CS802BL-T Scheme: 3-0 Course Credits: 3

Introduction:Information has never been so ubiquitous, valuable, or available. However, with the significant

growth in information created, stored, processed and transmitted across Information Technology (IT)systems and networks – often of a sensitive or personal nature – comes the need to protect thatinformation from a range of threats. Similarly the infrastructure that we come to rely on in business,government and society – whether it be for communications, utility, public or business service – must beprotected from these threats as it is typically controlled by information that is processed and transmittedacross IT systems, IT-enabled control systems and networks. The threats can range from professionalcriminals making their living from stealing information to well-intentioned employees or individualsmaking mistakes in the way they use applications or IT, or acts of social protest and terrorism. Protectinginformation along with the IT systems, control systems, networks and devices processing that informationis now recognised as an industry, a profession and an academic discipline in its own right. However, ITsystems, control systems, networks, websites and applications are typically designed or built by peoplewho do not give adequate consideration for this need. As a result, IT systems, control systems, networks,websites and applications typically: contain well-known errors; are deployed with well-known defaultsettings that leave the systems open to exploit; and leave the information and organisations they supportvulnerable to compromise. This situation has given rise to an acknowledged and growing prevalence ofattack, compromise and loss, fuelling recognition for the need to develop cybersecurity knowledge andskill within the disciplines responsible for networks and IT systems, including within the academiccourses that lead or prepare students to pursue a career in these areas. (ISC)2 , the largest not-for-profitmembership body of certified information and software security professionals worldwide, with over100,000 members and The Council of Professors and Heads of Computing (CPHC), brought together awide-ranging group of industry and academic experts to identify the key concepts related to cybersecuritythat can be embedded across undergraduate computing science and IT-related (e.g. business informationsystems and IT management for business) degree courses. This guide is the result of this effort, designedto help enrich those computing courses by providing the key cybersecurity principles and suggestedlearning outcomes. The concepts covered here are outlined for five themes: information and risk; threatsand attacks; cybersecurity architecture and operations; secure systems and products; and cybersecuritymanagement, to satisfy Level 4 requirements as stated in The framework for higher educationqualifications in England, Wales and Northern Ireland August 2008. Advanced concepts and furtherlearning outcomes are also provided for each theme, so that academic institutions can develop or enhancetheir courses to meet Level 5 and 6 requirements of the framework. The descriptors for all three levels (4– 6) are presented in Annex A. They are developed to support accreditation guidelines used by BCS, TheChartered Institute for IT (BCS) and Institution of Engineering and Technology (IET).

Objectives:In this course we will study the basic components of an operating system, their functions,

mechanisms, policies and techniques used in their implementation and examples from popular operatingsystems. The way different modules in the operating system interact and work together to provide thebasic services of an operating system.


Students should understand that information: Q is an organizational asset that has utility, and avalue – which may be relative depending on the perspective taken, and therefore can be classified toreflect its importance to an organization or individual Q is vulnerable to threats in systems Q has the


attributes relating to confidentiality, possession or control, integrity, authenticity, availability, and utility,any of which can make it vulnerable to attack may need to be protected – and some of the reasons whythat protection must occur (for example, legal and regulatory drivers, customer rights or organizationobjectives) Q has a lifecycle – from creation through to deletion – and protection may be required andmay change throughout that lifecycle Q that information risk management is a term referring to theprocess of documenting what information is at risk, type and level of risk realized; and the impact ofrealization.

Application:1. Downloading/copying/extraction of data or extracts any data2. Introduction of computer contaminant, or computer virus3. Causing damage either to the computer resource or data residing on it4. Disruption5. Denial of access6. Facilitating access by an unauthorized person7. Charging the services availed of by a person to the account of another person,8. Destruction or diminishing of value of information9. Stealing, concealing, destroying or altering source code with an intention

Course Contents:Unit 1: Introduction of Cybercrime: What is cybercrime? Forgery, Hacking, Software Piracy, ComputerNetwork intrusion

Unit 2: Category of Cybercrime: how criminals plan attacks, passive attack, Active attacks,cyberstalking.

Unit 3: Cybercrime Mobile & Wireless devices: Security challenges posted by mobile devices,cryptographic security for mobile devices, Attacks on mobile/cell phones, Theft, Virus, Hacking.Bluetooth; Different viruses on laptop

Unit 4: Tools and Methods used in Cyber crime: Proxy servers, panword checking, Random checking,Trojan Horses and Backdoors; DOS & DDOS attacks; SQL injection: buffer over flow

Unit 5: Phishing & Identity Theft: Phising methods, ID Theft; Online identity method.Unit 6: Cybercrime & Cybersecurity: Legal aspects, indian laws, IT act, Public key certificate

Text Books1. Cyber security by Nina Gobole & Sunit Belapune; Pub: Wiley India.

References1. E-Commerce- The cutting edge of business by Kamlesh K. Bajaj, TMH2. Cyber Law Of Information Technology And Internet by Anirudh Rastogi, First Edition3. Open Source And The Law by Priti Suri & Associates, First Edition


Title of Course: Optical NetworkingCourse Code: CS802CL-T Scheme: 3-0 Course Credits: 3

Introduction:

The main purpose of this course is to introduce students the important areasof communication networks,mainly optical networks and photonic switching. This will enable the studentsto acquire a solidunderstanding of foundations of optical networks technologies, systems, networks issues aswell aseconomic deployment considerations and also photonic switching. The aim of this course is to provide thestudents with a basic understanding of what optical networks are, and how they work.

Objectives:

The objective of the course is to provide a comprehensive understanding of optical communicationsystems and networks.1. To get a basic understanding of physical properties of optical networks.2. To get a profound understanding of protocols applied in optical networks: MPLS, GMPLS, MPLS-TP,

Ethernet PBB-TE.3. To get a profound understanding of optical switching methods and networking techniques, circuit,

packet, hybrid, burst and flow.4. To get a basic understanding of optical components and optical node design.


After the course the students should be able to:

1. Solve a simple WDM network design and optimization problems2. Define the main limitations and possibilities of the optical network technologies3. Define the main differences between optical networking and traditional networking4. Explain the benefits of optical layer survivability5. Describe the main issues in management and control of optical networks.

Course Contents:Unit 1: Basicsof Opticalcommunications-:Sources.Transmitters.Modulators.Opticalfiber.Photodetectors, and Receivers.Switchingin networks.Circuitswitched. Packetswitched. Cellswitched.Virtualcircuitswitched.Burstswitched(fastcircuitswitched).TransmissionAsynchronous, Synchronous.Layeringin packetswitchednetworks.Motivation.Commonlyusedabstraction,Physicallayer.Datalinklayer.Networklayer.Transportlayer.Applicationlayer.Layeringincircuitswitchednetworks.Physicallayer.Multiplexingstandards.Signaling- CAS, CCS.SS7concept.

Unit 2: Dataplane, managementplane, controlplane- concept.Firstgenerationnetworks.SDH/SONET.Computerinterconnections- ESCON,FiberChannel,HIPPI.FDDI.ATM.DQDB.


Components– description.Modelockedlaser(forpspulses).Tunablefilters.Multiplexers.Demultiplexers.Tunablewavelengthconvertors. Opticalamplifiers. a. Fiber- EDFA. b. SOA,Tunabletransmitters.Tunablereceivers.Dispersioncompensatingfibers.Multiplexingtechniques.SDM, TDMA, WDMA(OFDMA), DWDM, SCM, CDMA.

Unit 3: Protocolsforsinglechannelbroadcastnetworks. (recapitulation)ALOHA, CSMA/CD, Problemswith CSMA/CD, Definitionofhighspeednetwork.Classificationof multipleaccessmethods.(recapitulation)Random access, Reserved access, Scheduledaccess.Multi-channelmultipleaccessprotocols.Desirablecharactersticksof protocol, Scalability, Fairness, TTTR, TTFR, FTTR, FTFR,Problemofwavelengthstability.MultihopWDMnetwork.Shuffle net, MSN.Wavelengthroutednetworks.Mesh, Ring-Trafficgroomingproblem.

Unit 4: IPoverOpticalframework.ASON, MPëS, Burstswitchednetwork(bufferlessnetworks), All-opticalcircuit switches, All-opticalpacketswitches. Broadcastandselect. Wavelengthrouted. Spaceswitchbased. Discussiononvariousswitcharchitectures. Packetbufferingtechniques. Travellingtype. Recirculatingtype.Protectionandrestoration.Restorationmechanism.Restorationtimingissues. Pathprotection.Spanprotection. P-cycles

Text Books

1. WDMNetworks:BiswanathMukherjee.2. OpticalNetworks- APracticalPerspective:RajivRamaswamy&KumarSivarajan.


Title of Course: Low Power Circuits & SystemsCourse Code: CS802DL-T Scheme: 3-0 Course Credits: 3

Introduction:The unit covers deep submicron CMOS technology and digital CMOS design styles, sources andmechanisms of power dissipation in CMOS integrated circuits, modeling power at different levels andprobabilistic power analysis. Power optimization and special circuit techniques are also covered. Othertopics include: logic minimization and synthesis for low power, low voltage technologies, low powerclock distribution and asynchronous design.

Learning Outcomes:On completion of this unit students should be able to

1. classify the mechanisms of power dissipation in CMOS integrated circuits;2. model power dissipation and use optimization methods on various levels;3. apply in practice technology-level, circuit-level, and system-level power optimization techniques.4. Recognize advanced issues in VLSI systems, specific to the deep-submicron silicon technologies;

Course Contents:

1. Basics of MOS circuits: MOS Transistor structure and device modeling; MOS Inverters; MOSCombinational Circuits–Different Logic Families,

2. Sources of Power dissipation: Dynamic Power Dissipation: Short Circuit Power; SwitchingPower; Gliching Power:Static Power Dissipation

3. Supply Voltage Scaling Approaches: Device feature sizes caling; Multi-Vdd Circuits;Architectural level approaches: Parallelism, Pipelining; Voltage scaling using high-leveltransformations; Dynamic voltage scaling; Power Management.

4. Switched Capacitance Minimization Approaches: Hardware Software Trade off; BusEncoding; Two’s complement VsSign Magnitude; Architectural optimization; Clock Gating;Logicstyles

5. Leakage Power minimization Approaches: Variable-threshold-voltage CMOS (VTCMOS)approach; Multi-threshold-voltage CMOS (MTCMOS) approach; Dual-Vt assignment approach(DTCMOS); Transistor stacking.

Special Topics: Adiabatic Switching Circuits; Battery-aware Synthesis; Variation to lerantdesign

References:1. Sung_MoKang, YusufLeblebici,CMOSDigitalIntegratedCircuits,TataMcGrawHill2.NeilH.E.WesteandK.Eshraghian,PrinciplesofCMOSVLSIDesign,2ndEdition,AddisonWesley(Indianreprint).3. Bellamour,andM.I.Elmasri,LowPowerVLSICMOSCircuitDesign,KluwerAcademicPress,1995


4. AnanthaP.ChandrakasanandRobertW.Brodersen,LowPowerDigitalCMOSDesign,KluwerAcademicPublishers,19955. KaushikRoyandSharatC.Prasad,Low-PowerCMOSVLSIDesign,Wiley-Interscience,2000


Title of Course: E-CommerceCourse Code: CS802EL-T Scheme: 3-0 Course Credits: 3

Introduction:This course examines E-Commerce concepts, and Business technique basics. The Topics to be covered(tentatively) include:

• Introduction• Business to Business E-Commerce• Legal issues• Security Issues• Business to Consumer E-Commerce• E-business

Objectives:In this course we will study the basic components of an E-Commerce, their functions, mechanisms,policies and techniques used in their implementation and examples from popular E-CommerceApplication. The way different modules in the E-Commerce interact and work together to provide thebasic services of an E-Commerce.

Learning Outcomes:Knowledge:1. Understand the theory and logic behind the design and construction of E-Business.2. You will differentiate between various E-commerce functionalities in terms of performance.3. Become aware of the issues in the management of resources like EDI,SET,RSA etc.4. Know the problems in the design of E-Commerce and study the probable solutions.5. Understanding various type of Business policies.6. An overview of advanced E-Commerce and compare the technical aspects of all the advanced E-

Commerce.Application:1. To develop, implement, and debug various VB & ASP.2. To develop, implement, and demonstrate the algorithms of EDI.4. To develop E-Business.

Course Contents:Unit 1: Definition, Scope of E-Commerce, Hardware requirements, E-Commerce and Trade Cycle,Electronic Markets, Electronic Data Interchange and Internet Commerce.

Unit 2: Electronic Markets, Electronic Data Interchange (EDI): Technology, Standards (UN/EDIFACT),Communications, Implementations, Agreements, Security, EDI and Business, Inter-Organizational E-commerce.

Unit 3: Risks: Paper Document vs. Electronic document, Authentication of Electronic document, Laws,Legal issues for Internet Commerce: Trade marks and Domain names, Copyright, Jurisdiction issues,Service provider liability, Enforceable online contract.Unit 4: Security Solutions: Symmetric and Asymmetric Cryptosystems, RSA, DES, and Digital

Signature, Protocols for secure messaging, Secure Electronic Transaction(SET) Protocol, Electronic cashover internet, Internet Security .


Unit 5: Consumer trade transaction, Internet, Page on the Web, Elements of E-Commerce with VB,ASP,SQL.

Unit 6: Internet book shops, Software supplies and support, Electronic Newspapers, Internet Banking,Virtual Auctions, Online Share Dealing, Gambling on the net, E-Diversity, Case studies through internet.

Text Books1. E- Commerce-Strategy, Technologies & Applications by David Whitley, TMH.2. Beginning E-Commerce with VB, ASP, SQL Server7.0 & MTS by Mathew Reynolds, WroxPublishers.

References1. E-Commerce-The cutting edge of business by Kamlesh K.Bajaj, TMH.


Title of Course: RoboticsCourse Code: CS802FL-T Scheme: 3 Course Credits: 3

Introduction:This course introduces fundamental concepts in robotics. The objective of the course is to provide anintroductory understanding of robotics. Students will be exposed to a broad range of topics in roboticswith emphasis on basics of manipulators, coordinate transformation and kinematics, trajectory planning,control techniques, sensors and devices, robot applications and economics analysis.Course covers fundamentals of robot working, programming and integration in a manufacturing process.It startswith examples of robotics idea over history and continue with a numerous of examples innowadays robotapplications on different areas of human activities. Topics to be covered include robotmechanical, power,measuring and control system, robot kinematics, dynamic, control and programming.Special chapter of mobilerobots will cover mobile robot kinematics, path planning and control. Overviewof nowadays research in roboticsand view of the robotics impact in human future.

Objectives:

1. To be familiar with the automation and brief history of robot and applications.2. To give the student familiarities with the kinematics of robots.3. To give knowledge about robot end effectors and their design.4. To learn about Robot Programming methods & Languages of robot.5. To give knowledge about various Sensors and their applications in robots.


1. Students will be equipped with the automation and brief history of robot and applications.2. Students will be familiarized with the kinematic motions of robot.3. Students will have good knowledge about robot end effectors and their design concepts.4. Students will be equipped with the Programming methods & various Languages ofrobots.5. Students will be equipped with the principles of various Sensors and their applications inrobots.6. Importance of robotics in today and future goods productionrobot configuration and subsystems7. Principles of robot programming and handle with typical robot8. Working of mobile robots

Application:

Current and potential applications include:

1. Military robots2. Space Robotics3. Underwater Robotics4. Electric Mobility5. Logistics, Production and Consumer (LPC)6. Search and Rescue (SAR) & Security Robotics7. Assistance- and Rehabilitation Systems8. Agricultural Robotics


9. Domestic robots, cleaning and caring for the elderly10. Medical robots performing low-invasive surgery11. Nano robots

Course Contents:

Unit 1: IntroductionBrief history, types, classification and usage, Science and Technology of robots, Some useful websites,text books and research journals.

Unit 2: Elements of robots–links, joints, actuators, and sensorsPosition and orientation of a rigid body, Homogeneous transformations, Representation of joints, linkrepresentation using D-Hparameters, Examples of D-H parameters and link transforms, different kinds ofactuators–stepper, DC servo and brush less motors, model of a DC servo motor, Types of transmissions,Purpose of sensors, internal and external sensors, common sensors–encoders, tachometers, strain gaugebased force-torque sensors, proximity and distance measuring sensors, and vision.

Unit 3: Kinematicsof serial robotsIntroduction, Direct and inverse kinematics problems, Examples of kinematics of common Serialmanipulators, workspace of a serial robot, Inverse kinematics of constrained and redundant robots,Tractrix based approach or fixed and free robots and multi-body systems, simulations and experiments,Solution procedures using theory of elimination,Inversekinematicssolutionforthegeneral6Rserialmanipulator.

Unit 4: Kinematicsof parallelrobotsDegrees-of-freedomofparallelmechanismsandmanipulators,Activeandpassivejoints,Constraintandloop-closureequations,Directkinematicsproblem,Mobilityofparallel manipulators, Closed-from and numericalsolution, Inverse kinematics of parallel manipulator sand mechanisms, Direct kinematics of Gough-Stewart platform.

Unit 5: Velocityandstaticanalysisof robotmanipulatorsLinear and angular velocity of links, Velocity propagation, Manipulator Jacobians for serial and parallelmanipulators, Velocity ellipse and ellipsoids, Singularity analysis for serial and parallel manipulators,Loss and gain of degree of freedom, Statics of serial and parallel manipulators, Statics and for cetransformation matrix of a Gough-Stewart platform, Singularity analysis and statics.

Unit 6: Dynamicsof serialand parallel manipulatorsMass and inertia of links, Lagrangian formulation for equations of motion for serial and parallelmanipulators, Generation of symbolic equations of motion using a computer, Simulation(direct andinverse) of dynamic equations of motion,Examplesofaplanar2R and four-bar mechanism, Recursivedynamics, Commercially available multi-body simulation software (ADAMS)and Computer algebrasoftware Maple.

Unit 7: Motion planning and controlJoint and Cartesian space trajectory planning and generation, Classical control concepts using theexample of control of a single link, Independent joint PID control, Control of a multi-link manipulator,Non-linear model based control schemes, Simulation and experimental case studies on serial and parallelmanipulators, Control of constrained manipulators, Cartesian control, Force control and hybrid position/force control, Advanced to picsinnon-linearcontrol of manipulators.


Unit 8: Modelingandcontrolof flexiblerobotsModels of flexible links and joints, Kinematic modeling of multi-link flexible robots, Dynamics andcontrol of flexible ink manipulators, Numerical simulations results, Experiments with a planar two-linkflexible manipulator.

Unit 9: ModelingandanalysisofwheeledmobilerobotsIntroduction and some well-known wheeled mobile robots(WMR),two and three-wheeled WMR on flatsurfaces, Slip and its modeling, WM Ronuneventerra in, Design of slip-free motion on uneven terrain,Kinematics, dynamics and staticst ability of a three-wheeled WMR’son uneventerra in, Simulations usingMatlab and ADAMS.

Unit 10: SelectedadvancedtopicsinroboticsIntroduction to chaos, Non-linear dynamics and chaos in robot equations, Simulations of Planar 2DOFmanipulators, Analytical criterion for unforced motion. Gough-Stewart platform and its singularities, useof near singularity for fine motion for sensing, design of Gough-Stewartplatformbasedsensors.Over-constrainedmechanismsanddeployablestructures,Algorithmto obtain redundant links andjoints,Kinematics and statics of deploy able structure swith pantograph sorsciss or-like elements(SLE’s).

Text Books

1. K.SFuR.C.CSGLee-RoboticsControl,Sensing,Vision&Intelligence,McGraw-Hill.2.M.P.Groover,M.Weins,R.N.Nagel,N.C.Odrey–IndustrialRobotics,McGrawHill


Title of Course: Advanced Computer Architecture LabCourse Code: CS891AL-T-P Scheme: 0-0-3 Course Credits: 3

Objectives:Students must have already registered for the course, Electrical Circuits Lab, Electronic Devices andCircuits Lab, Digital Electronics Lab & Microprocessors and Controllers Lab.

1. To learn the students how to develop, implement and debug assembly language,VLSI programs that meet the stated specifications.

2. Students should learn how the machine level (Low) languages controlscomponents of a CPU, I/O and memory subsystems.

Learning Outcome:

The Course will be covered through assignment practical Labs, Some Section of the course willinclude additional reading in the research literature (e.g. research paper on high performancecomputer Architecture) to allow them to see how the leading edge is advanced in this area of thediscipline. In practical Labs different software tools like MASM, Circuit Maker, Xilinx etc are used tomake all theoretical concepts into practical examples.

Course Contents:

Unit-1: Implementation of logic gates circuits, circuits of Boolean algebra and its functions,combinational circuits – logic functions, multiplexers, decoders & encoders, half and full adder,binary adder and subtract or, binary incremental, counters.

Unit-2: Registers- shift registers, register with parallel load, connection of various registersaccording to register transfer operations. Sequential circuits, integrated circuits.

Unit-3: Construction of common BUS. Implementation of various arithmetic, logic and shift micro-operations.

Unit-4: Design of ALU, Design of basic computer, design of timing and control circuit of variouscomponents and registers of processor. Implementation of memory reference, register referenceinstructions.

Unit-5: Assemble language programs using MASM tool -basic programs, program loops,programming of arithmetic and logic operations, subroutines, input/output programs.

Text Books:

1. “The Art of Assembly Language Programming” by Randy Hyde.

2. “VHDL Primer” by Bhasker.References Books:

1. “Computer System Organisation and Architecture: Designing for Performance”by W Stallings, Seventh Edition, Prentice Hall, 2006. ISBN: 0-13-185644-8

2. Yu-cheng Liu,Glenn A. Gibson , “The 8086/8088 Family Architecture,Programming & design”, Second Edition, PHI.

3. Douglas Hall, “Microprocessors & Interfacing, Programming & Hardware”,2ndEdn. Tata McGraw Hill.

4. Kenneth Ayala “The 8086 microprocessor programming and Interfacing the PC”.

5. Tom Shanley, Protected Mode Software Architecture, Addison-Wesley (1996), ISBN 0-201-55447-X


Title of Course: Parallel Computing LabCourse Code: CS891BL-T-P scheme: 0-0-3 Course Credit: 2

Objectives:To learn and understand the concepts of parallel processing, designing the parallel algorithm,interfacing and communication between multiple processors, analyzing the complexity of parallelalgorithm.

Learning Outcomes: The students will have a detailed knowledge of the concepts of parallelprocessing, designing the parallel algorithm, interfacing and communication between multipleprocessors, analyzing the complexity of parallel algorithm. Upon the completion of ParallelComputing practical course, the student will be able to:

Understand and implement basic services and functionalities of parallel processing. To understand the interfacing between multiple computers. Understand the benefits of thread over process and implement synchronized programs using

multithreading concepts. Analyze the complexity of parallel algorithm Design and analysis of parallel algorithm Simulate sub programs in parallel through multiple computers..

Course Contents:Exercises that must be done in this course are listed below:Exercise No.1: Basic arithmetic operations in parallelExercise No. 2: Quick Sort through parallel processingExercise No. 3: Generation of Fibonacci series, finding prime numbers in an intervalExercise No. 4: Matrix Multiplication by parallel computersExercise No. 5: Parallel Tree TraversalsExercise No. 6: Enumeration sortExercise No. 7: Odd-Even Transposition sort

Text Book:1. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to Algorithms”2. E.Horowitz and Shani “Fundamentals of Computer Algorithms”

Recommended Systems/Software Requirements:1. Intel based desktop PC with minimum of 166 MHZ or faster processor with at least 64 MB RAM

and 100 MB free disk space.2. Turbo C or TC3 complier in Windows XP or Linux Operating System


Title of Course: Natural Language Processing LabCourse Code: CS891CL-T-P scheme: 0-0-3 Course Credit: 3

Objectives:The objective of Natural Language Processing lab is to introduce the students with the basics of NLPwhich will empower them for developing advanced NLP tools and solving practical problems in thefield.

Learning Outcomes: The experiments in this lab are arranged in a logical sequence to inculcate anew concept at every step, starting from very basic ones to advanced ones.The students by taking up projects on these domains will learn then once of these domainswhich will definitely help them better in landing up in such companies or continue theirMasters/Research in the similar or related domains.

Course Contents:Exercises that must be done in this course are listed below:

Exercise No.1: Word AnalysisExercise No. 2: Word GenerationExercise No. 3: MorphologyExercise No. 4: N-GramsExercise No. 5: N-Grams SmoothingExercise No. 6: POS Tagging: Hidden Markov ModelExercise No. 7: POS Tagging: Viterbi DecodingExercise No. 8: Building POS TaggerExercise No. 9: ChunkingExercise No. 10: Building Chunker

Text Book:1. Akshar Bharati, Rajeev Sangal and Vineet Chaitanya: "Natural Language Processing: A PaninianPerspective", Prentice-Hall of India , New Delhi, 1995.

Recommended Systems/Software Requirements:

1. Six PCs with the following specification2. Intel Core i3 (4th Gen) Processor3. 19.5 Inches Screen4. Touch screen Support5. 1 TB Hard Drive6. 4 GB DDR3 RAM7. Windows 8.18. Two LAN connections for the Pcs.9. Wireless Internet access.


Title of Course: Cryptography & Network Security LabCourse Code: CS801DL-T Scheme: 3-0 Course Credits: 3

Introduction:With the growth of the Internet, the need for secured data transmission increased manifold. In fact itbecame a pre-condition to the usage of the Internet for business transaction. Therefore security is amajor concern in the Internet World.

Objectives:

We will study security from multiple perspectives. We will consider a variety of security policies,authentication before access, integrity of information, and confidentiality of information. The coursewill focus on the models, the tools, and the techniques for enforcement of security policies, with someemphasis on the use of cryptography. And because today’s implementation approaches are typicallyflawed, we will also address the penetration and disruption of information systems in the context ofoperating systems and networks.


1. You will understand the basic security services e.g. Authentication, Access Control,Confidentiality, Integrity, and Non repudiation)2. You will understand the concepts of risk, threats, vulnerabilities and attack.3. You will know the important ethical and legal issues to consider in computer security.4. You will know the goals of end-to-end data security.5. You will understand the role of random numbers and prime numbers in security.You will learn standard symmetric encryption algorithms6. You will learn the architecture for public and private key cryptography and how public keyInfrastructure (PKI) supports network security.7. You will learn the methods of digital signature and encryption.8. You will learn key management and how key exchange protocols work.9. You will learn security protocols at different layers of Network layer heirachy.10. You will learn futuristic cryptographic techniques like Eliptic Curve and quantum cryptography.11. You will learn the concept of trusted computing.12. You will learn the Web security Protocol.

Application:

1. Apply appropriate known cryptographic techniques for a given scenario.2. You will be able to analyze the tradeoffs of balancing key security properties.3 You will be able to design a security solution and do the cryptanalysis. .

Course Contents:

Text Books


1. “Cryptography and Network Security”, William Stallings, 2nd Edition, Pearson Education Asia2. “Network Security private communication in a public world”, C. Kaufman, R. Perlman and M.Speciner, Pearson3. Cryptography & Network Security: AtulKahate, TMH.

Reference :

1. “Network Security Essentials: Applications and Standards” by William Stallings, Pearson2. “Designing Network Security”, MerikeKaeo, 2nd Edition, Pearson Books3. “Building Internet Firewalls”, Elizabeth D. Zwicky, Simon Cooper, D. Brent Chapman, 2ndEdition, Oreilly4. “Practical Unix & Internet Security”, SimsonGarfinkel, Gene Spafford, Alan Schwartz, 3rd Edition,Oreilly


Title of Course: Grand VivaCourse Code: CS881L-T –P Scheme: 0P Course Credits: 4

Aims and Objectives

1. To compare the traditional viva examination (TVE) with OSVE (Objective Structured VivaExamination).

2. To obtain the students’ opinion regarding OSVE as an assessment tool.

3. A suggestion to include OSVE as a part of university examination.

Materials and Methods

The study was carried out in November 2012, at K.J. Somaiya Medical College, in thedepartment of Anatomy. 50 students were exposed to different stations of viva as well as OSVE.A comparison was made of the student’s performance and a feedback was taken from thestudents regarding the same.

As the OSVE was being conducted for the first time, the students were notified in advanceregarding the plan for conducting the part ending practical assessment – by both the TVE andOSVE. The OSVE was planned for 20 marks, viva voce of 20 marks.

Purpose and Format of the Viva Voce Examination

Literally, "viva voce" means by or with the living voice - i.e., by word of mouth as opposed to

writing. So the viva examination is where you will give a verbal defence of your thesis.

Put simply, you should think of it as a verbal counterpart to your written thesis. Your thesis

demonstrates your skill at presenting your research in writing. In the viva examination, you will

demonstrate your ability to participate in academic discussion with research colleagues.

Purpose of the Exam

The purpose of the viva examination is to:

demonstrate that the thesis is your own work

confirm that you understand what you have written and can defend it verbally

investigate your awareness of where your original work sits in relation to the wider research field


establish whether the thesis is of sufficiently high standard to merit the award of the degree for

which it is submitted

allow you to clarify and develop the written thesis in response to the examiners' questions

The Examiners and Exam Chair

You will normally have two examiners:

an internal examiner who will be a member of academic staff of the University, usually from

your School/Department but not one of your supervisors

an external examiner who will normally be a member of academic staff of another institution or

occasionally a professional in another field with expertise in your area of research (candidates

who are also members of University staff will normally have two external examiners in place of

an internal and an external examiner)

Your supervisor should let you know who your examiners will be as it is important that you

ensure you are familiar with their work and any particular approach that they may take when

examining your thesis.

In some cases there may also be a Chair person for the examination. A Chair is appointed if the

Graduate Dean or either of the examiners feels this is appropriate, for example where the

examining team has relatively little experience of examining UK research degrees. The Chair is

there to ensure the examination is conducted in line with University regulations and is not there

to examine your thesis. If there is a Chair person, it will usually be a senior member of the

academic staff of your School/Department.

Normally no one else is present in the exam.

Exam Venue and Arrangements

Your internal examiner is responsible for arranging your viva exam and they will contact you

with the relevant details - date, time, venue, etc.

Usually the viva exam will take place in your School/Department, though occasionally another

University location may be used. If you are unsure where you need to go, make sure you check

this before the day of your exam.


If you returned your Notice of Intention to Submit Your Thesis three months before your

submission date, your viva exam should normally take place quite soon after submission. Almost

all viva exams take place within three months of thesis submission and in many cases it is within

one month.

Format of the Exam

All viva examinations are different, so it is not possible to describe exactly what will happen -

but there are general points which can be made which may be helpful, and you should have the

opportunity before your examination to discuss what will happen with your supervisor or to

attend the University's pre-viva examination workshop.

The purpose of the viva is to establish that your work is of a sufficiently high standard to merit

the award of the degree for which it is submitted. In order to be awarded a research degree, the

thesis should demonstrate an original contribution to knowledge and contain work which is

deemed worthy of publication.

In order to do this, examiners may:

ask you to justify your arguments

ask you to justify not only things which you have included in your thesis but also things which

you may have left out

ask you questions about the wider research context in which the work has been undertaken

argue certain points with you

expect you to discuss any developments which may flow from your work in the future

Inevitably, your thesis will have strengths and weaknesses and the examiners will want to

discuss these. It is considered a positive thing, indeed an essential thing, that you can discuss

both the strengths and the weaknesses. You can think of the weaknesses as an opportunity to

demonstrate your skill at critical appraisal.

Remember that examiners seek to find and discuss weaknesses in all theses - you should not

interpret criticism as an indication that the examination will not end successfully.


Title of Course: Project Part-IICourse Code: CS882L-T –P Scheme: 0-0-0 Course Credits: 6

Project: an activity where the participants have some degree of choice in the outcome. The resultis complete and functional, that is, it has a beginning, middle and end. Usually, it spans multiplelab periods and requires work outside scheduled lab periods. Since there are choices inimplementation, design is inherently a component of a project. A project is inherently differentfrom an analysis or exercise, in which the solution has a predictable form. Projects span a widevariety of possibilities: design and build, identify a system, do a forensic analysis, evaluate aproduct or assess some environmental situation.

Program Objective 1Graduates shall make their way to the society with proper scientific and technical knowledge inmechanical engineering.

Program Objective 2Graduates shall work in design and analysis of mechanical systems with strong fundamentals andmethods of synthesis.

Program Objective 3Graduates shall adapt to the rapidly changing environment in the areas of mechanicalengineering and scale new heights in their profession through lifelong learning.

Program Objective 4Graduates shall excel in career by their ability to work and communicate effectively as a teammember and/or leader to complete the task with minimal resources, meeting deadlines.

Program Outcomes:

1. Ability to apply knowledge of mathematics, science and mechanical engineeringfundamentals for solving problems.

2. Ability to Identify, formulate and analyze mechanical engineering problems arriving atmeaningful conclusions involving mathematical inferences.

3. Ability to design and develop mechanical components and processes to meet desiredneeds considering public health, safety, cultural, social, and environmental aspects.

4. Ability to understand and investigate complex mechanical engineering problemsexperimentally.

5. Ability to apply modern engineering tools, techniques and resources to solve complexmechanical engineering activities with an understanding of the limitations.

6. Ability to understand the effect of mechanical engineering solutions on legal, cultural,social, public health and safety aspects./li>


7. Ability to develop sustainable solutions and understand their impact on society andenvironment.

8. Ability to apply ethical principles to engineering practices and professionalresponsibilities.

9. Ability to function effectively as an individual and as a member or leader in diverseteams and in multidisciplinary settings.

10. Ability to comprehend, design documentation, write effective reports, make effectivepresentations to the engineering community and society at large.

11. Ability to apply knowledge of engineering and management principles to lead teams andmanage projects in multidisciplinary environments.

12. Ability to engage in independent and life-long learning in the broad context oftechnological changes and advancements.

university of engineering & management, jaipur course ... · hygiene theory, alderfer’s erg...

Documents