school of computing science and engineering …...school of computing science and engineering...

School of Computing Science and Engineering

Department of Computer Science and Engineering

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CTIS/2019 R4 / 23 October 2019

B. Tech CSE (with specialization in Cloud Technology and Information Security) Semester – III

CIA: Continuous Internal Assessment

L: Theory Lecture

T: Tutorial

P: Practical

TH: Theory Exam.

#: Internship for 15 days.

*: Oral Examination

UC: University Core

PC: Programme Core

PE: Programme Elective

CIA Weightage Description CIA 1 10% Home Assignment CIA 2 20% Mid-Term Exam (MTE) CIA 3 10% Seminar Presentation CIA 4 10% Research Based Activity

TOTAL 50%

Sr. No. Core Course Code Course Name

Teaching Scheme (Hrs./Week)

Examination Scheme

Total Marks

L T P C

Formative Assessment

CIA

Summative Assessment

ESE Course Lab Course Lab

1 UC 17YBS304 Discrete Mathematics and Logic 3 -- -- 3 50 -- 50 -- 100

2 PC 17YCT301 Digital Design and Computer Organization 3 -- -- 3 50 -- 50 -- 100

3 PC 17YCT302 Object Oriented Programming 3 -- -- 3 50 -- 50 -- 100

4 PC 17YCT303 Data Structures 3 -- -- 3 50 -- 50 -- 100

5 PC 17YCT304 Information Security Fundamentals 3 -- -- 3 50 -- 50 -- 100

6 PC 17YCT311 Object Oriented Programming Lab -- -- 4 2 -- 25 -- 25 50

7 PC 17YCT312 Data Structure Lab -- -- 4 2 -- 25 -- 25 50 8 PC 17YCT314 Introduction to Public Speaking -- -- 2 1 -- 100 -- - 100

9 UC 17YCT315 Internship I -- 1 -- 1 -- 50 -- -- 50

TOTAL 15 01 10 21 250 200 250 50 750





Year: Second Year Semester – III Course: Discrete Mathematics and Logic Course Code: 17YBS304

Teaching Scheme

(Hrs. /Week) Continuous Internal Assessment (CIA) End Semester

Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 3 1 0 3 10 20 10 10 -- 50 -- 100

Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) - 0Hrs. Prerequisites: Basic Mathematics Objectives: Students are able to:-

1 To impart fundamentals of discrete mathematical structures useful in studying, analysing and solving problems in Computer Science.

2 To sharpen the mathematical skills by practicing problem solving, logical reasoning and writing precise proofs.

3 To impart skills for applying ideas from discrete mathematics to real world problems. Unit No Details Hours

1

Module 1:Need of Set, Representation of Sets, Subsets, Venn Diagrams, complements, Cartesian products, Operations on sets, Laws of Set Theory, Power Sets and Products, cardinality and countability (Countable and Uncountable sets), Partition of sets, Multisets, The Principle of Inclusion - Exclusion.

3

Module 2: Propositions and Logical operations, Truth tables, Equivalence, Implications, Laws of Logic, Normal forms, Predicates and quantifiers, Mathematical Induction.

4

2

Module 1: Relations and their properties, n-array relations and their applications, representing relations, closure of relations, equivalence of relations, partial orderings, Hasse Diagram, Lattices, Chains and Anti-Chains, Transitive Closure and Warshall‘s Algorithm.

3

Module 2: Surjective, Injective and Bijective functions, Inverse Functions and Compositions of Functions, The Pigeonhole Principle.

4

3

Module 1:Basic terminology, representation of a graph in computer memory, multi-graphs and weighted graphs, Subgraphs, Isomorphic graphs, Complete, regular and bipartite graphs, operations on graph.

3

Module 2:Paths and circuits, Euler paths and circuits, Hamiltonian paths and circuits, Planner graphs, shortest path in weighted graphs (Dijkstra’s algorithm), coloring graphs, Isomorphism of Graphs.

3

4 Module 1:Basic terminology and characterization of trees, rooted trees and path length in rooted trees, binary search trees, Tree traversal , Fundamental Trees and cut sets.

4





Module 2: Spanning tree and Minimal Spanning tree, Isomorphism of trees, Weighted trees and Prefix Codes, The Max flow- Min Cut Theorem (Transport network).

4

5

Module 1:Algebraic structures with one binary operation - semi groups, monoids and groups, Isomorphism, homomorphism, automorphism, Cyclic groups,

4

Module 2:Normal sub group, codes and group codes, Algebraic structures with two binary operations - rings, integral domains and fields. Ring homomorphism and Isomorphism.

4

Outcomes: At the end of this course students will be able to:-

1 Solve real world problems logically using appropriate set, function, and relation models and interpret the associated operations and terminologies in context.

2 Analyze and synthesize the real world problems using discrete mathematics. Text Books 1. C L Liu, “Elements of Discrete Mathematics”, Tata McGraw-Hill, ISBN 10:0-07-066913-9. 2. K.H. Rosen, “Discrete Mathematics and its application”, 7th edition, Tata McGraw Hill, ISBN

978-0-07-338309-5. 3. B. Kolman, Robert C. Busby, Sharon Ross, “Discrete Mathematical Structure”, 6th edition,

Pearson/Prentice Hall, ISBN 9780132078450. Reference Book 1. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, 6th edition, McGraw-Hill,

2007, ISBN 978-0-07-288008-3. 2. Tremblay J. P. and R. Manohar, Discrete Mathematical Structures with Applications to

Computer Science, Tata McGraw-Hill, 1997. 3. Bernard Kolman, Robert C. Busby and Sharon Ross, Discrete Mathematical Structures, Prentice-

Hall of India /Pearson, ISBN: 0132078457, 9780132078450. 4. N. Biggs, “Discrete Mathematics -19 850717 – 8.





Year: Second Year Semester – III Course: Digital Design and Computer Organization Course Code: 17YCT301

Teaching Scheme


Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 3 0 0 3 10 20 10 10 -- 50 -- 100

Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) - 0Hrs. Prerequisites: Fundamentals of Programming Languages, Basics of Electronics Engineering Objectives: Students are able to:-

1 To understand the structure, function and characteristics of computer systems & Number System.

2 To understand the various computer systems and logic gates. 3 To understand combinational and sequential logic circuits. 4 To understand memory concept. 5 To understand I/O devices and instruction sets.

Unit No Details Hours

1

Module 1:Basic Organization of Computers, Classification Micro, Mini, Mainframe and Super Computer. System Bus and Interconnection, Computer Function, Interrupt and Class of Interrupts.

3

Module 2: Number systems, Decimal Number system, Binary number system, Octal &Hexa decimal number system,1's & 2's complement, Binary Fixed Point Representation.

4

2

Module 1:Von-Neumann M/c: Structure of IAS. Fundamental Concepts: Fetching and storing a word in Memory, Register Transfer, Performing an Arithmetic & Logic Operation, Execution of Instruction.

3

Module 2: Arithmetic operation on Binary numbers, Overflow & under f low. Logic Gates, AND, OR, NOT GATES and their Truth tables, NOR, NAND & XOR gates.

4

3

Module-1 Half Adder, Full Adder, 4-bit binary adder, multiplexer-2:1, 4:1, 8:1, Demultiplexer-1:2, 1:4, 1:8.

3

Module 2 Latch, Flip Flop-SR FF, D FF, JK FF, Race around condition, T FF, MSJK FF. Shift Registers-SISO, SIPO, PISO,PIPO, Counter-Asynchronous and asynchronous.

3

4 Module 1:Cache memory- Computer Memory system Overview, Memory hierarchy, Cache memory principles, Elements of cache design.

4

Module 2:Internal Memory-Semiconductor main memory, Error correction. 4





External Memory-Magnetic Disk, RAID.

5

Module 1:I/O-External Devices, I/O Modules, Programmed I/O, Interrupt Driven I/O, DMA.

4

