GANPAT UNIVERSITY FACULTY OF ENGINEERING … · Documentation (SRS) ,Requirement Gathering and...

19
GANPAT UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY TEACHING AND EXAMINATION SCHEME Programme Bachelor of Technology Branch/Spec. Computer Engineering Semester VI Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014 Subject Code Subject Name Teaching scheme Examination scheme (Marks) Credit Hours (per week) Theory Practical Lecture(DT) Practical(Lab.) Lecture(DT) Practical(Lab.) CE SEE Tota l CE SEE Total L TU Total P TW Total L TU Total P TW Total 2CE601 Theory of Computation 3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50 2CE602 Software Engineering 3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50 2CE603 Information System Security 3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50 2CE604 Application Development Lab 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 2CE6E* Elective II 3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50 2CE6E* Elective III 3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50 2HS601 Aptitude Skill Building–II 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 15 0 15 7 - 7 15 0 15 14 - 14 200 300 500 210 140 350 NOTE: * indicates any number from the following set of subjects in given order Elective II Elective III 2CE605 : Mobile Application Development 2CE607 : Network Programming 2CE606 : Microprocessor and Interfacing 2CE608 : Computer Graphics 2CE609 : Cloud Computing

Transcript of GANPAT UNIVERSITY FACULTY OF ENGINEERING … · Documentation (SRS) ,Requirement Gathering and...

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY

TEACHING AND EXAMINATION SCHEME Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject Code

Subject Name

Teaching scheme Examination scheme (Marks)

Credit Hours (per week) Theory Practical

Lecture(DT) Practical(Lab.) Lecture(DT) Practical(Lab.) CE SEE Total

CE SEE Total

L TU Total P TW Total L TU Total P TW Total

2CE601 Theory of Computation

3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2CE602 Software Engineering 3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2CE603 Information System Security

3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2CE604 Application Development Lab

0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50

2CE6E* Elective II 3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2CE6E* Elective III 3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2HS601 Aptitude Skill Building–II

0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50

Total 15 0 15 7 - 7 15 0 15 14 - 14 200 300 500 210 140 350

NOTE: * indicates any number from the following set of subjects in given order

Elective II Elective III

2CE605 : Mobile Application Development 2CE607 : Network Programming

2CE606 : Microprocessor and Interfacing 2CE608 : Computer Graphics

2CE609 : Cloud Computing

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE601 Subject Name Theory of Computation

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Basic Understanding of Mathematics

Learning Outcome:

After successful completion of this course, student will be able to Demonstrate advanced knowledge of formal computation and its relationship to languages. Distinguish different computing languages and classify their respective types. Recognize and comprehend formal reasoning about languages. Show a competent understanding of the basic concepts of complexity theory.

Theory syllabus

Unit Content Hrs

1

Review of Mathematical Background: Sets, Functions, Logical statements, Proofs, Relations, Languages, The Principal of Mathematical induction, the strong principle of Mathematical induction, Recursive definitions, Structural Induction

06

2

Regular Languages And Finite Automata: Regular expressions, Regular languages, Memory required to recognize a language, Finite automata, Distinguishable strings, Union, intersection and complement of regular languages

08

3

Non-determinism And Kleen’s Theorem: Non-deterministic finite automata, Non deterministic finite automata with ^ transitions, Kleen's theorem

05

4

Regular And Non Regular Language: Minimization of Finite automata, Non-regular and regular languages, Pumping Lemma, Decision problems and decision algorithms, Regular languages in relation to programming languages.

07

5

Context-Free Languages and Push-Down Automata: Context-free languages, Regular Grammars, Derivation tree and ambiguity, An Unambiguous CFG , Simplified and Normal forms, Chomsky normal form

07

6

Pushdown Automata and CFL: Push -Down Automata, Definition and examples, Deterministic PDA, Types of acceptances and their equivalence, Equivalence of CFG and PDA, Introduction to parsing, Top-down and bottom up parsing, Non-CFL and CFL, Pumping Lemma for CFL, Intersection and Complement of CFL

06

7

Turing Machine: Models of computation, TM definition, Combining TMs, Computing a function with TMs. Variations on Turing Machines, Doubly infinite and more than one Tapes, Non-deterministic and Universal TM

