RASHTRASANT TUKADOJI MAHARAJ NAGPUR UNIVERSITY, NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY (B.TECH) DEGREE COURSE, SPMUSTER: SEVENTH BRANCH: COMPUTER SCIENCE AND ENGIN EERING Subject: ‘Cryptography and Network Security Subject Code ate ] Internal ae | Load Credit Total Marks University Marks | Total | Marks | be 0 | too | 13 100 30 70 (Theory) | al oni se a Aim: To highlight the features of different technologies involved in Network Security Prerequisite(s): Mathematics, Algorithm, Networking Course Objective: To develop the student's ability to understand the concept of security, goals in various applications, fo provide the students with some fundamental cryptographic! 2 mathematics used in various symmetric and asymmetric key! | ryptographiy. 3 [To develop the student's ability to analyze the eryptographic algorithms. 4 flo familiarize the student the need of security in computer networks. | Course Outcome: At the end of this course student are able to: cor ty goals, background of cryptographic maiheinaties equire knowledge 0 ‘identification of its application inderstand, analyze and implement ~ the symmetric key algorithm CO3 and — understand and analyze. == — asymmetric key encryption i ofl gorithms, digital signatures, nnalyze the concept of message integrity and the algorithms for checking the integrity cod daca, ting etyprosystem used in netw COS” Understand and analyze the eUNITE: (08 Hrs) Introduction : Security goals, cryptographic attacks, Mathematics of cryptography: modular arithmetic, Euclidean and extended Euclidean algorithm. Traditional symmetric key ciphers; Monosiphabetie ciphers: addition and multiplication ciphers, Polyalphabetic ciphers: Vigenere's ciphers, Hill ciphers, playfuir eiphers. UNIT HI: (07 Hrs) Symmetric key cryptography: Block ciphers and its components, Stream cipher, Blowfish, DES, AES, RC4, Key distribution UNIT III: (07 Hrs) Asymmetric key cryptography: Euler's Phi-Funetion, Fermat's Little Theorem, Euler's theorem, Chinese remainder theorem, Diffie-Hellman, RSA, ECC, Entity authentication Digital signature UNIT IV: (07 Hrs) Message Integrity and authentication: Authentication requirement, MAC, HMAC, Cryptographic Hash Function: MDS, SHA, User authentication, Kerberos UNIT V: (07 Hrs) Firewalls, Intrusion Detection, Password Network Security: Key Management, PGP, [PSee, SS ‘management, Virus, Textbooks: ual Private Network, Web Security © William Stallings “Cryptography and Network Security: Principles and Standards”, Prentice Hall India, 7th Edition, 2017. * Behrouz A, Forouzan, “Cryptography and Network Security", McGraw-Hill publication, 2nd Edition, 2010, References: © Richard H. Baker, Network Security, MeGraw Hill Intervational 3rd Edition, 1996 © Bruce Schneier, Applicd Crypiography, John Wiley New York, 2nd Edition, 1996, perye ys ee oeRASHTRASANT TUKADOJI MAHARAJ NAGPUR UNIVERSITY, NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY (B.TECH,) DEGREE COURSE, SEMESTER: SEVENTH BRANCH: COMPUTER SCIENCE AND ENGINE! ubject: Cryptography and Network Security ~ Bubject Code: BTECHCSET0IP Load Credit] Total Maxis | “Internal Marks | University Macks [Tout] ODEs =n ae po (Practical) t o1 50 | 25 25 [i> =) [es Aim: To highlight the features of different technologies involved in Network Security, Prerequisite(s): Mathematies, Algorithm, Networking Course Objectiv < ffo develop the student's ability to understand the ‘goals in various applications. To provide the students ih some damental cryptographic 2 mathematics used in various symmetric. and — asymmetric —_—key| | leryptography. |Fo Familiarize the student the need of security in eomputer networks, Course Outcome: At the end of this course student are able to: (Acquire knowledge about security goals, background of cryptographic mathematics and identification of its application "Require knowledge about the background of mathematics oF asymmetric Key eryplowaphy| €O3 ‘and understand and analyze, = — asymmetric key —_eneryption, algorithms, digital signatures eerily of nalyze the concept of message imegrity and the algorithms for checking the lata, ‘COS [Understand and analyze the existing ezypiosystem used in networking Note: Minimum 10 Pract ops & web wv als based qn given syllabusRASHTRASANT TUKADOJI MAHARAJ NAGPUR UNIVERSITY, NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY (.TECH.) DEGREE COURSE SEMESTER: SEVENTH (C.B.C.S,) BRANCH: COMPUTER SCIENCE AND ENGINEERING Subject: Elective-IV Deep Learning aoe Subject Code [BrECHCSE707 al Load Credit] Total Marks | intemal Marks | Universiy Mans | Teale | OSH a eee area 03 100 30 | 0 oo | 1 fe introduce basic deep leaming algorithms. as = 4 2 [Fo understand real world problem which will be solved by deep learning methods. 3 Wo identity deep learning techniques suitable for a real world problem, aa Course Outcome: Atthe end of this course student are able to: COI [Understand basic of deep learning algorithms, =i: aes | hee | ‘epresent feedforward Neural Network co2 if Evaluate the performance of different deep learning models with respect to the co3 | ptimization, bias variance trade-off overfitting and underfitting | COs [Apply the convolution networks in eomext with real world problem solving. = | COS [Apply recurrent neural networks in context with real world problem solving. | UNIT I (08 Hrs) Basic of Deep Learning - History of Deep Leaming, MeCulloch Pitts Neuron, ‘Thresholding Lowie, 1g Algorithm and Convergence, Multilayer Perceptrons (MI.Ps), Perceptrons, Perceptron Learnit Representation Power of MLPs, Sigmoid Neurons, Feed forward Neural Networks. UNIT TL (07 Hrs) Training of feedforward Neural Network ~ Representation Power of Feed forward Neural Networks, Training of feed forward neural network, Gradient Descent, Gradient Descent (G1), Momentum Based GD, Nesterov Accelerated GD, Stochastic GD, AdaGrad, RMSProp. Adam: UNIT IL Optimization Algorithm - Gradient Descent (GD), Momentum Based GD, Nesteroy Accelerated GD. ization Methods: Sigmaid, (07 Hrs) ction and In Stochastic GD, AdaGrad, RMSProp, Adam, Activation Fu got sm gue Bo gh dy sitTanh, Relu, Xavier and He initialization, Regularization: Bias and variance, Overfitting, Hyperparameters tuning, L] and L2 regualarization, Data Augmentation and early stopping, Parameter sharing and tying UNIT IV (07 Hrs) Convolution Neural Newwork (CNN) - Convolutional operation, Pooling, LeNet, AlexNet, ZF-Net VGGNet, GoogLeNet, ResNet. Visualizing Convolutional Neural Networks, Guided Backpropagation UNITV (07 Hrs) Recurrent Neural Network (RNN) - Recurrent Neural Networks, Backpropagation through Time (BPTT). Vanishing and Exploding Gradients, Long Short Term Memory (STM) Cells, Gated Recurrent Units (GRUS). Text Books: + Sandro Skansi, Introduction to Deep Lear Springer. ‘+ Charu C., Aggarwal. Neural Networks and Deep Learning: A Textbook. Springer. 2019 + lan Goodfellow , Yoshua Bengio and Agron Courville. Deep Learning. An MIT Press book. 2016. «Dr. Lovelyn Rose, Dr. |. Ashok Kumar, Dr.) Karthika Renuka Deep Learning using Python, Willey Publication. Reference Books: * Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009. + A. Ravindran, K.M. Ragsdell , and G. V. Reklaitis, Engineering Optimization: Methods and Applications , John Wiley & Sons, Inc. , 2016,RASHTRASANT TUKADOJI MAHARAJ NAGPUR UNIVERSITY, NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY (B.TECH.) DEGREE COUR: SEMESTER: SEVENTH (C.B.C.S,) BRANCH: COMPUTER SCIENCE AND ENGINEERING Subject : [Elective IV : Optimization Technique Bubject Code :BTECHCSE7027 | | Load] Credit [Total Marks | Internal Marks | University Marks Total 03Hrs_ 03 100. 30 70 { 100 (Theory) | | | Aim ; To understand the implementation of various data structures and algorithms, Prerequisite(s): C Language Course Objective/Learning Objective: bility to apply the theory of optimization methods and algorithms 10 develop and for solving rious types of optimization problems. ation techniques in problems of Engine [Ability 10 g 2 ‘echnology | Course Outcome: At the end of this course Student are able to: [Explain the theoretical workings of the graphical, simplex and analytical methods ei col pnaking effective decision on variables so as to optimize the objective function. Identify appropriate optimization method to solve complex problems involved in various ote industies rer Demonstrate the optimized material distribution schedule using tansponation model id minimize total distribution cost | Ee ‘dentify appropriate equipment replacement technique to be adopted to ininimize inaintenance cost by eliminating equipment break-down, cos PPP the knowledge of game theory concepts to articulate real-world competitive situations sirategic decisions to counter the consequences. | UNIT: (08 Hrs) Introduction of operation research: LP Formutetions, Graphical method for solving LP's with 2 variables, Simplex method, Duality theory in linear programming and applications, Integer linear programming, dual simplex method be byt ae py to wsUNIT I: (07 Hrs) Dynamic Programming : Basic Concepts, Bellman's optimality principles, Dynamics Programming approach indecision -—making_—problems, optimal. subdivision _ problem Sequencing Models: Sequencing problem, Johnson's Algorithm for processing n jobs through 2 ‘machines, Algorithm for processing n jobs through 3 or more machines, Processing 2 jobs through » machines. UNIT I: (07 Hrs) ERT and CPM : Project management origin and use of PERT. origin and use of Project Management CPM, Applications of PERT and CPM, Project Network, Diagram representation, Critieal path ealeulation by network analysis and critical path method (CPM), Determination of flosts, Construction of time chart and resource labelling, Project cost curve and crashing in project management, Project Evaluation and review Technique (PERT) UNITIV: (07 Hrs) Queuing Models : Essential features of queuing systems, operating characteristics of queuing system, probability distribution in queuing systoms, classification of queuing models, solution of queuing M/M/1 0 /ECFS.M/M/I : N/FCES, M/M/S : fF CFS, MM/S : N/FCFS, UNIT V: (07 Hrs) FOQ (Economic Order Quantity) model, Inventory models with deterministic demands (no shortage & shorage Inyentary Models : Introduction to the inventory problem, Deterministic Models, The classica allowed), Inventory models with probabilistic demand, multi item determines models Textbooks: © Gillet B.E.: Introduction to Operation Research, Computer Oriented Algorithmic approach ~ Tata McGraw Hill Publising Co. Ltd. New Delhi, . P.K, Gupta & D.S. Hira, “Operations Research", $.Chand & Co References: © J.K, Sharma, “Operations Research: Theory and Applications”, Mae Millan © SD. Sharma, “Operations Research”, Kedar Nath Ram Nath, Meerut (UP) ‘SS. Rao “Optimization Theory and Application”, Wesley Eastem gum? te toys eweRASHTRASANT TUKADOJI MAHARAJ NAGPUR UNIVERSITY, NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY (B.TECH.) DEGREE COURSE SEMESTER: (C.B.CS,) BRANCH: COMPUTER SCIENCE AND ENGINEERING 5) _ Elective 1V; Gaming Archiogune— Subject Code :Bv Subject fn Load Credit | Total Marks | Intemal Tu ‘S| University Marks | | [tm Sages peed aca wo | 39 7 [Cee Be ect ea ae ae ‘Aim : To understand the concopts of Gaming Architecune Prerequisites): Course Objective/Learning Objective: ie [lnderstand he conceps of Game deign anda lopment P E Ne Propesses, mechanics and issued in Game Design: F_ fi Posed to the Gore architecties of Game Programming Know about Game programming platforms Course Outcome: At the flame works and engines, Learw to develop, *4 of this course Student are able to: cor _PPisetss the concepis of Game design and development, es eee al Sign the processes, and use mechanies for game dev [spline Core archers of Gans Progaminin cow se Game programming platforms, Fame ware and engi cos (Create interactive Games, a UNIT I: (08) 3D GRAPHICS FOR GAME PROGRAMMING 3D Transformations, Quaternions, 3 Modeling and Rendering, Ray Tracing, Shader Models, Lighting, Color, “Sleaions, Culling and Clipping, Character Animation, Physics-baced Simulation, Scene on GAME ENGINE DESIGN Gare engine architecture, Engine suppon systems, Resouces and File systems, Game Joop and realtime Simulation, Human Interface deviees, Collision and rigid body dynamics, Game profiling UNIT IMI; (7) GAME PROGRAMMINGUNIT IV: 07) GAMING PLATFORMS AND FRAMEWORKS. 2D and 3D Game development using Flash, DirectX, Java, Pylon, Came engines - nity. DX Studio, Development: The Development Process, Code Quality. Coding Prortics. Debugging and Module Completion ‘The Seven Golden Gambits, The Thee Lead Balloons Intalization andthe Main Loop’ Inializing Game objects Game Loop, Cleanup UNIT V: cy ‘Loading and Caching Game Resoures: Image and Audio Formals, Compression Resource Files Resource File builder, Resource Cache, 3D Graphics and 3D Engines: 3D Graphies Pipeline 3D Middleware Game and Development:Developing 2D and 3D interactive games using DirectX or Python —Isomettie and Tite Besed Games, Puzzle games, Single Player games, Mull Player games, Invoduction fo Avgumsnted and Virtual Reality in game development, Textbooks: oo, MeMe Stallify and David Grahum, “Game Coding Complete” Furth L:dtion, Cengage Leaming, PTR, 2012, * —_1880n Gregory, “Game Engine Architouure", CRC Press / A K Peters, 2009, * __ David H. Eberly, “3D Gume Engine Design, Second Eition: A Practical Approsch to Real-Time Computer Graphics" 2 nd Editions, Morgan Kaufinann, 2006, * Radia Shankarmani , Saurabh Jain Gaurang Sinha, Game Architecture and Programming Kindle Edition References: * —_Emest Adams and Andrew Rollings, "Fundamentals of Game Design", 2 nd dition Prentice Hall New * _ Ese Lengyel, “Mathematics for 3D Game Programming and Computor Graphics" rd dition, Course ‘Technology PIR, 2011 * Jesse Schell, The Art of Game Design: A book of lenses, 1 st Edition, CRC Press, 2008 He dye de gh ty itRASHTRASANT TUKADOJI MAHARAJ NAGPUR UNIVERSITY,NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY (B.Tech.)DEGREE COURSE SEMESTER:SEVENTH (C.B.C.S.) BRANCH: Computer Science & Engineering “Subject : | Elective IV; Salesforee Technology Subject Code :BTECHCSE7021 | ‘Load Credit | Total Marks | Internal Marks | University Marks Toul — | | = ost: | Hs | i 1 os | 100 30 70 oo] (Theory) Aim: To provide a comprehensive understanding of the Salesforce platform, its core features, and its various components, Prerequisite: OOPS (Object Oriented Programming) or any programming lenguage Course Objectives: To make leam how to create and customize objects, fields, and records; building workflows and automation processes. To learn designing and managing reports and dashboards; and utilizing the Salesforce AppExchange. To provide knowledge and hands-on experience in programming using Apex (Sulesforce's proprietary programming language) Course Outcome: At the end of this course students are able to: COI | Develop skills in configuring and managing Salesforce orgs. CO2_ | Understanding Salesforce Data Management C03 | Implementing automation, security and debugging data CO4 | Acquize programming skills in Apex, Salesforce's programming language. COS. | Enable to extend and customize Salesforce to meet specific business requizements. ye de py‘Nt /Reference Books: alesforce Platform App Builder Certification Handbook" by SiddheshKabe and Muhammad Ehsan Khan (Packt Publishing), + “Salesforee CRM: The Definitive Admin Handbook" by Paul Goodey (Packt Publishing), + "Force.com Enterprise Architecture" by Andrew Fawcett (Packt Publishing), * "Mastering Salesforce CRM Administration” by Rakesh Gupta (Packt Publishing), + _"Salestoree Essentials for Administrators” by Mohith Shrivastava (Packt Publishing). + “Leaming Salesforce Lightning Application Development" by Mohith Shrivastava (Packt Publishing), * "Apex Design Patterns" by Jtendra Z2a (Packt Publishing) * "Mastering Apex Programming” by ChamilMadusanka (Packt Publishing).RASHTRASANT TUKADOJI MAHARAS NAGPUR UNIVERSITY, NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY (8-TECH) DEG: SEMESTER: SEVENTH (C.B.CS,) -OMPUTER SCTENCE & ENGINEERING COURSE. | Sibjest 7] Rleove'V- Netwal Language rovesing “7 ACSETT | Pee cae Total Marks | — intemal Marks letter} [ors | 03 LPO ete Prerequisite(s): Course Objective/L.curning Objectiv 9 introduce the basic concepis and applications of Netwal Language rocessing (NEP) | {To provide an understanding of the challon Fo tach the diferent echnigus and algorithms wads NEP wir wwiow classification, | | jnformation retmeval and extraction, syntactic and semanie ‘analysis, and deep leaming models To enable students to analyze text data and build NEP models To exuip students with the skills to evaluate and compare bigorithens Course Outcome: At the end of this course Student are able to: nds he esc conesps nd pein of Nawal Engage Frocsng WLI [entity th wnalye and preprocess text data for NLP tasks lenges in NLP and evaluate the solutions to these challenges ‘such as text classification, information retrieval and | /Arply different NLP techniques and algo iques and algorithms using appropriate meitee | UNITE: (08Hes) Imtroduction to NLP: Definition and scope of NLP, Historical overview and applications of NLP, Challenges in NLP and their solutions, Basie concepts in linguistics and language processing, Text reprocessing and normalization UNIT I: (07 Hrs) Language Models and Text Classification: Language modeling and n-gram models, Classification and calegorzation of text date, Test classification algorithms such as Naive Bayes, Decision ‘Trees, and Support Vector Machines (SVM), Evaluation meacures for text classification ¢UNIT UI: (07 Hrs) Information Retrieval and Extraction: Information retrieval models such as vector space model and Probabilistic model, Retrieval of relevant documents using query expansion, Named Entity Recognition (NER), Relation Extraction and Open intormation Extraction (OIE) UNIT IV: (07 Hrs) Syntactic and Semantic Analysis: Parts of Speech (POS) tagging and parsing, Dependeuey Par Seimantic Analysis andl Sentiment Analysis, Word Embeddings and Semantic Similarity UNIT (07 Hrs) Advanced Topies in NLP:Neucal Network models for NLP tasks . Deep Leaming models tor NLP tasks Natural Language Generation (NLG), Dialogue Systems and Chatbots Textbooks: © Speech and Language Processing" by Daniel Jurafsky and James H, Martin © Natural Language Processing" by Jacob Eisenstein Referene © "Foundations of Statistical Natural Language Processing” by Christopher D. Manning and Hinrich Senive © "Natural Language Frocessing with Python" by Steven Bird. Ewan Klein, and Edward Loper Be asone fe pb Ob- usRASHTRASANT TUKADOJI MAHARAJ NAGPUR UNIVERSITY, NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY (B.TECH.) DE SEMESTER: SEVENTH (C.B.C.S,) BRANCH: COMPUTER SCIENCE & E! Subject: | Elective V: Big Data Analytics | Subject Code :BTECHCSE73T | Load | Credit | Total Marks Intermal Marks University Mars Total | Garrats aaaee (eens ae ar a. el 03 | 100 19 too | (Theory) | | | Pre- requisites : Should have knowledge of Programming Language (Java preferably). Practice of SQL. (queries and sub queries), exposure to Linux Environment. Course Objective/Learning Objective: [ Student should able to learn and understand the basic concept, [ 1 bpptication of Big Data. | 2 jTo learn Concept of Distributed system with Apache Hadoop. 3 Tolearn application of Hladoop to solve real world problem Petes eae Course Outcome: At the end of this course Student are able to [COI [ndersiand Concepi, characteristics types of big data C02 Build and maintain reli je di stems with Apache Hadoop. COS [Apply Hadoop ecosystem components to solve real world problems. CO4 Apply machine learning algorithm for big data analysis. COS Implement Big Data Activiiesusing Hive a = oO ae — ae UNIT I: (08 Hrs) Introduction to Big Data: Data, Characteristies of data and Types of digital data: Unstructured, Semi-structured and cinta, Characteristies Structured, Sources of data, working with unstructured data, Evolution and Definition of and Need of big data, Challenges of big data, Data environment versus big data environment, Big Data Analysis Life Cycle. UNIT HT: (07 Hrs) Big data analyties tools and Technologies: Overview of business intelligence, Characteristics and need of big data analytics, Classification of analytics, Challenges to big data analytics. Analytical operations: Associations rules. classifications, clustering, Mahout ML, ete paw gphUNIT: (07 Hrs) Hadoop foundation for analytics: Features, Hadoop ccosystems, Evolution of Hadoop architectures Hadoop 1.0, 'adoop 2.0, Hadoop3.0, Key aspects and Components of Hadoop 3.0. Hadoop ‘Technology Stack: Hive, Pig, Zookeeper, Swoop, oovie, flume, etc Unit IV: (07 Hrs) MapReduce and YARN framework: Introduction to MapReduce, Processing data with MapReduce. Introduction to YARN, Components YARN, Data serialization and Working with common serialization formats, Big data serialization formats ont (07 Hrs) NoSQl. Databases: Schema-less Models, Increasing Flexibility for Data ManipvlationKey Value Stores- Document Stores ~ Tabular Stores — Object Data Stores Hive - Shurding -Hbase — Analyzing big data NoSQI. Database Architectures, Text Books : + Tom Wi “Hadoop: The Definitive Guide” Third Edit on, O'reily Media, 2012, * Seema Acharya, Subhasini Chellappan, "Big Data Analytics” Wiley 2015 * Big Data.Big Data Analytics by Michae! Mineli, Michele Chambers, Ambiga Dhira * David Loshin, "Big Data Analytics: From Strategic Planning to Enterprise Integration with Tools, Techniques, NoSQL., and Graph‘, Morgan Kaufiant/El sevier Publishers, 2013, References * Michael Berthold, David J. Hand, "Intelligent Data Analysis”, Springer, 2007, ns. CRC press (2013) * Tom Plunkett, Mark Hornick, “Using R to Unlock the Value of Big Data: Big Data Analytics with Oracle * Jay Liebowitz, “Big Data and Business Analytics” Auerbach Publi R Enterprise and Oracle R Connector for Hadoop”, MeGraw-Hill/Osborne Media (2013),RASHTRASANT TUKADOJI MAHARAJ NAGPUR UNIVERSITY, NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY (B.TECH) DEGREE COURSE SEMESTER: SEVENTH (C.B.C.S,) BRANCH: COMPUTER SCIENCE AND ENGINEERING L Subject Elective V: Mobile Computing fe wubject Code BTECHCSET031 | U Marks Internal Marks ae ses ara ee | a 3 30 I 70 03 100 Jniversity Marks Total pected apap eeseteeiss ha Pre- requisites : Computer Networks, Course Objective/Learning Objecti fh [fo study Wireless Communication with Cellular system Model {fo study GSM system with Radio, Network Switching and Operation subsystem, To learn Wireless LAN with MAC Layer, yets. fe study Mobile MANET with WAP protocol Course Outcome: At the end of this course Student are abl saan — ——— (CO1 fo Understand the basic concepts of Wireless Communication with Cellular System 'o learn about GSM System with Cell layout, Radio, Network Switching and Operation! coz 0: subsystem, HLR & VLR. | [CO3 [fo learn Wireless LAN with its Architecture and MAC Layer. oa [To lea Mobile IP, Dynamic Host Configuration Protocol, Mobile Ad hoc Networks Wireless Application protocol. i £05__ [Fo leam about TCP over Wireless Networks, wi UNITI: (08 Hrs) Introduction to Mobile Computing, Features of Wireless Communication, Applications of Wireless Communication, A simplified Reference Model in Mobile Computing, Cellular system Infrastructure with fenerie Block diagram, frequency reuse, Medium Access Control (Wireless): Motivation fora specialized MAC, Hidden and exposed terminals, neat and far terminals, Wireless Network over Wired Network, UNIT: (07 Firs) Introduction to GSM system: Mobile Services, GSM Architecture, OSM operational and technical eauirements, Cell layout and frequency planning, GSM radio subsystem, Network an Switehi po gdy es de gh ip we 1Subsystem, Operation subsystem, Echo eanceller, Localization and calling, Handovers UNIT ML: (07 Hrs) Wireless LAN: Advantages of Wireless LAN, Applications, IEEE 802.1 standards, system Architecture, Protocol architecture, physical layer, medium access control layer, MAC management, Mobile Agents, Requirement for mobile agent system, Bluetooth, Roaming. UNITIV: (07 Hrs) Mobile Network Layer: Mobile IP-IP Packet delivery, Dynamic Host Configuration Protocol (DHCP), Mobile Ad hoc Networks (MANETs): Overview, Properties ofa MANET. routing, DSDV. DSR. AODV & Hybrid Routing Protocol UNITY (07 Hrs) Mobile Transport Layer: Traditional TCP, Indirect TCP, Snooping TCP, Selective retransmission, ‘Transaction oriented TCP, Wireless Application Protocol (WAP), Architecture, Wireless datagram protocol ‘Text Books + * Mobile Communications, Jochen Schiller, Second edition, Pearson, 2006 * Mobile Computing for beginners, Raksha Shende, Arizona Business Alliance, 2012. * Handbook of Wireless Networks and Mobile Computing, Ivan Stojmenovic. Wiley, 2002. References * Fundamentals of Mobile and Pervasive Computing, Adelstein, Frank, Gupta and Sandeep KS, McGraw: Hill, 2005, * Principles of Mobile Computing, Hansmann, Merk and Nieklous, Stober, Springer, Second Edition, 2003. + Mobile Communication, T. Shivakami, Annaji MM. Kuthe, Sciemtifie International Publishing. House, 2022. Pier & & &RASHTRASANT TUKADOJI MAHARAS NAGPUR UNIVERSITY, NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY. (B.TECH.) DEGREE COURSE SEMESTER: SEVENTH (C.B.C.S.) BRANCH: COMPUTER SCIENCE AND ENGINEERING [Bikieot =] Open Bi “Toad | Creat | Tow Mans | [otis 0 100 | 30 » io | L_ Theory) | yell Pyinon Programming | Subjest Code ATECIICSETOAT Internal Marks | Univer rsity Marks Prerequisite(s): C Language Course Objective/L.carning Objectiv |_1__[Founderstand the Fundamentals of Pylon programming language [2 Fedevetop problenrseiving and progamming skis wing Piben Fo use Python in different applications such as web development, daw analysis, and ania ntellgence. { Course Outcome: At the end of this course, Student are able to [Cot Develop programing 3 sin Python progransaning languages CO2 implement object-oriented programming UNIT I: (08 Hrs) Introduction to Psthon Programming: Overview of Pyth programming languago, Variables, data ‘Pes, and operators, Conditional statements and loops, Functions, and modules UNIT II: (07 Hrs) Object-Oriented Programming in Python: Object-oriented progeemming concepts, Classes, objects, and methods, Inheritance, and polymorphism UNIT III: (07 Hrs) Python Libraries for Data Analysis; Introduction to NumPy and Pandes, Data manipulation with NumPy and Pandas, Data vis ization with Matplotlib and Seaborn, UNIT IV: fved ply Lo ob Ar" "duWeb Development with Flask: Introduction o Flask framework, creating web applications using Flask, Flask extensions for database integration UNIT V: (07 Hrs) Tnt-uduction to Machine Learning with Python: Introduction to Seikit-Leam, Supervised and Unsupervised learning, Classification, and regression algorithms Textbooks: * "Python for Everybody: Exploring Data in Python 3” by Charles Severance, * “Python Crash Course, 2nd Edition: A Hands-On, Project-Based Introduction to Programming" by Eric Matthes, References: © —“Leaming Python, sth Edition” by Mark Lutz, * "Python Data Science Handbook: Essential Tools for Working wita Data" by Jake VenderPlas,RASHTRASANT TUKADOJI MAHARAJ NAGPUR UNIVERSITY, NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY (B.TECH.) DEGREE COURSE. SEMESTER: SEVENTH (C.B.C.S.) BRANCH: COMPUTER SCIENCE AND ENGINEERING Subject + Open Elestive JAVA Programming fiCsE70IF ] Load Credit | Total Marks [internat Marks | University Merks | Tol | 03 Tis Aaa ae e 3 | 100 30 0 00 | (Theory) | I i al Prerequisite(s): C Language Course Objective/L earning Objective: 1 [einrodie the conseps oF ava programing language ans pplication nsoltware NGnnGa To develop « sound understanding of Java programming constructs suchas variables, open onal statements, loops, and arrays, [To provide students witha strong foundaivon in object-oriented programming conccpis such as lnhovanes: polymorphism, encapsulation, and abstraction 4 [To cnable students to ereate and use clases, objects, and methods in lava programs. © teach students how to handle exceptions and use various InpuVoulpat techniques in Java programs, Course Outcome: At the end of this course Student are able to: co, Understand the fundamentals of Java prograrnming language and its application in software development, | Con, fmPlemeat Java programming sonst ach at warble, prion onal wants Toop, and arrays. Design and implement object-oriented programs using inherianee, polymorphism, encepsulation and’ | cos Pee Pl i Progr 8 polymorp ps bstraction concepts in Java, [Coa Create and ae cases, objects and methods hve proyrams (COS final exeepions and use input echigus hava opans UNIT: (08 Hrs) Introduction to Java Programming: Introduction to Java programming language Java Virtual Machine (SVM), Java Development Kit (DK), Overview of Java programming environment, Simple Java program and its executionUNIT: (07 Hrs) Java Programming Constructs: Variables and data types, Operators, and expressions Control statements: if-else, switch, for, while, do-while, Arrays: single-dimensional and multi dimensional arrays, Strings and string manipulation UNIT ITT: (07 Hrs) Object-Oriented Programming Concepts in Java: Classes and objects, Methods and constructors, Inheritance: single and mubilevel inheritance, Polymorphism: method overloading and) overriding Encapsulation and abstraction UNIT IV: (07 Hrs) Handling Exceptions in Java: Exception handling: try-catch, throw, throws, Exception hierarchy in Java, Cheeked and unchecked exceptions, Creating custom exceptions UNIT V: (07 Hrs) Input/Output Techniques in Java: File handling in Java, Reading and wt ting data using streams, Serialization and deserialzation, Networking programming in Java: sockets and URLS Textbooks: * Java: The Complete Reference by Herbert Schildt, McGraw Hill Education, Uth edition, 2018 Severance, C. (2016), © “Head First Java" by Kathy Sierra and Bert Bates, References: * Core Java Volume 1- Fundamentals by Cay S, Horstmann and Gary Comell, Prentice Hal, Lith edition, 2018, © Java How To Program by Paul Deitel and Harvey Deitel, Pearson Education, 1th edition, 2017. EsRASHTRASANT TUKADOJI MAHARAJ NAGPUR UNIVERSITY, NAGPUR FOUR YEAR BACHELOR OF TECHNOLOGY (B.TECH.) DEGREE COURSE, SEMESTER: SEVENTH (C.B.CS.) BRANCH: COMPUTER SCIENCE AND ENGINEERING ase Management | Subject Code :BTECHCSEI04T ‘Open Elective I= Basies of Dat System Load | Credit | Total Marks | — tntemal Marks Toul | oss am Ree 03 100 10 100 (Theory) Aim: To understand basic concepts of Database Management System. Prorequisite(s): NIL, Course Objective/Learning Objective: 1. | To introduce a general ides of a database management system, 2. | To develop skills to implement real life applications that involve database handling, ‘To provide opportunities in subject arcas of data handling and managing techniques Course Outcome: At the end of this course Student are able to: COt | Understand the basics of DBMS to analyze sm information problem in the form of an Entity relation diagram and design an appropriate data model for it CO2_| Demonstrate basies of File organizations end its types CO3_ | Interpret functional dependencies and various normalization forms CO4 | Pecform basic transaction processing and management COS | Demonstrate SQL. queries to perform CRUD (Create, Retrieve, Update, Delete) operations on database eis par Le Ap iFUNIT: (08 Hes) Introduction to DBMS - Purpose of Database Systems,Database systems Applications, view of data,Database Languages,Database system structure,data_methods,Databaso Design,& ER Model : Entity,Anributes Relationships, Constraints Keys, Design Provess, ER’ Models, E-R Diagram. UNIT: (7 Hrs) File organizations and its types, indexing, types of indexing, hashing, hashing techniques, UNITE: (OT Hrs) Functional Dependeney (FD) ~ data integrity rules, functional dependency, need of normalization,firse nomnal form, second normal form, third normal form UNIT IV: (07 Hes) Database Transaction Processing : transaction system concepts, desirable properties(ACID) of transactions schedules, serializability of schedules, concurrency control, recoverability and Deadlock handling, UNIT SQI. Coneeprs - Besies of SQL, DDL, DML, DCL, structure ~ creation, alteration, defining constraints, Funetions (07 Hrs) aggregate functions, Built-in functions -numeric, date, string functions, sot aperations. Use of group by. ha order by, join and its types, Exist, Any. All Textbooks: i * Abraham Silbeischats, Henry F. Korth and S, Sudarshan, Database System Concepts 4th Ed, McCiraw Hil 2010 * Ramer Elmesri and Shamkart B, Navathe, Fundamentals of Database Systems (Se), Pearson Edveation, 2008 © Raghu Ramakrishnan and Johannes Gelcke, Database Management Systems (3/e). McGraw Hill References: # Peter Reb and Carlos Coronel, Database Systems: Design, Implementation and Management (74), Cengage Learning, 2007.