Module 2: Instruction Sets-Machine Instruction Characteristics, types of operands, types of operations, Addressing Modes-Instruction Formats. Processor Organization, Register Organization.

4


1 Understand the structure, function and characteristics of computer systems & Number System.

2 Understand the various computer systems and logic gates. 3 Understand combinational and sequential logic circuits. 4 Understand memory concept. 5 Understand I/O devices and instruction sets.

Text Books 1.

McGraw-Hill, ISBN–13:978-1-25-902597-6. 2. –13: 978-0-07- 066911-6. 3.

Education/ Prentice Hall of India, 2003, ISBN 978-93-325-1870-4, 7th Edition. 4. -Hill Publications, 2001,

ISBN- 978-1-25-900537-5, 5th Edition. Reference Book 1. – 13: 978-

81-315-0058-3 2. -Hill Publication, 1998,

ISBN:978-1-25-902856-4, 3rd Edition. 3. –

203 – 1553 – 7, 4th Edition of India /Pearson, ISBN: 0132078457, 9780132078450. 4. N. Biggs, “Discrete Mathematics -19 850717 – 8.





Year: Second Year Semester – III Course: Object Oriented Programming Course Code: 17YCT302

Teaching Scheme


Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 3 0 0 3 10 20 10 10 -- 50 -- 100 Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) - 0Hrs. Prerequisites: Fundamentals of Programming Languages Objectives: Students are able to:-

1 To study the object-oriented programming principles and techniques. 2 To understand fundamental concepts of OOP such as data abstraction, encapsulation,

inheritance, dynamic binding and polymorphism. 3 To create base of cutting-edge programming.


1

Module 1:Principles of OOP: Software crisis, Software evolution, OOP paradigm, Basic Concepts of OOP, Benefits & applications of OOP. Functions: Function, function prototype, accessing function and utility function.

3

Module 2:Moving from C to C++: Declaration of variable, Reference variables, Scope resolution operator, Member dereferencing operator, memory management operators. Beginning with C++: What is C++, Applications of C++, A Simple C++ Program.

4

2

Module 1: Class, Object, class and data abstraction, class scope and accessing class members, Controlling access to members, Objects and Memory requirements, Defining member functions, A C++ program with class, Making an outside function inline, Nesting of member function, Private member function, Arrays within class, Member allocation for objects, Arrays of objects, Objects as function arguments. Static Class members, Static Functions, inline function, Friend Function.

3

Module 2: Constructors, Parameterized constructors, Multiple constructors in a class, Constructors with default arguments, Destructors.

4

3

Module 1: Polymorphism: Operator overloading concept, Use of operator overloading, defining operator overloading, Binary operator overloading.

3

Module 2: Inheritance- Base Class and derived Class, protected members, relationship between base Class and derived Class, Constructor and destructor in Derived Class, Overriding Member Functions, Class Hierarchies, Inheritance, Public and Private Inheritance, Levels of Inheritance, Multiple Inheritance, Ambiguity in Multiple Inheritance.

3





4

Module 1: Pointers- indirection Operators, Memory Management: new and delete, Pointers to Objects, accessing Arrays using pointers, Function pointers, Pointers to Pointers, this Pointer, virtual function, dynamic binding, Virtual destructor.

4

Module 2: function templates, Function overloading, overloading Function templates, class templates, class template and Nontype parameters.

4

5

Module 1: Fundamentals of exception handling techniques, simple exception handling- Divide by Zero, rethrowing an exception, exception specifications.

4

Module 2: Data hierarchy, Stream and files, Stream Classes, Stream Errors, Disk File I/O with Streams, File Pointers, and Error Handling in File I/O, File I/O with Member Functions, Standard Template Library:Introduction to STL, Containers, algorithms and iterators.

4


1 Apply standards and principles to write executable code. 2 Take a problem and develop the structures to represent the solution in the form of objects

and the algorithms. 3 Check the program and, if necessary, find errors in the program and rectify them.

Text Books 1. Balagurusamy, “Object Oriented Programming with C++” Sixth Edition, McGrawHill

Publication, ISBN 13:978-1-25-902993-6. 2.

9780201889543. Reference Book 1. Object-Oriented Programming in C++, fourth edition, Sams Publishing,

ISBN:0672323087 (ISBN 13: 9780672323089). 2.

2011, ISBN:978-00-72226805. 3. Cox Brad, Andrew J. Novobi –Oriented Programming: An Evolutionary

Approach –Wesley, ISBN:13:978-020-1548341.





Year: Second Year Semester – III Course: Data Structures Course Code: 17YCT303

Teaching Scheme (Hrs.

/Week) Continuous Internal Assessment (CIA) End Semester

Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 3 0 0 3 10 20 10 10 -- 50 -- 100 Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) - 0Hrs.

Prerequisites: Fundamentals of Programming Languages Objectives: Students are able to:-

1 To understand the standard and abstract data representation methods. 2 To acquaint with the structural constraints and advantages in usage of the data. 3 To understand the memory requirement for various data structures. 4 To operate on the various structured data. 5 To understand various data searching and sorting methods with pros and cons.


1

Module 1: Introduction to Data Structures: Concept of data, Data object, Data structure, Abstract Data Types, realization of ADT in 'C'. Concept of Primitive and non-primitive, linear and Non-linear, static and dynamic, persistent and ephemeral data structures. Analysis of algorithm: frequency count and its importance in analysis of an algorithm, Time complexity & Space complexity of an algorithm, Big 'O', ‘algorithm

3

Module 2: Search Techniques, Sequential search, variant of sequential search- sentinel search, Binary search, Fibonacci search. Types of sorting-Internal and external sorting, General sort concepts-sort order, stability, efficiency, number of passes, Sorting methods- Bubble sort, Insertion sort, Selection sort, Quick sort, Heap sort, Shell sort

4

2

Module 1: Introduction of stack, Operations on stacks: Push & Pop, Array representation of stack, Linked representation of stack, Application of stack, Conversion of infix to prefix and postfix expressions, Evaluation of the postfix expression using a stack. Iteration and recursion with examples such as binary search, Fibonacci numbers, Use of stack in backtracking

3

Module 2: Array and linked representation, Operations on queue, Types of queue: Circular queues, Advantages of Circular queue. Multiqueues, Dequeues and Priority queue, Linked Queue & operations, Applications of Queue.

4

3 Module 1: Basic concept, Representation of linked lists, Comparison of sequential 3





& linked organizations, Operations on linked list, linked list as ADT, Linked list using dynamic memory management, Types of linked list: Linear, Circular linked list, Doubly linked list and operations, Module 2: Applications of linked list: Polynomial representation and addition, Polynomial addition & Multiplication using linked list, Generalized Linked list(GLL) concept, polynomial representation

3

4

Module 1: Tree- basic terminology, General tree and its representation, representation using sequential and linked organization, Binary tree- properties, converting tree to binary tree, binary tree traversals- inorder, preorder, post order, level wise -depth first and breadth first, Operations on binary tree. Binary Search Tree (BST), BST operations, Threaded binary tree- concepts, threading,

4

Module 2: Graph- Basic Concepts, Storage representation, Adjacency matrix, adjacency list, Traversals-depth first and breadth first. Minimum spanning Tree, Prims and Kruskal Algorithms, Dikjtra's Single source shortest path, Topological ordering.

4

5

Module 1: Symbol Table-Representation of Symbol Tables- Static tree table and Dynamic tree table, Height Balanced Tree- AVL tree. Indexing and Multiway Trees-Indexing, indexing techniques, Types of search tree- Multiway search tree, B-Tree, B+Tree

4

Module 2: Hash Table- Concepts-hash table, hash function, bucket, collision, probe, synonym, overflow, open hashing, closed hashing, perfect hash function, load density, full table, load factor, rehashing, issues in hashing, hash functions properties of good hash function. Heap-Basic concepts, realization of heap and operations

4


