7CS1 Cloud Computing - Aryacollege.in
7CS1A Cloud ComputingClass: VII Sem. B.Tech.Branch: Computer Engg.Schedule per WeekLectures: 3UnitsIIIIIIEvaluationExamination Time Three (3) HoursMaximum Marks 100[Mid-term (20) & End-term (80)]Contents of the subjectIntroduction Cloud Computing: Nutshell of cloud computing, Enabling Technology, Historicaldevelopment, Vision, feature Characteristics and components of Cloud Computing. Challenges, Risks andApproaches of Migration into Cloud. Ethical Issue in Cloud Computing, Evaluating the Cloud's BusinessImpact and economics, Future of the cloud. Networking Support for Cloud Computing. Ubiquitous Cloudand the Internet of ThingsCloud Computing Architecture: Cloud Reference Model, Layer and Types of Clouds, Services models,Data center Design and interconnection Network, Architectural design of Compute and Storage Clouds.Cloud Programming and Software: Fractures of cloud programming, Parallel and distributed programmingparadigms-MapReduce, Hadoop , High level Language for Cloud. Programming of Google App engine,Virtualization Technology: Definition, Understanding and Benefits of Virtualization. ImplementationLevel of Virtualization, Virtualization Structure/Tools and Mechanisms , Hypervisor VMware, KVM, Xen.Virtualization: of CPU, Memory, I/O Devices, Virtual Cluster and Resources Management, Virtualizationof Server , Desktop, Network, and Virtualization of data-centerIVSecuring the Cloud : Cloud Information security fundamentals, Cloud security services, Design principles,Policy Implementation, Cloud Computing Security Challenges, Cloud Computing Security Architecture .Legal issues in cloud Computing.Data Security in Cloud: Business Continuity and Disaster Recovery , Risk Mitigation , Understanding andIdentification of Threats in Cloud, SLA-Service Level Agreements, Trust ManagementVCloud Platforms in Industry: Amazon web services , Google AppEngine, Microsoft Azure Design, Aneka:Cloud Application Platform -Integration of Private and Public CloudsCloud applications: Protein structure prediction, Data Analysis, Satellite Image Processing, CRM and ERP,Social networking . Cloud Application- Scientific Application, Business Application.Advance Topic in Cloud Computing: Federated Cloud/InterCloud, Third Party Cloud ServicesRecommended Text:1. “ Distributed and Cloud Computing “ By Kai Hawang , Geofrey C.Fox, Jack J. DongarraPub: Elservier2. Cloud Computing ,Principal and Paradigms, Edited By Rajkumar Buyya, Jemes Broberg, A. Goscinski,Pub.- Wiley3. Kumar Saurabh, “Cloud Computing” , Wiley Pub4. Krutz , Vines, “Cloud Security “ , Wiley Pub5. Velte, “Cloud Computing- A Practical Approach” ,TMH PubB.Tech. CS Syllabus as submitted to 15th Academic councilDate- 07/10/201563
7CS2A Information System Security (Common to CS & IT)Class: VII Sem. B.Tech.Branch: Computer Engg.Schedule per WeekLectures: 3UnitsIIIIIIIVVEvaluationExamination Time Three (3) HoursMaximum Marks 100[Mid-term (20) & End-term (80)]Contents of the subjectIntroduction to security attacks, services and mechanism, classicalencryption techniques- substitution ciphers and transpositionciphers, cryptanalysis, stream and block ciphers.Modern Block Ciphers: Block ciphers principals, Shannon’s theoryof confusion and diffusion, fiestal structure, data encryptionstandard(DES), differential and linear cryptanalysis of DES, blockcipher modes of operations, triple DES.AES, RC6, random number generation.S-box theory: Boolean Function, S-box design criteria, Bentfunctions, Propagation and nonlinearity, construction of balancedfunctions, S-box design.Public Key Cryptosystems: Principles of Public Key Cryptosystems,RSA Algorithm, security analysis of RSA, Exponentiation inModular Arithmetic.Key Management in Public Key Cryptosystems: Distribution ofPublic Keys, Distribution of Secret keys using Public KeyCryptosystems. X.509Discrete Logarithms, Diffie-Hellman Key Exchange.Message Authentication and Hash Function: Authenticationrequirements, authentication functions, message authentication code,hash functions, birthday attacks, security of hash functions andMAC, MD5 message digest algorithm, Secure hashalgorithm(SHA).Digital Signatures: Digital Signatures, authentication protocols,digital signature standards (DSS), proof of digital signaturealgorithm.Remote user Authentication using symmetric and AsymmetricAuthenticationPretty Good Privacy.IP Security: Overview, IP Security Architecture, AuthenticationHeader, Encapsulation Security Payload in Transport and Tunnelmode with multiple security associations (Key Management notIncluded).Strong Password Protocols: Lamport’s Hash, Encrypted KeyExchange.Text/References:B.Tech. CS Syllabus as submitted to 15th Academic councilDate- 07/10/201564
1. Stalling Williams: Cryptography and Network Security: Principles and Practices, 4th Edition,Pearson Education, 2006.2. Kaufman Charlie et.al; Network Security: Private Communication in a Public World, 2nd Ed.,PHI/Pearson.3. Pieprzyk Josef and et.al; Fundamentals of Computer Security, Springer-Verlag, 2008.4. Trappe & Washington, Introduction to Cryptography, 2nd Ed. Pearson.B.Tech. CS Syllabus as submitted to 15th Academic councilDate- 07/10/201565
7CS3A Data Mining & Ware Housing (Common to CS & IT)Class: VII Sem. B.Tech.EvaluationBranch: Computer Engg.Schedule per WeekLectures: 3Examination Time Three (3) HoursMaximum Marks 100[Mid-term (20) & End-term (80)]UnitsContents of the subjectIOverview, Motivation(for Data Mining),Data Mining-Definition & Functionalities,Data Processing, Form of Data Preprocessing, Data Cleaning: Missing Values, NoisyData, (Binning, Clustering, Regression, Computer and Human inspection),Inconsistent Data, Data Integration and Transformation. Data Reduction:-Data CubeAggregation, Dimensionality reduction, Data Compression, Numerosity Reduction,Clustering, Discretization and Concept hierarchy generation.IIConcept Description: Definition, Data Generalization, Analytical Characterization,Analysis of attribute relevance, Mining Class comparisons, Statistical measures inlarge Databases. Measuring Central Tendency, Measuring Dispersion of Data, Grap hDisplays of Basic Statistical class Description, Mining Association Rules in LargeDatabases, Association rule mining, mining Single-Dimensional Boolean Associationrules from Transactional Databases– Apriori Algorithm, Mining MultilevelAssociation rules from Transaction Databases and Mining Multi- DimensionalAssociation rules from Relational Databases.IIIWhat is Classification & Prediction, Issues regarding Classification and prediction,Decision tree, Bayesian Classification, Classification by Back propagation, Multilayerfeed-forward Neural Network, Back propagation Algorithm, Classification methodsK-nearest neighbour classifiers, Genetic Algorithm. Cluster Analysis: Data types incluster analysis, Categories of clustering methods, Partitioning methods. HierarchicalClustering- CURE and Chameleon. Density Based Methods-DBSCAN, OPTICS. GridBased Methods- STING, CLIQUE. Model Based Method –Statistical Approach,Neural Network approach, Outlier AnalysisIVData Warehousing: Overview, Definition, Delivery Process, Difference betweenDatabase System and Data Warehouse, Multi Dimensional Data Model, Data Cubes,Stars, Snow Flakes, Fact Constellations, Concept hierarchy, Process Architecture, 3Tier Architecture, Data Mining.VAggregation, Historical information, Query Facility, OLAP function and Tools.OLAP Servers, ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backupand Recovery, Tuning Data Warehouse, Testing Data Warehouse.Text Books & References:1. Data Warehousing in the Real World – Anahory and Murray, Pearson Education.2. Data Mining – Concepts and Techniques – Jiawai Han and Micheline Kamber.3. Building the Data Warehouse – WH Inmon, Wiley.B.Tech. CS Syllabus as submitted to 15th Academic councilDate- 07/10/201566
7CS4A COMPUTER AIDED DESIGN FOR VLSIClass: VII Sem. B.Tech.Branch: Computer Engg.Schedule per WeekLectures: 3UnitsContents of the subjectComplexity in microelectronic circuit design and Moore’s Law, design styles -FullcustomIEvaluationExamination Time Three (3) HoursMaximum Marks 100[Mid-term (20) & End-term evices,FieldSynthesisandOptimizations, design flow and related problems.Boolean functions and its representations – co-factor, unite, derivatives,consensus and smoothing; tabular representations and Binary DecisionDiagram (BDD), OBDD, ROBDD and Bryant’s reduction algorithm and ITEalgorithm. Hardware abstract models – structures and logic networks, Statediagram, data-flow and sequencing graphs, hierarchical sequencing graphs.Compilation and behavioral optimizations.IIArchitectural Synthesis – Circuit description and problem definition, temporal andspatial domain scheduling, synchronization problem. Scheduling algorithms - ASAPand ALAP scheduling algorithms, scheduling under constraints, relative scheduling,list scheduling heuristic. Scheduling in pipelined circuits.Resource Sharing & Binding in sequencing graphs for resource dominated circuits,sharing of registers and busses; binding variables to registers.Two-level logic optimization principles – definitions and exact logic minimizations.Positional cube notations, functions with multi-valued logic. List-orientedmanipulations.Physical Design. Floor planning – goals and objectives. Channel definition, I/O andpower planning. Clock Planning. Placement – goals and objectives. Placementalgorithms. Iterative improvement algorithms. Simulated Annealing. Timing-drivenPlacement. Global routing – goals and objectives. Global routing methods. Timingdriven global routing. Detailed Routing – goals and objectives. Left-edge algorithm.Constraints and routing graphs. Channel routing algorithms. Via minimization.Clock routing, power routing, circuit extraction and Design Rule Checking.IIIIVVText Books:1. S.H. Gerez. Algorithms VLSI Design Automation. Wiley India. (Indian edition available.)2. Michael John Sebastian Smith. Application-Specific Integrated Circuits. Addison-Wesley.(Low-priced edition is available.)3. G.D. Micheli, Synthesis and optimization of digital circuits, TMH.References:1. f2. S. Sait and H. Youssef. VLSI Physical Design Automation: Theory and Practice.B.Tech. CS Syllabus as submitted to 15th Academic councilDate- 07/10/201567
7CS5A COMPILER CONSTRUCTIONClass: VII Sem. B.Tech.Branch: Computer Engg.Schedule per WeekLectures: 3UnitsIIIEvaluationExamination Time Three (3) HoursMaximum Marks 100[Mid-term (20) & End-term (80)]Contents of the subjectCompiler, Translator, Interpreter definition, Phase of compiler introduction to one pass &Multipass compilers, Bootstrapping, Review of Finite automata lexical analyzer, Input,buffering, Recognition of tokens, Idea about LEX: A lexical analyzer generator,Error handling.Review of CFG Ambiguity of grammars, Introduction to parsing. Bottom up parsingTop down parsing techniques, Shift reduce parsing, Operator precedence parsing,Recursive descent parsing predictive parsers. LL grammars & passers error handling of LLparser. LR parsers, Construction of SLR, Conical LR & LALR parsing tables, parsing withambiguous grammar. Introduction of automatic parser generator: YACC error handling inLR parsers.IIISyntaxdirecteddefinitions, Top downusing postfix notationquadruples, -attributedtranslation. Specification of a type checker, Intermediate code formsand three address code, Representing TAC using triples andof assignment statement. Boolean e xpression and control structures.IVStorage organization, Storage allocation, Strategies, Activation records, Accessing localand non local names in a block structured language, Parameters passing, Symbol tableorganization, Data structures used in symbol tables.VDefinition of basic block control flow graphs, DAG representation of basic block,Advantages of DAG, Sources of optimization, Loop optimization, Idea about global data flowanalysis, Loop invariant computation, Peephole optimization, Issues in design of code generator,A simple code generator, Code generation from DAG.Text/References:1. Aho, Ullman and Sethi: Compilers, Addison Wesley.2. Holub, Compiler Design in C, PHI.B.Tech. CS Syllabus as submitted to 15th Academic councilDate- 07/10/201568
7CS6.1A ADVANCE DATABASE MANGEMENT SYSTEMSClass: VII Sem. B.Tech.EvaluationBranch: Computer Engg.Schedule per WeekLectures: 3Examination Time Three (3) HoursMaximum Marks 100[Mid-term (20) & End-term (80)]UnitsIIIIIIIVVContents of the subjectQuery Processing and Optimization: Overview of Relational Query Optimization,System Catalog in a Relational DBMS, Alternative Plans, Translating SQL, Queriesinto Algebra, Estimating the Cost of a Plan, Relational Algebra Equivalences,Enumeration of Alternative Plans. [2]Object Database Systems: Motivating Examples, Structured Data Types, Operations OnStructured Data, Encapsulation and ADT's, Inheritance, Objects, OIDs and ReferenceTypes, Database Design for an ORDBMS, ORDBMS Implementation Challenges,ORDBMS, Comparing RDBMS, OODBMS, and ORDBMS.Parallel and Distributed Databases: Architectures for Parallel, Databases, ParallelQuery Evaluation, Parallelizing Individual Operations, Parallel Query Optimization,Distributed DBMS Architectures, Storing Data in a Distributed DBMS, DistributedCatalog Management, Distributed Query Processing, Updating Distributed Data,Introduction toDistributed Transactions, Distributed Concurrency Control,Distributed Recovery. [2]Database Security and Authorization: Introduction to Database Security, AccessControl, Discretionary Access Control- Grant and Revoke on Views and IntegrityConstraints, Mandatory Access Control- Multilevel Relations and Polyinstantiation,Covert Channels, DoD Security Levels, Additional Issues Related to Security- Role ofthe Database Administrator, Security in Statistical Databases, Encryption. [2]POSTGES: POSTGRES user interfaces, sql variations and extensions, TransactionManagement, Storage and Indexing, Query processing and optimizations, SystemArchitectures.XML: Motivation, Structure of XML data, XML Document Schema, Querying andTransformation, Application Program Interface to XML, Storage of XML Data, XMLapplications. [2]Text/References1. Elmasri R and Navathe SB, Fundamentals of Database Systems, 3rd Edition, AddisonWesley,2000.nd2. Connolly T, Begg C and Strachan A, Database Systems, 2 Edition, Addison Wesley, 19993. Ceri Pelagatti , Distributed Database: Principles and System - (McGraw Hill)4. Simon AR, Strategic Database Technology: Management for the Year 2000, Morgan Kaufmann,1995th5. A. Silversatz, H. Korth and S. Sudarsan: Database Cocepts 5 edition, Mc-Graw Hills 2005.B.Tech. CS Syllabus as submitted to 15th Academic councilDate- 07/10/201569
7CS6.2A RoboticsClass: Vll Sem. B.Tech.Branch: Computer Engg.Schedule per WeekLectures: 3EvaluationExamination Time Three (3) HoursMaximum Marks 100[Mid-term (20) & End-term (80)]UnitContentsIIntroduction -- brief history, types, classification and usage, Science and Technology of robots, Someuseful websites, textbooks and research journals.IIElements of robots -- joints, links, actuators, and sensors Position and orientation of a rigid body,Homogeneous transformations, Representation of joints, link representation using D-H parameters,Examples of D-H parameters and link transforms, different kinds of actuators – stepper, DC servo andbrushless motors, model of a DC servo motor, Types of transmissions, Purpose of sensors, internal andexternal sensors, common sensors – encoders, tachometers, strain gauge based force-torque sensorsIIIIntroduction, Direct and inverse kinematics problems, Examples of kinematics of common serialmanipulators, workspace of a serial robot, Inverse kinematics of constrained and redundant robots, Tractrixbased approach for fixed and free robots and multi-body systems, simulations and experiments, Solutionprocedures using theory of elimination, Inverse kinematics solution for the general 6R serial manipulator.IVDegrees-of-freedom of parallel mechanisms and manipulators, Active and passive joints, Constraint andloop-closure equations, Direct kinematics problem, Mobility of parallel manipulators, Closed-from andnumerical solution, Inverse kinematics of parallel manipulators and mechanisms, Direct kinematics ofGough-Stewart platform.VLinear and angular velocity of links, Velocity propagation, Manipulator Jacobians for serial and parallelmanipulators, Velocity ellipse and ellipsoids, Singularity analysis for serial and parallel manipulators, Lossand gain of degree of freedom, Statics of serial and parallel manipulators, Statics and force transformationmatrix of a Gough-Stewart platform, Singularity analysis and statics.Text Books :1. Mittal and Nagrath, Robotics and Control, Tata McGraw-Hill Education, 2003.2. Fred G. Martin, Robotic Explorations: A Hands On Introduction to Engineering,Pearson Education, 2001.B.Tech. CS Syllabus as submitted to 15th Academic councilDate- 07/10/201570
7CS6.3A Data Compression TechniquesClass: VII Sem. B.Tech.Branch: Computer Engg.Schedule per WeekLectures: 3UnitsEvaluationExamination Time Three (3) HoursMaximum Marks 100[Mid-term (20) & End-term (80)]Contents of the subjectCompression Techniques: Lossless, lossy, measure of performance, modeling &coding.Lossless compression: Derivation of average information, data models, uniquelyIdecodable codes with tests, prefix codes, Kraft-Mc Millan inequality.Huffman coding: Algorithms, minimum variance Huffman codes, optimality, lengthextended codes, adaptive coding, Rice codes, using Huffman codes for lossless imagecompression.Arithmetic coding with application to lossless compression.Dictionary Techniques: LZ77, LZ78, LZWIIPredictive coding: Burrows-Wheeler Transform and move-to-front coding, JPEG-LSFacsimile Encoding: Run length, T.4 and T.6Lossy coding- Mathematical preliminaries: Distortion criteria, conditional entropy,average mutual information, differential entropy, rate distortion theory, probabilityand linear system models.Scalar quantization: The quantization problem, uniform quantizer, Forward adaptiveIIIquantization, non-uniform quantization-Formal adopting quantization,companded QuantizationVector quantization: Introduction, advantages, The Linde-Ruzo-Grey algorithm,lattice vector quantization.Differential encoding – Introduction, Basic algorithm, Adaptive DPCM, Deltamodulation, speech and image coding using delta modulation.IVSampling in frequency and time domain, z-transform, DCT, DST, DWHT,quantization and coding of transform coefficient.Sub band coding: Introduction, Filters, Basic algorithm, Design of Filter banks,G.722,MPEG.VWavelet based compression: Introduction, wavelets multi-resolution analysis and thescaling function implementation using filters.Text Books & References:1. Sayood K: Introduction to Data Compression: ELSEVIER 2005.B.Tech. CS Syllabus as submitted to 15th Academic councilDate- 07/10/201571
7CS7A Web Development LabClass: VIl Sem. B.Tech.Branch: Computer Engg.Schedule per WeekPractical Hrs: 2EvaluationExamination Time Three (3) HoursMaximum Marks 50[Mid-term (60) & End-term (40)]S. No.12345List of Experiment. Creation of HTML FilesWorking with Client Side Scripting : VBScript, JavaScriptConfiguration of web servers: Apache Web Server, Internet Information Server (IIS)Working with ActiveX Controls in web documentsExperiments in Java Server Pages: Implementing MVC Architecture using Servlets, Data AccessProgramming (using ADO), Session and Application objects, File System Management67891011Working with other Server Side Scripting: Active Server Pages, Java Servlets, PHPExperiments in Ajax ProgrammingDeveloping Web ServicesDeveloping any E-commerce application (Mini Project)Application Development in cloud computi
Wiley 3. Kumar Saurabh, “Cloud Computing” , Wiley Pub 4. Krutz , Vines, “Cloud Security “ , Wiley Pub 5. Velte, “Cloud Computing- A Practical Approach” ,TMH Pub Date- 07/10/2015 64 7CS2A Information System Security (Common to CS & IT) Class: VII Sem. B.Tech. Evaluation
Chapter 10 Cloud Computing: A Paradigm Shift 118 119 The Business Values of Cloud Computing Cost savings was the initial selling point of cloud computing. Cloud computing changes the way organisations think about IT costs. Advocates of cloud computing suggest that cloud computing will result in cost savings through
Cloud Computing J.B.I.E.T Page 5 Computing Paradigm Distinctions . The high-technology community has argued for many years about the precise definitions of centralized computing, parallel computing, distributed computing, and cloud computing. In general, distributed computing is the opposite of centralized computing.
Mobile Cloud Computing Cloud Computing has been identified as the next generation’s computing infrastructure. Cloud Computing allows access to infrastructure, platforms, and software provided by cloud providers at low cost, in an on-demand fashion. Mobile Cloud Computing is introduced as an int
Cloud Computing What is Cloud Computing? Risks of Cloud Computing Practical Applications Benefits of Cloud Computing Adoption Strategies 5 4 3 2 1 Q&A What the Future Holds 7 6 Benefits of Cloud Computing Reduced Cost for Implementation Flexibility Scalability Disaster Relief Multitenancy Virtualization Pay incrementally Automatic Updates
UNIT 5: Securing the Cloud: Cloud Information security fundamentals, Cloud security services, Design principles, Policy Implementation, Cloud Computing Security Challenges, Cloud Computing Security Architecture . Legal issues in cloud Computing. Data Security in Cloud: Business Continuity and Disaster
Cloud computing "Cloud computing is a computing paradigm shift where computing is moved away from personal computers or an individual application server to a "cloud" of computers. Users of the cloud only need to be concerned with the computing service being asked for, as the underlying details of how it is achieved are hidden.
The rationale of cloud computing (for the customer) is reduced and linearly scaling costs. Cloud computing allows allocating required computing resources dynamically to demand. It scales linearly with the number of users, i.e. incurs no or little capital expenses (capex), only operating expenses (opex). Traditional IT: Cloud computing: Users .
50 80 100 150 200 250 300 350 400 450 500 550 600 . (API 624/ ISO 15848), cryogenic valves (-196 C) and valves in exotic metallurgies. Valves in other sizes and ASME classes available on demand. 4 Compliance Standards Parameter Standard Design Gate Valves API 603, ASME B16.34 Globe Valves ASME B16.34 Check Valves ASME B16.34 Ends Face-to-face/ End-to-end Dimensions ASME B16.10 End Flange .
