Course Contents. Teaching Scheme: TH: 04 Hours/Week. Credit 03. Examination Scheme: CIA : 50 Marks End-Sem (paper): 50 Marks

Transcription

1 Sandip University, Nashik School of Engineering Second Year of Computer Science and Engineering (with Specialization in Cloud Technology & Information Security) (2017 Course) Discrete Mathematics and Logic (YCT301) Teaching Scheme: TH: 04 Hours/Week Prerequisite:- Basic Mathematics Credit 03 Examination Scheme: CIA : 50 Marks End-Sem (paper): 50 Marks Course Objectives: To impart fundamentals of discrete mathematical structures useful in studying, analyzing and solving problems in Computer Science. To sharpen the mathematical skills by practicing problem solving, logical reasoning and writing precise proofs. To impart skills for applying ideas from discrete mathematics to real world problems. Course Outcomes: On completion of the course, student will be able to Solve real world problems logically using appropriate set, function, and relation models and interpret the associated operations and terminologies in context. Analyze and synthesize the real world problems using discrete mathematics. Course Contents Unit I Sets & Logic 8 Hours Set Theory : 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. Logic : Propositions and Logical operations, Truth tables, Equivalence, Implications, Laws of Logic, Normal forms, Predicates and quantifiers, Mathematical Induction. Unit II Relations and Functions 07 Hours

2 Relations: 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 Functions: Surjective, Injective and Bijective functions, Inverse Functions and Compositions of Functions, The Pigeonhole Principle. Unit III Graph 08 Hours Basic terminology, representation of a graph in computer memory, multigraphs and weighted graphs, Sub graphs, Isomorphic graphs, Complete, regular and bipartite graphs, operations on graph, 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. Unit IV Trees 07 Hours Basic terminology and characterization of trees, rooted trees and path length in rooted trees, binary search trees, Tree traversal, Fundamental Trees and cut sets, Spanning tree and Minimal Spanning tree, Isomorphism of trees, Weighted trees and Prefix Codes, The Max flow- Min Cut Theorem (Transport network). Unit V Algebraic Structures 08 Hours Algebraic structures with one binary operation - semi groups, monoids and groups, Isomorphism, homomorphism, automorphism, Cyclic groups, Normal sub group, codes and group codes, Algebraic structures with two binary operations - rings, integral domains and fields. Ring homomorphism and Isomorphism. Books: Text: 1. C L Liu, Elements of Discrete Mathematics, Tata McGraw-Hill, ISBN 10: K.H. Rosen, Discrete Mathematics and its application, 7th edition, Tata McGraw Hill, ISBN B. Kolman, Robert C. Busby, Sharon Ross, Discrete Mathematical Structure, 6th edition, Pearson/Prentice Hall, ISBN Reference: 1. Kenneth H. Rosen, Discrete Mathematics and its Applications, 6th edition, McGraw-Hill, 2007, ISBN Tremblay J. P. and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw-Hill, Bernard Kolman, Robert C. Busby and Sharon Ross, Discrete Mathematical Structures, PrenticeHall of India /Pearson, ISBN: , N. Biggs, Discrete Mathematics, 3rd Edition, Oxford University Press, ISBN

3 Web Reference: 1. en.wikipedia.org/wiki/discrete_mathematics 2.

4 Teaching Scheme: TH: 04 Hours/Week Prerequisite:- Sandip University, Nashik School of Engineering Second Year of Computer Science and Engineering (with Specialization in Cloud Technology & Information Security) (2017 Course) Computer Architecture and Programming Concepts (YCT302) Credit 03 Examination Scheme: CIA : 50 Marks End-Sem (paper): 50 Marks Basics of Electronic Engineering. Course Objectives: Course Outcomes: The purpose of this course is to understand how Computer Systems work & its basic principles and analyze the system performance current state of art in memory design. To identify the elements of modern instructions sets and explain their impact on processor design On completion of the course, student will be able to Realize and simplify Boolean Algebraic assignments for designing digital circuits using K- Maps. Design and implement Sequential and Combinational digital circuits as per the specifications. Apply the knowledge to appropriate IC as per the design specifications Course Contents Unit I Basic Computer Organization 08 Hours Instruction Codes, Computer Registers: Common bus system, Computer Instructions: Instruction formats, Instruction Cycle: Fetch and Decode, Flowchart for Instruction cycle, Register reference instructions. Micro Programmed Control Unit: Control Memory, Address Sequencing, Conditional branching, Mapping of instruction, Subroutines, Design of Control Unit, Central Processing Unit: Introduction, General Register Organization, Stack Organization: Register stack, Memory stack; Instruction Formats, Addressing Modes. Unit II Register Transfer and Micro-operation 07 Hours Register Transfer Language, Register Transfer, Bus and Memory Transfer: Three state bus buffers, Memory Transfer. Arithmetic Micro-operations: Binary Adder, Binary Adder-Subtractor, and Binary Increment or, Logic Micro-operations: List of Logic micro operations, Shift Micro-operations (excluding H/W implementation), Arithmetic Logic Shift Unit.