1 To discriminate the usage of various structures in approaching the problem solution. 2 To design the algorithms to solve the programming problems. 3 To use effective and efficient data structures in solving various Computer Engineering

domain problems. 4 To analyze the problems to apply suitable algorithm and data structure. 5 To use appropriate algorithmic strategy for better efficiency

Text Books 1.

0716782928 ISBN 13: 9780716782926. 2.

ISBN-978-81-265-1260-7 Reference Book 1.

ISBN 9788131503140. 2.

ISBN-13, 9788175152571. 3. YedidyahLangsam, Moshe J Au

C++ -317-0328-2.





4. ISBN:0-19-510843-4.





Year: Second Year Semester – III Course: Information Security Fundamentals Course Code: 17YCT304



Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 3 -- - 3 10 20 10 10 -- 50 -- 100 Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) – 0 Hrs. Prerequisites: Basic concept of networking Objectives: Students are able to:-

1 The course primarily covers the Types of Threats, Vulnerabilities, Risks and various terminologies in Information Security.

2 It explains the formation of Security policy at various levels inside the Organization and provides the definition Procedures, Standard and Guidelines.

3 The units emphasizes the need of Performing Asset Classification and Declassification, Retention and Disposal of Information Asset also it identifies the various levels of Authorization for access Viz., Owner, Custodian and User.


1

Module 1: Introduction to Information Security: Definition of Information Security, Evolution of Information Security; Basics Principles of Information Security; Critical Concepts of Information Security; Components of the Information System;

5

Module 2: Balancing Information Security and Access; Implementing IT Security, The system Development Life cycle, Security professional in the organization.

5

2

Module 1 The Need for IT Security : Business Needs-Protecting the functionality, Enabling the safe operations, Protecting the data, safe guarding the technology assets; Threats-compromises to Intellectual property, deliberate software attacks, Espionage and trespass, sabotage and vandalism;

8

Module 2: Attacks-Malicious Codes, Back Doors, Denial of Service and Distributed Denial of Service, Spoofing, sniffing, Spam, Social Engineering. 5

3

Module 1 Risk Management : Definition of risk management, risk identification, and risk control, Identifying and Accessing Risk,

5

Module 2: Assessing risk based on probability of occurrence and likely impact, the fundamental aspects of documenting risk via the process of risk assessment, 7





the various risk mitigation strategy options, the categories that can be used to classify controls. Network Infrastructure Security and Connectivity

4

Module 1: Understanding Infrastructure Security: Device Based Security, Media-Based Security, Monitoring and Diagnosing; Monitoring Network- Firewall, Intrusion Detection System, Intrusion

5

Module 2: Prevention system; OS and Network Hardening, Application Hardening; Physical and Network Security- Policies, Standards and Guidelines. 5

5

Module 1: Security Technology: Access Control, Firewall, Protecting Remote Connections; Honeypots and Honeynets,

3

Module 2: Introduction of Scanning and Analysis Tools, Basics of Biometric Access Control. 3

Outcomes: On completion of the course, student will be able to–

1 To enable students to understand the concepts of IT security, Threats, Vulnerabilities, Impact and

control measures.

2 And also to get familiarize with Asset management along with the objective to create awareness in

Digital Rights management

Text Books 1. Information Security Risk Analysis - Thomas R. Peltier, Third Edition, Pub: Auerbach, 2012 2. Operating System Concepts, 8th Edition by Abraham Silberschatz, Peter B. Galvin, Greg Gagne,

Pub: John Wiley & sons, Inc., 2009. Reference Book 4. Information security: Principles and Practice - Mark Stamp, 2nd Edition, Pub: John Wiley & Sons,

Inc., 2011 Web Reference:

1. http://nptel.ac.in/courses/106103068/ 2. http://www.geeksforgeeks.org/computer-organization-and-architecture-tutorials/





Year: Second Year Semester – III Course: Object Oriented Programming Lab Course Code:17YCT311



Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 0 0 4 2 -- -- -- -- 25 0 25 50

Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs. Prerequisites: C Programing Language Objectives: Students are able to:-

1 Understand Fundamental concept of Object oriented programing 2 Understand Abstraction, Encapsulation, Inheritance and Polymorphism 3 Understand Concept of real work problem solving using OOP 4 Understand to provide solutions to complex real world problems

Guidelines for Assessment Continuous assessment of laboratory work is done based on overall performance and lab assignments performance of student. Each lab assignment assessment will assign grade/marks based on parameters with appropriate weightage. Suggested parameters for overall assessment as well as each lab assignment assessment include- timely completion, performance, innovation, efficient codes, punctuality and neatness. Guidelines for Laboratory Conduction The instructor is expected to frame the assignments by understanding the prerequisites, technological aspects, utility and recent trends related to the topic. The assignment framing policy need to address the average students and inclusive of an element to attract and promote the intelligent students. The instructor may set multiple sets of assignments and distribute among batches of students. It is appreciated if the assignments are based on real world problems/applications. Encourage students for appropriate use of Hungarian notation, Indentation and comments. Use of open source software is encouraged. In addition to these, instructor may assign one real life application in the form of a mini-project based on the concepts learned. Instructor may also set one assignment or mini-project that is suitable to respective branch beyond the scope of syllabus. Set of suggested assignment list is provided in three groups. Each student must perform at least 13 assignments as at 05 compulsory from group A, 07 from group B and 01 from group C Operating System recommended : 64-bit Open source Linux or its derivative Programming tools recommended: Open Source C Programming tool like GCC

Suggested List of Laboratory Assignments Group A (Compulsory Assignments)

1. Create class Student having Roll No. and Name member variable and get_data () and put_data() member functions. Take values for member variables through member functions and print those values by calling member functions through object.

2. Create any one class and demonstrate the use of static member variable and static member





functions. 3. Write a program to display name and age of five managers using array of objects. 4. Write a program to demonstrate the use of friend function within class. 5. Write a program containing Default Constructor, Parameterized Constructor, and Destructor.

Group B (Any 7) 1. Write a program to sort the numbers in an array using separate functions for read, display, sort

and swap. 2. Write a program to perform addition, subtraction, multiplication and division operations on

complex numbers. 3. Write a program to implement database of persons using inheritance which have different

profession e,g. engineer, doctor, student, laborer etc. 4. Write a program to perform addition, subtraction, multiplication and division operations on

complex numbers using operator overloading. 5. Write a program using Constructors and destructors to implement Stack. Design the class for

stack and the operations to be performed on stack. 6. Write a program in C++ to handle the “Divide by zero” exception. 7. Write a program in C++ using the open (), eof() and getline() member functions to open and

read file content line by line. 8. Write a program in C++having class Number which has inline function mult() and cube() for

calculating the multiplication of 2 double numbers given and cube of the integer number given. 9. Write a program in C++ for bubble sort using function template. 10. Write a program in Java with class Rectangle with the data field’s width, length, area and

colour. The length, width and area are of double type and colour is of string type. The methods are get_length(), get_width(), get_colour() and find_area(). Create two objects of Rectangle and compare their area and colour. If the area and colour both are the same for the objects then display “Matching Rectangles”, otherwise display “Non-matching Rectangle”.

Group C (Any 1) 1. Write a program to store roll numbers of student in array who attended training program in

random order. Write function for- a) Searching whether particular student attended training program or not using linear search and sentinel search. b) Searching whether particular student attended training program or not using binary search and Fibonacci search.

2. Write program to implement a priority queue in C++ using an inorder List to store the items in the queue. Create a class that includes the data items (which should be template) and the priority (which should be int) The inorder list should contain these objects, with operator <= overloaded so that the items with highest priority appear at the beginning of the list (which will make it relatively easy to retrieve the highest item.)





Year: Second Year Semester – III Course: Data Structures Lab Course Code: 17YCT312



Examination Total


Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs. Prerequisites: Basic Programming Language Objectives: Students are able to:-

1 To perform different c operations. 2 To understand searching and sorting.



