New Scheme Based On AICTE Flexible Curricula CSE-Cyber Security/Cyber Security, III-Semester CY301 Technical Communication
Sharon Gerson and Steven Gerson. Technical Writing: Process and Product (8th Edition), London: Longman, 2013
Rentz, Kathryn, Marie E. Flatley& Paula Lentz. Lesikar’s Business Communication Connecting in a Digital world, McGraw-Hill, Irwin.2012
Allan & Barbara Pease. The Definitive Book of Body Language,New York, Bantam,2004
Jones, Daniel. The Pronunciation of English, New Delhi, Universal Book Stall.2010
Sharma, Sangeeta& Mishra, Binod. Communication Skills for Engineers and Scientists, New Delhi: PHI Learning, 2009, rpt 2012
To understand basics of Cryptography and Network Security.
To be able to secure a message over insecure channel by various means.
To learn about how to maintain the Confidentiality, Integrity and Availability of a data.
4. To understand various protocols for network security to protect against the threats in the networks.
Introduction of cryptography , Symmetric-key Encryption, Historical Ciphers, Computational Security, Semantic Security and Pseudorandom Generators (PRGs), Perfect secrecy. One-time- pad encryption. Characterizations of perfect secrecy, Limitations of perfect secrecy
CPA-Secure Ciphers from PRF, Modes of Operations of Block Ciphers, DES, AES and Message Authentication Codes (MAC) ,Information-theoretic Secure MAC, Cryptographic Hash Functions
Ideal-Cipher Model, Davies-Meyer construction and Merkle-Damgård Paradigm, Birthday Attacks on Cryptographic Hash Functions, Applications of Hash Functions,
Random Oracle Model and Authenticated Encryption. Generic Constructions of Authenticated Encryption Schemes, Key-exchange Problem, One-way Trapdoor Functions and Cyclic Groups
Discrete-Logarithm Problem, Computational Diffie-Hellman Problem, Decisional , Diffie- Hellman Problem, Elliptic-Curve Based Cryptography and Public-Key Encryption
CCA -secure Public-key Hybrid Ciphers Based on Diffie-Hellman Problems and RSA- assumption, Digital Signatures, Overview of TLS/SSL, Number Theory, Interactive Protocols .
Cryptography And Network Security Principles And Practice Fourth Edition, William Stallings, Pearson
Education
Modern Cryptography: Theory and Practice, by Wenbo Mao, Prentice Hall PTR
Network Security Essentials: Applications and Standards, by William Stallings. Prentice Hall
Cryptography: Theory and Practice by Douglas R. Stinson, CRC press.
Introduction to Data Structure: Concepts of Data and Information, Classification of Data structures, Abstract Data Types, Implementation aspects: Memory representation. Data structures operations and its cost estimation. Introduction to linear data structures- Arrays, Linked List: Representation of linked list in memory, different implementation of linked list. Circular linked list, doubly linked list, etc. Application of linked list: polynomial manipulation using linked list, etc.
Stacks and Queue: Stacks as ADT, Different implementation of stack, multiple stacks. Application of Stack: Conversion of infix to postfix notation using stack, evaluation of postfix expression, Recursion. Queues: Queues as ADT, Different implementation of queue, Circular queue, Concept of Dqueue and Priority Queue, Queue simulation, Application of queues.
Tree: Definitions - Height, depth, order, degree etc. Binary Search Tree - Operations, Traversal, Search. AVL Tree, Heap, Applications and comparison of various types of tree; Introduction to forest, multi-way Tree, B tree, B+ tree, B* tree and red-black tree.
Graphs: Introduction, Classification of graph: Directed and Undirected graphs, etc, Representation, Graph Traversal: Depth First Search (DFS), Breadth First Search (BFS), Graph algorithm: Minimum Spanning Tree (MST)-Kruskal, Prim’s algorithms. Dijkstra’s shortest path algorithm; Comparison between different graph algorithms. Application of graphs.
Sorting: Introduction, Sort methods like: Bubble Sort, Quick sort. Selection sort, Heap sort, Insertion sort, Shell sort, Merge sort and Radix sort; comparison of various sorting techniques. Searching: Basic Search Techniques: Sequential search, Binary search, Comparison of search methods. Hashing & Indexing. Case Study: Application of various data structures in operating system, DBMS etc.
AM Tanenbaum, Y Langsam& MJ Augustein, “Data structure using C and C++”, Prentice Hall India.
Robert Kruse, Bruse Leung, “Data structures & Program Design in C”, Pearson Education.
Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education.
N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall.
Jean – Paul Trembly , Paul Sorenson, “An Introduction to Data Structure with application”, TMH.
Richard, GilbergBehrouz, Forouzan ,“Data structure – A Pseudocode Approach with C”, Thomson press.
Morris Mano, Digital Circuits & Logic Design, PHI
Gothman, Digital Electronics, PHI
Tocci, Digital Electronics, PHI
Mavino& Leach, Digital Principles & Applications, PHI
Taub and schilling, Digital Integrated electronics.
Simon Haykin, Introductionto Analog& Digital Communication, Wiley.
Lathi B.P., Modern analog& digital communication , Oxford University.
To study and verify the truth tables of various Logic gates
To verify the properties of NAND and NOR gates as Universal Building Blocks.
Simplification and implementation of a Boolean function
Implementation of basic Boolean arithmetic logic circuits such as Half-adder, Half- subtractor, Full adder and Full subtractor
Conversion from Binary to Gray and Gray to Binary code
To construct a binary multiplier using combinational logic and to verify with the truth table
To verify 2-bit Magnitude comparator for all possible conditions
Generation of various logical functions using 8-to-1 multiplexer
Construction of a 4-bit ripple counter and study of its operation
Operation of IC-555 Timer as Monostable, Astable and Bistablemultivibrators
To characterize binary ladder type digital to analog (D/A) and analog to digital (A/D) convertor
Comparison of various Logic families
Design and implementation of various types of flip-flops using JK flip-flop
To study natural sampling of continuous time waveforms using different sampling rates
To study Pulse-Code modulation with Time-division multiplexing (PCM-TDM)
To study generation and detection of BPSK and QPSK waveforms
New Scheme Based On AICTE Flexible Curricula CSE-Cyber Security/Cyber Security, III-Semester CY305 Object Oriented Programming & Methodology
Introduction to Object Oriented Thinking & Object Oriented Programming: Comparison with Procedural Programming, features of Object oriented paradigm– Merits and demerits of OO methodology; Object model; Elements of OOPS, IO processing, Data Type, Type Conversion, Control Statement, Loops, Arrays.
Encapsulation and Data Abstraction- Concept of Objects: State, Behavior & Identity of an object; Classes: identifying classes and candidates for Classes Attributes and Services, Access modifiers, Static members of a Class, Instances, Message passing, and Construction and destruction of Objects.
Relationships – Inheritance: purpose and its types, ‘is a’ relationship; Association, Aggregation. Concept of interfaces and Abstract classes.
Polymorphism: Introduction, Method Overriding & Overloading, static and run time Polymorphism. Virtual Function, friend function, Static function, friend class.
Strings, Exceptional handling, Introduction of Multi-threading and Data collections. Case study like: ATM, Library management system.
Timothy Budd, “An Introduction to Object-Oriented Programming”, AddisonWesley Publication, 3rd Edition.
Cay S. Horstmann and Gary Cornell, “Core Java: Volume I, Fundamentals”, Prentice Hall publication.
G. Booch, “Object Oriented Analysis& Design”, Addison Wesley.
James Martin, “Principles of Object Oriented Analysis and Design”, Prentice Hall/PTR.
Peter Coad and Edward Yourdon, “Object Oriented Design”, Prentice Hall/PTR.
Herbert Schildt, “Java 2: The Complete Reference”, McGraw-Hill Osborne Media.
New Scheme Based On AICTE Flexible Curricula CSE-Cyber Security/Cyber Security, III-Semester
To write a Python program to find GCD of two numbers.
To write a Python Program to find the square root of a number by Newton’s Method.
To write a Python program to find the exponentiation of a number.
To write a Python Program to find the maximum from a list of numbers.
To write a Python Program to perform Linear Search
To write a Python Program to perform binary search.
To write a Python Program to perform selection sort.
To write a Python Program to perform insertion sort.
To write a Python Program to perform Merge sort.
To write a Python program to find first n prime numbers.
To write a Python program to multiply matrices.
To write a Python program for command line arguments.
To write a Python program to find the most frequent words in a text read from a file.
To write a Python program to simulate elliptical orbits in Pygame.
To write a Python program to bouncing ball in Pygame.
New Scheme Based On AICTE Flexible Curricula CSE-Cyber Security/Cyber Security, III-Semester CY301 Technical Communication
Sharon Gerson and Steven Gerson. Technical Writing: Process and Product (8th Edition), London: Longman, 2013
Rentz, Kathryn, Marie E. Flatley& Paula Lentz. Lesikar’s Business Communication Connecting in a Digital world, McGraw-Hill, Irwin.2012
Allan & Barbara Pease. The Definitive Book of Body Language,New York, Bantam,2004
Jones, Daniel. The Pronunciation of English, New Delhi, Universal Book Stall.2010
Sharma, Sangeeta& Mishra, Binod. Communication Skills for Engineers and Scientists, New Delhi: PHI Learning, 2009, rpt 2012
To understand basics of Cryptography and Network Security.
To be able to secure a message over insecure channel by various means.
To learn about how to maintain the Confidentiality, Integrity and Availability of a data.
4. To understand various protocols for network security to protect against the threats in the networks.
Introduction of cryptography , Symmetric-key Encryption, Historical Ciphers, Computational Security, Semantic Security and Pseudorandom Generators (PRGs), Perfect secrecy. One-time- pad encryption. Characterizations of perfect secrecy, Limitations of perfect secrecy
CPA-Secure Ciphers from PRF, Modes of Operations of Block Ciphers, DES, AES and Message Authentication Codes (MAC) ,Information-theoretic Secure MAC, Cryptographic Hash Functions
Ideal-Cipher Model, Davies-Meyer construction and Merkle-Damgård Paradigm, Birthday Attacks on Cryptographic Hash Functions, Applications of Hash Functions,
Random Oracle Model and Authenticated Encryption. Generic Constructions of Authenticated Encryption Schemes, Key-exchange Problem, One-way Trapdoor Functions and Cyclic Groups
Discrete-Logarithm Problem, Computational Diffie-Hellman Problem, Decisional , Diffie- Hellman Problem, Elliptic-Curve Based Cryptography and Public-Key Encryption
CCA -secure Public-key Hybrid Ciphers Based on Diffie-Hellman Problems and RSA- assumption, Digital Signatures, Overview of TLS/SSL, Number Theory, Interactive Protocols .
Cryptography And Network Security Principles And Practice Fourth Edition, William Stallings, Pearson
Education
Modern Cryptography: Theory and Practice, by Wenbo Mao, Prentice Hall PTR
Network Security Essentials: Applications and Standards, by William Stallings. Prentice Hall
Cryptography: Theory and Practice by Douglas R. Stinson, CRC press.
Introduction to Data Structure: Concepts of Data and Information, Classification of Data structures, Abstract Data Types, Implementation aspects: Memory representation. Data structures operations and its cost estimation. Introduction to linear data structures- Arrays, Linked List: Representation of linked list in memory, different implementation of linked list. Circular linked list, doubly linked list, etc. Application of linked list: polynomial manipulation using linked list, etc.
Stacks and Queue: Stacks as ADT, Different implementation of stack, multiple stacks. Application of Stack: Conversion of infix to postfix notation using stack, evaluation of postfix expression, Recursion. Queues: Queues as ADT, Different implementation of queue, Circular queue, Concept of Dqueue and Priority Queue, Queue simulation, Application of queues.
Tree: Definitions - Height, depth, order, degree etc. Binary Search Tree - Operations, Traversal, Search. AVL Tree, Heap, Applications and comparison of various types of tree; Introduction to forest, multi-way Tree, B tree, B+ tree, B* tree and red-black tree.
Graphs: Introduction, Classification of graph: Directed and Undirected graphs, etc, Representation, Graph Traversal: Depth First Search (DFS), Breadth First Search (BFS), Graph algorithm: Minimum Spanning Tree (MST)-Kruskal, Prim’s algorithms. Dijkstra’s shortest path algorithm; Comparison between different graph algorithms. Application of graphs.
Sorting: Introduction, Sort methods like: Bubble Sort, Quick sort. Selection sort, Heap sort, Insertion sort, Shell sort, Merge sort and Radix sort; comparison of various sorting techniques. Searching: Basic Search Techniques: Sequential search, Binary search, Comparison of search methods. Hashing & Indexing. Case Study: Application of various data structures in operating system, DBMS etc.
AM Tanenbaum, Y Langsam& MJ Augustein, “Data structure using C and C++”, Prentice Hall India.
Robert Kruse, Bruse Leung, “Data structures & Program Design in C”, Pearson Education.
Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education.
N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall.
Jean – Paul Trembly , Paul Sorenson, “An Introduction to Data Structure with application”, TMH.
Richard, GilbergBehrouz, Forouzan ,“Data structure – A Pseudocode Approach with C”, Thomson press.
Morris Mano, Digital Circuits & Logic Design, PHI
Gothman, Digital Electronics, PHI
Tocci, Digital Electronics, PHI
Mavino& Leach, Digital Principles & Applications, PHI
Taub and schilling, Digital Integrated electronics.
Simon Haykin, Introductionto Analog& Digital Communication, Wiley.
Lathi B.P., Modern analog& digital communication , Oxford University.
To study and verify the truth tables of various Logic gates
To verify the properties of NAND and NOR gates as Universal Building Blocks.
Simplification and implementation of a Boolean function
Implementation of basic Boolean arithmetic logic circuits such as Half-adder, Half- subtractor, Full adder and Full subtractor
Conversion from Binary to Gray and Gray to Binary code
To construct a binary multiplier using combinational logic and to verify with the truth table
To verify 2-bit Magnitude comparator for all possible conditions
Generation of various logical functions using 8-to-1 multiplexer
Construction of a 4-bit ripple counter and study of its operation
Operation of IC-555 Timer as Monostable, Astable and Bistablemultivibrators
To characterize binary ladder type digital to analog (D/A) and analog to digital (A/D) convertor
Comparison of various Logic families
Design and implementation of various types of flip-flops using JK flip-flop
To study natural sampling of continuous time waveforms using different sampling rates
To study Pulse-Code modulation with Time-division multiplexing (PCM-TDM)
To study generation and detection of BPSK and QPSK waveforms
New Scheme Based On AICTE Flexible Curricula CSE-Cyber Security/Cyber Security, III-Semester CY305 Object Oriented Programming & Methodology
Introduction to Object Oriented Thinking & Object Oriented Programming: Comparison with Procedural Programming, features of Object oriented paradigm– Merits and demerits of OO methodology; Object model; Elements of OOPS, IO processing, Data Type, Type Conversion, Control Statement, Loops, Arrays.
Encapsulation and Data Abstraction- Concept of Objects: State, Behavior & Identity of an object; Classes: identifying classes and candidates for Classes Attributes and Services, Access modifiers, Static members of a Class, Instances, Message passing, and Construction and destruction of Objects.
Relationships – Inheritance: purpose and its types, ‘is a’ relationship; Association, Aggregation. Concept of interfaces and Abstract classes.
Polymorphism: Introduction, Method Overriding & Overloading, static and run time Polymorphism. Virtual Function, friend function, Static function, friend class.
Strings, Exceptional handling, Introduction of Multi-threading and Data collections. Case study like: ATM, Library management system.
Timothy Budd, “An Introduction to Object-Oriented Programming”, AddisonWesley Publication, 3rd Edition.
Cay S. Horstmann and Gary Cornell, “Core Java: Volume I, Fundamentals”, Prentice Hall publication.
G. Booch, “Object Oriented Analysis& Design”, Addison Wesley.
James Martin, “Principles of Object Oriented Analysis and Design”, Prentice Hall/PTR.
Peter Coad and Edward Yourdon, “Object Oriented Design”, Prentice Hall/PTR.
Herbert Schildt, “Java 2: The Complete Reference”, McGraw-Hill Osborne Media.
New Scheme Based On AICTE Flexible Curricula CSE-Cyber Security/Cyber Security, III-Semester
To write a Python program to find GCD of two numbers.
To write a Python Program to find the square root of a number by Newton’s Method.
To write a Python program to find the exponentiation of a number.
To write a Python Program to find the maximum from a list of numbers.
To write a Python Program to perform Linear Search
To write a Python Program to perform binary search.
To write a Python Program to perform selection sort.
To write a Python Program to perform insertion sort.
To write a Python Program to perform Merge sort.
To write a Python program to find first n prime numbers.
To write a Python program to multiply matrices.
To write a Python program for command line arguments.
To write a Python program to find the most frequent words in a text read from a file.
To write a Python program to simulate elliptical orbits in Pygame.
To write a Python program to bouncing ball in Pygame.