05

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 Introduction to Languages and Theory of Computation: By John C. Martin

Reference Books

1 Computation: Finite and Infinite: By Marvin L. Minsky, Prentice-Hall, 1967

2 Introduction to formal languages: By G. E. Reevsz, Mc-graw hill.

3 Formal language theory: By M. H. Harrison

GANPAT UNIVERSITY

FACULTY OF ENGINEERING& TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE602 Subject Name Software Engineering

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Object Oriented Analysis & Design

Learning Outcome:

After successful completion of this course, student will be able to

Understand lifecycle for software development.

Analyse the requirements systematically and develop the model using Unified Modeling language.

Develop a quality software product through effective team-building, planning, scheduling and risk assessment.

Theory syllabus

Unit Content Hrs

1

Introduction to Software and Software Engineering: FAQ about Software Engineering ,Software characteristics ,The Changing Nature of Software, Software Myths

02

2

Process Models (Software Development Life Cycle): What is Software Process?, What is Software Development Life Cycle (SDLC)?,Prescriptive models, The water fall model (classical life cycle model), Incremental Process model, Evolutionary process model, The unified process

04

3

Building the Analysis Model: Requirement Analysis, Analysis Modeling Approaches, Data Modeling Concepts, Object Oriented Analysis, Scenario Based Modeling, Class Based Modeling, Crating a Behavioral Model, Flow Oriented Modeling Entity Relationship Diagram (E-R Diagram)

04

4 Requirements Analysis and Specification or Requirement Engineering: Requirement Engineering ,Requirement Elicitation, Requirement Analysis, Requirement Documentation (SRS) ,Requirement Gathering and Analysis, Software Requirement Engineering

04

5

Software Project Management: Introduction, Responsibility of Software Project Manager, Project Planning Activities, Project planning, SPMP Document, Metrics for Project Size Estimation ,Project Estimation Techniques, Scheduling

06

6

Coding and Testing: Coding Standards and Guidelines, Coding Review, What is Testing,Error- Faults-Failures ,Test cases, Test suites, Verification versus Validation, Design of Test Cases, Alpha and Beta Testing, Testing in Small and Testing in Large, Black Box Testing, White Box Testing (Structural Testing),Integration testing, System Testing

06

7 Software Design: Design Framework, Conceptual Design and Technical Design ,Quality Attributes (FURPS) (Hewlett – Packard),Modularity, Strategy of Design, Function Oriented Design, Object Oriented

04

Design Approach (OOD)

8

Unified Modeling Language (UML): Overview of object oriented concepts, Advantage of OOD, Unified modeling language (UML), UML diagrams, Use Case Diagram, Class Diagram, Sequence, collaboration Diagram, Activity Diagram, State chart Diagram

02

9 Function oriented software design: Overview of SA/SD methodology Structured analysis, Data flow diagrams(DFDs),Structure design

04

10 Architectural design: Software architecture, Data design, Architectural styles and patterns, Architectural design 04

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 Software engineering a practitioner’s approach (7th edition) by Roger S. Pressman

Reference Books

1 Software Engineering (8th edition) by Sommerville

2 Fundamentals of Software Engineering (4th edition) by Rajib Mall

3 Fundamentals of Software Engineering (3rd edition) by K.K.Agrawal

4 Object – Oriented Modeling and Design with UML (2nd edition) by Rumbaugh, Blaha

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE603 Subject Name Information System Security

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Computer Networks

Learning Outcome:

After successful completion of this course, student will be able to

List and briefly describe security risks and mitigation strategies for an organization that is about to connect its network to the Internet and communicate with other companies via email.

Explain the differences between the three major goals of information security: confidentiality, integrity and availability, and can list and explain one technique for ensuring each.

Explain how public key cryptography can be used to ensure the identity of the sender of an encrypted message.

Theory syllabus

Unit Content Hrs

1 Introduction: Security goals, attacks, Security services, security mechanisms

04

2 Cryptographic Mathematics: Modular arithmetic, linear congruence, Algebraic structure, checking of primeness, primality testing, Chinese remainder theorem, quadratic congruence