1. Write a program to perform Set operations - Union, Intersection, Difference, Symmetric Difference etc. 2. Write a program to perform various string operations such as Copy, Length, Reversing, Palindrome, and

Concatenation and to find occurrence substring etc with and without using library functions. 3. Write a program to perform following operations on any database: Add, Delete, Modify, Display, Search

& Sort etc. 4. Implement Sorting Methods using functions- Bubble Sort, Selection Sort and Insertion Sort.





5. Implement Searching Methods-Sequential Search and Binary Search. Group B (Any 7)

1. Implement Sorting Methods using recursion- Quick Sort and Merge Sort. 2. Represent polynomial using structures and write a menu driven program to perform Addition,

Multiplication and Evaluation. 3. Write a menu driven program to perform following operations on SLL/CDLL: Create, Insert – Start, end,

between, Search & delete, Reverse, Display etc. 4. Create two Singly Linked lists, sort one after creation and one while creation using Pointer manipulation.

Merge these two lists into one list without creating a new node or swapping of the data. 5. Represent a polynomial using Circular Linked List and write a menu driven program to perform

Addition, Multiplication and Evaluation. 6. Implement Stack as an ADT using Array. Use this ADT to perform expression conversion and

evaluation (infix to postfix, infix to prefix, prefix to infix, prefix to postfix, postfix to infix and postfix to prefix).

7. Represent Circular Queue using Linked List and write a program to perform operations like Insert, Delete, Finding front and rear element.

8. Write a program for simulating job queue. Write functions to add job and delete job from queue. 9. Write a program for linked implementation of Stack & Queue. 10. Pizza parlor accepting maximum M orders. Orders are served in first come first served basis. Order once

placed cannot be cancelled. Write C++ program to simulate the system using circular queue using array. Group C (Any 1)

1. Write a program to store roll numbers of student in array who attended training program in random order. Write function for- a) Searching whether particular student attended training program or not using linear search and sentinel search. b) Searching whether particular student attended training program or not using binary search and Fibonacci search.

2. Write program to implement a priority queue in C++ using an inorder List to store the items in the queue. Create a class that includes the data items (which should be template) and the priority (which should be int) the inorder list should contain these objects, with operator <= overloaded so that the items with highest priority appear at the beginning of the list (which will make it relatively easy to retrieve the highest item.)





Year: Second Year Semester – III Course: Introduction to Public Speaking Course Code: 17YCT313

Teaching Scheme


Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab - - 2 1 -- -- -- -- 25 25 50 Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs. Prerequisites: No prerequisites. Objectives:

1 To impart good public speaking skills in the students and give them more confidence in both professional and personal life


1

Module 1: Oral Communication Principles of nonverbal communication - through clothes and body language, Types of managerial speeches - speech of introduction, speech of thanks, occasional speech, theme speech

6

Module 2:Mastering the art of giving interviews in selection or placement interviews, discipline interviews, appraisal interviews, exit interviews, Building Persuasion & Negotiation abilities

6

2 Module 1 Body Language& Grooming Introduction to Body Language, Postures, Gestures, Eye contact, Personality styles, Grooming, Dress code

5

3

Module 1: Art of Communicating in Groups Reading Comprehension, Group communication by way of meetings & group discussions

7

Module 2 Business presentation - Features of good presentations - Planning, Structuring and Delivering presentations - Handling questions - Coping with nervousness.

6

Outcomes: 1 Students will have better communication skills. 2 Students will have better ability to represent among group of professionals. 3 Students will learn how to perform in interviews. Text Books

1. Matthukutty M Monippally, Business Communication Strategies, Tata McGraw-Hill.





Reference Book 1. Chaturvedi P.D. et al, Business Communication; Concepts, Cases, & Applications, Pearson

Education. 2. Shirley Taylor, Communication for Business, Pearson Education. 3. Lesiicar and Flatley, BasicBusiness Communication, Tata McGraw-Hill. 4. Courtan L. Bovee et al., Business Communication Today, Pearson Education.





Year: Second Year Semester – III Course: Industry Internship-I Course Code: YCT314

Teaching Scheme


Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab -- 1 -- 1 -- -- -- -- 50 -- -- 50 Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 00 Hrs. Objectives: Students are able to:-

1 To expose students to the 'real' working environment and get acquainted with the organization structure, business operations and administrative functions.

2 To set the stage for future recruitment by potential employers. Unit No Details Hours

1

Course (catalog) description: As a part of the B. Tech Curriculum, Industry Internship is a Practical course, in which the students of CSE are trained for technical skills. Grading: The Course is graded based on: Presentation : 50% Student’s reports : 50% Employers Expectations: Source of highly motivated pre professionals. Students bring new perspectives to old problems. Visibility of your organization is increased on campus. Quality candidates for temporary or seasonal positions and projects. Freedom for professional staff to pursue more creative projects. Flexible, cost effective work force not requiring a long term employer commitment. Proven, cost effective way to recruit and evaluate potential employees. Your image in the community is enhanced as you contribute your expertise to the educational enterprise


1 An ability to work in actual working environment. 2 An ability to utilize technical resources. 3 An ability to write technical documents and give oral presentations related to the work

completed.





B. Tech CSE (with specialization in Cloud Technology and Information Security)

Semester – IV

CIA: Continuous Internal Assessment

L: Theory Lecture

T: Tutorial

P: Practical

TH: Theory Exam.

#: Internship for 15 days.

*: Oral Examination

UC: University Core

PC: Programme Core

PE: Programme Elective

CIA Weightage Description

CIA 1 10% Home Assignment CIA 2 20% Mid-Term Exam (MTE)

CIA 3 10% Seminar Presentation

CIA 4 10% Research Based Activity

TOTAL 50%

Sr. No. Core Course

Code Course Name

Teaching Scheme (Hrs./Week)

Examination Scheme

Total Marks

L T P C

Formative Assessment

CIA

Summative Assessment

ESE Course Lab Course Lab

1 UC 17YBS401 Modern Mathematics 3 1 -- 4 50 -- 50 -- 100

2 PC 17YCT401 Object Oriented Programming in Java 3 -- -- 3 50 -- 50 -- 100

3 PC 17YCT402 Database Management System 3 -- -- 3 50 -- 50 -- 100

4 PC 17YCT403 Introduction to Cloud Computing 3 1 -- 4 50 -- 50 -- 100

5 UC 17YHS401 Professional Ethics 3 -- -- 3 50 -- 50 -- 100

6 PC 17YCT411 Object Oriented Programming in Java Lab -- -- 4 2 -- 25 -- 25 50

7 PC 17YCT412 Database Management System Lab -- -- 4 2 -- 25 -- 25 50

8 PC 17YCT413 Study Skills and Language -- 2 1 -- 100 -- -- 100

9 UC 17YFF401/ 17YFG402

Foreign Language (French / German ) 2 -- 2 3 50 -- 50 -- 100

TOTAL 17 02 12 25 300 150 300 50 800





Year: Second Year Semester – IV Course: Modern Mathematics Course Code: 17YBS401

Teaching Scheme


Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 3 0 0 3 10 20 10 10 50 100 Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs. Prerequisites: Basic Mathematics Objectives: The course will enables students to:-

1 To solve order linear differential equations. 2 To find the roots of polynomial equations by using numerical methods and to learn the

concepts of interpolation. 3 To understand the basic concepts of probability distributions, correlation, regression and

fitting of curves. 4 To understand the basic concepts of linear Programing problems. 5 To find the optimal solution of LPP by using simplex and dual simplex method


1 Module 1: Linear Differential Equations with constant coefficients, Homogeneous Linear differential equations, 4

Module 2: Applications of LDE with constant coefficients to Electrical systems. 4

2

Module 1: Zeroes of transcendental and polynomial equation using Bisection method, Secant method, Regula falsi method and Newton Raphson method, Rate of convergence of above methods.

4

Module 2:Interpolation: Finite differences, difference tables, Newton’s forward and backward interpolation, Lagrange’s and Newton’s divided difference formula for unequal intervals.