5 Unit III Introduction to Hardware Architecture and Programming Concepts 07 Hours PC Components. Microprocessor history of microprocessors, transistor, IC, evolution of microprocessors. Microcontrollers history. System software and machine architecture, simplified instructional computer (SIC), assembler, loader, linker, macro processor, compilers. Unit IV Microprocessors &Microcontrollers 08 Hours Moore s law, Microprocessor architecture, 8085, 8-bit, 12-bit, 16-bit, 32bit, and 64-bit microprocessor, 8085, 8086, RISC microprocessor, multi-core processors, register sets, addressing modes. Embedded systems, embedded design, Types of microcontrollers, memory technologies, 8051 architecture, Serial communication, interrupts Instruction sets and programming, hardware features. Unit V Assemblers, Loaders & Linkers 08 Hours Basic assembler function, SIC assembler, Machine dependent assembler features, machine independent assembler features, one pass assembler, multi-pass assembler, MASM assembler. Basic loader function, Bootstrap loader, Machine dependent loader, machine independent loader, Program linking, linkage editor, and dynamic linkage. Compilers function, machine dependent and machine independent compilers. Books: Text: 1. Stephen Brown, ZvonkoVranesic, Fundamentals of Digital Logic with VHDL Design, McGraw- Hill, ISBN 13: R.P. Jain, Modern Digital Electronics, TMH, 2012, ISBN 13: W. Stallings, Computer Organization and Architecture: Designing for performance, Pearson Education/ Prentice Hall of India, 2003, ISBN , 7th Edition. 4. Zaky S, Hamacher, Computer Organization, 5th Edition, McGraw-Hill Publications, 2001, ISBN , 5th Edition. Reference: 1. John Yarbrough, Digital Logic applications and Design, Cengage Learning, ISBN 13: John P Hays, Computer Architecture and Organization, McGraw-Hill Publication, 1998, ISBN: , 3rd Edition. 3. A. Tanenbaum, Structured Computer Organization, Prentice Hall of India, 1991 ISBN: , 4th Edition

6 Web Reference:

7 Sandip University, Nashik School of Engineering Second Year of Computer Science and Engineering (with Specialization in Cloud Technology & Information Security) (2017 Course) Information Security Fundamentals (YCT303) Teaching Scheme: TH: 04Hours/Week Prerequisite:- Course Objectives: Credit 03 Examination Scheme: CIA : 50 Marks End-Sem (paper): 50 Marks The course primarily covers the Types of Threats, Vulnerabilities, Risks and various terminologies in Information Security. It explains the formation of Security policy at various levels inside the Organization and provides the definition Procedures, Standard and Guidelines. 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. Course Outcomes: On completion of the course, student will be able to To enable students to understand the concepts of IT security, Threats, Vulnerabilities, Impact and control measures. And also to get familiarize with Asset management along with the objective to create awareness in Digital Rights management Course Contents Unit I Introduction to Information Security 08 Hours Definition of Information Security, Evolution of Information Security; Basics Principles of Information Security; Critical Concepts of Information Security; Components of the Information System; Balancing Information Security and Access; Implementing IT Security, The system Development Life cycle, Security professional in the organization. Unit II The Need for IT Security 08 Hours