07

3 Classical Ciphers: Symmetric cipher model, substitution ciphers, transposition ciphers, steganography 06

4

Modern symmetric key ciphers: Modern block ciphers, modern stream ciphers, Data Encryption standard, advanced encryption standard, Electronic code book mode, CBC, cipher feedback mode, output feedback mode

07

5 Public key cryptography: RSA, RSA proof, RSA attacks, Rabin cryptosystem, Key management: Diffie Hellman 05

6

Message Authentication and Hash functions: Authentication requirements, functions, Message authentication codes (MAC), Hash functions, security of Hash functions

05

7 Hash algorithms: SHA- 512

03

8 Digital Signatures: Basics, digital signature standards 03

9 IP Security:

02

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 William Stallings: “Cryptography and Network Security – Principles and Practice”, 4/E,PearsonEducation, 2005.

Reference Books

1 Bruce Scheneir: “Applied Cryptography”, 2/E, John Wiley, 1996

2 Behrouz Forouzan: “Cryptography & Network Security”, 1/E, TMH, 2007.

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE604 Subject Name Application Development Lab

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 0 0 1 - 1 Theory - - -

Hours 0 0 2 - 2 Practical 30 20 50

Pre-requisites:

Understanding of Tools & Technology and Database Management System

Learning Outcome:

After successful completion of this course, student will be able to

Develop an application using different technology

Learn how to work in a team.

Think and apply new ideas in developing an application.

Theory syllabus

-

Practical content

Unit Content Hrs

1

Students have to carry out an application development work under the guidance of faculty member using the knowledgeof subjects that he/she has learned up to 6thsemester. Students have to submit a report with code at the end of the semester

26

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE605 Subject Name Mobile Application Development

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Object Oriented Programming

Learning Outcome:

After successful completion of this course, student will be able to

Describe android and understand different versions of android.

Explain concepts and theories of android’s various components and apply them to various situations in android application development.

work with Database, Google map, Menus etc.

Theory syllabus

Unit Content Hrs

1 Introduction to Android: History of Mobile Software Development, Open Handset Alliance, What is an Android, Difference between I-phone OS (apple) and Android OS,Define term HTML,XML and WML

03

2 Setting Up Your Android Development Environment: Configuring Your Development Environment, Difference between JVM and DVM, Android platform Architecture, Advantage of DVM over JVM, Android Emulator

02

3

Building your first Android Application: Creating and Configuring a New Android Project, Core Files and Directories of the Android Application, Creating an AVD for Your Project, Creating Launch Configurations for Your Project, Running Your Android Application in the Emulator, Debugging Your Android Application in the Emulator, Adding Logging Support to Your Android Application, Adding Some Media Support to Your Application, Adding Location-Based Services to Your Application, Debugging Your Application on the Hardware

02

4 Understanding the Anatomy of an Android Application: What is the meaning of an Anatomy? , Explain the activity with their states? , What are the methods used in android activity life cycle? , Explain the Android activity life cycle

03

5

Defining your Application using the Android Manifest file: Core files and Directories of the Android Application, What are the contents of the Android Manifest file? , How to edit the Android manifest file?, Registering Activities and Other in Application

03

6

Managing Application Resources: What Are Resources?, Storing Application Resources , Understanding the, Resource Directory Hierarchy, Resource Value Types, Setting Simple Resource Values Using Eclipse, Working with String, String Arrays, Boolean, Integer,Colors, Dimensions, Drawables, Images resources etc…, Working with Layouts, Using Layout Resources Programmatically

04

7 Exploring User Interface Screen Elements: Introducing the Android View, Android Control, Android Layout, Displaying Text to Users with TextView, Configuring Layout and Sizing, Using Buttons, Check Boxes, Radio Groups, spinner,

03

ProgressBar etc.

8 Designing User Interfaces with Layouts: Creating User Interfaces in Android, Creating Layouts Using XML Resources and Programmatically, Scrollview, GridView, ListView, Spinner etc.

02

9 Drawing and Working with Animation: Design Working with Canvases and Paints, Drawing Ovals and Circles, Frame by frame & tween animation etc.