3

3

Module 1 Probability: Random variable, Binomial, Poisson, and Normal distributions. 4

Module 2: Fitting of curves: Coefficient of correlation and lines of regression of bivariate data, Fitting of Curves by method of Least squares. 4

4

Module 1: Formulation of Linear Optimization Problems, constraints, Graphical method to solve LPP, 4

Module 2: Standard and Canonical forms, basic solutions and feasible solutions, optimal solutions by simplex method. 3

5 Module 1: Artificial Variables, Duality concept, formulation of dual problems, duality principle, 4





Module 2: Relation between Primal and Dual L.P.P., Dual simplex method. 4 Outcomes: On completion of the course, student will be able to–

1 Solve linear differential equation using appropriate techniques. 2 Apply statistical methods like correlation, regression analysis and probability theory for

analysis and prediction of a given data as applied to machine intelligence. 3 Solve Linear Programming Problems.

Text Books 1. B. S. Grewal, Higher Engineering Mathematics, 43rd edition, Khanna Publishers. 2. A text book of Applied Mathematics: Vol. I, II and III by J. N. Wartikar& P. N. Wartikar ,

VidyarthiGrihaPrakashan, Pune. 3. Operations Research by T. A. Taha. Reference Book 1. Ervin Kreyszig, Advanced Engineering Mathematics, 10th edition, John Wiley and Sons. 2. Peter V. O'Neil, Advanced Engineering Mathematics, 7th edition, Cengage Learning. 3. Operations Research by S. D. Sharma.





Year: Second Year Semester – IV Course: Object Oriented Programming in Java Course Code: 17YCT401

Teaching Scheme


Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 3 - 3 10 20 10 10 -- 50 -- 100 Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs. Prerequisites: C, C++. Objectives: The course will enables students to:-

1 To understand fundamental concepts of OOP such as data abstraction, encapsulation, inheritance, dynamic binding and polymorphism.

2 To understand the implementation of OOP concepts with JAVA. 3 To learn the features of core java that makes it more popular.


1

Module 1: Introduction: Programming language Types and Paradigms, Why Java , Flavors of Java, Features of Java Language, 4

Module 2: JVM –The heart of Java, Java’s Magic Bytecode, Java Program Development, Data types, Loops, Java Source File Structure, Compilation, Executions.

4

2

Module 1: Inheritance : Use and Benefits of Inheritance in OOP, Types of Inheritance in Java, Inheriting Data members and Methods , Role of Constructors in inheritance.

4

Module 2:Overriding Super Class Methods, Use of “super”, Polymorphism in inheritance, Type Compatibility and Conversion Implementing interfaces. 3

3

Module 1Array & String:Defining an Array, Initializing & Accessing Array, Multi –Dimensional Array, Operation on String, Mutable & Immutable String, 4

Module 2:Using Collection Bases Loop for String, Tokenizing a String, Creating Strings using StringBuffer. 4

4

Module 1:Exception Handling:The Idea behind Exception, Exceptions & Errors, Types of Exception, Control Flow In Exceptions, JVM reaction to Exceptions, Use of try, catch, finally, throw, throws in Exception Handling, In-built and User Defined Exceptions, Checked and Un-Checked Exceptions.

4

Module 2:File Handling:Input/Output Operation in Java (java.io Package), Streams and the new I/O Capabilities, Understanding Streams, The Classes for Input and Output, The Standard Streams, Working with File Object, File I/O Basics, Reading and Writing to Files, Buffer and Buffer Management.

3





5

Module 1:GUI Programming:Designing Graphical User Interfaces in Java, Components and Containers, Basics of Components, Using Containers, Layout Managers, AWT Components, Adding a Menu to Window, Extending GUI Features Using Swing Components, Java Utilities (java.util Package) The Collection Framework : Collections of Objects , Collection Types, Sets , Sequence, Map, Understanding Hashing, Use of ArrayList & Vector.

4

Module 2:Event Handling:Event-Driven Programming in Java, Event- Handling Process, Event-Handling Mechanism, The Delegation Model of Event Handling, Event Classes, Event Sources, Event Listeners.

4


1 Implement Object Oriented Programming Concepts 2 Use and create packages and interfaces in a Java program 3 Use graphical user interface in Java programs 4 Create Applets 5 Implement exception handling in Java 6 Implement Multithreading 7 Use Input/output Streams

Text Books 1. E Balagurusamy "Programming with Java", Fifth Edition, McGraw Hill Education, 2014, ISBN:

978-9351343202. 2. Herbert Schildt, “Java A Beginner's Guide”, 6th Edition, Tata McGraw-Hill , 2014, ISBN:

9789339213039. 3. R. Nageswara Rao, “Core Java: An Integrated Approach”, 1est Edition, DreamtechPress , 2016,

ISBN: 978-9351199250. Reference Book 1. Herbert Schildt"Java: The Complete Reference"; Ninth Edition, Oracle Press, ISBN 978-0-07-

180855-2. 2. D.T.Editorial Serices "Java 8 programming" Black Book. 3. D.T Editorial Services, R. Nageswara Rao"Core Java: An Integrated Approach"





Year: Second Year Semester – IV Course: Database Management System Course Code: 17YCT402

Teaching Scheme


Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 3 - - 3 10 20 10 10 -- 50 -- 100 Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs. Prerequisites: Elementary knowledge about computers including experience of using UNIX. Computer Programming & Utilization Knowledge about data structures and algorithms, corresponding to the basic course on Data Structures and Algorithms. Objectives: The course will enables students to:-

1 To understand the fundamental concepts of database management 2 To learn databases and applications software primarily in the relational model 3 To use querying languages, primarily SQL, and other database supporting software 4 To understand the basic issues of transaction processing and concurrency control 5 To implement security and integrity policies relating to databases


1

Module 1: Database Concepts, Database System Architecture, Data Modelling: Data Models, Basic Concepts, entity, attributes, relationships, constraints, keys, users and architecture of DBA

4

Module 2: Components of E-R Model, conventions, converting E-R diagram into tables, EER Model components, converting EER diagram into tables, legacy system model

4

2

Module 1: Basic concepts, Attributes and Domains, Codd's Rules, Relational Integrity: Domain, Entity, Referential Integrities, Enterprise Constraints, Views, Schema Diagram, Database Design : Functional Dependency,Directives

4

Module 2: Purpose of Normalization, Data Redundancy and Update Anomalies, Normalization: 1NF, 2NF, 3NF, BCNF. Decomposition: lossless join decomposition and dependency preservation, Multi valued Normalization (4NF), Join Dependencies and the Fifth Normal Form

3

3

Module 1: Introduction to SQL: Characteristics and advantages, SQL Data Types and Literals, DDL, DML, DCL, TCL,SQL Operators, Tables: Creating, Modifying, Deleting, Views: Creating, Dropping, Updating using Views, Indexes, Nulls

4

Module 2: SELECT Query and clauses, Set Operations, Predicates and Joins, Set membership, Tuple Variables, Set comparison, Ordering of Tuples, Aggregate 4





Functions, Nested Queries, Database Modification using SQL Insert, Update and Delete Queries, MongoDB

4

Module 1: Stored Procedures, Cursors, Triggers, assertions, roles and privileges Programmatic SQL: Embedded SQL, Dynamic SQL 4

Module 2: Basic concept of a Transaction, Transaction Management, Properties of Transactions, Concept of Schedule, Serial Schedule, Serializability: Conflict and View, Cascaded Aborts, Recoverable and Non- recoverable Schedules

3

5

Module 1: Need, Locking Methods, Deadlocks, Time-stamping Methods, Optimistic Techniques, Recovery methods : Shadow-Paging and Log-Based Recovery, Checkpoints

4

Module 2: Centralized and Client-Server Architectures, 2 Tier and 3 Tier Architecture,Introduction to Parallel Databases, Key elements of Parallel Database Processing, Architecture of Parallel Databases,Introduction to Distributed Databases, Architecture of Distributed Databases, Distributed Database Design, Internet Databases, Database Connectivity using Mongo databases

