Shri Vile Parle Kelavani Mandal’s MITHIBAI COLLEGE OF ARTS, CHAUHAN INSTITUTE OF SCIENCE & AMRUTBEN JIVANLAL COLLEGE OF COMMERCE AND ECONOMICS (AUTONOMOUS) \NAAC Reaceredited ‘A’ grade, OGPA: 3.57, Granted under RUSA, FIST-DST & Star College Scheme of DBT, Government of India, Best College (2016-17), University of Mumbai Affiliated to the UNIVERSITY OF MUMBAI Program: B.Sc.-Computer Science an F.Y. B. Se. Semester I & II Choice Based Credit System (CBCS) with effect from the Academic year 2021-22 ‘A.C. No: ‘Agenda No: 4, qaysueee Ravi ClpflsPROGRAMME SPECIFIC OUTCOMES (PSO'S) ‘On completion of the B.Sc Computer Science, the learners should be enriched with knowledge and be able to- PSO1: To train the students for software development using different programming languages. S02: To develop the skills for problem solving in computing and other relevant disciplines. PS03: To introduce emerging trends to the students in a gradual way. PS04: To groom the students for facing the challenges in ICT industry. Preamble Information and Communication Technology (ICT) has today become integral part of all industry domains as well as fields of academies and research. The industry requirements and technologies have been steadily and rapidly advancing. Organizations are increasingly opting for open source systems. The students too these days are thinking beyond career in the industry and aiming for research opportunities. The B.Sc. Computer Science course structure therefore needed a fresh outlook and complete overhaul. ‘A real genuine attempt has been made while designing the new syllabus for this three year graduate course. Not only does it prepare the students for a career in Software industry, it also motivates them towards further studies and research opportunities. In the first year i.e. for semester I & II, basic foundation of important skills required for software development is laid. The syllabus proposes to have four core subjects of Computer science and two core courses of Mathematics-Statistics. All core subjects are proposed to have theory as well as practical tracks. While the Computer Science courses ‘will form fundamental skills for solving computational problems, the Mathematics & Statistics course will inculcate research oriented acumen. The syllabus design for further semesters encompasses more advanced and specialized courses of Computer Science. We sincerely believe that any student taking this course will get very strong foundation and exposure to basics, advanced and emerging trends of the suibject. We hope that the students’ community and teachers’ fraternity will appreciate the treatment given to the courses in the syllabus. Page | of 61Evaluation Pattern ‘The performance of the learner will be evaluated in two components. The first component will be a Continuous Assessment with a weightage of 25% of total marks per course. The second component will be a Semester end Examination with a weightage of 75% of the total marks per course, The allocation of marks for the Continuous Assessment and Semester end Examinations is as shown below: a) Details of Continuous Assessment (CA) 25% of the total marks per course: Continuous Assessment Details Marks ‘Component I (CA-1) Class Test/Research Paper Review/ 15 marks Assignment/ Presentation/ Mini Project ‘Component 2 (CA-2) ‘Assignment presentation/mini project, ete 10 marks Minimum 2 component of Continuous Assessment need to be conducted pet course. b) Details of Semester End Examination 75% of the total marks per course. Duration of examination will be two and half hours. Question Description Marks Total Marks Number QI | Answer any 3 out of 4 Questions Tmarks each [3x 7=21 marks Q2 | Answer any 3 out of 4 Questions Tmarks each [3x 7=21 marks Q3__| Answer any 3 out of 4 Questions Tmarks each | 3x7=21 marks Q4 | Answer any 3 out of 4 questions 4marks each [3x4= 12 marks Total Marks [75 marks Evaluation for practical papers In the Practical exams, there will be 20% assessment for the journal and laboratory work and 80% as term end component to be conducted as a semester end exam per course. For each course there will be one examiner per batch who will evaluate the practical on eo, Sigiauut Signature Signature HOD Approved by Vice-Principal Approved by PrincipalThe courses are as follows: - NB.- (i) wi ‘Thus in a week, a student will study 14 hours of theory and 12 hours of practical Course Title Lecture/Week Theory of Computation Java Programming. ‘Operating System Database Management System Advanced Web Technologies ‘Computer Networks Combinatorics and Graph Theory Computer Science Practical — VIT Computer Science Practical — VII afos|ro]rofeo}ns) nfo jes. Semester — II Course Title Credits Lecture/Week | Fundamentals of Algorithms 2 ‘Advanced Java 2 Physical Computing and ToT Programmin; ei Android Developer Fundamentals Linear Algebra with Python NET Technologies Software Engineering ‘Computer Science Practical —IX Computer Science Practical —X jes] |i [tafe fas} a a}ry|to}ra|ro The duration of each theory lecture will be of 60 minutes. A course consists of 3 modules. For each module the number of hours allotted are 10. The total number of lecture hours for each course will thus be 30. For theory component value of One Credit is equal to 15 learning hours. ‘There will be one practical per batch for all but one courses per semester. The duration of each practical will be of 2 hours. For practical component the value of One Credit is equal to 30 learning hours, for each semester.Program: Bachelor of Science(2021-22) ‘Semester :T Course: Computer Organization and Design Course Code: USMACSI01 ‘Teaching Scheme ‘Evaluation Scheme Lecture Practical | Tutorial Continuous Term End (Hours per | (Hours | (Hours | Credit | Assessment and | Examinations (TEE) week) per per Evaluation (CAE) (Marks-75 week) | week) (Marks -25) _ | in Question Paper) 2 nae 2H 5 B [Learning Objectives: 7 © To understand basic digital electronics. © To understand structure and organization of computers. * To understand the structure and operation of moder processors and their instruction sets. ‘ourse Outcomes: [After completion of the course, learners would be able to: |CO1: To leam about how computer systems work and underlying principles (CO2: To understand the basics of digital electronics needed for computers ‘03: To understand the basies of instruction set architecture for reduced and complex instruction sets |CO4: To understand the basics of processor structure and operation 205: To understand how data is transferred between the processor and I/O devices. | Outline of Syllabus: (per session plan) Module | Description - INo of hours 1 paaeele ‘Abstractions and Technology, Fundamentals of Digital Logic. 10 z lemory System Organization, Input /Output, Basic Processor Unit. “10 3 Control Unit, Instruction set architectures, Fundamentals of Advanced! 10 Computer Architecture. ‘Total 30 PRACTICALS 30 Page 3 of 61Module Computer Organization and Design No. of Hours/Credits ‘Computer Abstractions and Technology, Fundamentals of Digital Logic. 10 ‘omputer Abstractions and ‘Technology: Basic Computer Components and Functions. Representation of numbers and| haracters. Fundamentals of Digital Logic: Boolean Algebra, Logic Gates, ‘Simplification of Logic Circuits: Algebraic Simplification, standard] anonical form, minterm and maxterm, Kamaugh Maps. ‘ombinational Circuits : Adders, Mux, De-Mux, Sequential Circuits barn (SR, JK & D), Counters : synchronous and asynchronou: Counter, Register types. iemory System Organization, Input /Output, Basic Processor init, 10 lemory System Organization: Classification and desigi arameters, Memory Hierarchy, Internal Memory: RAM, SRAM and RAM, Interleaved and Associative Memory, Cache memory, emory mapping and External Memory. Input / Output: YO Module, Programmed /O, Interrupt Driven /O, [Direct Memory Access. [Basic Processor Unit: Processor Organization, Structure and] Function. Register Organization, Instruction Cycle, Instructior [Pipelining. Control Unit, Instruction set architectures, Fundamentals of Advanced Computer Architecture 10 ‘ontrol Unit; Micro-Operations, Functional _ Requirements, Processor Control, Hardwired Implementation, Mint pepaned ‘Control, [Instruction set architectures: Instruction Formats, Instruction Sets, Addressing Modes, word size, big-endian and ittle-endian| Page 4 of 61‘angemenis. Instructions, sequencing. Instruction sels for RISC and| 'ISC (examples Altera NIOS Il and Freescale Cold Fite). Machinel language, assembly language, assembler directives. Types of machine, instructions: arithmetic, logic, shift, etc. ndamentals of Advanced Computer Architectui Parallel chitecture: Classification of Parallel Systems, Flynn’s Taxonomy, ray Processors, Clusters, and NUMA Computers. Introduction lultiprocessor Systems and Multi-Core Computers. PRACTICALS Sr. No.] Topic, - | 1 |Study and verify the truth table of various logic gates (NOT, AND, OR, NAND, NOR, EX- OR, and EX-NOR). 2 [Using Logisim to design the universal gates. 3 | Simplify given Boolean expression and realize it 4 | Simplify given Boolean expression using kmap. S| Design and verify a half/full adder 6 Design and verity halfifull subtractor | 7 |Design a 4-bit magnitude comparator using combinational circuits, 8 [Design and verify the operation of flip-flops using logie gates 9 | Verify the operation of a counter. - 10. | Verify the operation of a 4-bit shift register RECOMMENDED READING: Page 5 of 61Text Books: 1, Carl Hamacher et al., Computer Organization and Embedded Systems, 6 ed., McGraw-Hill 2012. 2. Computer Organization and Architecture William Stallings , 8th edition ,pearson,2012. Reference Books 1. Patterson and Hennessy, Computer Organization and Design, Morgan Kaufinann, ARM. Edition, 2011 2. RP Jain, Modem Digital Electronics, Tata McGraw Hill Education Pvt. Lid. , 4th Edition, 2010 Page 6 of 61Program: Bachelor of Science(2021-22) Semester : 1 Course: Programming with Python-I [ Course Code: USMACSTO2 ‘Teaching Scheme Evaluation Scheme Lecture Practical | Tutorial ‘Continuous Term End (Hours per | (Hours | (Hours | Credit | Assessment and | Examinations (TEE) week) per per Evaluation (CAE) (Marks-75 week) week) | (Marks -25) | in Question Paper) 2 2 = 2H oy 75 Learning Objectives: * To introduce various concepts of programming to the students using Python. * To leam the syntax of writing various commands of Python * To develop logic for Problem Solving with the help of Python * To leam about the basic constructs of programming such as data, operations, conditions, loops, fanctions etc, {Course Outcomes: |After completion of the course, learners would be able to: COL: Students should be able to understand the concepts of programming before actually starting to \write programs. | CO2:. Students should be able to develop logic reasoning skills C03: Students should be made familiar about the basic constructs of programming such as data, operations, conditions, loops, functions ete. COs: Students should be able to apply the problem solving skills using syntactically simple language ‘Outline of Syllabus: (per session plan) Module | Description [No of hours 1 [Introductory concepts of Python 10 2 [Python Constructs ~ Conditions and Loops 10 3 [Python dictionary and user-defined functions i0 ‘Total 30 PRACTICALS E 30 Page 7 of 61Module Programming with Python- I 1 introductory concepts of Python - 10 introduction to Python - Working with Python Understanding Pytho: ariables Python basic Operators [Python Data Types Declaring and using Numeric data types: int, float| omplex Using string data type and string operations Defining list and list slicing, Use of Tuple data type 2 Python Constructs — Conditions and Loops 10 (Conditional blocks using if, else and elif Simple for loops in python ‘or loop using ranges, string, list and dictionaries Use of while loops python Loop, continue, break juilding blocks of python programs Understanding string in built} thods List manipulation using in built methods 3 Python dictionary and user-defined functions | 10 ictionary manipulation Programming using string, list and dictionary, in built functions Jser Defined Functions - Advantages of functions, function! arameters, formal parameters, actual parameters, global and local ariables. Programming using functions Anonymous functions. Lis! -omprehensions. Page 8 of 61/PRACTICALS Sr. No.| Topic. 1 | Installing and setting up the Python IDLE interpreter, Executing simple statements like ‘expression statement (numeric and Boolean types), assert, assignment, delete statements; the| print function for output, 2. | Python commands based on datatypes, typecasting, built-in functions and modules. 3. | Programs based on lists, conditional constructs, the for statement and the range function; interactively using the built-in functions len, sum, max, min 4 | Programs related to string manipulation 5 _ | Programs based on the while statement; importing and executing built-in functions from the time, math and random modules 6 | Programs related to dictionaries 7 | Programs using list comprehensions and anonymous fimetions 8 | Programs using the built-in methods of the string .list and dictionary classes. 9 | Programs based on user-defined functions RECOMMENDED READING: Text Books: 1, Magnus Lie Hetland, Beginning Python: From Novice to Professional, Apress 2. Paul Gries, et al., Practical Programming: An Introduction to Computer Science Using Python 3, Pragmatic Bookshelf, 2/E 2014 Reference Books 1. Charles Dierbach, Introduction to Computer Science using Python, Wiley, 2013 Page 9 of 612. Paul Gries , Jennifer Campbell, Jason Montojo, Practical Programming: An Introduction to ‘Computer Science Using Python 3, Pragmatic Bookshelf, 2/E 2014 3. Adesh Pandey, Programming Languages ~ Principles and Paradigms, Narosa, 2008 Page 10 of 61Program: Bachelor of Science(2021-22) Semester : 1 ‘ourse: Discrete Mathematics ‘Course Code: USMACSI03, Teaching Scheme Evaluation Scheme Lecture | Practical | Tutorial Continuous Term End (Hours per | (Hours | (Hours Credit | Assessment and | Examinations (TEE) week) per per Evaluation (CAE) (Marks-75 | week) | week) (Marks -25) | in Question Paper) [3 2 : al 25 8 1 Learning Objectives: [The purpose of the course is to familiarize the prospective learners with mathematical structures that are fundamentally discrete, This course introduces sets and functions, forming and solving recurrencel lations and different counting principles. These concepts are useful to study or describe objects o jproblems in computer algorithms and programming languages. \Course Outcomes: /After completion of the course, learners would be able to: COL: To provide overview of theory of discrete objects, starting with relations and partially ordered sets CO2: Study about recurrence relations, generating function and operations on them. COS: Give an understanding of graphs and trees, which are widely helpful in software development. | CO4: Provide basic knowledge about models of automata theory and the corresponding formal languages. ‘Outline of Syllabus: (per session plan) Module Description 'No of hours| 1 IRecurrence Relations : 10 2 |Counting Principles, Languages and Finite State Machine 10 3 |Graphs and Trees E 10 [otal 30 PRACTICALS 30 Page 11 of 61Module Discrete Mathematics No. of Hours/Credits Recurrence Relations 10 (a) Functions: Definition of function, Domain, co domain and the] range of a function. Direct and inverse images. Injective, surjectiv. and bijective functions. Composite and inverse functions. b) Relations: Definition and examples. Properties of relations , Partial |Ordering sets, Linear Ordering Hasse Daigrams , Maximum and| finimum elements, Lattices (©) Recurrence Relations: Definition of recurence relations| [Formulating recurrence relations, solving recurrence relations- Bac jacking method, Linear homogeneous recurrence relations wit onstant coefficients. Solving linear homogeneous recurrence, ations with constant coefficients of degree two when characteristi equation has distinet roots and only one root, Particular solutions o nn linear homogeneous recurrence relation, Solution of recurrenc lation by the method of generation functions, Applications. ‘ormulate and solve recurrence relation for Fibonacci numbers, ‘ower of Hanoi, Intersection of lines in a plane, Sorting Algorithms. lames Principles, Languages and Finite State Machine 10 (a) Permutations and Combinations: Partition and Distribution o ‘pjects, Permutation with distinct and indistinct objects, Binomial mumbers, Combination with identities: Pascal Identity, fandermonde’s Identity, Pascal triangle, Binomial theorem| mbination with indistinct objects. (b) Counting Principles: Sum and Product Rules, Two-way counting, ‘ee diagram for solving counting problems, Pigeonhole Principle, Sieve formula) (Without proof). bine proof); Simple examples, Inclusion Exclusion Principle] Page 12 of 61(c) Languages, Grammars and Machines: Languages, regula [Expression and Regular languages, Finite state Automata, grammars, [Finite state machines, Gédel numbers, Turing machines, 3 Graphs and Trees 10 fa) Graphs : Definition and elementary results, Adjaceney matrix, path] matrix, Representing relations using diagraphs, Warshall’s algorithm shortest path , Linked representation of a graph, Operations on grap! jwith algorithms - searching in a graph; Insertion in a graph, Deleting + from a graph, Traversing a graph- Breadth-First search and Depth |First search. (b) Trees: Definition and elementary results. Ordered rooted tree, [Binary trees, Complete and extended binary trees, representing binary) lrees in memory, traversing binary trees, binary search tree| [Algorithms for searching and inserting in binary search trees| [Algorithms for deleting in a binary search tree PRACTICALS ‘Sr. No.|Topic. 1 | Graphs of standard functions such as absolute value function, inverse fimetion, logarithmic jand exponential functions, flooring and ceiling fimetions, trigonometric functions over suitable intervals 2 | Partial ordering sets, Hasse diagram and Lattices. 3 | Recurrence relation 4 | Different counting principles. | 5. | Finite state Automata and Finite state machines. 6 | Warshall’s Algorithm, Page 13 of 617 [Shortest Path algorithms. 8. Operations on graph, 9 {Breadth and Depth First search algorithms, 10 [Concept of searching, inserting and deleting from binary search RECOMMENDED READING: Text Books: 1, Discrete Mathematics and Its Applications, Seventh Edition by Kenneth H. Rosen, ‘McGraw Hill Education (India) Private Limited. (2011) 2. Norman L. Biggs, Discrete Mathematics, Revised Edition, Clarendon Press, Oxford 1989, 3. Data Structures Seymour Lipschutz, Schaum’s out lines, McGraw-Hill Inc. Reference Books 1, Blements of Discrete Mathematics: C.L. Liu , Tata MeGraw- Hill Edition 2. Concrete Mathematics (Foundation for Computer Science): Graham, Knuth, Patashnik Second Edition, Pearson Education. 3. Discrete Mathematics: Semyour Lipschutz, Marc Lipson, Schaum’s out lines, MeGraw- Hill Inc. 4, Foundations in Discrete Mathematics: K.D. Joshi, New Age Publication, New Page 14 of 61Program: Bachelor of Science(2021-22) Semester : 1 Course: Database Systems ‘Course Code: USMACS104 ‘Teaching Scheme ‘Evaluation Scheme reation, manipulation and querying of data in databases. Lecture | Practical | Tutorial | ‘Continuous Term End (Hours per (Hours (Hours ‘Credit Assessment and | Examinations (TEE) week) per per Evaluation (CAE)| — (Marks-75 week) week) (Marks - 25) _ | in Question Paper) 2 2 - 21 25 75 [Learning Objectives: [The objective of this course is to introduce the concept of the DBMS with respect to the relational model, to specify the functional and data requirements for a typical database application and to understand |Course Outcomes: [After completion of the course, leamers would be able to: C03: To create, manipulate, query the database. COI: Evaluate business information problem and find the re*quirements of a problem in tetms of data. C02: Design the database schema with the use of appropriate data types for storage of data in database, ‘Outline of Syllabus: (per session plan) Module Description No of hours| 1 [Introduction to DBMS, Data models, Entity Relationship Model, Relationall 10 [Data Model, ER to table { 2 Schema refinement and Normal forms, Relational Algebra, DDL Statements] 10 | DML Statements 3 Functions, Joining Tables, Subqueries, Database Protection, Views, DCL. 10 statements [Total 30 PRACTICALS 30 Page 15 of 61Module Database Systems No. of Hours/Credits| Introduction to DBMS, Data models, Entity Relationship Model, Relational Data Model, ER to table 10 introduction to: DBMS — Database, DBMS — Definition, Overview f DBMS, Advantages of DBMS, Levels of abstraction, Data independence, DBMS Architect [Data models - Client/Server Architecture, Object Based Logical Model, Record Based Logical Model ( relational, hierarchical] jetwork) [Entity Relationship Model - Entities, attributes, entity sets, relations, relationship sets, Additional constraints ( key constraints, participatios onstraints, weak entities, aggregation / generalization, Conceptual [Design using ER (entities VS attributes, Entity Vs relationship, binay 's temary, constraints beyond ER) [Relational data model Domains, attributes, Tuples and Relations, [Relational Model Notation, Characteristics of Relations, Relational Constraints - primary key, referential integrity, unique constraint, Null nstraint IER to Table- Entity to Table, Relationship to tables with and without ey constraints. ichema refinement and Normal forms, Relational Algebra, DDL pistements DML Statements 10 Schema refinement and Normal forms: Functional dependencie: rst, second, third normal form. [Relational Algebra operations: selection, projection, set operation: junion, intersection, difference, cross product, Joins ~conditional, equi join and natural joins, division | pr Statements - Creating Databases, Using Databases, datatypes, ‘eating Tables (with integrity constraints — primary key, default, heck, not null), Altering Tables, Renaming Tables, Dropping Tables, Page 16 of 61[DML Statements ~ Viewing the structure of a table insert, update, lelete, Select all columns, specific columns, unique records, conditional select, in clause, between clause, limit, ageregate ffanctions (count, min, max, avg, sum), group by clause, having clause 3 Functions, Joining Tables, Subqueries, Database Protection, ‘iews, ,DCL Statements 10 [Functions — String Functions (concat, instr, left, right, mid, length] Icasc/lower, ucase/upper, replace, stremp, trim, Itrim, rtrim), Mat Functions (abs, ceil, floor, mod, pow, sqrt, round, truncate) Date Functions (adddate, datediff, day, month, year, hour, min, sec, now, reverse) joining Tables — inner join, outer join (left outer, right outer, full outer) SSubqueries — subqueries with IN, EXISTS, subqueries restrictions, jested subqueries, ANY/ALL clause, correlated subqueries [Database Protection: Security Issues, Threats to Databases, Security, lechanisms, Role of DBA, Discretionary Access Control ‘ews (creating, altering dropping, renaming and manipulating views) [PCL Statements (creating/dropping users, privileges introduction, jeranting/revoking privileges, viewing privileges) PRACTICALS Sr. No.| Topic. 1 |For given scenario [Draw E-R diagram and convert entities and relationships to table. 2 |Write relational algebra queries on the tables created in Practical-1 3 | Perform the following: Viewing all databases © Creating a Database * Viewing all Tables in a Database Page 17 of 61© Creating Tables (With and Without Constraints) © Inserting/Updating/Deleting Records in a Table * Saving (Commit) and Undoing (roltback) Perform the following: Altering a Table + Dropping/Truncating/Renaming Tables © Backing up / Restoring a Database * Perform the followi © Simple Queries ‘¢ Simple Queries with Aggregate functions * Queries with Aggregate functions (group by and having clause) (Queries involving ‘+ Date Functions ‘© String Functions * Math Functions ~Join Queries © Inner Join © Outer Join ‘Subqueries © With IN clause © With EXISTS clause . Views ‘* Creating Views (with and without check option) ‘+ Dropping views ‘+ Selecting from a view DCL statements Granting and revoking permissions Page 18 of 61RECOMMENDED READING: Text Books: 1. Discrete Mathematics and Its Applications, Seventh Edition by Kenneth H. Rosen, McGraw Hill Education (India) Private Limited. (2011) 2. Norman L. Biggs, Discrete Mathematies, Revised Edition, Clarendon Press, Oxford 1989, 3. Data Structures Seymour Lipschutz, Schaum's out lines, MeGraw- Hill Ine. Reference Books 1, Elements of Discrete Mathematics: C.L. Liu , Tata McGraw-Hill Edition . 2. Concrete Mathematics (Foundation for Computer Science): Graham, Knuth, Patashnik Second Edition, Pearson Education, 3. Discrete Mathematics: Semyour Lipschutz, Mare Lipson, Schaum’s out lines, MeGraw- Hill Inc. 4. Foundations in Discrete Mathematics: K.D. Joshi, New Age Publication, New Page 19 of 61Program: Bachelor of Science(2021-22) ‘Semester : I (Course: Algorithms & Programming in € ‘Course Code: USMACS105 Teaching Scheme Evaluation Scheme Lecture | Practical | Tutorial Continuous Term End (Hours per | (Hours | (Hours Credit Assessment and | Examinations (TEE) week) per per Evaluation (CAE)| — (Marks-75 | week) | week) (Marks -25) | in Question Paper) 2 2 - 21 25 Ss [Learning Objectives: [The objective of this course is to provide a comprehensive study of the C programming language, stressing hupon the strengths of C, which provide the students with the means of writing modular, efficient| maintainable, and portable code, |Course Outcomes: |Afier completion of the course, leamers would be able to: CO1: Write, compile and debug programs in C language, use different data types in a computer program and design programs involving decision structures, loops and functions. CO2: Explain the difference between call by value and call by reference and understand the dynamics of memory by the use of pointers. COS: Use different data structures and create/update basic data files. Outline of Syllabus: (per session plan) Module | Description INo of hours| 1 [Structure of C program, Data, Variables, Types of operators and Iterations 10 2 [Arrays, Data Input and Output functions, Manipulating Strings, Function: 10 fand Recursion 3 Pointer, Dynamic Memory Allocation and Structure. 10 \Total 30 PRACTICALS 7 30 Page 20 of 61Module Algorithms & Programming in C Structure of C program, Data, Variables, Types of operators and Iterations [Structure of C program: Header and body, Use of comments| linterpreters vs compilers, Formatted /O: printf(), scanf{) [Data: Variables, Constants, data types like: int, float char, double and \void, short and long size qualifiers, signed and unsigned qualifiers. Variables: Declaring variables, scope of the variables according block, hierarchy of datatypes. {Types of operators: Arithmetic, relational, logical, compound signment, increment and decrement, conditional or ternary, bitwise ind comma operators. Precedence and order of evaluation, statements and Expressions. Automatic and explicit type conversion. iterations: Control statements for decision making: (i) Branching: i statement, else.. if statement, (does the writer mean if-else or nested jifs)switch statement. (ii) Looping: while loop, do... while, for loop. (iii Jump statements: break, continue and goto, Arrays, Data Input and Output functions, Manipulating Strings, Functions and Recursion 10 |Arrays: (One and two dimensional), declaring array variables| initialization of arrays, accessing array elements Data Input and Output Functions: Character 1/O format: getch() [getche(), geichar(), gete(), gets(), putchar(), pute(), puts(). lanipulating Strings; Declaring and initializing String variables, hharacter and string handling functions. inetions: Function declaration, function definition, Global and local ariables, return statement, Calling a function by passing values. ursion: Definition, Recursive functions. ation and Structure. Pointer, Dynamic Memory All 10 Page 21 of 61‘ointer: Fundamentals, Pointer variables, Referencing and de- feferencing, Pointer Arithmetic, Using Pointers with Arrays, Using Pointers with Strings, Array of Pointers, Pointers as function) larguments, Functions returning pointers, Dynamic Memory Allocation: malloc(), calloc(), realloc(), free() and, izeof operator. Structure: Declaration of structure, reading and pssignment of structure variables, Array of structures, atrays withi structures, structures within structures, PRACTICALS Sr. No.| Topic. 1 [Programs to understand the basic data types and VO. 2 [Programs on Operators and Expressions 3. [Programs on decision statements. 4 [Programs on looping. - | 5 [Programs on arrays. 6 | Programs on functions. 7 [Programs on structures and unions. 8 [Programs on pointers. 9 Programs on pointer arithmetic’s 10 | Programs on string manipulations. - RECOMMENDED READING: Page 22 of 61Text Books: 1, Programming in ANSI C (Thi Edition): E Balaguruswamy, TMH 2. Programming in ANSI C, RamKumar Agarwal 3. Let Us C, Yashwnt Kanitkar, BPB Publicaitions Reference Books: 1. “Programming in C”, Pradip Dey, 2nd Edition, Oxford University 2. C Programming Absolute Beginner's Guide (3rd Edition)’ by Greg Perry Learn C the Hard Way’ by Zed A. Shaw Page 23 of 61| Program: Bachelor of Science(2021-22) Semester : 1 \Course: Descriptive Statistics and Introduction to Probability ‘Course Code: U! ISMACS106 Teaching Scheme Evaluation Scheme Lecture] Practical | Tutorial Continuous Term End (Hours per (Hours (Hours | Credit Assessment and | Examinations (TEE) week) per per Evaluation (CAE) (Marks-75 week) | week) (Marks -25) | in Question Paper) 2 2 = 2H 25 5 |Learning Objectives: [The purpose of this course is to familiarize students with basics of Statistics. This will be essential fo frrospective researchers and professionals to know these basics, ‘ourse Outcomes: [After completion of the course, learners would be able to: CO1: Enable learners to know descriptive statistical concepts CO2: Enable study of probability concept required for Computer learners CO3: To groom the students for learning data analytics Outline of Syllabus: (per session plan) Module | Description [No of hours| 1 Data Presentation and Data aggregation. 10 2 loments, Measures of Skewness and Kurtosis, Correlation and Regression} 10 and linear regression. 3 Probability and Probability distribution, 10 \Total 30 PRACTICALS 30° Page 24 of 61Module Descriptive Statistics an Introduction to Probability No.of | Hours/Ci ‘redits| Data Presentation and Dati geregation, 10 Data Presentation Data types : ailvibuie, variable, discrete andl continuous variable Data presentation : frequency distribution, istogram o give, curves, stem and leaf display Data Aggregation Measures of Central tendency: Mean, Median, jnode for raw data, discrete, grouped frequency distribution. Measures ispersion: Variance, standard deviation, coefficient of variation fo raw data, discrete and grouped frequency distribution, quartiles| juantiles Real life examples joments, Measures of Skewness and Kurtosis, Correlation and iRegression and linear regression. 10 loments: raw moments, central moments, relation between raw and eentral moments [Measures of Skewness and Kurtosis: based on moments, quattiles, elation between mean, median, mode for symmetric, asymmetric frequency curve. Correlation and Regression: bivariate data, scatter plot, correlation, jmonsense correlation, Karl pearson’s coefficients of correlation, gression Probability and Probability distribution. 10 [Probability : Random experiment, sample space, events types and )perations of events Probability definition : classical, axiomatic, Elementary Theorems f probability (without proof) O | z Learning Objectives: To help learners develop their soft skills and develop their personality together with their technical skills. Developing professional, social and academic skills to hamess hidden strengths, capabilities and knowledge equip them to excel in real work environment and corporate life. Understand various issues in personal and profession communication and learn to overcome them. Learning Outcomes: ~ 1} To know about various aspects of soft skills and learn ways to develop personality 2) Understand the importance and type of communication in personal and professional environment. 3) To provide insight into much needed technical and non-technical qu: in career planning, 4) Learn about Leadership, team building, decision making and stress management Outline of Syllabus: (per session plan ) Unit | Deseription Duration 1 |Introduction to Soft Skitls and Hard Skills Personality Development, Emotional 10 Intelligence, Etiquette and Manneristn, Communication Today, 2 | Academic Skills Employment Communication, Professional Presentation, Job 10 Interviews, Group Discussion. 3 _ | Professional Skills Creativity at Workplace, Ethical Values, Capacity Building: 10 Leam, Unlearn and Releamn, Leadership and Team Building, Decision Making and Negotiation, Stress and Time Management. Page 28 of 61Total 30 Page 29 of 61Module Soft Skills Development No. of Hours/Credits| Introduction to Soft Skills and Hard Skills Personality Development, Emotional Intelligence, Etiquette and Mannerism, {Communication Today. 10 introduction to Soft Skills and Hard Skills Personality, Development: Knowing Yourself, Positive Thinking, Johari’ ‘indow, Communication Skills, Non-verbal Communication| Physical Fitness Emotional Intelligen jeaning and Definition, Need for Emotional lintelligence, Intelligence Quotient versus Emotional Intelligenc uotient, Components of Emotional Intelligence, Competencies o: Emotional Intelligence, Skills to Develop Emotional Intelligence [Etiquette and Mannerism: Introduction, Professional Etiquette, [Technology Etiquette {Communication Today: Significance of Communication, GSC’s 3 lode! of Communication, Vitality of the Communication Process, ‘irtues of Listening, Fundamentals of Good Listening, Nature of Non- |Verbal Communication, Need for Intercultural Communication| {Communicating Digital World [Academic Skills Employment Communication, Professional [Presentation, Job Interviews, Group Discussion. 10 |Academic Skills Employment Communication: Introduction] Resume, Curriculum Vitae, Scannable Resume, Developing an| impressive Resume, Formats of Resume, Job Application or Cover [Letter [Professional Presentation: Nature of Oral Presentation, Planning a Presentation, Preparing the Presentation, Delivering the Presentation Hob Interviews: Introduction, Importance of Resume, Definition o! Interview, Background Information, Types of Interviews, Preparator Page 30 of 61Steps for Job Interviews, Interview Skill Tips, Changes in the Interview Process, FAQ During Interviews ‘roup Discussion: Introduction, Ambience/Seating Arrangement for Group Discussion, Importance of Group Discussions, Differen: tween Group Discussion, Panel Discussion and Debate, Traits, ‘ypes of Group Discussions, topic based and Case based Group, iscussion, Individual Traits [Professional Skills Creativity at Workplace, Ethical Values, (Capacity Building: Learn, Unlearn and Relearn, Leadership andl Team Building, Decision Making and Negotiation, Stress and| [Time Management 10 (Professional Skills Creativity at Workplace: Introduction, Current lorkplaces, Creativity, Motivation, Nurturing Hobbies at Work, Th rx Thinking Hat Method [Ethical Values: Ethics and Society, Theories of Ethics, Correlation etween Values and Behavior, Nurturing Ethies, Importance of Work, thics, Problems in the Absence of Work Ethics | ‘apacity Building: Learn, Unicarn and Relearn: Capacity Building, Elements of Capacity Building, Zones of Learning, Ideas for Learning| ‘Strategies for Capacity Building [Leadership and Team Building: Leader and Leadership, Leadership] [Traits, Culture and Leadership, Leadership Styles and Trends, Team] Building, Types of Teams, [Decision Making and Negotiatios introduction to Decision Making ‘Steps for Decision Making, Decision Making Techniques, Negotiatiot [Fundamentals, Negotiation Styles, Major Negotiation Concepts (Stress and Time Management: Stress, Sources of Stress, Ways to Cope] with Stress RECOMMENDED READIN Textbook: Page 31 of 61Soft Skills; an Integrated Approach to Maximise Personality, Gajendra S. Chauhan, Sangeeta Sharma, Wiley India Reference Books: 1, Personality Development and Soft Skills, Barun K. Mitra, Oxford Press 2. Business Communication, Shalini Kalia, Shailja Agrawal, Wiley India 3. Soft Skills - Enhancing Employability, M. $, Rao, I. K. Intemational 4. Comerstone: Developing Soft Skills, Sherfield, Pearson India Page 32 of 61Program: jachelor of Science(2021-22) Semester : IT Course: Principles of Web Design & Web Technologies ‘Course Code:New Code ‘Teaching Scheme Evaluation Scheme Leeture | Practical | Tutorial Continuous Term End (Hours per (Hours (Hours ‘Credit Assessment and | Examinations (TEE) week) per per Evaluation (CAE) (Marks-75, week) week) (Marks -25) | in Question Paper) 2 2 3 2H 2 5 ‘Learning Objectives: © To leam how to create a user-friendly web pages * To leam the aesthetics of web site designing * To leam the techniques of client side scripting using JavaScript * To be able to perform form validation in client side [Course Outcomes: [After completion of the course, learners would be able to: COL: Students should be able to understand the techniques of creating a web page. CO2: Students should be able to create hyperlink between web pages CO3: Students should be made familiar about the basic constructs of client side seripts using Java Script CO4: Students should be able to create user forms using HTML and JavaScript for validation | Outline of Syllabus: (per session plan) Module Description No of hours| 1 ‘eb Site Design Principles and HTML 10 a laTML CSS 7 10 3 JavaScript 10 [rotal 7 30 PRACTICALS 30 Page 33 of 61Module [Principles of Web Design & Web Technologies No. of Hours/Credits ‘Web Site Design Principles and HTML 10 (eb Site Design Principles — Design for the Medium, Design for the |Whole Site, Design for the User, Design for the Screen Planning the [Site - Create a Site Specification, Identify the Content Goal, Analyz ur Audience, Build a Web Site Development Team, Filenames and] URLs, Directory Structure, Diagram the Site Planning Site Navigation] ;- Creating Usable Navigation, Using Text- Based Navigation, Using aphics- Based Navigation Publishing and Maintaining Your Wel ‘Site - Publishing Your Web Site, Testing Your Web Site, Refining and Updating Your Content, Attracting Notice to Your Web Site |HTML - HTML 4.0 Tag Reference, Document Structure Tags, Formatting Tags, List Tags, Hyperlinks, Image & Image map, Table [Tags, Form Tags | INTML Css 10 IHTML Frames — Understanding Frames, Frame Syntax, Targs ig in| Framesets, Planning Frame Content CSS: Understanding the Syntaa{ f CSS, CSS Selectors, Inserting CSS in an HTML Document, CSS| ‘operties to work with background of a Page, CSS properties to work ith Fonts and Text Styles Building Web Pages using HTML and CSS, javascript 10 javaSeript: Using JavaScript in an HTML Document, Programming! Fundamentals of JavaScript — Variables, Operators, Control Flo Bistements, Popup Boxes, Functions ~ Defining and Invoking Function, Defining Function arguments, Defining a Return Statement JavaScript Objects - String, RegExp, Math, Date, Browser Objects indow, Navigator, History, Location, Document, Document Object Model, Form Validation using JavaScript Page 34 of 61PRACTICALS Sr. No.| Topic. 1 | Visit at least 5 Websites and write a report on the features, navigation and appearance aspects of them. 2. | Design a webpage that makes use of + Document Structure Tags «Various Text Formatting Tags © List Tags ‘¢ Image and Image Maps 3. [Design a webpage that makes use of © Table tags * Navigation across multiple pages © Embedded Multimedia elements 4 |Design a webpage that makes use of Form Tags (forms with various form elements) 5 | Design a webpage that make use of Cascading Style Sheets with * CSS properties to change the background of a Page © CSS properties to change Fonts and Text Styles * CSS properties for positioning an clement 6 | Write JavaScript code for * Performing various mathematical operations such as calculating fact / finding Fibonacci Series / Displaying Prime Numbers in a given range / Evaluating. Expressions / Calculating reverse of a number 7 | Write JavaScript code for performing Client-Side Validation of various Form Elements 8 | Write JavaScript code for * Demonstrating different JavaScript Objects such as String, RegExp, Math, Date ‘+ Demonstrating different JavaScript Objects such as Window, Navigator, History, | Location, Document, c. Storing and Retrieving Cookies Page 35 of 61RECOMMENDED READI. Text Books: 1, PWD: Principles of Web Design by Joel Sklar 2, HTML & CSS ~The Complete Reference by Thomas Powell Reference Books: 1. HTML 5 Black Book, Covers CSS 3, JavaScript, XML, XHTML, AJAX, PHP and jQuery, 2ed, Dreamtech Press 2. Beginning javascript Wilton, Wrox Publication Page 36 of 61Program: Bachelor of Science(2021-22) Semester : IT (Course: Programming with Python — I ‘Course Code: USMACS202 ‘Teaching Scheme Evaluation Scheme Lecture | Practical | Tutorial Continuous Term End (Hours per | (Hours | (Hours Credit | Assessment and | Examinations (TEE) week) per per Evaluation (CAE) (Marks-75 week) | week) (Marks -25) | in Question Paper) 2 iy ~ 2 5 5 Learning Objectives: ‘+ To leam how to create a desktop application, * To leam the file handling and string manipulations, © To leam the socket programming. * To understand and manage error handling, |Course Outcomes: |After completion of the course, learners would be able to: COL: Students should be able to understand how to read/write to files using python. COS: Students should get an introduction to the concept of pattern matching. |e students should be made familiar with the concepts of, socket programming, GUI applications an database connectivity. Outline of Syllabus: (per session plan) Module | Description r [No of hours| 1 [Python File Input-Output, Exception handling and Regular Expressions. 10 2 |GUT Programming in Python (using Tkinter/wxPython/Qn, 10 3 [Database connectivity in Python, Object oriented python. 10 ‘Total 30 |PRACTICALS 30 Page 37 of 61Module Programming with Python — IL No.of | Hours/Credit Python File Input-Output, Exception handling and Regular Expressions. 10 [Python File Input-Output: Opening and closing files, various type: f file modes, reading and writing to files, manipulating directories| Itcrables, iterators and their problem-solving applications, Exeeption handling: What is an exception, various keywords « hhandic exceptions such try, catch, except, else, finally, raise. [Regular Expressions: Concept of regular expression, various type of regular expressions, using match function. ‘UI Programming in Python (using Tkinter/wxPython/Qh 10 |GUI Programming in Python (using Tkinter/wxPython/Qi) What is |GUI, Advantages of GUI, Introduction to GUI library. Layout management, events and bindings, fonts, colours, drawing on canvas line, oval, rectangle, etc.) Widgets such as : frame, label, button, heckbutton, entry, listbox, message, radiobutton, text, spinbox ete [Database connectivit in Python, Object oriented python 10 [Database connectivity in Python: Installing mysql connector| hecessing connector module module, using connect, cursor, execute & ‘lose functions, reading single & multiple results of query execution, ecuting different types of statements, executing transactions, lunderstanding exceptions in database connectivity. Introduction (Object-oriented python: python class and objects, _init__ method] inheritance. Page 38 of 61|PRACTICALS Sr. No.| Topic. e 1 [Programs to read and waite files. 2 | Programs with iterables and iterators 3. |Program to demonstrate exception handling. 4 [Program to demonstrate the use of regular expressions. 5 |Program to show draw shapes & GUI controls. 6 | Program to ereate server-client and exchange basio information. 7 {Program to send email & read contents of URL. 8 [Programs to read and write files 9 [Program for creating server and client Sockets. 10 |Mini application using python RECOMMENDED READING: Text Books: 1, Paul Gries , Jennifer Campbell, Jason Montojo, Practical Programming: An Introduction to Computer Science Using Python 3, Pragmatic Bookshelf, 2/E 2014 Reference Books: 1 James Payne , Beginning Python: Using Python 2.6 and Python 3, Wiley India, 2010 2, A. Lukaszewski, MySQL for Python: Database Access Made Easy, Pact Publisher, 2010 Page 39 of 61Program: Bachelor of Science(2021-22) Semester : IT Course: Calculus Course Code: USMACS203 Teaching Scheme Evaluation Scheme Lecture | Practical | Tutorial Continuous Term End (Hours per | (Hours | (Hours | Credit | Assessment and | Examinations (TEE) week) per per Evaluation (CAE)| — (Marks-75 week) week) | (Marks-25) | in Question Paper) 2 2 - al 25 15 \Learning Objectives: i (The course is designed to have a grasp of important concepts of Calculus in a scientific way. It cover ‘pics from as basic as definition of functions to partial derivatives of functions in a gradual and logicall ay. The leamer is expected to solve as many examples as possible to a get compete clarity hunderstanding of the topics covered. |Learning Outcomes: 'l) Understanding of Mathematical concepts like limit, contin , derivative, integration of functions. 22) Ability to appreciate real world applications which uses these concepts. 3) Skill to formulate a problem through Mathematical modelling and simulation ‘Outline of Syl ii us: (per session plan) Module | Description i INo of hours) 1 [Derivatives and its applications. i 10 2 lIntegration and its applications, ll 10 3 [Partial derivatives and its applications. 10 |Total 30 PRACTICALS - 30 Page 40 of 61Module Caleutus No. of Hours/Credit! Derivatives and its applications. 10 [DERIVATIVES AND ITS APPLICATIONS: Review of Functions, limit of a fun n, continuity of a function, derivative function| [Derivative In Graphing And Applications: Analysis of Functions4 lincrease, Decrease, Concavity, Relative Extrema; Graphing| Polynomials, Rational Functions, Cusps and Vertical Tangents| [Absolute Maxima and Minima, Applied Maximum and Minimum) Problems, Newton's Method.. [Integration and its applications. 10 INTEGRATION AND ITS APPLICATIONS: An Overview of th {Area Problem, Indefinite Integral, Definition of Area as a Limit) Sigma Notation, Definite Integral, Evaluating Definite Integrals by, Substitution, Area Between Two Curves, Length of a Plane Curve. jumerical Integration: Simpson’s Rule. Modeling with Differential Equations, Separation of Variables, Slope Fields, Euler's Method, First-Order Differential Equations and Applications. [Partial derivatives and its applications. 10 PARTIAL DERIVATIVES AND ITS APPLICATIONS: [Functions of Two or More Variables Limits and Continuity Partial] Derivatives, Differentiability, Differentials, and Local Linearity, [Chain Rule, Directional Derivatives and Gradients, Tangent Planes ind Normal, Vectors,Maxima and Minima of Functions of Twi ariables Page 41 of 61PRACTICALS Sr. No.| Topic, 1 | Continuity of functions; Derivative of functions 2 Increasing, decreasing, concave up and concave down functions 3 [Relative maxima, relative minima, absolute maxima, absolute minima 4 |Newton’s method to find approximate solution of an equation 5 [Area asa limit and length of a plane curve 6 | Numerical integration using Simpson's rule 7 |Solution of a first order first degree differential equation, Euler's method 8 [Calculation of Partial derivatives of functions 9 | Local linear approximation and directional derivatives | 10. [Maxima and minima of functions of two variables RECOMMENDED READING: ‘Text Books: 1 C ‘alculus: Early transcendental (10th Edition): Howard Anton, Irl Bivens, Stephen Davis, John Wiley & sons, 2012. Reference Books: 1. Cal lculus and analytic geometry (9th edition): George B Thomas, Ross L Finney, Addison Wesley, 1995 Page 42 of 612. Calculus: Early Transcendentals (8th Edition): James Stewart, Brooks Cole, 2015. 3. Calculus (10th Edition): Ron Larson, Bruce H. Edwards, Cengage Leaning, 2013, Page 43 of 61Program: Bachelor of Science(2021-22) = ‘Semester : II programming, ‘© To provide and holistic approach to design, use and implement abstract data typ. different applications using Python. \Course: Data Structures Course Code: USMACS204 Teaching Scheme Evaluation Scheme Lecture | Practical | Tutorial ‘Continuous ‘Term End (Hours per | (Hours | (Hours | Credit | Assessment and /Examinations (TEE) week) per per Evaluation (CAE)|— (Marks-75 week) | week) | Marks - 25) in Question Paper) 2 Dee 241 25 5 \Learning Objectives: z * To explore and understand the concepts of Data Structures and its significance is es, ‘* To understand the commonly used data structures and various forms ofits implementation fo |Course Outcomes: [After completion of the course, learners would be able to: CO1: Leam about Data structures, its types and significance in computing (CO2: Explore about Abstract Data types and its implementation CO3: Ability to program various applications using different data structure in Python Outline of Syllabus: (per session plan) Module | Description ‘No of hours 1 [Abstract Data Types, Algorithm Analysis and Searching and Sorting. 10 2 [Linked Structures, Stacks, Queues, 10 3 ‘ecursion, Hash Table, Advanced Sorting and Binary Trees, 10 frotat r 30 PRACTICALS - 30 Page 44 of 61Module Data Structures ‘No. of |Hours/Credity Abstract Data Types, Algorithm Analysis and Searching and Sorting. 10 Abstract Data Types: Introduction, The Date Abstract Data [Type, Bags, Iterators. Application jets and Maps: Sets-Set ADT, Selecting Data Structure, List based Implementation, Maps-Map ADT, List Based limplementation, [Algorithm Analysts: Complexity Analysis-Big-O Notation, Evaluating Python Code, Evaluating Python List, Amortized Cost, Evaluating Set ADT, Application ‘Searching and Sorting: Scarching-Linear Search, Binary Search, Sorting-Bubble, Selection and Insertion Sort, Working with ted Lists-Maintaining Sorted List, Maintaining sorted Lists. \Linked Structures, Stacks, Queues 10 [Linked Structures: Introduction, Singly Linked List-Traversing, ‘earching, Prepending and Removing Nodes, Bag ADT-Linked ist Implementation. Comparing Implementations, Linked List iterators, More Ways to Build Kinked Lists, Applications- "olynomials Stacks: Stack ADT, Implementing Stacks-Using Python List, [Using Linked List, Stack Applications-Balanced Delimiters, Evaluating Postfix Expressions ‘Queues: Queue ADT, Implementing Queue-Using Python List, ircular Array, Using List, Priority Queues- Priority Queue ADT Bounded and unbounded Priority Queues Advanced Linked List! Doubly Linked Lists-Organization and Operation, Circular Linked [List-Organization and Operation Page 45 of 613 Recursion, Hash Table, Advanced Sorting and Binary Trees, 10 Recursion: Recursive Functions, Properties of Recursion, Its working, Recursive Applications fash Table: Introduction, Hashing-Linear Probing, Clustering, sing, Separate Chaining, Hash Functions sdvanced Sorting: Merge Sort, Quick Sort, Radix Sort, Sorting inked List Binary ‘Trees: Tree Structure, Binary Tree-Properties| plementation and Traversals, Expression Trees, Heaps, Search] Tees PRACTICALS ‘Sr. No. | Topic. 7 T | Implement Linear Search to find an item in a list. 2 | Implement binary search to find an item in an ordered list. 3 | Implement Sorting Algorithms . a. Bubble sort b. Insertion sort ¢. Selection sort 4 | Implement use of Sets and various operations on Sets 5 | Implement working of Stacks. (pop method to take the last item added off the stack and a push method to add an item to the stack) © | Implement Program for | 2, Infix to Postfix conversion | b. Postfix Evaluation ¢. Check balanced parenthesis 7 | Implement the following 2, Aqueue as a list which you add and delete items from. b. A circular queue. (The beginning items of the queue can be reused 8 | Implement Linked list and demonstrate the functionality to add and delete items in the linked list. 9 | Implement Binary Tree and its traversals. Page 46 of 6110 Recursive implementation of a, Factorial b. Fibonacci RECOMMENDED READING: ‘Text Books: 1) Data Structure and algorithm Using Python, Rance D. Necaise, 2016 Wiley India Edition 2) Data Structure and Algorithm in Python, Michael T. Goodrich, Robertom Tamassia, M. H. Goldwasser, 2016 Wiley India Edition Reference Books: 1)Data Structure and Algorithmic Thinking with Python- Narasimha Karumanchi, 2015, Careermonk Publications 2) Fundamentals of Python: Data Structures, Kenneth Lambert, Delmar Cengage Learning Page 47 of 61Program: Bachelor of Science(2021-22) ‘Semester : II |Course: Free and Open source software with Linux Course Code: USMACS205 ‘Teaching Scheme Evaluation Scheme Lecture Practical | Tutorial ‘Continuous Term End (Hours per | (Hours (Hours ‘Credit Assessment and |Examinations (TEE) week) per per Evaluation (CAE)} — (Marks-75 | week) week) (Marks - 25) in Question Paper) 2 2 - a1 v3 15 [Learning Objectives: [This course introduces various tools and techniques commonly used by Linux programmers, system| idministrators and end users to achieve their day to day work in Linux environment. It is designed fo ‘omputer students who have limited or no previous exposure to Linux. [Course Outcomes: - {After completion of the course, leamers would be able to: COL: Have a good working knowledge of Linux, from both a graphical and command line perspective, allowing them to easily use any Linux distribution. CO2: Learn advanced subjects in computer science practically. CO3: Progress as a Developer of Linux System Administrator using the acquired skill set. ‘Outline of Syllabus: (per session plan) Module | Description Noof | hours 1 Linux System, shell and environment variables. 10 | 2 |Linux file system, structured commands and handling user input. 10 3 FOSS Philosophy 10 [rotal 30 PRACTICALS 30 | Page 48 of 61Module Free and Open source software with Linux No. of |Hours/Creditg Linux System, shell and environment variables. 10 jux System: Design Principles, Kernel Modules, Proce fanagement, Scheduling, Memory Management, File system, (O.Linux Basics: Looking into the Linux Kernel, The Unix/Linu chitecture, Features of Unix/Linux. ‘Basic bash shell commands: Starting the shell, Shell prompt, Fil ‘system Navigation, File and directory listing, File handling, rectory handling More bash shell commands: Monitoring] ograms, Monitoring diskspace, Working with data files: Sorti arching, CompressingArchiving The Linux environment! ariable: Environment variables, setting environment variables, Removing environment variables, Default shell environment variables, setting the PATH environment ariables, Locating system environment variables, Variable arrays| [Using command aliases Linux file system, structured commands and handling user input. 10 |Understanding Linux file permission: Linux security, Using [Linux groups, Decoding file permissions, Changing security settings Basic script building: Using multiple commands, Creating p script file, Redirecting Input and Output, Performing math (Using structured commands: Working with the if-then, if-then- Ise and nesting if statements, test command, Compound condition yesting, advanced if then features, the case command. Morel {structured commands: for command, C-style for command, while| ‘ommand, until command, nesting loops, Looping on file data, -ontrolling the loop, processing the o/p of a loop. Page 49 of 61fandling user input: Command line parameters, Special arameter variables, shift command, Standardizing options, Getting! ser UP FOSS Philosophy 10 IFOSS Philosophy: Basic Definitions, Problems with traditional mmercial software, Why use Free and Open Source Software? Software Freedom, Debian Free Software Guideline, FOSS do t mean no-cost, Zero Marginal Cost in FOSS, FOSS and Ethics bre Software & Open Source Software: Four essential freedoms, Free Software Definition, Free is not free. Open Source Software, pen Source Definition, Open Standards Requirement for Software ‘OSS Development: FOSS development model, FOSS Versioning, issue handling in FOSS, FOSS Community Development, FOSS) )ject Role Types, Participating in FOSS development, Starting! \d Maintaining a FOSS Project ‘OSS Business Models and Licensing: Income Generation] tunities, FOSS Business Models, Copyright, Copyleft, FOS' icense, Popular FOSS licenses PRACTICALS Sr.No. Topic. T ‘i.Finding Info Documentation: From the command line: bring up the info page for the ‘grep command. Bring up the usage section. ii, Finding man pages From the command line: Bring up the man page for the ‘Is’ ‘command. Scroll down to the EXAMPLES section. iii. Finding man pages by Topic What man pages are available that document file compression Page 50 of 61i. Finding man pages by Section From the command line, bring up the man page for the printf library function, Which manual page section are library functions found? ii, Command line operations: 4, Install any newpackage on your system 'b. Remove the package installed c. Find the passwd file in / using find command 4, Create a symbolic link to the file you found in last step ¢. Create an empty file example.txt and move it in /tmp directory using relative pathname. £. Delete the file moved to /tmp in previous step using absolute path. g, Find the location of Is, ps, bash commands File Operations: a, Explore mounted filesystems on your system. b. What are different ways of exploring mounted filesystems on Linux? . Archive and backup your home directory or work directory using tar, gzip commands, 4. Use dd command to create files and explore different options to dd. c. Use diff command to create diff of two files. Use patch command to patch a file. And analyze the patch using diff command again. Use environment a, Which account are you logged in? How do you find out? . Display /ete/shadow file using cat and understand the importance of shadow file How it’s different than passwd file. ©. Get you current working directory. 4. Explore different ways of getting command history, how to run previously executed ‘command without typing it? ¢. Create alias to most commonly used commands like. ‘Linux Editors: vim/emacs a, Create,modify, search, navigate a file in editor. b. Leam all essential commands like search, search/replace, highlight, show line numbers. Page 51 of 616 | Linux Security: a, Use of sudo to change user leges to root b. Identify all operations that require sudo privileges ¢. Create a new user and add it to sudo configuration file. 4. Set password for new user. ©. Modify the expiration date for new user using password ageing. £. Delete newly added user i. Searching with grep: Search for your usemame in the /ete/passwd file, ii, Parsing files with awk: Display in a column a unique list of al the shells used for users in /ete/passwd, Which field in /etc/passwd holds the shell (user command interpreter in the manual page)? How do you make a list of unique entries, that is, no repeated entries? iii. Searching and substituting with sed: Search all instances of the user command interpreter (shell) equal to /bin/false in /ete/passwd and substitute with (bin/bash using sed. iv. Exit status: write a script which does Is to a non existent file, Display an exit status of the previous command. Now create the file and again display the exit status. In cach task send the Is output to /dev/null ¥. Working with files: Write a shell script which will ask user for a directory, create that directory and switch to it and tell the user where you are using pwd command. Now use touch to create some new files followed by displaying the filenames. vi. Environment variables: Write a script which displays all environment variables on the system i, Functions: Write a script that asks user for a number (1,2 or 3) which is used to call a function with the number in its name. The function then displays a message with the function number within it, example: “This message is from function number 4,” ii, Arithmetic: Write a script which will work as arithmetic calculator to add, subtract, multiply, divide. The user should pass an argument on the command line a letter (a,s,m_ or d) and two numbers. If wrong number of arguments are passed then display an error message. Make use of functions to perform operations. Page 52 of 61| ili. Case Statements: Write a script that will be given a month number as the argument and will translate this number into a month name. The result will be printed to stdout. RECOMMENDED READING: Text Books: 1) Unix Concepts and Applications by Sumitabha Das. 2) Official Ubuntu Book, 8th Edition, by Matthew Helmke & Elizabeth K. Joseph with Jose Antonio Rey and Philips Ballew, Prentice Hall Reference Books: 1) Linux kemel Home: http://kerel.org 2) Open Source Initiative: https://opensouree.org! 3) The Linux Foundation: hitp://www.linuxfoundation.org/ Page 53 of 61Program: jachelor of Science(2021-22) ‘Semester : IT |Course: Statistical Methods and Testing of Hypothesis ‘Course Code: USMACS206 Teaching Scheme a Evaluation Scheme Lecture | Practical | Tutorial ‘Continuous Term End (Hours per | (Hours | (Hours Credit | Assessment and |Examinations (TEE) week) per per Evaluation (CAE)| (Marks-75 week) | week) (Marks - 25) in Question Paper) 2 2 - 2 25 ers [Learning Objectives: [prospective rescarchers and professionals to know these basies. (The purpose of this course is to familiarize students with basics of Statistics. This will be essential for (Course Outcomes: [After completion of the course, leamers would be able to: CO1: Know descriptive statistical concepts C02: Study probability concept required for Computer learners Outline of Syllabus: (per session plan) Module Description No of hours 1 (Standard distributions. 10 z Hypothesis testing, cs 10 | 3. jon-parametric tests, 10 t a [Total 30, PRACTICALS i: 30 Page 54 of 61No. of Statistical Methods and Testing of Hypothesis 'Hours/Credits Module 1 Standard distributions | Standard distributions: random variable; discrete, continuous, lexpectation and variance of a random variable, pmf, pdf, edf| Introduction and properties without proof for following! flistributions; binomial, normal, chi-square, t, F. Examples 2 [Hypothesis testing 10 [Hypothesis testing: one sided, two sided hypothesis, critical region, p-value, tests based on t, Normal and F, confidence} vals. Analysis of variance : one-way, two-way analysis of ianee 3 Non-parametric tests, 10 jon-parametric tests: need of non-parametric tests, sign test| ‘ilicoxon’s signed rank test, run test, Kruskal-Walis tests, Chi- Square test of association PRACTICALS Sr.No. | Topic. 1 | Problems based on binomial distribution 2 | Problems based on normal distribution 3 _ | Property plotting of binomial distribution ‘4 | Property plotting of normal distribution 5 | Plotting pdf, cdf, pif, for discrete and continuous distribution 6 | ttest, normal test, F test Page 55 of 617 | Analysis of Variance 8 | Non parametric tests- I 9 | Non- Parametric tests — IT 10 | Post-hoc analysis of one-way analysis RECOMMENDED READING: Text Books: 1. Trivedi, K.S.(2009) : Probability, Statistics, Design of Experiments and Queuing theory, with applications of Computer Science, Prentice Hall of India, New Delhi Reference Books: 1. Ross, $M. (2006): A First course in probability. 6th Ed® Pearson 2. Kulkarni, M.B., Ghatpande, 8.B. and Gore, S.D. (1999): Common statistical tests. Satyajeet Prakashan, Pune 3. Gupta, S.C. and Kapoor, V.K. (2002) : Fundamentals of Mathematical Statistics, $, Chand and Sons, New Delhi 4. Gupta, S.C. and Kapoor, V.K. (4th Edition) : Applied Statistics, S, Chand and Son’s, New Delhi 5. Montgomery, D.C. (2001): Planning and Analysis of Experiments, Wiley Page 56 of 61Program: Bachelor of Science ‘Semester : IT \Course: Environmental Studies Course Code: USMACS207 Teaching Scheme Evaluation Scheme Lecture | Practical | Tutorial | ‘Continuous ‘Term End (Hours per | (Hours (Hours Credit Assessment and |Examinations (TEE) week) per | per Evaluation (CAE)|— (Marks-75 week) | week) (Marks - 25) ‘in Question | Paper) 2 - aT 3 75 |Learning Objectives: [Environmental Studies (EVS) at the primary stage envisages exposing students to the real vel in their surroundings also to help students to connect and be aware of, appreciate and be sensitize towards the prevailing environmental issues (natural, physical, social and cultural). [Learning Outcomes: COL: To expose students to the real-life world, natural and social, in which they live, \CO2: To enable them to analyse, evaluate, and draw inferences about problems and concerns related the environment. |CO3: To add, wherever possible the understanding of em ‘Outline of Syllabus: (per session plan) ynmental issues, Module | Description | Noof hours 1 introduction to Environmental Studies and cosystems, Natural] 10 Resources: Renewable and Non-Renewable Resources 2 [Biodiversity and Conservation , Human Communities and Environment. 10 3 [Environmental Pollution Environmental Policies and Practices 10 Total 30 Page 57 of 61‘Module No, of - Statistical Methods and Testing of Hypothesis Hours/Credit4 Introduction to Environmental Studies and Ecosystems, Natural Resources: Renewable and Non-Renewable Resources 10 introduction to Environmental Studies and Ecosystems Multidisciplinary nature of environmental studies; components o environment — atmosphere, hydrosphere, lithosphere and biosphere. Scope and importance; Concept of sustainability and sustainable development. What is an ecosystem? Structure and function of ecosystem} Energy flow in an ecosystem: food chain, food web and ecological] succession. Ecosystems: a) Forest ecosystem b) Grassland] ‘ecosystem c) Desert ecosystem d) Aquatic ecosystems (ponds | streams, lakes, rivers, oceans, estuaries) fatural Resources: Renewable and Non-Renewable Resource ind Resources and land use change; Land degradation, soil rosion and desertification, Deforestation: Causes and impacts duc to mining, dam building on, environment, forests, biodiversity and tribal populations, Water! Use and over-exploitation of surface and ground water, floods roughts, conflicts over water (international & inter-state). Heating of earth and circulation of air; air mass formation and precipitation. Energy resources: Renewable and non-renewable energy sources, use of alternate energy sources, growing energy, needs Page 58 of 61Biodiversity and Conservation , Human Communities and Environment. 10 [Biodiversity and Conservation Levels of biological diversity: genetic, species and ecosystem| diversity; Biogeography zones of India; Biodiversity patterns an¢ global biodiversity hot spots India as a mega-biodiversity nation; Endangered and endemic species of India Threats to biodiversity; habitat loss, poaching of wildlife, man-wildlife conflicts, iological invasions; Conservation of biodiversity: In-situ and Ex- |situ conservation of biodiversity. Ecosystem and biodiversity servi Ecological, economic, social, ethical, aesthetic and) Informational value, [Human Communities and Environment Human population and growth: Impacts on environment, hum: health and welfares, Carbon foot-print. esettlement an rehabilitation of project affected persons; case studies. Disaster management: floods, earthquakes, cyclones andl landslides. Environmental movements: Chipko, Silent valley, Bishnois of Rajasthan.Environmental ethics: Role of Indian and! other religions and cultures in environmental conservation. Environmental communication and public awareness [Environmental Pollution ,Environment: Policies and Practices 10 [Environmental Pollution Environmental pollution: types, causes, effects and controls; Air] water, soil, chemical and noise pollution Nuclear hazards and /muman health risks Solid waste management: Control measures o urban and industrial waste. Page 59 of 61Environmental Policies and Practices | Climate change, global warming, ozone layer depletion, acid rai and impacts on human communities and agriculture. Environment Laws: Environment Protection Act; Air (Prevention & Control of Pollution) Act; Water (Prevention and control o! Pollution) Act; Wildlife Protection Act; Forest Conservation Act; International agreements; Montreal and Kyoto protocols an conservation on Biological Diversity (CBD). The Chemical Weapons Convention (CWC).Nature reserves, tribal populatio and rights, and human, wildlife conflicts in Indian context RECOMMENDED READING: Texthook: 1 Dr(Smt.).Bala Krishnamoorthy, Environment Management, Text and Cases, Prentice Hall of India, 2nd Edition, 2008 Reference Books: 1, Agarwal S.K, Environmental Issues and Themes, A.P.H, Publishing Corporation, 1997 (Classic) Dodds Felix, Earth summit 2002: A new deal by, Routledge, 2001 Journal of Down earth published by center for science and Education CSE. Page 60 of 61