03

10 Explore Data Storage Techniques: Working with SharedPreferences, What is SQLite, features of SQLite, store data in SQLite 03

11 Explore Google Map: Feature of Google map, version of Google map APIs, integration of google map in android application

02

12 Working with other components: Use of TimePicker&DatePicker, Different Dialogboxs, Option menu & context menu, Send/read SMS, JSON & Application with JSON

03

13 IPhone OS: Introduction to iPhone Architecture, Essential COCOA TouchClasses, Interface Builder, Nib File, COCOA and MVC Framework, Overview of features of latest ios

06

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 Android Wireless Application Development, second edition by Shane Conder& Lauren Darcey. Pearson

Reference Books

1 Android Application Development (with Kitkat Support), Black Book by Pradeep Kothari-Dreamtech

2 Head First Android Development by Dawn Griffiths and David Griffiths- O'Reilly

3 Android Programming: The Big Nerd Ranch Guide, 2/e by Bill Phillips, Chris Stewart, Brian Hardy, Kristin Marsicano -Big Nerd Ranch Guides

4 Android Application Development in 24 Hours, 4/e by Carmen Delessio, Lauren Darcey, Shane Conder - Sams Teach Yourself

5 iPhone In Action, by Christopher Allen, Shannon Appelcline.

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE606 Subject Name Microprocessor and Interfacing

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Computer Architecture

Learning Outcome:

After successful completion of this course, student will be able to:

Understand and analyze various components of IT Infrastructure and emerging technologies used in business.

Analyse how to develop and coordinate IT systems strategies, plans and management initiatives within small, medium and large corporate enterprises.

Analyse the performance and operational excellence in business.

Study concerns in business like ethics, security, finance in corporate IT systems.

Theory syllabus

Unit Content Hrs

1

Introduction: Introduction to 8-bit and 16- bit microprocessors, internal architecture and pin diagram of 8085/8086 microprocessor, Minimum and maximum mode, IEEE Floating point representation Timing Diagrams, Read and write machine cycles, Address decoding, Even and Odd memory banks, accessing Memory and I/O ports.

07

2

Programming: Programmers model of 8085/86 - Addressing Modes, accessing data in the memory, instruction set, Instruction encoding format, Introduction to assembly language programming, Assembler, linker, Locator, debugger, emulator concepts. Assembler directives, 8086 programming examples to implement while - do, Repeat - Until, if-then-else constructs etc, String operations, Array, far and near procedures, macros. Timing and delay loops.

10

3

Interrupt Handling: Introduction to interrupt ,8086 interrupt structure, Interrupt Service Routine, Interrupt Vector Table (IVT) - location of IVT in the memory, contents of IVT, 8254 software programmable Timer/counter, 8259A priority interrupt controller, Hardware interrupts and Software interrupts, priority of 8086 interrupts. 8259A priority interrupt controller,

10

4

Microcontroller 8051 micro controller hardware, input/output pins , ports, ports and circuits, external memory, counters and timers, serial data i/o, interrupts.

06

5

8051 Instruction set and Programming External data moves, code memory read PUSH and POP op codes, data exchanges, Byte-level logical operations, bit-level logical operations, rotate and swap operations, Flags, incrementing and decrementing, addition, subtraction, multiplication and division, decimal arithmetic, Jump and call program range, jumps, calls and subroutines, interrupts and returns.

06

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 D. Hall, "Microprocessors and Interfacing", 3’rd edition, 1992, McGraw-Hill, ISBN - 0 - 07 - 100462- 9.

Reference Books

1 Y. Liu, G. Gibson. “Microcomputer Systems: The 80867 8088 Family, Architecture, Programming and Design", 2nd Edition, Prentice-Hall of India, 1986, ISBN 0 -87692 - 409 7.

2 M. Rafiquzzaman, "Microprocessors - Theory and applications: Intel and Motorola", Revised edition, 2002, Prentice Hall, (Chapters 5. 7, 8) ISBN 81 - 203 - 0848 - 4P.

3 P. Abel, "Assembly Language Programming", 5th edition, Pearson Education, 2002, ISBN 81 - 203 -1037 - 3.