4


1 Learn fundamental concepts of database management 2 Analyze database models & entity relationship models 3 Apply the basics of database languages and construct queries using SQL, PLSQL 4 Design cost effective transaction queries for databases.

Text Books 1. Silberschatz A., Korth H., Sudarshan S., "Database System Concepts", 6thEdition, McGraw

Hill Publishers, ISBN 0-07-120413-X Reference Book

1. S.K.Singh, Database Systems : Concepts, Design and Application , 2nd Edition, Pearson, 2013,

2. Connally T., Begg C., "Database Systems", 3rd Edition, Pearson Education, 2002, ISBN 81-7808-X

3. P. S. Deshpande, “SQL & PL / SQL for Oracle 11g Black Book”, DreamTech Publication





Year: Fourth Year Semester – IV

Course: Introduction to Cloud Computing Course Code: 17YCT 403


/Week) Continuous Internal Assessment (CIA)

End Semester Examination

Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 3 0 0 3 10 20 10 10 -- 50 -- 100 Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) - 0Hrs. Prerequisites: Basic information of cloud

Objectives:

Students are able to:- 1 The student will learn about the cloud environment, building software systems and components that

scale to millions of users in modern internet, cloud concepts capabilities across the various cloud service models including Iaas,Paas, Saas, and developing cloud based software applications on top of cloud platforms.

2 To learn how to use Cloud Services. 3 To implement Virtualization


1

Module 1:Fundamentals of Cloud Computing: Cloud Computing Basics – History of Cloud Computing, Characteristics of Cloud Computing, Need for Cloud computing, Advantages and Possible Disadvantages of cloud computing,

5

Module 2: Cloud Deployment Models – Public, Private, Hybrid, Community, Other deployment Models. Evolving Data Center into Private Cloud, Datacenter Components, Extracting Business value in Cloud Computing – Cloud Security, Cloud Scalability, Time to Market, Distribution over the Internet, Cloud Computing Case Studies.

4

2

Module 1 :Cloud Delivery Models: Introduction to Cloud Services, Infrastructure as a Service (IaaS) – Overview, Virtualization, Container, Pricing Models, Service Level Agreements, Migrating to the Cloud, IaaS Networking options, Virtual Private Cloud(VPC), IaaS Storage – File and Object storage, Data Protection, IaaS security, Benefits, Risks and Examples of IaaS. Platform as a Service (PaaS) – Overview, IaaS vs PaaS, PaaS Examples, benefits and risks.

5

Module 2:Software as a Service (SaaS) – Introducing SaaS, SaaS Examples – Office 365, Google G Suite, Salesforce.com , Evaluating SaaS – user and vendor perspective, Impact of SaaS, Benefits and risks of SaaS. Other Services on Cloud, Cloud Delivery

4





Models Considerations

3

Module 1: Cloud Platforms: Introducing Cloud Platforms, Evaluating cloud platforms, Cloud Platform technologies – Amazon Web Services, Microsoft Azure, Google Cloud Platform, Salesforce.com, Impact of Cloud platforms. Private Cloud Platforms – Introducing Private clouds – Microsoft Azure stack, Open stack, AWS Greengrass, Impact of Private clouds

5

Module 2: Cloud Migration : Delivering Business Processes from the Cloud: Business process examples, Broad Approaches to Migrating into the Cloud, The Seven-Step Model of Migration into a Cloud, Efficient Steps for migrating to cloud., Risks: Measuring and assessment of risks, Company concerns Risk Mitigation methodology for Cloud computing, Case Studies

4

4

Module 1: Cloud Computing - Challenges, Risk and Mitigation: Cloud Storage, Application performance, Data Integration, Security. Ensuring Successful Cloud

5

Module 2: Adoption: Designing a Cloud Proof of Concept, Vendor roles and capabilities, moving to the Cloud. Impact of Cloud on IT Service Management. Risks and Consequences of Cloud Computing – Legal Issues, Compliance Issues,

Privacy and Security.

4

5

Module 1 :Managing the Cloud – Managing and Securing Cloud Services, Virtualization and the Cloud, Managing Desktops and devices on the cloud, SOA and Cloud computing, Managing the Cloud environment,

5

Module 2: Planning for the Cloud – Economic Cost Model and Leveraging the Cloud, Cloud computing resources, Cloud Dos and Don’ts.

4


1 The student will learn about the cloud environment, building software systems and components that scale to millions of users in modern internet, cloud concepts capabilities across the various cloud service models including Iaas,Paas, Saas, and developing cloud based software applications on top of cloud platforms.

2 Able to learn how to use Cloud Services. 3 Able to implement Virtualization

Text Books

1. Kirk Hausman, Susan L. Cook, Telmo Sampaio, “ CLOUD ESSENTIALS CompTIA® Authorized

Courseware for Exam CLO-001”, John Wiley & Sons Inc., 2013

2. Judith Hurwitz , Robin Bloor , Marcia Kaufman , Fern Halper, “Cloud Computing for Dummies”,

Wiley Publishing Inc., 2010

Reference Book





Year: Second Year Semester – IV Course: Professional Ethics Course Code: 17YHS401

Teaching Scheme


Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 3 - - 3 10 20 10 10 -- 50 -- 100 Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs. Prerequisites: Soft Skills and Language. Objectives: The course will enables students to:- 1 To enable the students to imbibe and internalize the Values and Ethical Behavior in the

personal and Professional lives. Unit No Details Hours

1

Module 1: Basic Concepts, Governing Ethics, Personal & Professional Ethics, Ethical Dilemmas, Life Skills, Emotional Intelligence, Thoughts of Ethics, Value Education.

4

Module 2: Dimensions of Ethics, Profession and professionalism, Professional Associations, Professional Risks, Professional Accountabilities, Professional Success, Ethics andProfession.

4

2

Module 1: Basic Ethical Principles, Moral Developments, Deontology, Utilitarianism, Virtue Theory, Rights Theory, Casuist Theory, Moral Absolution. 4

Module 2: Moral Rationalism, Moral Pluralism, Ethical Egoism, Feminist Consequentialism, Moral Issues, Moral Dilemmas, MoralAutonomy. 3

3

Module 1: Professions and Norms of Professional Conduct, Norms of Professional Conduct vs. Profession; Responsibilities, Obligations and Moral Values in Professional Ethics, Professional codes of ethics, the limits of predictability and responsibilities of the engineering profession.

4

Module 2: Central Responsibilities of Engineers - The Centrality of Responsibilities of Professional Ethics; lessons from 1979 American Airlines DC-10 Crash and Kansas City Hyatt Regency Walk awayCollapse.

4

4

Module 1: Work Place Rights & Responsibilities, Ethics in changing domains of Research, Engineers and Managers; Organizational Complaint Procedure, difference of Professional Judgment within the Nuclear Regulatory Commission (NRC), the Hanford Nuclear Reservation.

4

Module 2: Ethics in changing domains of research - The US government wide definition of research misconduct, research misconduct distinguished from 3





mistakes and errors, recent history of attention to research misconduct, the emerging emphasis on understanding and fostering responsible conduct, responsible authorship, reviewing & editing.

5

Module 1:Introduction – Current Scenario, Technology Globalization of MNCs, International Trade, World Summits, Issues, Business Ethics and Corporate Governance.

4

Module 2:Sustainable Development Ecosystem, Energy Concerns, Ozone Deflection, Pollution, Ethics in Manufacturing and Marketing, Media Ethics; War Ethics; Bio Ethics, Intellectual Property Rights.

4


1 The students will understand the importance of Values and Ethics in their personal lives and professional careers. The students will learn the rights and responsibilities as an employee, team member and a global citizen.

Text Books 1. Professional Ethics: R. Subramanian, Oxford University Press, 2015. 2. Ethics in Engineering Practice & Research, Caroline Whit beck, 2e, Cambridge University Press

