New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester CS501 Theory of Computation
To understand computability, decidability, and complexity through problem solving.
To analyse and design abstract model of computation & formal languages
To understand and conduct mathematical proofs for computation and algorithms.
Introduction to Automata Theory Language & Computation, Hopcroft& Ullman, Narosa Publication.
Element of the Theory Computation, Lewis &Christors, Pearson.
Theory of Computation, Chandrasekhar & Mishra, PHI.
Theory of Computation, Wood, Harper & Row.
Introduction to Computing Theory, Daniel I-A Cohen, Wiley.
After completion of this course, the students would be able to:
LIST OF EXPERIMENTS
Design a Program for creating machine that accepts three consecutive one.
Design a Program for creating machine that accepts the string always ending with 101.
Design a Program for Mode 3 Machine
Design a program for accepting decimal number divisible by 2.
Design a program for creating a machine which accepts string having equal no. of 1’s and 0’s.
Design a program for creating a machine which count number of 1’s and 0’s in a given string.
Design a Program to find 2’s complement of a given binary number.
Design a Program which will increment the given binary number by 1.
Design a Program to convert NDFA to DFA.
Design a Program to create PDA machine that accept the well-formed parenthesis.
Design a PDA to accept WCWR where w is any string and WR is reverse of that string and C is a Special symbol.
Design a Turing machine that’s accepts the following language an b n c n where n>0.
After completion of this course, the students would be able to:
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester CS502 Database Management Systems
Understand the different issues involved in the design and implementation of a database system.
Study the physical and logical database designs, database modeling, relational, hierarchical, and network models
Understand and use data manipulation language to query, update, and manage a database
Develop an understanding of essential DBMS concepts such as: database security, integrity, concurrency,
Design and build a simple database system and demonstrate competence with the fundamental tasks involved with modeling, designing, and implementing a DBMS.
Evaluate a business situation and designing & building a database applications
DBMS Concepts and architecture Introduction, Database approach v/s Traditional file accessing approach, Advantages, of database systems, Data models, Schemas and instances, Data independence, Data Base Language and interfaces, Overall Database Structure, Functions of DBA and designer, ER data model: Entitles and attributes, Entity types, Defining the E-R diagram, Concept of Generalization, Aggregation and Specialization. transforming ER diagram into the tables. Various other data models object oriented data Model, Network data model, and Relational data model, Comparison between the three types of models.
Relational Data models: Domains, Tuples, Attributes, Relations, Characteristics of relations, Keys, Key attributes of relation, Relational database, Schemas, Integrity constraints. Referential integrity, Intension and Extension, Relational Query languages: SQL-DDL, DML, integrity con straints, Complex queries, various joins, indexing, triggers, assertions , Relational algebra and relational calculus, Relational algebra operations like select, Project
,Join, Division, outer union. Types of relational calculus i.e. Tuple oriented and domain oriented relational calculus and its operations.
Data Base Design: Introduction to normalization, Normal forms, Functional dependency, Decomposition, Dependency preservation and lossless join, problems with null valued and dangling tuples, multivalued dependencies. Query Optimization: Introduction, steps of optimization, various algorithms to implement select, project and join operations of relational algebra, optimization methods: heuristic based, cost estimation based.
Transaction Processing Concepts: -Transaction System, Testing of Serializability, Serializability of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction failures. Log based recovery. Checkpoints deadlock handling. Concurrency
Control Techniques: Concurrency Control, locking Techniques for concurrency control, time stamping protocols for concurrency control, validation based protocol, multiple granularity. Multi version schemes, Recovery with concurrent transaction. Introduction to Distributed databases, data mining, data warehousing, Object Technology and DBMS, Comparative study of OODBMS Vs DBMS . Temporal, Deductive, Multimedia, Web & Mobile database.
Study of Relational Database Management Systems through Oracle/PL SQL
QL/MySQL: Architecture, physical files, memory structures, background process. Concept of table spaces, segments, extents and block. Dedicated server, multi threaded server. Distributed database, database links, and snapshot. Data dictionary, dynamic performance view. Security, role management, privilege management, profiles, invoker defined security model. SQL queries, Data extraction from single, multiple tables equi- join, non equi-join, self -join, outer join. Usage of like, any, all, exists, in Special operators. Hierarchical quires, inline queries, flashback queries. Introduction of ANSI SQL, anonymous block, nested anonymous block, branching and looping constructs in ANSI SQL. Cursor management: nested and parameterized cursors, Oracle exception handling mechanism. Stored procedures, in, out, in out type parameters, usage of parameters in procedures. User defined functions their limitations. Triggers, mutating errors, instead of triggers.
Delete duplicate row from the table.
Display the alternate row from table.
Delete alternate row from table.
Update multiple rows in using single update statement.
Find the third highest paid and third lowest paid salary.
Display the 3rd, 4th, 9th rows from table.
Display the ename, which is start with j, k, l or m.
Show all employees who were hired the first half of the month.
Display the three record in the first row and two records in the second row and one record in the third row in a single sql statements.
Write a sql statements for rollback commit and save points.
Write a pl/sql for select, insert, update and delete statements.
Write a pl/sql block to delete a record. If delete operation is successful return 1 else return 0.
Display name, hire date of all employees using cursors.
Display details of first 5 highly paid employees using cursors.
Write a database trigger which fires if you try to insert, update, or delete after 7’o’ clock.
Write a data base trigger, which acts just like primary key and does not allow duplicate values.
Create a data base trigger, which performs the action of the on delete cascade.
Write a data base trigger, which should not delete from emp table if the day is Sunday.
In this subject the students are supposed to prepare a small database application in complete semester like financial accounting system, Railway reservation system,institute timetable management system. Student record system, library management system, hospital management system etc. in RDBMS as follows:
Section A:
Solving the case studies using ER datamodel (design of the database) Section B:
Implement a miniproject for the problem taken in section A.
Date C J, “An Introduction To DatabaseSystem”, Pearson Educations
Korth, Silbertz,Sudarshan, “Fundamental of Database System”, McGraw Hill
Rob, “ Data Base System:Design Implementation & Management”, Cengage Learninig
Elmasri, Navathe, “Fundamentals Of Database Systems”, Pearson Educations
Atul Kahate , “ Introduction to Database Management System”, Pearson Educations
Oracle 9i Database Administration Fundamental-I, Volume I, Oracle Press,TMH.
Paneerselvam,”DataBase Management System”, PHI Learning
dev.mysql.com
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester Departmental Elective CS- 503 (A) Data Analytics
DESCRIPTIVE STATISTICS :Probability Distributions, Inferential Statistics ,Inferential Statistics through hypothesis tests Regression & ANOVA ,Regression ANOVA(Analysis of Variance)
INTRODUCTION TO BIG DATA: Big Data and its Importance, Four V’s of Big Data, Drivers for Big Data, Introduction to Big Data Analytics, Big Data Analytics applications.
BIG DATA TECHNOLOGIES: Hadoop’s Parallel World, Data discovery, Open source technology for Big Data Analytics, cloud and Big Data, Predictive Analytics, Mobile Business Intelligence and Big Data, Crowd Sourcing Analytics, Inter- and Trans-Firewall Analytics, Information Management.
PROCESSING BIG DATA: Integrating disparate data stores, Mapping data to the programming framework, Connecting and extracting data from storage, Transforming data for processing, subdividing data in preparation for Hadoop Map Reduce.
HADOOP MAPREDUCE: Employing Hadoop Map Reduce, Creating the components of Hadoop Map Reduce jobs, Distributing data processing across server farms, Executing Hadoop Map Reduce jobs, monitoring the progress of job flows, The Building Blocks of Hadoop Map Reduce Distinguishing Hadoop daemons, Investigating the Hadoop Distributed File System Selecting appropriate execution modes: local, pseudo-distributed, fully distributed.
BIG DATA TOOLS AND TECHNIQUES: Installing and Running Pig, Comparison with Databases, Pig Latin, User- Define Functions, Data Processing Operators, Installing and Running Hive, Hive QL, Querying Data, User-Defined Functions, Oracle Big Data.
Michael Minelli, Michehe Chambers, “Big Data, Big Analytics: Emerging Business Intelligence and Analytic Trends for Today’s Business”, 1st Edition, Ambiga Dhiraj, Wiely CIO Series, 2013.
Arvind Sathi, “Big Data Analytics: Disruptive Technologies for Changing the Game”, 1st Edition, IBM Corporation, 2012.1. Rajaraman, A., Ullman, J. D., Mining of Massive Datasets, Cambridge University Press, United Kingdom, 2012
Berman, J.J., Principles of Big Data: Preparing, Sharing and Analyzing Complex Information, Morgan Kaufmann, 2014
Barlow, M., Real-Time Big Data Analytics: Emerging Architecture, O Reilly, 2013
Schonberger, V.M. , Kenneth Cukier, K., Big Data, John Murray Publishers, 2013
Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced Analytics”, 1st Edition, Wiley and SAS Business Series, 2012.
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester Departmental Elective CS- 503 (B) Pattern Recognition
Introduction – Definitions, data sets for Pattern, Application Areas and Examples of pattern recognition, Design principles of pattern recognition system, Classification and clustering, supervised Learning, unsupervised learning and adaptation, Pattern recognition approaches, Decision Boundaries, Decision region , Metric spaces, distances.
Classification: introduction, application of classification, types of classification, decision tree, naïve bayes, logistic regression , support vector machine, random forest, K Nearest Neighbour Classifier and variants, Efficient algorithms for nearest neighbour classification, Different Approaches to Prototype Selection, Combination of Classifiers, Training set, test set, standardization and normalization.
Different Paradigms of Pattern Recognition, Representations of Patterns and Classes, Unsupervised Learning & Clustering: Criterion functions for clustering, Clustering Techniques: Iterative square -error partitional clustering – K means, hierarchical clustering, Cluster validation.
introduction of feature extraction and feature selection, types of feature extraction , Problem statement and Uses, Algorithms - Branch and bound algorithm, sequential forward / backward selection algorithms, (l,r) algorithm.
Recent advances in Pattern Recognition, Structural PR, SVMs, FCM, Soft computing and Neuro-fuzzy techniques, and real-life examples, Histograms rules, Density Estimation, Nearest Neighbor Rule, Fuzzy classification.
Richard O. Duda, Peter E. Hart and David G. Stork, “Pattern Classification”, 2nd Edition, John Wiley, 2006.
C. M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2009.
S. Theodoridis and K. Koutroumbas, “Pattern Recognition”, 4th Edition, academic Press, 2009.
Robert Schalkoff, “pattern Recognition: statistical, structural and neural approaches”, JohnWiley & sons , Inc, 2007.
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester
Introduction of Cyber Crime, Challenges of cyber crime, Classifications of Cybercrimes: E- Mail Spoofing, Spamming, Internet Time Theft, Salami attack/Salami Technique,
Web jacking, Online Frauds, Software Piracy, Computer Network Intrusions, Password Sniffing, Identity Theft, cyber terrorism, Virtual Crime, Perception of cyber criminals: hackers, insurgents and extremist group etc. Web servers were hacking, session hijacking.
Cyber Crime and Criminal justice: Concept of Cyber Crime and the IT Act, 2000, Hacking, Teenage Web Vandals, Cyber Fraud and Cheating, Defamation, Harassment and E-mail Abuse, Other IT Act Offences, Monetary Penalties, jurisdiction and Cyber Crimes, Nature of Criminality, Strategies to tackle Cyber Crime and Trends.
The Indian Evidence Act of 1872 v. Information Technology Act, 2000: Status of Electronic Records as Evidence, Proof and Management of Electronic Records; Relevancy, Admissibility and Probative Value of E-Evidence, Proving Digital Signatures, Proof of Electronic Agreements, Proving Electronic Messages.
Tools and Methods in Cybercrime: Proxy Servers and Anonymizers, Password Cracking, Key loggers and Spyware, virus and worms, Trojan Horses, Backdoors, DoS and DDoS Attacks , Buffer and Overflow, Attack on Wireless Networks, Phishing : Method of Phishing, Phishing Techniques.
Principles of Cyber crime, Jonathan Clough Cambridge University Press
John R. Vacca, Computer Forensics:Computer Crime Scene Investigation, 2nd Edition, Charles River Media, 2005
Cyber Law Simplified, VivekSood, Pub: TMH.
Cyber Security by Nina Godbole, SunitBelapure Pub: Wiley-India
Information Warfare: Corporate attack and defense in digital world, William Hutchinson, Mathew Warren, Elsevier.
Cyber Laws and IT Protection, Harish Chander, Pub:PHI.
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester
After completion of the course students will be able to
Describe the concepts of WWW including browser and HTTP protocol.
List the various HTML tags and use them to develop the user friendly web pages.
Define the CSS with its types and use them to provide the styles to the webpages at various levels.
Develop the modern web pages using the HTML and CSS features withdifferent layouts as per need of applications.
Use the JavaScript to develop the dynamic web pages.
Use server side scripting with PHP to generate the web pages dynamically using the database connectivity.
Develop the modern Web applications using the client and server sidetechnologies and the web design fundamentals.
Introduction: Concept of WWW, Internet and WWW, HTTP Protocol : Request and Response, Web browser and Web servers, Features of Web 2.0 Web Design: Concepts of effective web design, Webdesign issues including Browser, Bandwidth and Cache, Display resolution, Look and Feel of the Web
site, Page Layout and linking, User centric design, Sitemap, Planning and publishing website, Designing effective navigation.
HTML :Basics of HTML, formatting and fonts, commenting code, color, hyperlink, lists, tables, images, forms, XHTML, Meta tags, Character entities, frames and frame sets, Browser architecture and Web site structure. Overview and features of HTML5
Style sheets : Need for CSS, introduction to CSS, basic syntax andstructure, using CSS, background images, colors and properties,manipulating texts, usingfonts, borders and boxes, margins, padding lists,positioning using CSS, CSS2, Overview and features of CSS3 JavaScript : Client side scriptingwith JavaScript, variables, functions, conditions, loops and repetition, Pop up boxes, Advance JavaScript: Javascript and objects, JavaScript own objects, the DOM and web browser environments, Manipulation using DOM, forms and validations,DHTML : Combining HTML, CSS andJavascript, Events and buttons
XML : Introduction to XML, uses of XML, simple XML, XML keycomponents, DTD andSchemas, Using XML with application. Transforming XML using XSL and XSLT PHP: Introduction and basic syntax of PHP, decision and looping with examples, PHP and HTML, Arrays, Functions, Browser control and detection, string, Form processing, Files, Advance Features: Cookies and Sessions, Object Oriented Programming with PHP
PHP and MySQL:Basic commandswith PHP examples, Connection to server, creating database, selecting a database, listing database, listing table names,creating a table, inserting data, altering tables, queries, deleting database, deleting data and tables, PHP myadmin and databasebugs
Developing Web Applications, Ralph Moseley and M. T. Savaliya, Wiley-India
Web Technologies, Black Book, dreamtech Press
HTML 5, Black Book, dreamtech Press
Web Design, Joel Sklar, Cengage Learning
Developing Web Applications in PHP and AJAX, Harwani, McGrawHill
Internet and World Wide Web How to program, P.J. Deitel & H.M. Deitel , Pearson
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester
Basics of programming: Character set, Constants, Variables, keywords, identifiers literals. Instructions: Type Declaration Instruction, arithmetic Integer Long Short, Signed unsigned, storage classes, Integer and Float Conversions, type conversion in assignment, hierarchy of
operations.
Decision control structure: control instructions, if, if-else, use of logical operator, hierarchy of
logical operators, arithmetic operators, relational operators, assignment operators, increment and decrement operators, conditional operators, bit wise operators, special operators, “&,*,.,>, “sizeof” Loops control structure: while loop, for loop, do – while loop, odd loop, nested loop, break, continue, case control structure, go to, exit statement.
Array: what are arrays , array initialization, bound checking 1D array, 2D array initialization of 1D and 2D array, memory map of 1D and 2D array, Multidimensional array. Strings: what are strings, standard library string function strlen(), strcpy(), strcat(), strcmp(), 2D array of characters.
Structure: Why use structure, declaration of structure, accessing structure elements, how structure elements are stored, array of structure, uses of structure. Preprocessor: features of Preprocessor, macro expansion, micro with arguments, file inclusion, conditional, #if, #elif, miscellaneous directives, #include, #define, directives, #undef, #pragma directives. Union: Union definition & declaration, accessing a union member, union of structures, initialization of union member, uses of union, use of user defined data types.
Introduction: Basic concepts of OOP: object, class, data abstraction, data encapsulation, inheritance, polymorphism, Static and dynamic binding, message passing, benefits of OOP’s, disadvantage of OOP’s, application of OOP’s, a simple program, anatomy of program, creating a source file, compiling and Linking.
David Parsons; Object oriented programming with C++; BPB publication
Object oriented programming in C++ by Robert Lafore: Galgotia
Balagurusamy; Object oriented programming with C++; TMH
Java Complete Reference: Herbert Schildt, Mc Graw Hill
Hubbard; Programming in C++ (Schaum); TMH
Mastering C++ by Venugopal, TMH
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester
Date C J, “An Introduction To Database System”, Pearson Educations
Korth, Silbertz,Sudarshan, “Fundamental of Database System”, McGraw Hill
Rob, “ Data Base System:Design Implementation & Management”, Cengage Learninig
Elmasri, Navathe, “Fundamentals Of Database Systems”, Pearson Educations
Atul Kahate , “ Introduction to Database Management System”, Pearson Educations
Oracle 9i Database Administration Fundamental-I, Volume I, Oracle Press,TMH.
Paneerselvam,”DataBase Management System”, PHI Learning
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester CS505 Linux (LAB)
Understand the system calls
Compare between ANSI C AND C++ AND POSIX standards
Mapping the relationship between UNIX Kernel support for files
Understand Kernel support for process creation and termination and memory allocation
Concepts, Unix/Linux Installation Process, Hardware Requirements for Unix/Linux, Advantages of Unix/Linux, Reasons for Popularity and Success of Linux/Unix Operating System, Features of Linux/Unix Operating System, Kernel, Kernel Functions,
Shell Variables, Branching Control Structures, Loop-Control Structure, Continue and break Statements, Sleep Command, Debugging Script. Use of Linux as web-
server, file server, directory server, application server, DNS server, SMTP server, Firewall, Proxy server.
Definition of File System, Defining Geometry, Disk Controller, Solaris File System, Disk Based File Systems, Network-Based File Systems, Virtual File systems, UFS File System, The Boot Block, The Super Block, The Inode, Tuning File System, Repairing File System.
Viewing a Process, Command to display Process, Process Attributes, Process States, Process Fields, PS Commands options, PGREP, PRSTAT, CDE Process Manager, Scheduling Process, Scheduling Priorities, Changing the Priority of a time-sharing process, Killing Process.
Physical Security, Controlling System Access, Restricted Shells Controlling File Access, File Access Commands, Access Control List(ACLs), Setting ACL Entries, Modifying ACL entries on a file, Deleting ACL entries on a file, Restricting FTP, Securing Super User Access, Restricting Root Access, Monitoring super user Access, TCP Wrappers.
Introduction, DHCP Leased Time, DHCP Scopes, DHCP IP Address, Allocation Types, Planning DHCP Deployment, DHCP Configuration files, Automatic Startup of DHCP Server, Configuration of DHCP Clients, Manually Configuring the DHCP.
Installation of Linux, Customization of Linux, Installation of SAMBA, APACHE, TOMCAT, Send MAIL, Postfix, Implementation of DNS, LDAP services, Firewall, Proxy server
To Study basic & User status Unix/Linux Commands.
Study & use of commands for performing arithmetic operations with Unix/Linux.
Create a file called wlcc.txt with some lines and display how many lines, words and characters are present in that file.
Append ten more simple lines to the wlcc.txt file created above and split the appended file into 3 parts. What will be the names of these split files? Display the contents of each of these files. How many lines will be there on the last file?
Given two files each of which contains names of students. Create a program to display only those names that are found on both the files.
Create a program to find out the inode number of any desired file.
Study & use of the Command for changing file permissions.
Write a pipeline of commands, which displays on the monitor as well as saves the information about the number of users using the system at present on a file called usere.ux.
Execute shell commands through vi editor.
Installation, Configuration & Customizations of Unix/Linux.
Write a shell script that accepts any number of arguments and prints them in the reverse order.
Write a shell script to find the smallest of three numbers that are read from the keyboard.
Write a shell script that reports the logging in of a specified user within one minute after he/she logs in. The script automatically terminates if the specified user does not login during a specified period of time.
Installation of SAMBA, APACHE, TOMCAT.
Implementation of DNS, LDAP services,
Study & installation of Firewall & Proxy server
Venkatesh Murthy, “Introduction to Unix &Shell”, Pearson Edu
Forouzan, “Unix &Shell Programming”, Cengage Learning
Sumitab Das,”Unix Concept & Application”,TMH
Gopalan, Shivaselvan,”Beginners Guide to Unix ” PHI Learning
Venkateshwavle,”Linux Programming Tools Unveil`ed”, BS Publication.
Richard Peterson,”Linux Complete Reference”,TMH
Richard Peterson,”Unix Complete Reference”,TMH
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester CS506- Python
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.
Timothy A. Budd: Exploring python, McGraw-Hill Education.
R.Nageshwar Rao ,”Python Programming” ,Wiley India
Allen B. Downey; Think Python, O'Reilly Media, Inc.
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester CS501 Theory of Computation
To understand computability, decidability, and complexity through problem solving.
To analyse and design abstract model of computation & formal languages
To understand and conduct mathematical proofs for computation and algorithms.
Introduction to Automata Theory Language & Computation, Hopcroft& Ullman, Narosa Publication.
Element of the Theory Computation, Lewis &Christors, Pearson.
Theory of Computation, Chandrasekhar & Mishra, PHI.
Theory of Computation, Wood, Harper & Row.
Introduction to Computing Theory, Daniel I-A Cohen, Wiley.
After completion of this course, the students would be able to:
LIST OF EXPERIMENTS
Design a Program for creating machine that accepts three consecutive one.
Design a Program for creating machine that accepts the string always ending with 101.
Design a Program for Mode 3 Machine
Design a program for accepting decimal number divisible by 2.
Design a program for creating a machine which accepts string having equal no. of 1’s and 0’s.
Design a program for creating a machine which count number of 1’s and 0’s in a given string.
Design a Program to find 2’s complement of a given binary number.
Design a Program which will increment the given binary number by 1.
Design a Program to convert NDFA to DFA.
Design a Program to create PDA machine that accept the well-formed parenthesis.
Design a PDA to accept WCWR where w is any string and WR is reverse of that string and C is a Special symbol.
Design a Turing machine that’s accepts the following language an b n c n where n>0.
After completion of this course, the students would be able to:
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester CS502 Database Management Systems
Understand the different issues involved in the design and implementation of a database system.
Study the physical and logical database designs, database modeling, relational, hierarchical, and network models
Understand and use data manipulation language to query, update, and manage a database
Develop an understanding of essential DBMS concepts such as: database security, integrity, concurrency,
Design and build a simple database system and demonstrate competence with the fundamental tasks involved with modeling, designing, and implementing a DBMS.
Evaluate a business situation and designing & building a database applications
DBMS Concepts and architecture Introduction, Database approach v/s Traditional file accessing approach, Advantages, of database systems, Data models, Schemas and instances, Data independence, Data Base Language and interfaces, Overall Database Structure, Functions of DBA and designer, ER data model: Entitles and attributes, Entity types, Defining the E-R diagram, Concept of Generalization, Aggregation and Specialization. transforming ER diagram into the tables. Various other data models object oriented data Model, Network data model, and Relational data model, Comparison between the three types of models.
Relational Data models: Domains, Tuples, Attributes, Relations, Characteristics of relations, Keys, Key attributes of relation, Relational database, Schemas, Integrity constraints. Referential integrity, Intension and Extension, Relational Query languages: SQL-DDL, DML, integrity con straints, Complex queries, various joins, indexing, triggers, assertions , Relational algebra and relational calculus, Relational algebra operations like select, Project
,Join, Division, outer union. Types of relational calculus i.e. Tuple oriented and domain oriented relational calculus and its operations.
Data Base Design: Introduction to normalization, Normal forms, Functional dependency, Decomposition, Dependency preservation and lossless join, problems with null valued and dangling tuples, multivalued dependencies. Query Optimization: Introduction, steps of optimization, various algorithms to implement select, project and join operations of relational algebra, optimization methods: heuristic based, cost estimation based.
Transaction Processing Concepts: -Transaction System, Testing of Serializability, Serializability of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction failures. Log based recovery. Checkpoints deadlock handling. Concurrency
Control Techniques: Concurrency Control, locking Techniques for concurrency control, time stamping protocols for concurrency control, validation based protocol, multiple granularity. Multi version schemes, Recovery with concurrent transaction. Introduction to Distributed databases, data mining, data warehousing, Object Technology and DBMS, Comparative study of OODBMS Vs DBMS . Temporal, Deductive, Multimedia, Web & Mobile database.
Study of Relational Database Management Systems through Oracle/PL SQL
QL/MySQL: Architecture, physical files, memory structures, background process. Concept of table spaces, segments, extents and block. Dedicated server, multi threaded server. Distributed database, database links, and snapshot. Data dictionary, dynamic performance view. Security, role management, privilege management, profiles, invoker defined security model. SQL queries, Data extraction from single, multiple tables equi- join, non equi-join, self -join, outer join. Usage of like, any, all, exists, in Special operators. Hierarchical quires, inline queries, flashback queries. Introduction of ANSI SQL, anonymous block, nested anonymous block, branching and looping constructs in ANSI SQL. Cursor management: nested and parameterized cursors, Oracle exception handling mechanism. Stored procedures, in, out, in out type parameters, usage of parameters in procedures. User defined functions their limitations. Triggers, mutating errors, instead of triggers.
Delete duplicate row from the table.
Display the alternate row from table.
Delete alternate row from table.
Update multiple rows in using single update statement.
Find the third highest paid and third lowest paid salary.
Display the 3rd, 4th, 9th rows from table.
Display the ename, which is start with j, k, l or m.
Show all employees who were hired the first half of the month.
Display the three record in the first row and two records in the second row and one record in the third row in a single sql statements.
Write a sql statements for rollback commit and save points.
Write a pl/sql for select, insert, update and delete statements.
Write a pl/sql block to delete a record. If delete operation is successful return 1 else return 0.
Display name, hire date of all employees using cursors.
Display details of first 5 highly paid employees using cursors.
Write a database trigger which fires if you try to insert, update, or delete after 7’o’ clock.
Write a data base trigger, which acts just like primary key and does not allow duplicate values.
Create a data base trigger, which performs the action of the on delete cascade.
Write a data base trigger, which should not delete from emp table if the day is Sunday.
In this subject the students are supposed to prepare a small database application in complete semester like financial accounting system, Railway reservation system,institute timetable management system. Student record system, library management system, hospital management system etc. in RDBMS as follows:
Section A:
Solving the case studies using ER datamodel (design of the database) Section B:
Implement a miniproject for the problem taken in section A.
Date C J, “An Introduction To DatabaseSystem”, Pearson Educations
Korth, Silbertz,Sudarshan, “Fundamental of Database System”, McGraw Hill
Rob, “ Data Base System:Design Implementation & Management”, Cengage Learninig
Elmasri, Navathe, “Fundamentals Of Database Systems”, Pearson Educations
Atul Kahate , “ Introduction to Database Management System”, Pearson Educations
Oracle 9i Database Administration Fundamental-I, Volume I, Oracle Press,TMH.
Paneerselvam,”DataBase Management System”, PHI Learning
dev.mysql.com
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester Departmental Elective CS- 503 (A) Data Analytics
DESCRIPTIVE STATISTICS :Probability Distributions, Inferential Statistics ,Inferential Statistics through hypothesis tests Regression & ANOVA ,Regression ANOVA(Analysis of Variance)
INTRODUCTION TO BIG DATA: Big Data and its Importance, Four V’s of Big Data, Drivers for Big Data, Introduction to Big Data Analytics, Big Data Analytics applications.
BIG DATA TECHNOLOGIES: Hadoop’s Parallel World, Data discovery, Open source technology for Big Data Analytics, cloud and Big Data, Predictive Analytics, Mobile Business Intelligence and Big Data, Crowd Sourcing Analytics, Inter- and Trans-Firewall Analytics, Information Management.
PROCESSING BIG DATA: Integrating disparate data stores, Mapping data to the programming framework, Connecting and extracting data from storage, Transforming data for processing, subdividing data in preparation for Hadoop Map Reduce.
HADOOP MAPREDUCE: Employing Hadoop Map Reduce, Creating the components of Hadoop Map Reduce jobs, Distributing data processing across server farms, Executing Hadoop Map Reduce jobs, monitoring the progress of job flows, The Building Blocks of Hadoop Map Reduce Distinguishing Hadoop daemons, Investigating the Hadoop Distributed File System Selecting appropriate execution modes: local, pseudo-distributed, fully distributed.
BIG DATA TOOLS AND TECHNIQUES: Installing and Running Pig, Comparison with Databases, Pig Latin, User- Define Functions, Data Processing Operators, Installing and Running Hive, Hive QL, Querying Data, User-Defined Functions, Oracle Big Data.
Michael Minelli, Michehe Chambers, “Big Data, Big Analytics: Emerging Business Intelligence and Analytic Trends for Today’s Business”, 1st Edition, Ambiga Dhiraj, Wiely CIO Series, 2013.
Arvind Sathi, “Big Data Analytics: Disruptive Technologies for Changing the Game”, 1st Edition, IBM Corporation, 2012.1. Rajaraman, A., Ullman, J. D., Mining of Massive Datasets, Cambridge University Press, United Kingdom, 2012
Berman, J.J., Principles of Big Data: Preparing, Sharing and Analyzing Complex Information, Morgan Kaufmann, 2014
Barlow, M., Real-Time Big Data Analytics: Emerging Architecture, O Reilly, 2013
Schonberger, V.M. , Kenneth Cukier, K., Big Data, John Murray Publishers, 2013
Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced Analytics”, 1st Edition, Wiley and SAS Business Series, 2012.
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester Departmental Elective CS- 503 (B) Pattern Recognition
Introduction – Definitions, data sets for Pattern, Application Areas and Examples of pattern recognition, Design principles of pattern recognition system, Classification and clustering, supervised Learning, unsupervised learning and adaptation, Pattern recognition approaches, Decision Boundaries, Decision region , Metric spaces, distances.
Classification: introduction, application of classification, types of classification, decision tree, naïve bayes, logistic regression , support vector machine, random forest, K Nearest Neighbour Classifier and variants, Efficient algorithms for nearest neighbour classification, Different Approaches to Prototype Selection, Combination of Classifiers, Training set, test set, standardization and normalization.
Different Paradigms of Pattern Recognition, Representations of Patterns and Classes, Unsupervised Learning & Clustering: Criterion functions for clustering, Clustering Techniques: Iterative square -error partitional clustering – K means, hierarchical clustering, Cluster validation.
introduction of feature extraction and feature selection, types of feature extraction , Problem statement and Uses, Algorithms - Branch and bound algorithm, sequential forward / backward selection algorithms, (l,r) algorithm.
Recent advances in Pattern Recognition, Structural PR, SVMs, FCM, Soft computing and Neuro-fuzzy techniques, and real-life examples, Histograms rules, Density Estimation, Nearest Neighbor Rule, Fuzzy classification.
Richard O. Duda, Peter E. Hart and David G. Stork, “Pattern Classification”, 2nd Edition, John Wiley, 2006.
C. M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2009.
S. Theodoridis and K. Koutroumbas, “Pattern Recognition”, 4th Edition, academic Press, 2009.
Robert Schalkoff, “pattern Recognition: statistical, structural and neural approaches”, JohnWiley & sons , Inc, 2007.
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester
Introduction of Cyber Crime, Challenges of cyber crime, Classifications of Cybercrimes: E- Mail Spoofing, Spamming, Internet Time Theft, Salami attack/Salami Technique,
Web jacking, Online Frauds, Software Piracy, Computer Network Intrusions, Password Sniffing, Identity Theft, cyber terrorism, Virtual Crime, Perception of cyber criminals: hackers, insurgents and extremist group etc. Web servers were hacking, session hijacking.
Cyber Crime and Criminal justice: Concept of Cyber Crime and the IT Act, 2000, Hacking, Teenage Web Vandals, Cyber Fraud and Cheating, Defamation, Harassment and E-mail Abuse, Other IT Act Offences, Monetary Penalties, jurisdiction and Cyber Crimes, Nature of Criminality, Strategies to tackle Cyber Crime and Trends.
The Indian Evidence Act of 1872 v. Information Technology Act, 2000: Status of Electronic Records as Evidence, Proof and Management of Electronic Records; Relevancy, Admissibility and Probative Value of E-Evidence, Proving Digital Signatures, Proof of Electronic Agreements, Proving Electronic Messages.
Tools and Methods in Cybercrime: Proxy Servers and Anonymizers, Password Cracking, Key loggers and Spyware, virus and worms, Trojan Horses, Backdoors, DoS and DDoS Attacks , Buffer and Overflow, Attack on Wireless Networks, Phishing : Method of Phishing, Phishing Techniques.
Principles of Cyber crime, Jonathan Clough Cambridge University Press
John R. Vacca, Computer Forensics:Computer Crime Scene Investigation, 2nd Edition, Charles River Media, 2005
Cyber Law Simplified, VivekSood, Pub: TMH.
Cyber Security by Nina Godbole, SunitBelapure Pub: Wiley-India
Information Warfare: Corporate attack and defense in digital world, William Hutchinson, Mathew Warren, Elsevier.
Cyber Laws and IT Protection, Harish Chander, Pub:PHI.
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester
After completion of the course students will be able to
Describe the concepts of WWW including browser and HTTP protocol.
List the various HTML tags and use them to develop the user friendly web pages.
Define the CSS with its types and use them to provide the styles to the webpages at various levels.
Develop the modern web pages using the HTML and CSS features withdifferent layouts as per need of applications.
Use the JavaScript to develop the dynamic web pages.
Use server side scripting with PHP to generate the web pages dynamically using the database connectivity.
Develop the modern Web applications using the client and server sidetechnologies and the web design fundamentals.
Introduction: Concept of WWW, Internet and WWW, HTTP Protocol : Request and Response, Web browser and Web servers, Features of Web 2.0 Web Design: Concepts of effective web design, Webdesign issues including Browser, Bandwidth and Cache, Display resolution, Look and Feel of the Web
site, Page Layout and linking, User centric design, Sitemap, Planning and publishing website, Designing effective navigation.
HTML :Basics of HTML, formatting and fonts, commenting code, color, hyperlink, lists, tables, images, forms, XHTML, Meta tags, Character entities, frames and frame sets, Browser architecture and Web site structure. Overview and features of HTML5
Style sheets : Need for CSS, introduction to CSS, basic syntax andstructure, using CSS, background images, colors and properties,manipulating texts, usingfonts, borders and boxes, margins, padding lists,positioning using CSS, CSS2, Overview and features of CSS3 JavaScript : Client side scriptingwith JavaScript, variables, functions, conditions, loops and repetition, Pop up boxes, Advance JavaScript: Javascript and objects, JavaScript own objects, the DOM and web browser environments, Manipulation using DOM, forms and validations,DHTML : Combining HTML, CSS andJavascript, Events and buttons
XML : Introduction to XML, uses of XML, simple XML, XML keycomponents, DTD andSchemas, Using XML with application. Transforming XML using XSL and XSLT PHP: Introduction and basic syntax of PHP, decision and looping with examples, PHP and HTML, Arrays, Functions, Browser control and detection, string, Form processing, Files, Advance Features: Cookies and Sessions, Object Oriented Programming with PHP
PHP and MySQL:Basic commandswith PHP examples, Connection to server, creating database, selecting a database, listing database, listing table names,creating a table, inserting data, altering tables, queries, deleting database, deleting data and tables, PHP myadmin and databasebugs
Developing Web Applications, Ralph Moseley and M. T. Savaliya, Wiley-India
Web Technologies, Black Book, dreamtech Press
HTML 5, Black Book, dreamtech Press
Web Design, Joel Sklar, Cengage Learning
Developing Web Applications in PHP and AJAX, Harwani, McGrawHill
Internet and World Wide Web How to program, P.J. Deitel & H.M. Deitel , Pearson
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester
Basics of programming: Character set, Constants, Variables, keywords, identifiers literals. Instructions: Type Declaration Instruction, arithmetic Integer Long Short, Signed unsigned, storage classes, Integer and Float Conversions, type conversion in assignment, hierarchy of
operations.
Decision control structure: control instructions, if, if-else, use of logical operator, hierarchy of
logical operators, arithmetic operators, relational operators, assignment operators, increment and decrement operators, conditional operators, bit wise operators, special operators, “&,*,.,>, “sizeof” Loops control structure: while loop, for loop, do – while loop, odd loop, nested loop, break, continue, case control structure, go to, exit statement.
Array: what are arrays , array initialization, bound checking 1D array, 2D array initialization of 1D and 2D array, memory map of 1D and 2D array, Multidimensional array. Strings: what are strings, standard library string function strlen(), strcpy(), strcat(), strcmp(), 2D array of characters.
Structure: Why use structure, declaration of structure, accessing structure elements, how structure elements are stored, array of structure, uses of structure. Preprocessor: features of Preprocessor, macro expansion, micro with arguments, file inclusion, conditional, #if, #elif, miscellaneous directives, #include, #define, directives, #undef, #pragma directives. Union: Union definition & declaration, accessing a union member, union of structures, initialization of union member, uses of union, use of user defined data types.
Introduction: Basic concepts of OOP: object, class, data abstraction, data encapsulation, inheritance, polymorphism, Static and dynamic binding, message passing, benefits of OOP’s, disadvantage of OOP’s, application of OOP’s, a simple program, anatomy of program, creating a source file, compiling and Linking.
David Parsons; Object oriented programming with C++; BPB publication
Object oriented programming in C++ by Robert Lafore: Galgotia
Balagurusamy; Object oriented programming with C++; TMH
Java Complete Reference: Herbert Schildt, Mc Graw Hill
Hubbard; Programming in C++ (Schaum); TMH
Mastering C++ by Venugopal, TMH
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester
Date C J, “An Introduction To Database System”, Pearson Educations
Korth, Silbertz,Sudarshan, “Fundamental of Database System”, McGraw Hill
Rob, “ Data Base System:Design Implementation & Management”, Cengage Learninig
Elmasri, Navathe, “Fundamentals Of Database Systems”, Pearson Educations
Atul Kahate , “ Introduction to Database Management System”, Pearson Educations
Oracle 9i Database Administration Fundamental-I, Volume I, Oracle Press,TMH.
Paneerselvam,”DataBase Management System”, PHI Learning
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester CS505 Linux (LAB)
Understand the system calls
Compare between ANSI C AND C++ AND POSIX standards
Mapping the relationship between UNIX Kernel support for files
Understand Kernel support for process creation and termination and memory allocation
Concepts, Unix/Linux Installation Process, Hardware Requirements for Unix/Linux, Advantages of Unix/Linux, Reasons for Popularity and Success of Linux/Unix Operating System, Features of Linux/Unix Operating System, Kernel, Kernel Functions,
Shell Variables, Branching Control Structures, Loop-Control Structure, Continue and break Statements, Sleep Command, Debugging Script. Use of Linux as web-
server, file server, directory server, application server, DNS server, SMTP server, Firewall, Proxy server.
Definition of File System, Defining Geometry, Disk Controller, Solaris File System, Disk Based File Systems, Network-Based File Systems, Virtual File systems, UFS File System, The Boot Block, The Super Block, The Inode, Tuning File System, Repairing File System.
Viewing a Process, Command to display Process, Process Attributes, Process States, Process Fields, PS Commands options, PGREP, PRSTAT, CDE Process Manager, Scheduling Process, Scheduling Priorities, Changing the Priority of a time-sharing process, Killing Process.
Physical Security, Controlling System Access, Restricted Shells Controlling File Access, File Access Commands, Access Control List(ACLs), Setting ACL Entries, Modifying ACL entries on a file, Deleting ACL entries on a file, Restricting FTP, Securing Super User Access, Restricting Root Access, Monitoring super user Access, TCP Wrappers.
Introduction, DHCP Leased Time, DHCP Scopes, DHCP IP Address, Allocation Types, Planning DHCP Deployment, DHCP Configuration files, Automatic Startup of DHCP Server, Configuration of DHCP Clients, Manually Configuring the DHCP.
Installation of Linux, Customization of Linux, Installation of SAMBA, APACHE, TOMCAT, Send MAIL, Postfix, Implementation of DNS, LDAP services, Firewall, Proxy server
To Study basic & User status Unix/Linux Commands.
Study & use of commands for performing arithmetic operations with Unix/Linux.
Create a file called wlcc.txt with some lines and display how many lines, words and characters are present in that file.
Append ten more simple lines to the wlcc.txt file created above and split the appended file into 3 parts. What will be the names of these split files? Display the contents of each of these files. How many lines will be there on the last file?
Given two files each of which contains names of students. Create a program to display only those names that are found on both the files.
Create a program to find out the inode number of any desired file.
Study & use of the Command for changing file permissions.
Write a pipeline of commands, which displays on the monitor as well as saves the information about the number of users using the system at present on a file called usere.ux.
Execute shell commands through vi editor.
Installation, Configuration & Customizations of Unix/Linux.
Write a shell script that accepts any number of arguments and prints them in the reverse order.
Write a shell script to find the smallest of three numbers that are read from the keyboard.
Write a shell script that reports the logging in of a specified user within one minute after he/she logs in. The script automatically terminates if the specified user does not login during a specified period of time.
Installation of SAMBA, APACHE, TOMCAT.
Implementation of DNS, LDAP services,
Study & installation of Firewall & Proxy server
Venkatesh Murthy, “Introduction to Unix &Shell”, Pearson Edu
Forouzan, “Unix &Shell Programming”, Cengage Learning
Sumitab Das,”Unix Concept & Application”,TMH
Gopalan, Shivaselvan,”Beginners Guide to Unix ” PHI Learning
Venkateshwavle,”Linux Programming Tools Unveil`ed”, BS Publication.
Richard Peterson,”Linux Complete Reference”,TMH
Richard Peterson,”Unix Complete Reference”,TMH
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, V-Semester CS506- Python
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.
Timothy A. Budd: Exploring python, McGraw-Hill Education.
R.Nageshwar Rao ,”Python Programming” ,Wiley India
Allen B. Downey; Think Python, O'Reilly Media, Inc.