8 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; Attacks-Malicious Codes, Back Doors, Denial of Service and Distributed Denial of Service, Spoofing, sniffing, Spam, Social Engineering Unit III Risk Management 08 Hours Definition of risk management, risk identification, and risk control, Identifying and AccessingRisk, Assessing risk based on probability of occurrence and likely impact, the fundamental aspects of documenting risk via the process of risk assessment, the various risk mitigation strategy options, the categories that can be used to classify controls. Network Infrastructure Security and Connectivity. Unit IV Understanding Infrastructure Security 07 Hours Device Based Security, Media-Based Security, Monitoring and Diagnosing; Monitoring Network- Firewall, Intrusion Detection System, Intrusion Prevention system; OS and Network Hardening, Application Hardening; Physical and Network Security- Policies, Standards and Guidelines. Unit V Security Technology 07 Hours Access Control, Firewall, Protecting Remote Connections; Honeypots and Honeynets, Introduction of Scanning and Analysis Tools, Basics of Biometric Access Control. Books: Text: 1. Information Security Risk Analysis - Thomas R. Peltier, Third Edition, Pub: Auerbach, Operating System Concepts, 8th Edition by Abraham Silberschatz, Peter B. Galvin, Greg Gagne, Pub: John Wiley & sons, Inc., Reference: 1. Information security: Principles and Practice - Mark Stamp, 2 nd Edition, Pub: John Wiley & Sons, Inc., 2011 Web Reference:

9 Teaching Scheme: TH: 04 Hours/Week Sandip University, Nashik School of Engineering Second Year of Computer Science and Engineering (with Specialization in Cloud Technology & Information Security) (2017 Course) Object Oriented Programming in Java (YCT304) Credit 04 Prerequisite:- Fundamentals of Programming Languages Course Objectives: Examination Scheme: CIA : 50 Marks End-Sem (paper): 50 Marks Object oriented programming is the most proven technique for developing reliable programs. It helps in increased productivity, reusability of code, decrease in the development time, and reduces cost of production to an extent. The cost of maintaining such systems have also considerably decreased. There are many languages which used the object oriented concepts and techniques. Some of them are C++, Java, Smalltalk, Objective-C, etc. Java is a purely object oriented language. Systems/applications created using java programming language reduces the need for developing and maintain complex and space consuming applications. Course Outcomes: On completion of the course, student will be able to Apply standards and principles to write executable code. Take a problem and develop the structures to represent the solution in the form of objects and the algorithms. Check the program and, if necessary, find errors in the program and rectify them. Students will learn how to write Programs using Java Course Contents Unit I Introduction 08 Hours History, Overview of Java, Object Oriented Programming, A simple Programme, Two control statements - if statement, for loop, using Blocks of codes, Lexical issues - White space, identifiers, Literals, comments, separators, Java Key words. Data types: Integers, Floating point, characters, Boolean, A closer look at Literals, Variables, Type conversion and casting, Automatic type promotion in Expressions Arrays.

10 Operators: Arithmetic operators, The Bit wise operators, Relational Operators, Boolean Logical operators, Assignment Operator, Operator Precedence. Control Statements: Selection Statements - if, Switch: Iteration Statements - While, Do-while, for Nested loops, Jump statements. Unit II Classes 08 Hours Class Fundamentals, Declaring objects, Assigning object reference variables, Methods, constructors, this keyword, finalize ( ) method A stack class, Over loading methods, using objects as parameters, Argument passing, Returning objects, Recursion, Access control, Introducing final, understanding static, Introducing Nested and Inner classes, Using command line arguments. Inheritance: Inheritance basics, Using super, method overriding, Dynamic method Dispatch, using abstract classes, using final with Inheritance. Unit III Packages 07 Hours Definition, Access protection importing packages, Interfaces: Definition implementing interfaces. Exception Handling: Fundamental, Exception types, Using try and catch, Multiple catch clauses, Nested try Statements, throw, throws, finally, Java s Built - in exception, using Exceptions. Unit IV Multithreaded Programming 08 Hours The Java thread model, The main thread, Creating a thread, Creating multiple thread, Creating a thread, Creating multiple threads, Using isalive() and Join(),Thread - Priorities, Synchronization, Inter thread communication, suspending, resuming and stopping threads, using multi-threading. I/O basics, Reading control input, writing control output, Reading and Writing files, Applet Fundamentals, the AWT package, AWT Event handling concepts The transient and volatile modifiers, using instance of using assert. Unit V JAVA Database Connectivity 08 Hours Database connectivity: JDBC architecture, JDBC Drivers, the JDBC API: loading a driver, connecting to a database, Creating and executing JDBC statements, Handling SQL exceptions, Accessing result sets: Types of result sets, Methods of result set interface. An example JDBC application to query a database. Books: Text: 1. The complete reference Java 2: V Edition By Herbert Schildt Pub. TMH Reference: 1. SAMS teach yourself Java 2: 3rd Edition by Rogers Cedenhead and Leura Lemay Pub. Pearson Education. Web Reference:

11 Sandip University, Nashik School of Engineering Second Year of Computer Science and Engineering (with Specialization in Cloud Technology & Information Security) (2017 Course) Data Structure and Algorithm (YCT305) Teaching Scheme: TH: 04 Hours/Week Prerequisite:- Course Objectives: Credit 04 Examination Scheme: CIA : 50 Marks End-Sem (paper): 50 Marks To understand the standard and abstract data representation methods. To acquaint with the structural constraints and advantages in usage of the data. To understand the memory requirement for various data structures. To operate on the various structured data. To understand various data searching and sorting methods with pros and cons. Course Outcomes: On completion of the course, student will be able to Students will benefit from the knowledge of Data Structures and different operating one can perform on these like searching, sorting, stacking and etc. This forms a very strong foundation for programming in different languages that the students will take up in subsequent semesters or in any other course Course Contents Unit I Introduction to Data Structures 08 Hours Definition, Classification of data structures: primitive and non-primitive, Elementary data organization, Time and space complexity of an algorithm (Examples), String processing. Dynamic memory allocation and pointers: Definition of dynamic memory allocation, Accessing the address of a variable, Declaring and initializing pointers, Accessing a variable through its pointer, Meaning of static and dynamic memory allocation, Memory allocation functions: malloc(), calloc(), free() and realloc(). Recursion: Definition, Recursion in C (advantages), Writing Recursive programs Binomial coefficient, Fibonacci, GCD. Unit II Searching and Sorting 08 Hours

12 Basic Search Techniques: Sequential search: Iterative and Recursive methods, Binary search: Iterative and Recursive methods, Comparison between sequential and binary search. Sort: General background and definition, Bubble sort, Selection sort, Insertion sort, Merge sort, Quick sort. Unit III Stack &Queues 08 Hours Stack Definition, Array representation of stack, Operations on stack: Infix, prefix and postfix notations, Conversion of an arithmetic expression from Infix to postfix, Applications of stacks. Queue: Definition, Array representation of queue, Types of queue: Simple queue, Circular queue, Double ended queue (deque), Priority queue, Operations on all types of Queues Unit IV Linked Lists 07 Hours Definition, Components of linked list, Representation of linked list, Advantages and Disadvantages of linked list. Types of linked list: Singly linked list, doubly linked list, Circular linked list, Operations on singly linked list: creation, insertion, deletion, search and display. Unit V Tree, Graph & Their Applications 07 Hours Definition : Tree, Binary tree, Complete binary tree, Binary search tree, Heap Tree terminology: Root, Node, Degree of a node and tree, Terminal nodes, Non-terminal nodes, Siblings, Level, Edge, Path, depth, Parent node, ancestors of a node. Binary tree: Array representation of tree, Creation of binary tree. Traversal of Binary Tree: Preorder, Inorder and postorder. Graphs, Application of Graphs, Depth First search, Breadth First search. Books: Text: 1. Weiss, Data Structures and Algorithm Analysis in C, II Edition, Pearson Education, Lipschutz: Schaum s outline series Data structures Tata McGraw-Hill 3. Robert Kruse Data Structures and program designing using C Trembley and Sorenson Data Structures Reference: 1. E. Balaguruswamy Programming in ANSI C. 2. Bandyopadhyay, Data Structures Using C Pearson Education, Tenenbaum, Data Structures Using C. Pearson Education, Kamthane: Introduction to Data Structures in C. Pearson Education Hanumanthappa M., Practical approach to Data Structures, Laxmi Publications, Fire Wall media Langsam, AusensteinMaoshe& M. Tanenbaum Aaron Data Structures using C and C++ Pearson Education. Web Reference:

13

14 Sandip University, Nashik School of Engineering Second Year of Computer Science and Engineering (with Specialization in Cloud Technology & Information Security) (2017 Course) Object Oriented Programming in JAVA - Lab (YCT316) Credit 02 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. Objective Object oriented programming is the most proven technique for developing reliable programs. It helps in increased productivity, reusability of code, decrease in the development time, and reduces cost of production to an extent. There are many languages which use the object oriented concepts and techniques. Some of them are C++, Java, Smalltalk, Objective-C, etc. Java is a purely object oriented language. Systems/applications created using java programming language reduces the need for