4 R. Denkon, "Advanced MS-DOS Programming", 2nd edition, BPB Publications, 2002, ISBN 81 -7029 - 485 - 1 (Chapters 2, 3, 4, 14).

5 The 8051 Microcontroller and Embedded Systems By Mazidi&Mazidi (PHI)

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE607 Subject Name Network Programming

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Computer Networks

Learning Outcome:

After successful completion of this course, student will be able to

Demonstrate advanced knowledge of networking.

Make use of various solutions to perform inter-process communications.

Demonstrate knowledge of protocols and languages used in Web and multimedia delivery.

Demonstrate advanced knowledge of programming for network communications.

describe major technologies used in network communications

Theory syllabus

Unit Content Hrs

1 Introduction: The OSI Model and the TCP/IP Protocol Suite, Underlying Technologies

03

2

IP Addresses: Classful Addressing, Classless Addressing, Delivery, Forwarding, and Routing of IP Packets,ARP and RARP, Internet Protocol (IP), Internet Control Message Protocol (ICMP), Internet Group Management Protocol (IGMP), User Datagram Protocol (UDP), Transmission Control Protocol (TCP), Stream Control Transmission Protocol (SCTP)

06

3 Unicast Routing Protocols: RIP, OSPF, and BGP 05

4 Multicasting and Multicast Routing Protocols, Host Configuration: BOOTP and DHCP 04

5 Domain Name System (DNS): 02

6 Remote Login: TELNET

03

7 File Transfer: FTP and TFTP 04

8 Electronic Mail: SMTP, POP, and IMAP 06

9 Network Management: SNMP 05

10 World Wide Web: HTTP 04

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 TCP/IP Protocol Suite, 3/e By Behrouz Forouzan, Tata-mc-graw hill.

Reference Books

1 TCP/IP Illustrated, Volume I By W. Richard Stevens, Low Price Edition

2 Internetworking with tcp/ip: principles, protocols, and architecture vol. I By comer, douglas

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE608 Subject Name Computer Graphics

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Computer Programming

Learning Outcome:

After successful completion of this course, student will be able to

Know application of Computer Graphics in various fields.

Use the underlying algorithms, mathematical concepts, supporting computer graphicsand fill the color inside the object.

Explain about how picture is display and produce color picture on the display device.

Able to apply 2D – 3D alteration on the objects and perform clipping on object.

Theory syllabus

Unit Content Hrs

1 Introduction: What is Computer Graphics? Application of Computer Graphics 01

2 Overview of Graphics System: Video Display Devices, Raster Scan System, Random Scan System 03

3 Output Primitives: Points and Lines, DDA Algorithm, Bresenham’s Line Algorithm, Midpoint Circle Algorithm, Midpoint Ellipse Algorithm, Boundary fill algorithm, Flood fill algorithm

07

4

2 D Geometric Transformations: Basic Transformations, Matrix Representation and Homogeneous Coordinates, Composite Transformation, Reflection, Shear, Transformation between Coordinate System, Raster Methods for Transformation

08

5 D Viewing: Window-to-View port Coordinate Transformation, Line Clipping Algorithms, Curve Clipping Text Clipping, Exterior Clipping

05

6 3 D Concepts: Parallel Projection, Perspective Projection, Depth Cueing, Surface Rendering, Three-Dimensional and Stereoscopic Views

01

7 3 D Geometric Transformation: Translation, Rotation, Scaling, Reflection, Shears, Composite Transformations 05

8 Color models: Properties of light, XYZ, RGB, YIQ and CMY Color models, Conversion between color models 04

9 Advanced topics: Antialiasing, Visible surface detection concepts, back-face detection, depth buffer method illumination methods (ambient, diffuse reflection, specular reflection), Computer Animation

08

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 Computer Graphics C version By Donald Hearn and M.Pauline Baker

Reference Books

1 Computer Graphics By ZhigangXizng and Roy Plastock

2 Graphics: Principles And Practice. By J.Foley, A. Van Dam, S. Feiner, and J. Hughes

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE609 Subject Name Cloud Computing

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Computer Networks

Learning Outcome:

At the end of the course, students will have achieved the following learning objectives.

Understand the hardware, software concepts and architecture of cloud computing.

Realize the importance of Cloud Virtualization, Abstractions and Enabling Technologies.

Explore the Programming for Applications on Cloud.

Theory syllabus

Unit Content Hrs

1

Introduction: Cloud Computing, Layers and Types of Clouds, Cloud Infrastructure Management, Challenges and Applications. Virtualization: Virtualization of Computing, Storage and Resources. Cloud Services: Introduction to Cloud Services IaaS, PaaS and SaaS

08

2

Software as a Service (SaaS): Evolution of SaaS, Challenges of SaaS Paradigm, SaaS Integration Services, SaaS Integration of Products and Platforms.Infrastructure As a Services (IaaS): Introduction, Background & Related Work, Virtual Machines Provisioning and Manageability, Virtual Machine Migration Services, VM Provisioning and Migration in Action. Platform As a service (PaaS): Integration of Private and Public Cloud,Technologies and Tools for Cloud Computing, Resource Provisioning services

09

3

MapReduce Programming models and Implementations: Introduction, Map Reduce Programming Model, Major Map Reduce Implementations for the Cloud, Map Reduce Impacts.Migrating into a Cloud: Cloud Services for Individuals, CloudServices Aimed at the Mid- Market, Enterprise Class Cloud Offering, Introduction to File System & Hadoop

07

4 Management and Monitoring: Accounts Monitoring, User profiles in Cloud, Resource Allocation and Pricing in Cloud 04

5

Security: Introduction, Cloud Storage: from LANs to WANs, Technologies for Data Security in Cloud Computing, Security Concerns, Legal issues and Aspects, Securing the Private and Public Cloud Architecture

04

6 Cloud Middleware: OpenStack, Eucaluptus, Windows Azure, CloudSim, EyeOs, Aneka, Google App Engine

08

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 RajkumarBuyya, James Broberg, Andrzej M Goscinski, Cloud Computing: Principles and Paradigms, Wiley publication

2 Toby Velte, Anthony Velte, Cloud Computing: A Practical Approach, McGraw-Hill Osborne Media.

Reference Books

1 George Reese, Cloud Application Architectures: Building Applications and Infrastructure in the Cloud, O'Reilly Publication

2 John Rhoton, Cloud Computing Explained: Implementation Handbook for Enterprises, Recursive Press

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2HS601 Subject Name Aptitude Skill Building - II

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 0 0 1 - 1 Theory - - -

Hours 0 0 2 - 2 Practical 30 20 50

Pre-requisites:

Aptitude Skill Building – I

Learning Outcome:

On successful completion of the course the students will be able to:

Acquire satisfactory competency in use of two basic skills (Quantitative Ability and Logical Reasoning).

Solve campus placements aptitude papers covering Quantitative Ability and Logical Reasoning.

Theory syllabus

-

Practical content

Unit Content Hrs

1

Arithmetic Aptitude: Square Root and Cube Root, Surds and Indices, Ratio and Proportion, Chain Rule, Pipes and Cistern, Boats and Streams, Alligation or Mixture, Logarithm, Races and Games, Stocks and Shares, Probability, True Discount, Banker's Discount, Odd Man Out and Series

10

2 Data Interpretation: Pie Charts, Line Charts 04

3 Logical Reasoning: Analyzing Arguments, Statement and Assumption, Course of Action, Statement and Conclusion, Theme Detection, Cause and Effect, Statement and Argument, Logical Deduction

06

4 Verbal Reasoning: Seating Arrangement, Character Puzzles, Direction Sense Test, Classification , Data Sufficiency, Arithmetic Reasoning, Verification of Truth

06

Text Books

1 Quantitative Aptitude: By R. S. Aggarwal. S. Chand Publishers

Reference Books

1 A Modern Approach to Logical Reasoning: By R. S. Aggarwal. S. Chand Publishers

2 A Modern Approach To Verbal And Non-Verbal Reasoning: By R. S. Aggarwal. S. Chand Publishers

3 An Advanced Approach To Data Interpretation: By Dr. R. S. Aggarwal. S. Chand Publishers.