2015. Reference Book 1. Engineering Ethics, Concepts Cases: Charles E Harris Jr., Michael S Pritchard, Michael J

Rabins, 4e, Cengagelearning, 2015. 2. Business Ethics concepts & Cases: Manuel G Velasquez, 6e, PHI, 2008.





Year: Second Year Semester – IV Course: Object Oriented Programming in Java Lab Course Code: 17YCT411

Teaching Scheme


Examination Total


Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs. Prerequisites: Object oriented programming Objectives: Students are able to:-

1 To teach the students basics of JAVA programs and its execution. 2 To teach the students the differences between C++ and Java programming. 3 To make the students learn concepts like packages and interfaces. 4 To make the students understand life cycle of the applets and its functionality. 5 To make the students understand the usage util package.


Suggested List of Laboratory Assignments





Group A (Compulsory Assignments) 1. Write a java program for employee class to display basic information. 2. Design a class in java to perform various mathematical operations on given numbers. 3. Write a java program for calculating area of circle. 4. Write a program for implementing single inheritance for student class. 5. Write a program for implementing multilevel inheritance for employee class.

Group B (Any 7) 1. Implement java program to display content of array. 2. Write a java program to find the prime number from 1 to 20. 3. Write a java program to display Fibonacci series of any number. 4. Implement a java program to perform addition of two numbers, accept numbers form user. 5. Write a java program to find.

a. Length of given string. b. Reverse the string. c. Palindrome.

6. Implement a java program to count number of vowels from given string. 7. Design an applet program to perform addition of two numbers. 8. Write an exception handling program to handle divide by zero and Array Index OutOfBounds

errors. 9. Implement AWT program to design student admission form. 10. Write a java program to read and write the content of given "example.txt" file.

Group C (Any 1) 1. Design a calculator using AWT. 2. Implement Tic Tac Toe using AWT.





Year: Second Year Semester – IV Course: Database Management System Lab Course Code: 17YCT412

Teaching Scheme


Examination Total


Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs. Prerequisites: Elementary knowledge about computers including experience of using UNIX. Computer Programming & Utilization Knowledge about data structures and algorithms, corresponding to the basic course on Data Structures and Algorithms. Objectives: Students are able to:-

1 To understand Database Programming Languages. 2 To learn and understand SQL, PL/SQL ,NoSQL 3 To learn Relational Database (Open source) such as MongoDB, MySQL 4 To learn and understand Database Project Life Cycle. 5 To understand Database Programming Languages.

Guidelines for Assessment Continuous assessment of laboratory work is done based on overall performance and lab assignments performance of student. Each lab assignment assessment will assign grade/marks based on parameters with appropriate weightage. Suggested parameters for overall assessment as well as each lab assignment assessment include- timely completion, performance, innovation, efficient codes, punctuality and neatness. Guidelines for Laboratory Conduction The instructor is expected to frame the assignments by understanding the prerequisites, technological aspects, utility and recent trends related to the topic. The assignment framing policy need to address the average students and inclusive of an element to attract and promote the intelligent students. The instructor may set multiple sets of assignments and distribute among batches of students. It is appreciated if the assignments are based on real world problems/applications. Encourage students for appropriate use of Hungarian notation, Indentation and comments. Use of open source software is encouraged. In addition to these, instructor may assign one real life application in the form of a mini-project based on the concepts learned. Instructor may also set one assignment or mini-project that is suitable to respective branch beyond the scope of syllabus. Set of suggested assignment list is provided in three groups. Each student must perform at least 13 assignments as at 05 compulsory from group A, 07 from group B and 01 from group C





Operating System recommended : 64-bit Open source Linux or its derivative Programming tools recommended: Open Source C Programming tool like GCC


1. Study of Open Source Databases : MySQL/ MongoDB/CouchDB etc. 2. Design and Develop SQL DDL statements which demonstrate the use of SQL objects such 3. Design 10 SQL queries for suitable database application using SQL DML statements:

Insert, Select, Update, Delete with operators 4. Design at least 10 SQL queries for suitable database application using SQL DML

statements: all types of Join, Sub-Query and View

5. Use the relations below to write SQL queries to solve the business problems specified. CLIENT (clientno#,name, client_referred_by#) ORDER (orderno#, clientno#, order_date, empid#) ORDER_LINE (orderno#, order line number#, item_number#, no_of_items, item_ cost, shipping_date) ITEM (item_number#, item_type, cost) EMPLOYEE (empid#, emp_type#, deptno, salary, firstname, lastname)

Group B (Any 7)

1. Write a PL/SQL block to calculate the student grades. 2. Write a PL/SQL block to implement types of cursors. 3. Write a PL/SQL stored procedure and function. 4. Write a database Trigger. 5. Write and implement Sub queries /Nested Queries 6. Write and Implements all Arithmetic Functions. 7. Use the relations below to write SQL Nested queries with various Clauses to solve the

business problems specified. CLIENT (clientno#,name, client_referred_by#) ORDER (orderno#, clientno#, order_date, empid#) ORDER_LINE (orderno#, order line number#, item_number#, no_of_items, item_ cost, shipping_date) ITEM (item_number#, item_type, cost) EMPLOYEE (empid#, emp_type#, deptno, salary, firstname, lastname)

Group C (Any 1) 1. Implement aggregation and indexing with suitable example using MongoDB 2. Implement Map reduces operation with suitable example using MongoDB. 3. Design and Implement any 5 query using MongoDB





Year: Second Year Semester – IV Course: Study Skills and Language Course Code: 17YCT414

Teaching Scheme


Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab -- - 2 1 -- -- -- -- 50 -- -- 50

Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs. Objectives: The course will enables students to:-

1 To help the students in building interpersonal skills. 2 To develop Emotional Intelligence to deal with difficult situations. 3 To create an open environment for Communication. 4 To inculcate employability skills among students.


1

Module 1: Study Skills Communication: Importance, barriers to communication, effective communication. Listening Skills: Listening for Comprehension Reading Skills: passages from varied registers

4

Module 2: Written Skills: Formal writing, Email writing, picture composition Writing for Social Media

4

2

Module 1: English Parts of Speech Vocabulary Building

4

Module 2: Basic Sentence Pattern Antonyms and Synonyms- functional usage Idioms, Phrases and Proverbs Passive Voice

3

3

Module 1 : Soft Skills – I Self-awareness: SWOT/SWOC, Perceptions and Attitudes, Positive ttitude 4

Module 2: Body Language Interpersonal Skills

4

4

Module 1 : Soft Skills – II Presentation Skills

4

Module 2: Group Discussion Interview Techniques. 3





5

Module 1:Reference & Study Skills Use of Dictionary and Thesaurus 4

Module 2: Use of Articles, Journals and Reference books Writing Reviews 4

Text Books 1. Communication Skills by Sanjay Kumar and Pushpa Lata, Oxford University Press. 2. Developing Communication Skill by Krishna Mohan, Meera Banerji, McMillan India Ltd. 3. English for Business Communication by Simon Sweeney, Cambridge University Press. Reference Book 1. Ethics in Engineering Practice and Research by Caroline &Whitbeck, Cambridge University

Press. 2. Personality Development and Group Discussions by Barun K. Mitra, Oxford University Press. 3. Group Discussions and Interview Skills by Priyadarshi Patnaik , Foundation Books , Cambridge

University Press. 4. The Power of Your Subconscious Mind by Dr Joseph Murphy MaanuGraphics , ISBN-13

9789381529560. 5. The 80/20 Principal by Richard Koch, Nicholas BrealeyPublishings , ISBN-13 9781857883992. 6. Time Management from Inside Out by Julie Morgenstern, Owl Books (NY), ISBN-13

9780805075908. 7. You can win by Shiv Khera, Macmillan, ISBN-139789350591932. Web References https://www.britishcouncil.in/sites/default/files/esfe_report.pdf https://www.britishcouncil.org/sites/default/files/english-soft-skills-maghreb-research-report.pdf http://nptel.ac.in/courses/109104030/references/references.pdf http://promeng.eu/downloads/training-materials/ebooks/soft-skills/effective-communication-skills.pdf Journals https://pdfs.semanticscholar.org/c1d3/e21ea8496e2d828678cde2981aac1bd4ce3e.pdf http://www.iosrjournals.org/iosr-jhss/papers/Vol11-issue4/D01142022.pdf https://www.tandfonline.com/doi/abs/10.1080/18186874.2016.1248061





Year: Second Year Semester – IV Course: French I Course Code:17YFF401

Teaching Scheme


Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 2 - 2 10 20 10 10 -- 50 -- 100 Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs. Objectives: The course will enables students to:-

1 To be able to greet others formally and Informally ,say good bye and also frame and answer W-questions about themselves and ask these questions to others

2 To be able to talk/write about their friends and their hobbies 3 To be able to talk about the city they live in, housing style, the important monuments and

the means of transport 4 To be able to talk about food habits and learn to communicate with the direct object. 5 To be able to talk about one’s family and relationships.


1

Module 1: Good Day! Speech intentions: Greetings and Goodbyes, Introduce yourself and others, Speak about yourself and others, Numbers till 20, To be able to say telephone, numbers and email address, Spell it out, Speak about countries and their languages.

4

Module 2: Vocabulary: Numbers from 0-100, Countries and Languages/nationalities Grammar: W- Questions (formal +informal / tu ou vous), Declarative sentences, Verbs, Personal pronouns Pronunciation, Alphabets.

4

2

Module 1: Friends, Colleagues and myself/S'ouvrir aux autres. Speech intentions: Speak about hobbies, Arrange an informal meeting, State the days of the week, telling the time in French /activity: dr. Appointment / speak work timings Professions/le metier, Ordinal Numbers, Speak about seasons,

4

Module 2: Vocabulary, Hobbies, Days of the week, Numbers from70-1000/practice date of birth, Professions, Months and seasons, Grammar, definite articles ( Le,LA, les), for masculine, feminine gender agreement with gender. verbs and personal pronouns 2, 3.Yes/ No questions, Plural, Verbs- to have and to be ( avoir, etre)

3

3

Module 1In the city Speech intentions: 1.State the names of places and buildings 2. Ask the address or directions to a place 3.Assign texts to a picture story/flashcards 4. Ask for things 5. State the names of various means of Transport

4





6. Ask for directions and to give directions 7. understand texts with international words and learn articles Module 2: Grammar: 1. definite articles ( le LA Les) 2. indefinite articles (un, une,des) 3. negation with (ne---pas) (ne----pasde) 4. Formal imperative

4

4

Module 1: Goutera LA compagne(Enjoy your meal) Speech intentions: 1. Speak about food 2. Make a shopping list 3. Converse while shopping 4. Understand texts using W- questions 5. Arrange the words and learn them Vocabulary: 1. Meal timings 2.Grocery 3.Drinks 4. Shops

4

Module 2: Grammar: 1. Word order in sentences 2.Verbes acheter,payer, manger, boire 3. Usage of De, du, de la,des

3

5 Module 1: Family: Vocabulary related to family 4 Module 2: Film screening for all the lessons. 4

Internal Assessment: CIA 1: Students will shoot a short introduction about themselves on the phone CIA 2A: Receptive task: Read and understand a text CIA 2B: Productive task: Write about 5-6 sentences about a friend/family member CIA 3: Presentation on Nashik in the form of poster/picture post card according to the student's choice/ monuments CIA 4: The students will research into french food options inregional zoneand make a presentation on the topic in a format of their choice Text Books 1. SaisonMETHODE DE FRANÇAIS A1 2. AlteregoA1 3. Apprenon le francais Niveau1-5 4. Jumelage 5. TRICOLOR All books are published by Goyalsaab Delhi, We will be using SAISONA1 as the base for teaching. Reference Book All the audio available DELF ON didierfle.com/saison/www.didierfle.com/saison





Year: Second Year Semester – IV Course: German I Course Code:17YFG402

Teaching Scheme


Examination Total

L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab 2 - - 2 10 20 10 10 -- 50 -- 100

Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs. Objectives: The course will enables students to:-

1 To be able to greet others, say good bye and also frame and answer W-questions about themselves and ask these questions to others.

2 To be able to talk/write about their friends and their hobbies. 3 To be able to talk/write about the city they live in, the important buildings there and the

means of transport. 4 To be able to talk/write about food habits and learn the accusative case in German. 5 To be able to talk/write about one’s family.


1

Module 1: Good Day! Speech intentions: Greetings and Goodbyes. Introduce yourself and others Speak about yourself and others Numbers till 20 To be able to say telephone numbers and email address Spell it out, Speak about countries and their languages.

4

Module 2: Vocabulary: Numbers from 0-100 Countries and Languages/nationalities Grammar: W- Questions (formal +informal / tu ou vous) Declarative sentences Verbs Personal pronouns Pronunciation Alphabets. Listening Comprehension

4

2

Module 1: Friends, Colleagues and myself/S'ouvrir aux autres. Speech intentions: Speak about hobbies Arrange an informal meeting

4





State the days of the week Speak about work, work timings ans Professions Numbers From 20 Speak about seasons Module 2: Vocabulary Hobbies Days of the week Numbers from 20 Professions Months and seasons Grammar, Definite articles (der , die , das): Nominative Case for masculine, feminine and neutral. Verbs and personal pronouns 2 Yes/ No questions Plural Verbs- to have and to be ( haben, sein) Reading Comprehension, Write simple texts using the grammar that has been taught

3

3

Module 1In the city Speech intentions: 1.State the names of places and buildings 2. Ask the address or directions to a place 3.Assign texts to a picture story/flashcards 4. Ask for things 5. State the names of various means of Transport 6. Ask for directions and to give directions 7. understand texts with international words and learn articles

4

Module 2: Grammar: 1. definite articles (der, die, das) 2. indefinite articles (ein, eine, ein) 3. negation with (kein, keine, kein) 4. Formal imperative Join the sentences using “aber’ (but) and “und” (and)

4

4

Module 1: Guten Appetit! (Enjoy your meal) Speech intentions: 1. Speak about food 2. Make a shopping list 3. Converse while shopping 4. Understand texts using W- questions 5. Arrange the words and learn them Vocabulary: 1. Meal timings 2.Grocery

4





3.Drinks 4. Shops Module 2: Grammar: 1. Word order in sentences 2. Accusative case 3. Verbs with Accusative Form W-Questions, Statements and interrogative sentences and check the position of the verb in the sentence

3

5

Module 1: Family: Vocabulary related to family -Draw a family tree and describe one’s family 4

Module 2: , Film screening for all the lessons– Interactive session on films of the units covered to understand the grasping of the vocabulary of all the 5 units 4

Outcomes: CIA 1: Students will shoot a short introduction about themselves on the phone CIA 2A: Internal exam CIA 2B: Internal exam CIA 3: Presentation on Nashik in the form of poster/picture post card according to the student's choice CIA 4: The students will research into food options in Nashik and make a presentation on the topic in a format of their choice

Text Books 1. Netzwerk A1 2. Tangram A1 3. Studio D A1 4. Moment Mal A1 5. Themen 1

All books are published by Goyalsaab Delhi We will be using Netzwerk A1 as the base for teaching. Reference Book www.youtube.com german150 https://www.youtube.com/channel/UC5ZnpdkQIit8TWhGVDiDnQQ https://www.youtube.com/watch?v=PMj9kUPrnBk&t=46sMein Wegnach Deutschland https://www.youtube.com/watch?v=X-J1t8q0wxMTypisch! Dw.com/nico www.vitaminde.de Deutschtrainer A1 – Learning App from Google Store

school of computing science and engineering …...school of computing science and engineering...

Documents