15 developing and maintain complex and space consuming applications. Nowadays java is also found in the mobile phones. Suggested List of Laboratory Assignments List of Programs Part A 1. Write a program to check whether two strings are equal or not. 2. Write a program to display reverse string. 3. Write a program to find the sum of digits of a given number. 4. Write a program to display a multiplication table. 5. Write a program to display all prime numbers between 1 to 1t Write a program to insert element in existing array. 7. Write a program to sort existing array. 8. Write a program to create object for Tree Set and Stack and use all methods. 9. Write a program to check all math class functions. 10. Write a program to execute any Windows 95 application (Like notepad, calculator etc) 11. Write a program to find out total memory, free memory and free memory after executing garbage Collector (gc). Part B 12. Write a program to copy a file to another file using Java to package classes. Get the file names at run time and if the target file is existed then ask confirmation to overwrite and take necessary actions. 13. Write a program to get file name at runtime and display number f lines and words in that file. 14. Write a program to list files in the current working directory depending upon a given pattern. 15. Create a textfileld that allows only numeric value and in specified length. 16. Create a Frame with 2 labels, at runtime display x and y commandordinate of mouse pointer in the labels.

16 Sandip University, Nashik School of Engineering Second Year of Computer Science and Engineering (with Specialization in Cloud Technology & Information Security) (2017 Course) Data structure and Algorithm - Lab (YCT317) Teaching Scheme: TH: PR: 04 Hours/Week Credit 02 Examination Scheme: Term Work : 25 Marks Practical : 25 Marks 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. Objective This course covers the basic concepts of different data structures which are the basic building blocks of Programming and problem solving. Suggested List of Laboratory Assignments List of Programs Part A 1. Use a recursive function to find GCD of two numbers.

17 2. Use a recursive function to find the Fibonacci series. 3. Use pointers to find the length of a string and to concatenate two strings. 4. Use pointers to copy a string and to extract a substring from a given a string. 5. Use a recursive function for the towers of Hanoi with three discs. 6. Insert an integer into a given position in an array. 7. Deleting an integer from an array. 8. Write a program to create a linked list and to display it. 9. Write a program to sort N numbers using insertion sort. 10. Write a program to sort N numbers using selection sort. Part B 1. Inserting a node into a singly linked list. 2. Deleting a node from a singly linked list. 3. Pointer implementation of stacks. 4. Pointer implementation of queues. 5. Creating a binary search tree and traversing it using in order, preorder and post order. 6. Sort N numbers using merge sort.

18 Teaching Scheme: TH: PR: 02 Hours/Week Prerequisite:- Course Objectives: Sandip University, Nashik School of Engineering Second Year of Computer Science and Engineering (with Specialization in Cloud Technology & Information Security) (2017 Course) Introduction to Public Speaking (YCT318) Credit 01 Examination Scheme: Term Work : 50 Marks To impart good public speaking skills in the students and give them more confidence in both professional and personal life Course Outcomes: On completion of the course, student will be able to On successful completion of this course, students will be able to Prepare managerial speeches of the appropriate nature and also to speak freely without a script, Keep a watch on their bogy-language and Grooming aspects while communication with others, Perform exceedingly well while in a group, actively participating in group discussion and forums and Fare well in job interviews by preparing and presenting themselves with greater confidence. Course Contents Unit I Oral Communication 08 Hours Principles of nonverbal communication - through clothes and body language, Types of managerial speeches - speech of introduction, speech of thanks, occasional speech, theme speech, Mastering the art of giving interviews in selection or placement interviews, discipline interviews, appraisal interviews, exit interviews, Building Persuasion & Negotiation abilities. Unit II Body Language & Grooming 08 Hours Introduction to Body Language, Postures, Gestures, Eye contact, Personality styles, Grooming, Dress code Unit III Art of Communication in Group 08 Hours

19 Reading Comprehension, Group communication by way of meetings & group discussions, Business presentation - Features of good presentations - Planning, Structuring and Delivering presentations - Handling questions - Coping with nervousness. Books: Text: 1.Matthukutty M Monippally, Business Communication Strategies, Tata McGraw- Hill. Reference: 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. Web Reference: