b> BIKANER TECHNICAL UNIVERSITY, BIKANER [58 x ® ) Fork carat feeafterea, dare ie a OFFICE OF THE DEAN ACADEMICS, SCHEME & SYLLABUS OF UNDERGRADUATE DEGREE COURSE Computer Science and Engineering (Data Science) V & VI Semester Effective for the students admitted in year 2019-20 and onwards. Approved by 7"" AC Meeting held on 1 Nov. 2021 (Agenda 75) Approved by 7" AC Meeting held on 1 Nov. 2021 (Agenda 7.5). Pagel)) BIKANER TECHNICAL UNIVERSITY, BIKANER [88 torr carat fafterca, dare Sie OFFICE OF THE DEAN ACADEMICS B. Tech. CSE (Data Science) 3" Year ~ V Semester - THEORY : Course “| Contact Marks or B.No. | Category hrs/week Code — L]T[P | exam [1A [ET | Total : Hrs. LE SCSDS3-01 | Information Theory& [2 [o]O [2 20 [80 [100 | 2 1 Coding _ - 2 SCSDS4-02 | Compiler Design 3 jofo [3 30 | 120 [450 |3 3 SCSDS4-03 | Operating Systems 3 [ofo [3 [30 [120 [aso [3 4 SCSDS4-04 | Data Wrangling 3_|ofo [3 30 [120 [1s0 [3 5 SCSDS4-05 | Analysis of Algorithms [3 [0 [0 [3 30 [120 [150 [3 6 Professional Elective 1: (any one) 2a (onlomal2 20 {80 [100 | 2 SCSDS5-11 | Mathematical PCC! Foundation for Data PEC | Science | SCSD85-12_ | Human-Computer Interaction El SCSDS5-13_| Computer Graphies & 4 ____| Multimedia _| Sub Total 16/0] 0 160 | 640 | 800 | 16 PRACTICAL & SESSIONAL. a 7 SCSDS4-21 [Data WranglingLab [0 [0] 2 | 2 | 30 | 20 | 50 | 4 8 SCSDS4-22 | Compiler DesignLab | 0 [0 | 2 | 2 | 30 | 20 | 50 1 9 | SCSDS4-23 | Analysis of 0 fo] 2 2 | 30 | 20 | 50 1 Pc Algorithms Lab 10 /SCSDS4-24 [Advance Javalab | 0 [0] 2 | 2 | 30 | 20 | 50 | 1 i | Psir SCSDS7-30 | Industrial Training | 0 [O| 1 75 | 50 | 128 | 28 12] SODECA Social Outreach, F SCSDS8-00 ipline & Extra | 25 | 25 | os Curricular Activities Sub- Total a) 195 | 155 7 TOTAL OF V SEMESTER lo }o) 9 355 | 795 23 L: Lecture, T: Tutorial, P: Practical, Gr: Credits ETE: End Term Exam, 1A: Internal Assessment S . Office: Bikaner Technical University, Bikaner det Karni Industrial Area, Pugal Road, Website: https://btu.ac.in fing held on 1 Nov. 2021 (Agenda 7.5). Page [2 Approved by 7 AC Mi~ BIKANER TECHNICAL UNIVERSITY, BIKANER a OFFICE OF THE DEAN ACADEMICS B. Tech CSE (Data Science) 3" Year — VI Semester oe - THEORY | I Course Contact Marks Cr S.No.| Category | a hrs/week cone) te PL PT] P| exam [1A] ETE | Total | Hrs. [1 [ESC 6CSDS3-01 | Digital Image oui One| (oss 2 }20 | 80 100 | 2 | Processing | [2 6CSDS4-02 | Machine Leaning 3 fo jo [3 [30/120 | 150 3 [3 6CSDS4-03 | Computer i E | Architecture and 0 Oe 3 ee | 20/5120) iSO es | Organization 4 | pce 6CSDS4-04 | Concepts in Artificial 3 jo fo Js 120 150, Intelligence si 6CSDS4-05 [Data Science usingR [3 [0 [o [3 30 | 120 3 6_| PEC Professional Elective | (any one) 3 [o fo {3 30 | 120 3 6CSDS5-11 | Distributed System 7 6CSDSS-12 | Data Mining and - - Business Intelligence | - 6CSDS5-13 | Cloud Computing : ‘Sub-Total 7} oo 850 | 17 a PRACTICAL & SESSIONAL — 7 6CSDS4-21 | Digital Image Rae 45 | 30 7% [1s Processing Lab gj Pec Machine LearningLab [0 [0 [3 [2 [45 | 30 15 15 9 Data Science Lab using [0 [0 [3 [2 45 3) 1S R 10 Mobile Application 0 fo [3 [2 45 30 15 1s Development Lab IL | SODECA | 6CSDS8-00 | Social Outreach, Discipline & Extra 25 2 | Os L Curricular Activities | _ Sub- Total - o fol — [a0 [145 | 325 ‘TOTAL OF VI SEMESTER wlol 380 | 825 | 1175 L: Lecture, T: Tutorial, P: Practical, Cr: Credits ETE: End Term Exam, 1A: Internal Assessment Office: Bikaner Technical University, Bikaner a iver Karni Industrial Area, Pugal Road, Bikaner-3! mn once ant Website: htips:/btu.ac.in gi «anes Approved by 7 AC Meeting held on 1 Nov, 2021 (Agenda 7.5). Page [3BIKANER TECHNICAL UNIVERSITY, BIKANER OFFICE OF THE DEAN ACADEMICS, (@) SYLLABUS OF UNDERGRADUATE DEGREE COURSE Computer Science and Engineering (Data Science) V & VI Semester Approved by 7 Office: Bikaner Technical Universi Karni Industrial Area, Pugal Road, Website: https://btu.ac.in = der cst ‘yrive’ Approved by 7" AC Meeting held on 1* Nov. 2021 (Agenda 7.5). Page [4BIKANER TECHNICAL UNIVERSITY, BIKANER les OFFICE OF THE DEAN ACADEMICS, 5CSDS3-01: Information Theory & Coding S.No. Contents, 1 | Introduction: Objective, scope and outcome of the course, or 2 [Introduction to information theory: Uncertainty, Information and Entropy, | Information measures for continuous random variables, source coding theorem. 05 Discrete Memory less channels, Mutual information, Conditional entropy. 3 _ | Source coding schemes for data compaction: Prefix code, Hufiman code, Shanon- Fane code & Hempel-Ziv coding channel capacity. Channel coding theorem. Shannon, 05 limit. 4 | Linear Block Code: Introduction to error connecting codes, coding & decoding of linear block code, minimum distance consideration, conversion of non-systematic 0s form of matrices into systematic form. Cyclic Code: Code Algebra, Basic properties of Galois fields (GF) polynomial operations over Galois fields, generating cyclic code by generating polynomial, 06, parity check polynomial. Encoder & decoder for eyclic codes. 6 | Convolutional Code: Convolutional encoders of different rates. Code Tree, Trlis and state diagram, 06 Maximum likelihood decoding of convolutional code: The viterbi Algorithm fee distance of a convolutional code ‘Suggested Books ‘© TM. Cover, J. A. Thomas, Elements of Information Theory, Wiley ‘© R, Togneri, C.1.$ deSilva, Fundamentals of Information Theory and Coding Design, Taylor and Franci © RJ. McEliece, The Theory of Information and Coding, Cambridge University Press '® _ R. Bose, Information Theory Coding and Cryptography, Tata McGraw Hill © Digital and Analog Communication Systems Shanmugam, K. Sam, Wiley India r Office: Bikaner Technical University, Bikangr; cate erst Karni Industrial Area, Pugal Road, Bikar ie Website: https:i/btu.acain gat a0" Approved by 7" AC Meeting held on 1" Nov, 2021 (Agenda 7.5). Page [5BIKANER TECHNICAL UNIVERSITY, BIKANER [8 Gor dete favafterca, dare OFFICE OF THE DEAN ACADEMICS, S5CSDS4-02: Compiler Design Credit: 3 ‘Max Marks: 150 (A. “31+ 01+ OP End Term Exam Contents Introduction: Objective, scope and outcome of the course. Introduction: Objective, scope and outcome of the course. Compiler, Translator, Interpreter definition, Phase of compiler, Bootstrapping, Review of Finite automata lexical analyzer, Input, Recognition of tokens, Idea about LEX: A lexical analyzer | 06 generator, Error handling Review of CFG Ambiguity of grammars: Introduction to parsing. Top-down parsing, LL grammars & passers error handling of LL parser, Recursive descent parsing predictive parsers, Bottom up parsing, Shift reduce parsing, LR. parsers, Construction of SLR, Conical LR & LALR parsing tables, parsing with ambiguous | 10 grammar. Operator precedence parsing, Introduction of automatic parser generator: YACC error handling in LR parsers. Syntax directed definitions; Construction of syntax trees, S- Attributed Definition, L-attributed definitions, Top down translation, Intermediate code forms using postfix notation, DAG, Three address code, TAC for various control structures, Representing ‘TAC using triples and quadruples, Boolean expression and control structures. 10 ‘Storage organization: Storage allocation, Strategies, Activation records, Accessing local and non-local names in a block structured language, Parameters passing. | 08 Symbol table organization, Data structures used in symbol tables. Definition of basic block control low graphs; DAG representation of basic block, Advantages of DAG, Sources of optimization, Loop optimization, Idea about global | 07 | data flow analysis, Loop invariant computation, Peephole optimization, Issues in | design of code generator. A simple code generator, Code generation from DAG. Total 2 Suggested Books . Approved by 7 AC Me A. Aho, J. D. Ullman, Monica S, Lam and R. Sethi, Compilers Principles, Techniques and Tools (2 ed,), Pearson Education, 2005. ISBN 978-0321547989. John Levine, Tony Mason and Doug Brown, Lex and Yace (1 ed.), O'Reilly Media, 1992. ISBN 978-1565920002, Kenneth C. Louden, Compiler Constru 1997. ISBN 978-0534939724, Dhamdhere, Compiler Construction (2 ed.), Macmillan Publication, 2003, ISBN 978-0333904060 Principles and Practice (1 ed.), Course Technology Inc ig held on 1 Nov. 2021 (Agenda 7.5). se 16{ =) BIKANER TECHNICAL UNIVERSITY, BIKANER OF ICE OF THE DEAN ACADEME 5CSDS4-03: Operating Systems Credit: 3 | Max Marks: 150 (1A :30, ETE:120) 3L+ 0T+ OP [eeu End Term Exams: 3hr ‘S.No. Contents Hours 1 | Introduction: Objective, scope and outcome of the course. Oo mand History of Operating systems: Structure and operations; processes and files Processor management: inter process communication, mutual exclusion, semaphores, wait and signal procedures, process scheduling and 04 algorithms, critical sections, threads, multithreading 3° | Memory management: contiguous memory allocation, virtual memory, paging, page | —_ table structure, demand paging, page replacement policies, thrashing, segmentation, | 08 case study | 4 | Deadlock: Shared resources, resource allocation and scheduling, resource graph | models, deadlock detection, deadlock avoidance, deadlock prevention algorithms Device management: devices and their characteristics, device drivers, device 1s handling, disk scheduling algorithms and policies | File management: file concept, types and structures, directory structure, eases | studies, access methods and matrices, file security, user authentication | 07 6 | UNIX and Linux operating systems as case studies; Time OS and case studies of | 0s Mobile OS - Tota - [Eero Suggested Books © Silberschatz, P. B. Galvin and G. Gagne, Operating System Concepts (9 ed.), John Wiley, 2012. ISB] 978-1118063330. © Tanenbaum, Modern Operating Systems (3 ed.), Prentice Hall India Learning Private Limited, 2019. ISB 978-8120339040, ‘© W. Stallings, Operating Systems Internals and Design Principles (7 ed.), Prentice Hall, 2013. ISBN 97 9332518803 ‘© Operating Systems ~ William Stallings, ‘© Operating Systems - Nutt, Pearson Education As arson Education Asia (2002) ia (2003) Office: Bikaner Technical University, Bikaner, °° yo") Karni Industrial Area, Pugal Road, Bika 4 Website: https://btu.ac.in oi" pcan Approved by 7 AC Me 1g, held on 1* Nov. 2021 (Agenda 7.5). Page |7BIKANER TECHNICAL UNIVERSITY, BIKANER [8 Gore aartay favaftercra, Aare a OFFICE OF THE DEAN ACADEMICS S5CSDS4-04: Data Wrangling [ ‘Max Marks: 150 (IA :30, ETE:120) | - 3L+ T+ OP : End Term Exams: 3hr S.No. Contents 1 [Introduction to data wrangling: What Is Data Wrangling?- Importance of Data Wrangling -How is Data | 6 ‘rangling performed?- Tasks of Data Wrangling-Data Wrangling Tools-Introduction to Python-Python [Basics-Data Meant to Be Read by Machines-CSV Data-JSON Data-XML Data. 2 Working with excel files and pdfs: Installing Python Packages-Parsing Excel Files-Parsing Exeel Files - | 9 jetting Started with Parsing-PDFs and Problem Solving in Python-Programmatic Approaches to PDF arsing-Converting PDF to Text-Parsing PDFs Using pdf miner-Acquiring and Storing Data-Databases: A Brief Introduction-Relational Databases: MySQL and PostgreSQL-Non-Relational Databases: NoSQL- then to Use a Simple File-Alternative Data Storage. 3 Data cleanup: Why Clean Data?- Data Cleanup Basies-ldentifying Values for Data Cleanup-Formatting | 9 Data-Finding Outliers and Bad Data-Finding Duplicates-Fuzzy Matching-RegEx Matching-Normalizing and Standardizing the Data-Saving the Data-Determining suitable Data Cleanup-Scripting the Cleanup Testing vith New Data 4 Data explor: is: Exploring Data-Importing Data-Exploring Table Functions-Joining Numerous | 8 atasets-Identifying Corrclations-Identifying Outliers-Creating Groupings-Analyzing Data-Separating and ‘ocusing the Data Presenting Data-Visualizing the Data-Charts-Time-Related Data-Maps-Interactives- ords-Images, Video, & IMlustrations-Presentation Tools-Publishing the Data-Open Source Platforms Web seraping: What to Scrape and How-Analyzing a Web Page-Network/Timeline-Ineracting with | 8 lavaScript-In-Depth Analysis of a Page-Getting Pages-Reading a Web Page-Reading a Web Page with ILXML-XPath-Advanced Web Scraping-Browser-Based Parsing-Screen Reading with Sclenium-Screen Reading with Ghost .PySpidering the Web-Building a Spider with Serapy-Crawling Whole Websites with crapy. Total 40 ‘Suggested Books * Jacqueline Kazil & Katharine Jarmul,” Data Wrangling with Python”, O'Reilly Media, Ine,2016 * Dr. Tirthajyoti Sarkar, Shubhadeep,” Data Wrangling with Python: Creating actionable data from raw sources’ Packt Publishing Ltd,2019. * Stefanie Molin,” Hands-On Data Analysis with Pandas”, Packt Publishing Ltd,2019 Allan Visochek,” Practical Data Wrangling”, Packt Publishing Ltd,2017 + Tye Rattenbury, Joseph M. Hellerstein, Jeffrey Heer, Sean Kandel, Connor Carreras,” Principles of Dat Wrangling: Practical Techniques for Data Preparation”, O’Reilly Media, Inc,2017 Mooc 1. huups//www-udemy.com/course/data-wrangling-with-python/ 2. http://www.openculture.com/free-online-data-science-courses Office: Bikaner Technical University, Bika ceo Karni Industrial Area, Pugal Road, Bikaner-38 Sane pik Website: https://btu.ae.in Approved by 7 AC Meeting held on 1* Nov. 2021 (Agenda 7.5). Page [8BIKANER TECHNICAL UNIVERSITY, BIKANER [88 Serr detent faeafterca, dare OFFICE OF THE DEAN ACADEMICS 5CSDS4-05: Analysis of Algorithms Credit: 3 —0THOP S.No. Contents 1 | Introduction: Objective ‘scope and outcome of the course 2 | Background: Review of Algorithm, Complexity Order Notations: definitions and calculating complexity. Divide And Conquer Method: Binary Search, Merge Sort, Quick sort and Strassen’s | 06 ‘matrix multiplication algorithms. 3° | Greedy Method: Knapsack Problem, Job Sequencing, Optimal Merge Patterns, and Minimal Spanning Trees.Dynamic Programming: Matrix Chain Multiplication. Longest’ — Common | 10 ‘Subsequence and 0/1 Knapsack Problem. 4° | Branch And Bound: Traveling Salesman Problem and Lower Bound Theory. Backtracking Algorithms and queens problem. 08. Patter Matching Algorithms: Naive and Rabin Karp string matching algorithms, KMP. Matcher and Boyer Moore Algorithms, Assignment Problems: Formulation of Assignment and Quadratic Assignment Problem. Randomized Algorith ‘egas algorithms, Monte Carlo algorithms, a randomized algorithm for Min-Cut, randomized algorithm for 2- SAT. Problem definition of Multicommodity flow, | 08 Flow shop scheduling and Network capacity assignment problems. 6 | Problem Classes Np, Np-Hard And Np-Complete: Definitions of P, NP-Hard and NP- Complete Problems. Decision Problems.Cook's Theorem. Proving NP- Complete Problems -| 08 Satisfiability problem and Vertex Cover Problem. Approximation Algorithms for Vertex Cover andSet Cover Problem. Total 4 Suggested Books © E, Horowitz, S. Sahni, and S. Rajsekaran, “Fundamentals of Computer Algorithms,” Galotia Publication TH. Cormen, CE .Leiserson, R .L Rivest “Introduction to Algorithms”, PHI Sedgewich, Algorithms in C, Galgoti Berman, Paul, “Algorithms, Cengage Leaming”. Richard Neopolitan, Kumar SS Naimipour, “Foundations of Algorithms” Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education, Reprint 2006 Office: Bikaner Technical University, Bikany Karni Industrial Area, Pugal Road, Bikaner-: 8 Website: https://btu.ac.in Approved by 7" AC Meeting held on 1 Nov. 2021 (Agenda 7.5). Page |9BIKANER TECHNICAL UNIVERSITY, BIKANER [Be Gore cater favafterca, ore ethe, OFFICE OF THE DEAN ACADEMICS, 5CSDS5-11: Mathematical Foundation for Data Science = Credit: 2 - jax Marks: 100 (1A :20, E 21+ OT+ OP = Contents Hours 1 | Introduction: Objective, scope and outcome of the course. o1 2 | Data summaries and descriptive statistics, central tendency, variance, covariance, | 5 correlation, Simple and Multiple Regression, Non linear regression, logistic regression 3 | Distributions: t-distribution, Z-distribution, Hypothesis testing for sampling distributions | 6 of means, proportions, sum and differences of means and proportions for large and small samples. Chi-square test, ANOVA Test 4 | Vector Space; Subspaces; Linear Dependence/Independence; Basis; Dimension; Linear | 6 transformation; Space and Rank; Null Space and Nullity; Rank nullity theorem, Matrix. Representation of a linear transformation; Linear Operators on Rn and their representation as square matrices. Eigen values and eigen vectors of a linear operator, Inner Product Spaces, Norm; | 6 5 | Orthonormal Sets, Schmidt orthogonalization process; projections, positive definite | | matrices, and Singular Value Decomposition, 6 | Bayesian and Markov Networks fundamentals. Graph Building. Independence | 6 Assumption, Basic of Hidden Markov Models and Conditional Random Field. Basics of Multivariate Calculus. Multivariate Chain Rule. Total 30 Suggested books ‘© Hoffman and Kunze : Linear Algebra, Prentice Hall of India, New Delhi ‘© Gilbert Strang : Linear Algebra And Its Applications (Paperback) , Nelson Engineering (2007) © MR. Spicgal : Theory and Problems of probability and statistics :.2nded ‘haum series Seymour Lipschutz et al: Lincar Algebra, 3rded:Schaum series. V. Krishnamoorthy et al : An introduction to linear algebra , Affiliated East West Press, New Delhi P.C Bhattacharya, S.K. Jain and S.R. Nagpaul : First course in Linear Algebra, Wiley Eastern Ltd., New Delhi K.B.Datta : Matrix and Linear Algebra, Prentice Hall of India, New Delhi © S.C. Gupta and V. K. Kapoor: Fundamentals of Mathematical Statistics (A Modern Approach), 10t Edition, ikaner Technical University, BikgueP\ ‘nn Se Office: och Karni Industrial Area, Pugal Road, BikanegsgaW0 Kane Website: https://btu.ac.in Approved by 7 AC Meeting held on 1” Nov. 2021 (Agenda 7.5). Page [0BIKANER TECHNICAL UNIVERSITY, BIKANER [58 Pore cater favafaarcra, dor cee OFFICE OF THE DEAN ACADEMICS 5CSDS5-12: Human-Computer Interaction 7 Credit: 2 __Max Marks: 100 (IA :20, ETE:80) a 2L+ OT+ OP __End Term Exams: 2hr No. Contents Hours | 1 | Introduction: Objective, scope and outcome of the course. or Historical evolution of the field, Interactive system design, Concept of usability ~ definition and elaboration, HCI and software Engineering, GUI design and by Aesthetics, Prototyping techniques 3 | Model-based Design and evaluation: Basic idea, introduction to different types of models, GOMS family of models (KLM and CMN- GOMS), Fitts’ law and Hick- | 03 Hyman’s law, Model-based design ease studies. 4 | Gui in HCI: Schneiderman’s eight, golden rules, Norman's seven principles, Norman's model of interaction, Nielsen’s ten heuristics with example of its use 0s Heuristic evaluation, Contextual inquiry, Cognitive walkthrough 5 | Empirical research methods in HCI: Introduction (motivation, issues, research question formulation techniques), Experiment design and data analysis (with 06 explanation of one-way ANOVA) | 6 | Task modeling and analysis: Hierarchical task analysis (ITA), Engineering task models and Concur Task Tree (CTT), Introduction to formalism in dialog design, 06 design using FSM (finite state machines) State charts and (classical) Petri Nets in dialog design introduction to CA, CA types, relevance of CA in IS design Model Human 05 Processor (MHP), OOP- Introduction OOM- Object Oriented Modeling of User Interface Design Total aaa Suggested Books * Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, —Human-Computer Interaction, 3rd Edition, Peatson Education, 2004 Brian Fling, —Mobile Design and Development, First Edition, O'Reilly Media Inc., 2009) * Bill Scott and Theresa Neil, —D igning Web Interfaces, First Edition, O'Reilly, 2009. Office: Bikaner Technical University, Bi Karni Industrial Area, Pugal Road, Bikaner- Website: https://btu.ac.in Approved by 7" AC Meeting held on 1" Nov. 2021 (Agenda 7.5).BIKANER TECHNICAL UNIVERSITY, BIKANER [88 OFFICE OF THE DEAN ACADEMICS. 5CSDS5-13: Computer Graphics & Multimedia Credit: 2 2L+ 01+ OP: Contents Introduction: Objective, scope and outcome of the course. a Or 2 | Basic of Computer Graphics: Basic of Computer Graphics, Applications of computer graphics, Display devices, Random and Raster scan systems, Graphics input devices, | 06 Graphiies software and standards Graphics Primitives: Points, lines, circles and ellipses as primitives, scan conversion algorithms for primitives, Fill area primitives including scan- line polygon filling, inside-outside test, boundary and flood-fill, character generation, line attributes, arca- | 07 fill attributes, character attributes. Aliasing, and introduction to Anti Aliasing (No anti aliasing algorithm). 4 | Two Dimensional Graphics: Transformations (translation, rotation, scaling), matrix | representation, homogeneous coordinates, composite transformations, reflection and | shearing, viewing pipeline and coordinates system, window-to-viewport | 07 transformation, clipping including point clipping, line clipping (cohen-sutherland, liang- bersky, NLN), polygon clipping 5 | Three Dimensional Graphics:3D display methods, polygon surfaces, tables, equations, meshes, curved lies and surfaces, quadric surfaces, spline representation, cubie spline interpolation methods, Bazier curves and surfaces 03 B-spline curves and surfaces.3D scaling, rotation and translation, composite | 04 | transformation, viewing pipeline and coordinates, parallel and perspective | transformation, view volume and general (parallel and perspective) projection transformations. ~ Total 28 Edward Angel, Interactive Computer ( Education * Donald Hearn and M, Pauline Baker, Computer Graphies with OpenGL, Prentice Hall ‘¢ F.S. Hill Jr, Computer Graphics using OpenGL, Pearson Education © J.D. Foley, A. Van Dam, S. K. Feiner, and J. F, Hughes, Computer Graphics - Principles and Practice, ‘Addison Wesley = 7 Bikaner. PO* yon phies: A Top Down Approach Using OpenGl, Pearson Office: Bikaner Technical University, Karni Industrial Area, Pugal Road, Bikaner-32 cect Website: https://btu.ac.in Bane “Bi! Approved by 7 AC Meeting held on 1" Nov. 2021 (Agent Page [IzBIKANER TECHNICAL UNIVERSITY, BIKANER |B OFFICE OF THE DEAN ACADEMICS S5CSDS4-21: Data Wrangling Lab Credit: 1 _[ Max Marks: 50 (14.330, ETE:20) OL+ OT+ 2P = End Term Exams: 2hr ‘of Experiments 1 | Write’ Python seript to ead each row from a given esv file and print a list of strings 2 | Write a Python program to read a given CSV file as a dictionary. 3 Write a Python program to convert Python dictionary object (sort by key) to JSON data, Print the object members with indent level 4 4 Write the python seript to Read the XML file - 5 | Write a Pandas program to import excel data (child labour and child marriage data) into a Pandas data frame and process the following . Get the data types of the given excel data b. Display the last ten rows. c. Insert a column in the sixth position of the said el sheet and fill it with NaN values 6 | Develop the python script to parse the pdf files using pdfmminer. 7 | Extract the Table from the child labour and child marriage data using pdfables library 8 Write a Python data wrangling scripts to insert the data into SQLite database 9 Develop the Python Shell Script to do the basic data cleanup on child labour and child marriage data a. Check duplicates and missing data b. Eliminate Mismatche: . Cleans line bre: and special characters 10 | Import the data into ‘agate’ then explores the table using agate methods and perform statistical correlations rT Draw the chart between perceived corruption scores compared to the child labour percentages using matplotlib. - _ 12 | Write the python script to Map the Child Labour Worldwide using pygal. 13 |_Write a Python program to download and display the content of robot.txt for en.wikipedia.org “Data can be any taken from any valid publicity data set sources such as Unicef Suggested Books © Jacqueline Kazil & Katharine Jarmul, “Data Wrangling with Python”, O°Reilly Media, Inc,2016 * Dr. Tirthajyoti Sarkar, Shubhadeep, “Data Wrangling with Python: Creating actionable data from raw sources”, Packt Publishing Ltd,2019, Office: Bikaner Technical University, re “law nf AN Karni Industrial Area, Pugal Road, Bikaner, 354004 ane’ et ‘Bi Website: https://btu.ac.in Approved by 7 AC Meeting held on 1" Nov. 2021 (Agenda 7.5). Page [13—\) BIKANER TECHNICAL UNIVERSITY, BIKANER OFFICE OF THE DEAN ACADEMICS OL+0T+2P ___End Term Exams: 2hr ‘S.No List of Experiments 1_ | Introduction: Objective, scope and outcome of the course. 2 | To identify whether a given string is a keyword or not. 3 | Count total no. of keywords in a file. [Taking file from user] 4 | Count total no of operators ina file. [Taking file from user} 5 | Count the total occurrence of each character in a given file. [Taking file from user] Write a C program to insert, delete and display the entries in the Symbol Table. 7 | Write a LEX program to identify following: Valid mobile number Valid url Valid idemtifier Valid date (dd/mm/yyyy) Valid time (hh:mm:ss) 8 | Write a lex program to count blank spaces,words,lines in a given file. 9 | Write a lex program to count the no. of vowels and consonants in a C file. 10 | Write a YACC program to recognize strings aaab,abbb using a°nb’n, where b>=0. 11 | Write a YACC program to evaluate an arithmetic expression involving operators +-, and 12 | Write a YACC program to check validity of a strings abed,aabbed using grammar a*nb*ne*md*m, where n, m>0 13 | Write a C program to find first of any grammar. Office: Bikaner Technical University, Bikai Karni Industrial Area, Pugal Road, Bikaner 3 https://btu.ac.in Approved by 7" AC Meeting held on 1° Nov. 2021 (Agenda 7.5). Page [4or sartat favaftenca, dere OFFICE OF THE DEAN ACADEMICS 5CSDS4-23: Analysis of Algorithms Lab Credit: 1 OL+ OT+ 2P S.No. List of Experiments 1 | Sorta given set of elements using the Quicksort method and determine the time required to sort the elements, Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot @ graph of the time taken versus n. The elements can be read from a file or can be generated using the random number generator. 2 | Implement a parallelized Merge Sort algorithm to sort a given set of elements and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n, The elements can be read from a file or can be generated using the random number generator. 3 | a. Obtain the Topological ordering of vertices in a given digraph. b. Compute the transitive closure of a given directed graph using Warshall's algorithm, 4 | Implement 0/1 Knapsack problem using Dynamic Programming. S| From a given vertex in a weighted connected graph, find shortest iths to other vertices using Dijkstra’s algorithm. 6 | Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm. ‘a. Print all the nodes reachable from a given starting node in a digraph using BFS method. b. Check | 7 | whether a given graph is connected or not using DES method. 8. | Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm, 9. | Implement All-Pairs Shortest Paths Problem using Floyd's algorithm, 10 | Implement N Queen's problem using Back Tracking. Office: Bikaner Technical University, Bikaner. Karni Industrial Area, Pugal Road, Bikanei-334004- Website: https://btu.ac.in — g\\®" Approved by 7" AC Meeting held on 1* Nov. 2021 (Agenda 7.5).Fore data favaftenca, dare a OFFICE OF THE DEAN ACADEMICS SCSDS4-24: Advance Java Lab BIKANER TECHNICAL UNIVERSITY, BIKANER [58 Credit: 1 — Max Marks: 50 (A :30, ETE:20) OL+ OT+ 2P_ _End Term Exams: 2hr ist of Experiments, 1 Introduction To Swing, MVC Architecture, Applets, Applications and Pluggable Look and Feel, Basic swing components : Text Fields, Buttons, Toggle Buttons, Checkboxes, and Radio Buttons 2 | Java database Programming, java.sql Package, JDBC driver, Network Programming With java.net Package, Client and Server Programs, Content And Protocol Handlers — - | 3. | RMIarchitecture, RMI registry, Writing distributed application with RMI, Naming services, Naming | And Directory Services, Overview of NDI, Object serialization and Internationalization “4 | J2EE architecture, Enterprise application concepts, n-tier application concepts, J2EE platiorm, HTTP protocol, web application, Web containers and Application servers, 5 | Server side programming with Java Servlet, HTTP and Servlet, Serviet API, life cycle, configuration and context, Request and Response objects, Session handling and event handling, Introduction to | filters with writing simple filter application PP 6 | JSP architecture, JSP page life cycle, JSP elements, Expression Language, Tag Extensions, Tag Extension API, Tag handlers, JSP Fragments, Tag Tag library, SQL Tag library and Functions Ta les, ISTL, Core Tag library. overview of XML library Office: Bikaner Technical University, Bikaner. Karni Industrial Area, Pugal Road, Bikaner-3 Website: https://btu.ac.in Be" Approved by 7 AC Meeting held on 1° Nov, 2021 (Agenda 7.5).BIKANER TECHNICAL UNIVERSITY, BIKANER |B Gore center favaftencrs, dere Eine OFFICE OF THE DEAN ACADEMICS, 6CSDS3-01: Digital Image Processing Credit: 2 — ‘Max. Marks: 100(01A:20, ETE:80) 2L+0T+0P [ End Term Exam: 2 Hours _| | S.No. Contents | Hours L | - 1 f, Scope and outcome of the course. oO A Introduction to Image Processing: Digital Image representation, Sampling & Quantization, Steps in image Processing, Image acquisition, color image representation, oe Image Transformation & Filtering: Intensity transform functions, Histogram processing, 3 Spatial filtering, Fourier transforms and its properties, frequency Domain filters, colour | 06 models, Pseudo coloring, colour transforms, Basics of Wavelet Transforms. i Image Restoration: Image degradation and restoration process, Noise Models, Noise Filters, | yy degradation function, Inverse Filtering, Homomorphism Filtering a Image Compression: Coding redundancy, Interpixel redundancy, Psych visual redundancy, | gg Huffman Coding, Arithmetic coding, Lossy compression techniques, JPEG Compression. | Image Segmentation & Representation: Point, Line and Edge Detection, Thresholding, Edge 6 and Boundary linking, Hough transforms, Region Based Segmentation, Boundary | 0S representation, Boundary Descriptors, ‘Total 28 ‘Suggested Books Rafael C Gonzalez, Richard E Woods, “Digital Image Processing”, 4th Edition, Pearson, 2018. Kenneth R. Castleman, Digital Image Processing Pearson, 2006. © Anil K Jain, “Fundamentals of Digital Image Processing”, Pearson Education, 2003 Office: Karni Industrial Area, Pugal Road, Bikaner- Website: https://btu.ac.in Approved by 7" AC Meeting held on 1 Nov. 2021 (Agenda ). Page [175) BIKANER TECHNICAL UNIVERSITY, BIKANER (@) Aarts cana) Reattomers, dere OFFICE OF THE DEAN ACADEMICS 6CSDS4-02: Machine Learning Credit: 3 jax Marks: 150 (A :30, ETE:120) | 3L+ OT+ OP End Term Exams: 3hr Contents Hours 1 | Introduction: Objective, scope and outcome of the course. or 2 | Supervised learning algorithm: Introduction, types of learning, application, Supervised learning: Linear Regression Model, Naive Bayes classifier Decision Tree, | 09 K nearest neighbor, Logistic Regression, Support Vector Machine, Random Forest algorithm 7 - - Unsupervised learning algorithm: Grouping Unlabeled Item using k-means clustering, Hierarchical Clustering, Probabilistic clustering, Association rule mining, | 08 Apriori Algorithm, fp growth algorithm, Gaussian mixture model. 4 | Introduction to Statistical Learning Theory, Feature extraction - Principal component analysis, Singular value decomposition. Feature selection — feature ranking and subset selection, filter, wrapper, and embedded methods, Evaluating Machine | 08 Learning algorithms and Model Selection. Semi-supervised learning, Reinforcement learning: Markov decision process (MDP), Bellman equations, policy evaluation using Monte Carlo, Policy iteration and Value iteration, Q-Leaming, State- Action-Reward-State-Action (SARSA), Model-| 08 based Reinforcement Learning. 6 | Recommended system, Collaborative filtering, Content-based filtering Artificial neural network, Perceptron, Multilayer network, Backpropagation, Introduction to| 08 Deep learning Total 2 Suggested Books ‘¢ Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012. Stephen Marsland, “Machine Learning ~An Algorithmic Perspective”, CRC Press, 2009, © Saikat Dutt, Subramanian Chandramouli, Amit Kumar Das, “Machine Learning”, Pearson Education, 2018 © Andreas C. Muller, “Introduction to Machine Learning with Python: A Guide for Data OReilly,2016. ‘# Sebastian Raschika, “Python Machine Learning”, Packt Publishing, 2015, Office: Bikaner Technical Universi Karni Industrial Area, Pugal Road, Bikaner-34 Website: https://btu.acin Approved by 7 AC Meeting held on 1* Noy. 2021 (AgendaBIKANER TECHNICAL UNIVERSITY, BIKANER [98 Sore caret fevattenca, dare Bitne OFFICE OF THE DEAN ACADEMICS, Credit: 3 “3LHOT+0P — S.No. 7 ~ Contents - Hours mn: Objective, scope and outcome of the course. - oO 2 | Computer Data Representation: Basic computer data types, Complements, Fixed point representation, Register Transfer and Micro-operations: Floating point representation, Register Transfer language, Register Transfer, Bus and Memory Transfers (Tree-State Bus Buffers, Memory Transfer), Arithmetic Micro-Operations, Logic Micro-Operations, Shift micro-operations, Arithmetic logical shift unit, Basic Computer Organization and Design Instruction codes, Computer registers, computer instructions, | 10 Timing and Control, Instruction cycle, Memory-Reference Instructions, Input-output and interrupt, Complete computer description, Design of Basic computer, design of Accumulator Unit 3° | Programming The Basic Computer: Introduction, Machine Language, Assembly Language, assembler, Program loops, Programming Arithmetic and logic operations, subroutines, I-O Programming. Micro programmed Control: Control Memory, Address sequencing, Micro program | 7 Example, design of control Unit 4 | Central Processing Unit: Iniroduction, General Register Organization, Stack Organization, Instruction format, Addressing Modes, data transfer and manipulation, Program Control, Reduced | 8 Instruction Set Computer (RISC)Pipeline And Vector Processing, Flynn's taxonomy, Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction, Pipeline, RISC Pipeline, Vector Processing, | Array Processors. 7 — Computer Arithmetic: Introduction, Addition and subtraction, Muliplication Algorithms (Booth Multiplication Algorithm), Division Algorithms, Floating Point Arithmetic operations, Decimal | Arithmetic Unit. Input-Output Organization Input-Output Interface, Asynchronous Data Transfer, | 8 Modes Of Transfer, Priority Interrupt, DMA, Input-Output Processor(IOP), CPU IOP Communication, Serial Communication. 6 | Memory Organization: Memory Hierarchy, Main Memory, Auxiliary Memory, Associative Memory, Cache Memory, Virtual Memory. Multiprocessors: Characteristics of Multiprocessors, Interconnection | 8 Structures, Inter-processor Arbitration, Inter-processor Communication and Synchronization, Cache Coherence, Shared Memory Multiprocessors. 14:30, ETE:120) End Term Exam: 3 Hours Total a2 Suggested Books William stallings, “ ‘omputer Organization and Architecture, PHI” 2, M. Morris Mano, M. Morris Mano, “Computer System Architecture” , PHI J.D. Carpinelli, “Computer Systems Organization and Architecture,” Pearson Education Heuring and Jordan, Pearson Education, “Computer Systems Design and Architecture” ‘Tor M. Aamodt, Wilson Wai Lun Fung, Timothy G. Rogers General-Purpose Graphics Processor Architecture Office: Bikaner Technical University, Bikaner .0° Karni Industrial Area, Pugal Road, Bikaner 334004 is ‘ Website: https://btu.ac.in BN Approved by 7" AC Meeting held on 1° Nov. 2021 (Agenda 7.5). Page [19BIKANER TECHNICAL UNIVERSITY, BIKANER Garr dartat favafterce, dare OFFICE OF THE DEAN ACADEMICS, 6CSDS4-04: Concepts in Artificial Intelligence Credit: 3 Max Marks: 150 (IA :30, 3L+ OT+ OP: End Term Exams: 3hr ETE:120) [Oe Contents Hours | Introdui 1: Objective, scope and outcome of the course. oO leaning and definition of artificial intelligence, Physical Symbol System Hypothesis, production systems, Characteristics of production systems; Breadth-first search and depth-first search techniques. Heuristic search Techniques: Hill Climbing, erative deepening DFS, bidirectional search. Analysis of search methods. A* algorithm, and their analysis. Introduction to Genetic Algorithms. Knowledge Representation, Problems in representing knowledge, knowledge representation using propositional and predicate logic, logical consequences, syntax, and semantics of an expression, semantic Tableau. Forward and backward reasoning. Proof methods, substitution and unification, conversion to clausal form, normal forms, resolution, refutation, deduction, theorem proving, in ferencing, monotonic and non ‘monotonic reasoning. Introduction to prolog. 06 06 Network-based representation and reasoning, Semantic networks, Conceptual Graphs, frames. Description logic (DL), concept language, reasoning using DL Conceptual dependencies (CD), scripts, reasoning using CD. Introduction to natural language processing 09 Adversarial search and Game theory, classification of games, game playing strategies, prisoner's Dilemma. Game playing techniques, minimax procedure, alpha- beta cut-offs. The complexity of alpha-beta search. Automated planning, classical planning problem, forward planning, partial order planning, planning with proposal logic, hierarchical task planning, multi-agent planning 09 Reasoning in uncertain environments, Fuzzy logic, fuzzy composition relation, operations on fuzzy sets. Probabilistic reasoning, Bayes theorem, construction of Bayesian networks, belief propagation, Markov processes and Hidden Markov models 09 Total ‘Suggested Books: Artificial Intelligence: Elaine Rich, Kevin Knight, Me-MeGraw-Hill Introduction to AI & Expert System: Dan W. Patterson, PHI Artificial Intelligence by Luger (Pearson Education) Russel & Norvig, Artificial Intelligence: A Modem Approach, Pearson Education Office: Bikaner Technical University, Bikaner, 40 Karni Industrial Area, Pugal Road, Bikaner-334004: ixane™ Website: https://btu.ac.in Approved by 7 ACM 1g held on 1 Noy. 2021 (Agenda 7.5). Page [20)) BIKANER TECHNICAL UNIVERSITY, BIKANER [98 Gore aertet faafterca, dor ats, OFFICE OF THE DEAN ACADEMICS, 6CSDS4-05: Data Science using R Credit: 3 — ‘Max Marks: 150 (1A :30, ETE:120) 3L+ 01+ OP — End Term Exams: 3hr S.No. Contents Hours 1 | Introduction: Objective, scope and outcome of the course. a on 2 | R Basics: data types and objects - control structures — data frame Feature | 8 Engineering - scaling, Label Encoding and One Hot Encoding, Reduction | 3 | MODEL FIT USING R: Regression Models- Linear and Logistic Model,| 6 Classification Models ~ Decision Tree, Naive Bayes, SVM and Random Forest, Clustering Models — K Means and Hierarchical clustering Data visualization using R: Box plot, histogram, scatter plot, heat map ~ Working 10 with Tableau, Tableau Data types; Basic graphs and charts; Sheet, Dashboard and Story Programming using Tableau; Simple linear and forecasting; Setting up a ‘Tabieau Server for enterprise and management decision making, Outlier detection, Data Balancing. Plotly and geplot library, D3.js, Gephi 5 | PERFORMANCE EVALUATION in R: Loss Function and Error: Mean Squared 6 Frror, Root Mean Squared Error— Model Selection and Evaluation criteria: Accuracy, Precision, FI score, Recall Score ~ Binary Predictive Classification — Sensitivity Specificity 6 | Optimization in R: Common R Packages for Linear, Quadratic and Non-linear 9 optimization, Built-in Optimization functions, Linear Programming in R: Ip Quadratic Programming: quadpot, Non Linear Optimization: One-Dimer Golden Section Search; Multi-dimensional: Gradient-based, Hessian based, Non- gradient based Total 40 ‘Suggested Books ‘¢ Hadley Wickham, Garrett Grolemund, R for data science : Import, Tidy, Transform, Visualize, And Model Data Paperback, 2017 © Software for Data Analysis: Programming with R (Statistics and Computing) 2010 by John Chambers ¢R Programming for Data Science by Roger D. Peng ‘* An Introduction to Statistical Learning: with Applications in R (S| D. Witten, T. Hastie and R. Tibshirani, Springer, 2013. 5 iger Texts in Statistics), G. James, Ys Office: Bikaner Technical University, Bikaner _ CATT averted Karni Industrial Area, Pugal Road, Bikaner-: rec net Website: https://btu.ac.in Bika’ "Bik Approved by 7 AC Meeting held on 1 Nov. 2021 (Agenda 7.5). Page [21BIKANER TECHNICAL UNIVERSITY, BIKANER [8 dare caret faeafterc, sore ens OFFICE OF THE DEAN ACADEMICS 6CSDS5-11: Distributed System Credit: 3 | ‘Max Marks: 150 (IA :30, ET 3+ 0T+ OP, - End Term Exams: 3hr a S.No. Contents Hours 1_| Introduction: Objective, scope, and outcome of the course. anne o1 2 | Distributed Systems: Features of distributed systems, nodes of a distributed system, Distributed computation paradigms, Model of distributed systems, Types of Operating systems: Centralized Operating System, Network Operating Systems, Distributed Operating Systems and Cooperative | 06 Autonomous Systems, design issues in distributed operating systems. Systems Concepts and Architectures: Goals, Transparency, Services, Architecture Models, Distributed Computing Environment (DCE). Theoretical issues in distributed systems: Notions of time and state, states and events in a distributed system, time, clocks, and event precedence, recording the state of distributed systems. 3° | Concurrent Processes and Programming: Processes and Threads, Graph Models for Process Representation, Client/Server Model, Time Services, Language Mechanisms for Synchronization, Object | 09 Model Resource Servers, Characteristics of Concurrent Programming Languages (Language not included). Inter-process Communication and Coordination: Message Passing, Request/Reply and | Transaction Communication, Name and Directory services, RPC and RMI case studies. _| istributed Process Scheduling: A System Performance Model, Static Process Scheduling with Communication, Dynamic Load Sharing and Balancing, Distributed Process Implementation. | 08 | Distributed File Systems: Transparencies and Characteristics of DFS, DFS Design and implementation, ‘Transaction Service and Concurrency Control, Data and File Replication. Case studies: Sun network file systems, General Parallel file System and Window's file systems. Andrew and Coda File Systems __ 5 | Distributed Shared Memory: Non-Uniform Memory Access Architectures, Memory Consistency Models, Multiprocessor Cache Systems, Distributed Shared Memory, Implementation of DSM systems. | 09 Models of Distributed Computation: Preliminaries, Causality, Distributed Snapshots, modelling. a Distributed Computation, Failures in a Distributed System, Distributed Mutual Exclusion, Election, Distributed Deadlock handling, Distributed termination detection. 6 | Distributed Agreement: Concept of Faults, failure and recovery, Byzantine Faults, Advers: | Byzantine Agreement, Impossibility of Consensus and Randomized Distributed Agreement. Replicated Data Management: concepts and issues, Database Techniques, Atomic Multicast, and Update} 09 Propagation. CORBA case study: Introduction, Architecture, CORBA RMI, CORBA Services. ‘Total 2 Suggested Books © Andrew S. Tannenbaum and Maarten Van Steen, Distributed Systems: Principles and Paradigms, Pearson © George Coulouris, Jean Dollimore, Tim Kindberg, and Gordon Blair, Distributed Systems: Concepts and Design, Addison Wesley ¢ P.K. Sinha, Distributed Operating Systems: Concepts and Design, IEEE pre: © -M. Singhal and N. G. Shivaratri, Advanced Concepts in Operating Systems, McGraw-Hill Office: Bikaner Technical Universit Karni Industrial Area, Pugal Road, Bikane Website: https://btu.ac.in Approved by 7 AC Meet fing held on 1" Nov. 2021 (Agenda 7.5).BIKANER TECHNICAL UNIVERSITY, BIKANER [98 Fork dete favaftencra, dare ate, OFFICE OF THE DEAN ACADEMICS, 6CSDS5-12: Data Mining & Business Intelligence Credi — ‘Max Marks: 150 (IA :30, ETE:120) - 3L4 OT OP End Term Exams: 3hr_ S.No. Contents 1 Introduction: Objective, scope, and outcome of the course. E ala a Introduction - Evolution and importance of Data Mining-Types of Data and 8 Patterns mined Technologies-Applications-Major issues in Data Mining. Knowing about Data-Data Preprocessing: Cleaning-Integration-Reduction— Data transformation and Discretization. 3 1g & Warehousing: Basic Concepts-Data Warehouse 9 | OLAP and OLTP systems - Data Cube and OLAP operations-Data | Warehouse Design and Usage-Business Analysis Framework for Data | Warehouse Design- OLAP to Multidimensional Data Mining. Mining Frequent | Patterns: Basic Concept ~ Frequent Item Set Mining Methods — Mining Association Rules ~ Association to Correlation Analysis - 4 | Classification and Prediction: Issues - Decision Tree Induction ~ Bayesian 7 | Classification — Rule-Based Classification — k-Nearest mining Classification, | Prediction Accuracy and Error measures, 5 | Clustering: Overview of Clustering — Types of Data in Cluster Analysis 7 Major Clustering Methods. 6 | _ Introduction to BI -BI definitions and concepts- BI Framework-Basies of Data g integration Introduction to Business Metrics and KPI - Concept of the dashboard. and balanced scorecard, Tool for BI: Microsoft SQL server: Introduction to Data Analysis using SSAS tools Introduction to Data Analysis using SSIS tools- Introduction to Reporting Services using SSRS tools- Data Mining Implementation Methods, Total 40 Suggested Books ‘Han, M. Kamber, “Data Mining Concepts and Techniques”, Morgan Kaufmann M. Kantardzic, “Data mining: Concepts, models, methods and algorithms, John Wiley &Sons Ine. Paulraj Ponnian, “Data Warehousing Fundamentals”, John Willey. M, Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson Education, G, Shmueli, N.R. Patel, P.C. Bruce, “Data Mining for Business Intelligence: Concepts, Techniques, an Applications in Microsoft Office Excel with XLMiner”, Wiley India Office: Bikaner Technical University, Bikan Karni Industrial Area, Pugal Road, Bikaner<34 Website: https://btwac.in ga" Approved by 7 AC Meeting held on 1" Nov. 2021 (Agenda 7.5). Page [23(j=) BIKANER TECHNICAL UNIVERSITY, BIKANER [5 ® dor detent feeaftarea, dor oy OFFICE OF THE DEAN ACADEMICS 6CSDS5-13: Cloud Computing Credit: 3 ‘Max Marks: 150 (1A :30, ETE:120) 31+ 0T+ OP - End Term Exams: 3hr S.No. Contents Hours 1 | Introduetion: Objective, scope and outcome of the course or 2 [Introduction: Introduction Cloud Computing: Nutshell of cloud computing, Enabling Technology, Historical development, Vision, feature Characteristics and components of Cloud Computing. Challenges, Risks, and Approaches of Migration into Cloud. Ethical Issue in Cloud Computing, Evaluating the Cloud's Business Impact and economies, Future of the | 06 cloud. Networking Support for Cloud Computing. Ubiquitous Cloud and the Internet of Things 3 | Cloud Computing Architecture: Cloud Reference Model, Layer and Types of Clouds, Services models, Data centre Design and interconnection Network, Architectural design of Compute and Storage Clouds. Cloud Programming and Software: Fractures of cloud | 10 | programming, Parallel and distributed programming paradigms-Map Reduce, Hadoop, High | level Language for Cloud, Programming of Google App Engine 4 | Virtualization Technology: Definition, Understanding, and Benefits of Virtualization Implementation Level of Virtualization, Virtualization Structure/Tools and Mechanisms, Hypervisor VMware, KVM, Xen. Virtualization: of CPU, Memory, VO Devices, Virtual | 10 Cluster and Resources Management, Virtualization of Server, Desktop, Network, and Virtualization of data-centre, 5 | Securing the Cloud: Cloud Information security fundamentals, Cloud security services, Design principles, Policy Implementation, Cloud Computing Security Challenges, Cloud Computing Security Architecture. Legal issues in cloud Computing. Data Security in Cloud Business Continuity and Disaster Recovery, Risk Mitigation, Understanding and Identification | 08 of Threats in Cloud, SLA-Service Level Agreements, Trust Management | 6 | Cloud Platforms in Industry: Amazon web services, Google AppEngine, Microsoft Azure Design, Ancka: Cloud Application Platform -Integration of Private and Public Clouds Cloud applications: Protein structure prediction, Data Analysis, Satellite Image Processing, CRM 07 ‘Total 2 Suggested Books © Dan C Marinescu, Cloud Computing, Theory and Practice, MK Elsevier © Rajkumar Buyya, James Broberg, Andrzej M. Goscinski, Cloud Computing: Principles and Paradigms, Wiley '® Barrie Sosinsky, Cloud Computing Bible, Wiley © Jim Smith, Ravi Nair, Virtual Machines: Versatile Platforms for Systems and Processes, MK Elsevi Yr Office: Bikaner Technical University, Bikaner . ” deh ners Karni Industrial Area, Pugal Road, Bikan 04 Wee Website: “ea https://btu.ac.in pare’ ‘po Approved by 7 AC Me 1g held on 1 Nov. 2021 (Agenda 7.5).{—\\ BIKANER TECHNICAL UNIVERSITY, BIKANER D OFFICE OF THE DEAN ACADEMICS, 6CSDS4-21: Digital Image Processing Lab Credit: 1.5 — jax Marks: 75 (1A :45, ETE:30) OL+ 01+ 3P a “End Term Exams: 2hr S.No. List of Experiments Point-to-point transformation, This laboratory experiment provides for thresholding an image and 1 | the evaluation of its histogram, Histogram equalization. This experiment illustrates the relationship among the intensities (gray levels) of an image and its histogram, 2 | Geometric transformations. This experiment shows image rotation, scaling, and translation. Two- dimensional Fourier transform 3 | Linear filtering using convolution. Highly selective filters, Ideal filters in the frequency domain, Non-Linear filtering using convolutional masks. Edge | 4 | detection, This experiment enables students to understand the concept of edge detectors and their operation in noisy images. Morphological operations: This experiment is intended so students can appreciate the effect of morphological operations using a small structuring element on simple binary images. The 5 | operations that can be performed are erosion, dilation, opening, closing, open-close, close-open. Karni Industrial Area, Pugal Road, Bi Website: https://btu.ac.in Approved by 7" AC Meeting held on 1* Nov. 2021 (Agenda 7.5).i \ BIKANER TECHNICAL UNIVERSITY, BIKANER, & Aone cate) Qeattencm, tore oe OFFICE OF THE DEAN ACADEMICS cs 6CSDS4-22: Machine Learning Lab Credit: 15 Max Marks: 75 (IA :45, ETE:30) OL+ OT+ 3P. End Term Exams: 2hr List of Experiments 1 | Implement and demonstrate the FIND-S algorithm for finding the most specific hypothesis based on a given set of training data samples. Read the training data from a .CSV file. 2 | For a given set of training data examples stored in a .CSV file, implement and demonstrate the Candidate-Elimination algorithm to output a description of the set of all hypoth the training examples. 3° | Write a program to demonstrate the working of the decision tree based 1D3 algorithm. Use an appropriate data set for building the decision tree and apply this knowledge to classify a new sample 4 | Build an Artificial Neural Network by implementing the Backpropagation algorithm and test the same using appropriate data sets 5 | Write a program to implement the naive Bayesian classifier for a sample training data set stored as a CSV file. Compute the accuracy of the classifier, considering few test data sets. 6 | Assuming a set of documents that need to be classified, use the naive Bayesian Classifier model to | perform this task. Built-in Java classes/API can be used to write the program. Calculate the accuracy, precision, and recall for your data set. 7 | Write a program to construct aBayesian network considering medical data. Use this model to demonstrate the diagnosis of heart patients using standard Heart Disease Data Set. You can use Java/Python ML library classes/API [8 | Apply EM algorithm to cluster a set of data stored in a CSV file. Use the same data set for clustering | using k-Means algorithm. Compare the results of these two algorithms and comment on the quality of clustering. You can add Java/Python ML library classes/API in the program. 9] Write a program to implement k-Nearest Neighbour algorithm to classify the iris data set. Print both correct and wrong predictions. Java/Python ML library classes can be used for this problem. 10 | Implement the non-parametric Locally Weighted Regression algorithm in order to fit data points. Select the appropriate data set for your experiment and draw graphs. cone Office: Bikaner Technical University, Bikamgyo@) Karni Industrial Area, Pugal Road, Bikaner-}34008 (00% Website: https://btu.ac.in Approved by 7 AC Meeting held on 1" Nov. 2021 (Agenda 7.5). Page [26© \) BIKANER TECHNICAL UNIVERSITY, BIKANER [98 Garr cater favaftercra, ore ete “E OF THE DEAN ACADEMICS, 6CSDS4-23: Data Science Lab using R ‘Credit: 15 Max Marks: 75 (1A :43, ETE:30) OL+ OT+ 3P ‘S.No. List of Experiments — 7 1 _| Installation of R, General issues, Package Management. 2 | To work on Data types, sub setting, writing data, reading data from CSV files. 3 | Experiments with Creating vector, vector operations, combining vectors, data frames and their merging, ‘control structures, redirecting output 4° | Experiments using Bar charts, dotplots, histograms, boxplot, Plotting and coloring, 5 | Basic statistics, sample means, testing proportion, an 6 | Experiments using Loops, Conditional statements. a 7 7 Data transformation, Outlier detection. _ Work on various Debugging tools. 9 | To write database queries related to R 10 | To implement Logical regression and PCA. : 11 | Work with RODBC and DBI Package. - - - Office: Bikaner Technical University, Bikaner coc Karni Industrial Area, Pugal Road, Bikant#33. 1008 \2 Website: https://btu.ae.in Approved by 7 AC Meeting held on 1" Nov. 2021 (Agenda 7.5). Page [27ib) BIKANER TECHNICAL UNIVERSITY, BIKANER [AS @) Sane cata) Peateran, tone ee OFFICE OF THE DEAN ACADEMICS, 6CSDS4-24: Mobile Application Development Lab ~ Credit: 15 —Max Marks: 75 (1A :45, ETE:30) “OL+ OT+ 3P End Term Exams: 2hr_ S.No. List of Experiments, 1 | To study Android Studio and android studio installation, Create a “Hello World” application. 2 | To understand Activity, Intent, Create sample application with login module (Check username | and password). [3° | Design simple GUI application with activity and intents e.g. calculator. 4 | Develop an application that makes use of RSS Feed [5 | Write an application that draws basic graphical primitives on the screen 6 | Create an android app for database creation using SQLite Database, [7] Develop a native application that uses GPS location information 8 | Implement an application that writes data to the SD card. [9 | Design a gaming application = il 10 | Create an application to handle images and videos according to size Office: Bikaner Technical University, Bikaner Karni Industrial Area, Pugal Road, Bi ancy 4004, 20 Website: https://btu.ac.in Approved by 7 AC Meeting held on 1° Nov, 2021 (Agenda 7.5 Page [28