BENGALURU CITY UNIVERSITY SYLLABUS FOR MASTER OF SCIENCE (Computer Science) (SEMESTER SCHEME) 2021-22 onwardsBANGALORE CITY UNIVERISTY Proceeding of the meeting of the Board of Studies in Computer Science, held in the Board Room of Canara Bank School of Management Studies, Central College Campus, Bangalore City University, Bangalore on 04-10-2021 at 11.00 am The Following Members were present: 1. Dr. Susesha, Professor, PG Department of Computer Science, Mysore Univeristy 2. Dr. Chandrakanth Naikodi, Associate Professor, PG Department of Computer Science, Davanagere University " Or. H.K. Gundurao, Associate Professor, Vijaya College, Bangalore Or. Prathibha V Kalburgi, Ramaiah College of Arts Science, and Commerce, Bangalore Mrs. Amalorpavarn, Sambram Acacemi of Management Studies, Sangalore Dr, Muralidirera B L*Professor, Department of Computer Science, Bangalore University Pane The Following Member was present dnline 1. Dr. Guru D.S, Professor, PG Department of Computer Science, Mysore Univeristy ‘The Following member is diseased 1. Late, Malathi Palani. A ‘The Following Members did not attend the meetiag: “” 1. Dr. Prabhakar C.1, Professor, Kuvempu University, Shimogga 2. Dr. Bhagyawana S Mudigowda, Associate Professor, Maharani Cluster University 3. Smt. Nagarathnamma S.M, Associate Professor, Maharani Cluster Univeristy ‘The Chairperson welcomed the members and briefed the members on the proposed syllabus. The Committee discussed the syllabus in detail and approved the following syllabus: 1. lll and IV semester syllabus for the MCA CBCS Scheme 2, The syllabus for | to IV semesters syllabus for M.Sc (Computer Science) - CBCS Scheme 3, Syllabus Structure for the NEP BCA, and I, and ll semester syllabus for the same 4, Syllabus Structure for the NEP B.Sc Computer Scionce, and | and Il semester syllabus for the same 5. Electives for the CBCS BCA Syllabus ‘The Chairperson thanked all the members for their active participation. qr ih bmw (Or. Susesha) (Or. Charldrakanth Naikodi) (Or. HK. Gundurao} (Mrs. pratt V Kalburgi) (Mrs; Amalorpavam) NO Rares pe Chairperson6 9 MEMBERS OF THE BoS Dr, Muralidhara BL Professor, Department of Computer Science Bangalore University Dr. Guru D.S Professor PG Department of Computer Science ‘Mysore Univeristy Dr. Susesha Professor, PG Department of Computer Science Mysore Univeristy Dr. Prabhakar C.J Professor Kuvempu University, Shimoga Dr. Chandrakanth Naikc Associate Professor Department of Computer Science Davanagere University Dr. Prathibha V Kalburgi IN COMPUTER SCIENCE CHAIRPERSON ‘Member Member Member ‘Member Member Ramaiah College of Arts Science, and Commerce Bangalore Mrs. Amalorpavam Member ‘Sambram Academi of Management Studies Bangalore Dr. H.K. Gundurao Associate Professor Vijaya College, Bangalore Dr. Bhagyawana S Mudigowda Associate Professor Maharani Cluster University, Bangalore ‘Smt. Nagarathnamma S.M Associate Professor Maharani Cluster Univeristy, Bangalore Page 2 of 35 Member Member MemberSCHEME OF STUDY AND SCHEDULE OF EXAMINATION 1. Title of the course: Computer Science, M.Sc. 2, Duration of the course : 2 years (4 semesters) 3.Bligibility’ a) BSc. (Computer Science) or BCA with Mathematics as one of the subject and at least 50% aggregate marks of all optional subjects (throughout 3 years B Se. / BCA course), B.Sc. PCM with PG Diploma / Certificate in Computer Science of duration one year b). The minimum requirement for SC / ST candidates are relaxed in accordance with University regulations. 4. Intake: 15 + supernumerary quota as per University regulations, Total number of students including payment seats not to exceed — 35. Payment seat fee is as per university guidelines. 5. Admission: A category wise merit list will be prepared with marks obtained in all optional im all the three years 6. Attendance: As per regulations of the University for PG. courses, 7. Medium of instruction: English 8, Scheme of study: Each semester is of 4 months duration I to III semester: Theory papers 4, Practical’s 2 in each semester. IV semester: Project, seminar and viva-voce, theory papers, 4 9. Scheme of examination: There shall be a University examination at the end of each semester. ) Appearance for the examination: As per regulations of the University for PG. Courses bb) Provision for repeaters: As per regulations of the University for PG, Courses ©) Dissertation and viva-voce examination: The period of dissertation work is on full semester (4th semester). A student has to select a guide from the department in consultation with the chairperson of the department 10, Result declaration: As per regulations of the University for PG. Courses. 11. Miscellaneous: a) It is recommended that tutorial work be provided for all theory and practical papers, by Internal assessment: Attendance - 10 Seminars and Assignments - 10 Mid-semester exam - 10 ) Lectures from experts in the field from R&D institutions are highly desirable. Any other issue not envisaged above shall be resolved by the Vice-Chancellor in consultation with the appropriate bodies of the University, which shal be final and binding. Page 3 of 35SCHEME OF STUDY AND EXAMINATION FOR MASTER OF SCIENCE IN COMPUTER SCIENCE (M Se (CS) ¥2K21 Seme Som Paper Code Msciorr Msciot Mscioxt MSClosT MSC1OsP MSC1O00 Msc1o7T Msc201T Msc2027 MSC208T Msc208r MSC20sP MSC206° Msc207T MSC30IT MSC302T uw Msc30xT MSC308 MSC30SP Page 4 of 35 Tile of the paper Computer Architecture ‘Operating Sys Problem Solving Techniques ‘Data Structures Problem Solving Lab Data Stricires Lab Soli Core — Quantitative, ‘Teaching and Research, Aptitude Computer Networking ‘Ailicial Intelligence Object Oriemed Programming using Java Database Management Systems va Lab Database Management Systems Lab Soll Core ~ Soft Skill and Personality Development (Open Elective Elective L Eketive Design and Analysis of Algoriths Web Programming Design and Analysis of Algoriths lab Hour Week 4 4 30 w 0 30 30 30 30 30 Marks xan | Towa a) m 10 Tn) m™ 10 a) an) m 10 m 100 a) a) a) nC) a) m 10 7 100 m 10 ce) a) nr) m | 10 Credits Subject Semester| MSC306P | ‘MSC4OIT Ww scan Tuscana Page 5 of 35, ‘Web Programming Lab Research Methodology Software Engineering Research Project, gee 8 0 ™ 70 150FIRST SEMESTER MSC MSC101T :COMPUTER ARCHITECTURE Total Teaching Hours: 52 No. of Hours / Week: 04 UNIT-1 [10Hours} Number Systems: Binary, Octal, Hexa decimal numbers, base conversion, addition, subtraction of binary numbers, one's and two's complements, positive and negative numbers, character codes ASCII, EBCDIC ete Digital Logic Circuits: Logic gates, Boolean algebra, Map Simplification. Combinational Circuits: Half Adder, Full Adder, flip-flops. Sequential Circuits Shiftregisters,Counters,InteztatedCircuits,Mux,Demux,Encoder,Decoder.Data_ Representation: Fixed and Floating point, Error detection and correction codes. Computer Arithmetic: Addition jon and Division algorithms, Floating-point Arithmetic Operations, Decimal arithmetic operations. Structure of Computers: Computer types, Functional units, Basic operational concepts, Von- Neumann Architecture, Bus Structures, Software, Performance, Multiprocessors and Multicomputer. UNIT- I [oHours} Basic Computer Organization and Design: Instruction codes, Computer Registers, Computer Instructions and Instruction cycle, Timing and Control, Memory-Reference Instructions, Input Output and interrupt.Central processing unit: Stack organization, Instruction Formats, Addressing Modes, Data ‘Transfer and Manipulation, Complex Instruetion Set Computer (CISC) Reduced Instruetion Set Computer (RISC), CISC vis RISC. UNIT- 111 [loHours} Register Transfer and Micro-operations: Register Transfer Language, Register Transfer, Bus and Memory Transfers, Arithmetic Micro-Operations, Logic Micro-Operations, Shift Micro- Operations, Arithmetic logic shift unit Micro-programmed Control: Control Memory, Address Sequencing, Micro-Program example, Design of Control Unit. Input Output: VO interface, Programmed 10, Memory Mapped IO, Interrupt Driven IO, DMA. Instruction level parallelism: Instruction level parallelism (ILP)-over coming data hazards, limitations of ILP. UNIT-1V, [10 Hours} Processors and Memory Hierarchy: Advanced processor technology - Super scalar and vector processors - Memory hierarchy technology - Virtual memory technology. Bus, Cache and Shared Memory: Bus System-Cache memory organizations-Shared memory organization-Sequential and ‘weak consistency models, UNIT-V (12 Hours] Parallel Computer methods: Multiprocessor and multi computers — Shared-Memory ‘multiprocessors, Distributed-Memory Multiprocessors. Multi-vector and SIMD computers. PRAM and VLSI models - Architectural development tracks - Multiple Processor Tracks, Multi- vector and SIMD Tracks, Multi-threaded and Dataflow Tracks. Thread level parallelism: Multithreaded Architectures, Distributed Memory MIMD Architectures, Shared Memory Architectures, Page 6 of 35Architecture of Multithreaded processors, Principles of multithreading, Issues and solutions. TEXT BOOKS: 1. Mano M Morris, "Computer System Architecture”, 3rd edition Pearson India(2019). 2. William Stallings, “Computer Organization and Architecture designing for performance”, 10th edition, Pearson(2016) 3. Kai Hwang, “Advanced Computer Architecture — Parallelism, Scalability, Programmability”, Tata McGraw-Hill, 2008, Reference 1. Dezso Sima, Terence Fountain, Peter Kacsuk, “Advanced Computer Architectures — A Design Space approach”, Pearson Education, 2009 2.Carl Hamacher, Zvonks Vranesic,SafeaZaky, “Computer Architecture And Organization”, Sth edition McGraw Hill New Delhi, India(2002). MSC102T: OPERATING SYSTEMS Total Teaching Hours: 52 No. of Hours / Week-04 UNIT-1 [10 Hours} Introduction: Batch Systems, Concepts of Multiprogramming and Time Sharing, Parallel, Distributed and real time Systems, Operating System Structures, Components & Services, System calls, System programs, Virtual machines. Process Management: Process Concept, Process Scheduling, Co ~ Operating process, Threads, Inter process communication, CPU Scheduling Criteria, Scheduling algorithm, Multiple Processor Scheduling, Real time Scheduling, Algorithm evolution UNIT- IL [10 Hours] Process Synchronization and deadlocks: The Critical Section Problem, Synchronization hardware, ‘Semaphores, Classical problems of synchronization, Critical regions, monitors, Dead locks — system model, Characterization, Dead lock prevention, avoidance and detection, Recovery from dead lock, Combined approach to deadlock handling UNIT- IT [12 Hours] Memory Management: Logical and Physical address space, Swapping, Contiguous allocation, Paging, Segmentation, Segmentation with paging in Mastics and Intel 386, Virtual memory- Demand paging and its performance, Page replacement algorithms, Allocation of frames, thrashing, page size and other considerations. Demand Segmentation. UNIT-1V, [10 Hours} File management (Systems, Secondary Storage Structure): File Concepts, Access methods, Directory Structure, Protection and consistency, File system structure, Allocation methods, Free space management, Directory Implementation, Efficiency and Performance, Recovery. Disk Management (Structure, Disk Scheduling Methods): Disk Structure & Scheduling methods, Disk ‘management, Swap — Space management Page 7 of 35UNIT-V [10 Hours] Protection and Security: Goals of protection, Domain Protection, Access matrix, Security Problem, Authentication, One time password, program threats, System threats. Virtual Machines: Building Blocks, Types of VMs and their implementations, Distributed Systems: Advantages, ‘Types of Network based OS, Robustness, Design Issues, Distributed File Systems. Case Study of ‘Windows 10 and Linux Operating System. TEXT BOOKS: 1. Abraham Silberschatz and Peter Baer Galvin, “Operating System Concepts”, 7th Edition, Pearson Education, 2002 Reference 2. HM Deitel, “Operating Systems”, Pearson Learning Solutions, 3rd Edition, 2003, 3. William Stallings, “Operating Systems”, 6th Edition, Pearson Education, 2010. 4, Stuart, “Operating systems: Principles, Design and Implementation”, Cengage Learning India, Ist Edition 2008, MSC103T: PROBLEM SOLY! TECHNIQUE Total Teaching Hours: $2 No. of Hours / Week: 04 UNIT-1 [10 Hours] Introduction: The Role of Algorithms in Computing, Algorithms as a technology, Analyzing algorithms, Designing algorithms, Growth of Functions, Asymptotic notation, Standard notations and common functions. Fundamental Algorithms: Exchanging the values of two variables, Counting, Summation of a set of mumbers, Factorial Computation, Generating of the Fibonacci sequence, Reversing the digits of an integer, Base Conversion, Character to number conversion UNIT-IL [12 Hours] C Programming: Getting Started, Variables and Arithmetic expressions, Input and Output: Standard input and output, formatted output- printf, variable length argument list, formatted input scant. Control Flow: Statements and Blocks, Ifelse, else-if, switch, loops: while loop, for loop, do while, break and continue, goto and labels. Pointers and Arrays: pointers and address, pointers and finetion arguments, multidimensional array, initialization of pointer arrays, command line arguments. UNIT- IL [10 Hours] Factoring Methods: Finding the square root of a number, the smallest Divisor of an integer, the sreatest common divisor of two integers, generating prime numbers, computing the prime factors of an imeger, generation of pseudo random numbers, raising a number to a large power, computing the nth Fibonacci Number. Array Techniques: Acray order Reversal, Array counting or Histogramming, Finding the maximum number in a set, removal of duplicates from an ordered array, partitioning an array, Finding the k smallest element, multiplication of two mattices. Page 8 of 35,UNIT-IV [10 Hours] Merging: the two-way merge. Sorting: Sorting by selection, sorting by exchange, sorting by insertion, sorting by diminishing increment, sorting by partitioning. Searching: binary search, hash search.Text processing and Patten searching: text line length adjustment, left and right justification of text, keyword searching in text, text line editing, linear pattern search, sub-linear pattern search uNIT-V [10 Hours} Introduction to Python: Need of Python Programming, Applications, Basics of Python Programming Using the REPL(Shell), Running Python Scripts, Variables, Assignment, Keywords, Input-Output, Indentation. Basic elements, branching programs, control structures, Strings, Functions, Scoping, Abstraction, Structure types TEXT BOOK! 1. RG Dromey, “How to Solve it by Computer”, Pearson Education India, 2008. 2.Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to Algorithms”, 3rd Edition, The MIT Press Cambridge, Massachusetts London, England, 2009. 3. Brain M. Kemighan, and Dennis M. Ritchie, “The C Programming Language”, 2nd edition, Princeton Hall Software Series, 2012 4, Wesley J. Chun, “Core Python Programming - Second Edition”, Prentice Hall Reference: 1 John V Guttag, “Introduetion to Comput Hall of India 2. Introduction to PYTHON, Kenneth A.Lambert, Cengage. 3.Leaming Python, Mark Lutz, O° Really. jon and Programming Using Python”, Prentice MSC 104T: DATA STRUCTURES Total Teaching Hours: $2 No, of Hours / Week: 04 UNIT [0Hours} Introduction and Overview: Definition, Elementary data organization, Data Structures, dataStructures operations, Abstract data types, algorithms complexity, time-space trade off Preliminaries: Mathematical notations and functions, Algorithmic notations, control structures Complexity of algorithms, asymptotic notations for complexity of algorithms.String Processing:Definition, Storing Strings, String as ADT, String operations, word/text processing, Pattern Matching algorithms. UNIT [12Hours) Arrays: Definition, Linear arrays, arrays as ADT, Representation of Linear Arrays in Memory, Page 9 of 35Traversing Linear arrays, Inserting and deleting, Multi-dimensional arrays, Matrices and Sparse matrices. Linked list: Definition, Representation of Singly Linked List in memory, Traversing a Singly linked list, Searching in a Singly linked list, Memory allocation, Garbage collection, Insertion into a singly linked list, Deletion from a singly linked list; Doubly linked list, Header linked list, Circular linked UNIT [10Hours) Stacks: Definition, Array representation of stacks, Linked representation of stacks, Stack as ADT, Arithmetic Expressions: Polish Notation, Conversion of infix expression to postfix expression, Evaluation of Post fix expression, Application of Stacks, Recursion, Towers of Hanoi, Implementation of recursive procedures by stack. Queues: Definition, Array representation of queue, Linked list representation of queues. Types of queue: Simple queue, Circular queue, Double-ended queue, Priority queue, Operations on Queues, Applications of queues, UNIFAY [loHours} Binary Trees: Definitions, Tree Search, Traversal of Binaty Tree, Tree Sort, Building a Binary Search Tree, Height Balance: AVL Trees, Contiguous Representation of Binary Trees: Heaps, Lexicographic Search Trees: Tries, External Searching: m-array tree, B-Trees, B+ Tree, B* Tree, Applications of Trees.Graphs: Mathematical Back ground, Computer Representation, Graph Traversal, Topological Sorting, Greedy Algorithm, Graphs as Data Structure. UNIFY [0Hours} Searching: Introduction and Notation, Sequential Search, Binary Search, Comparison of Methods. Sorting: Introduction and Notation, Insertion Sort, Selection Sort, Shell Sort, Divide And Conquer, Merge sort for Linked List, Quick sort for Contiguous List. Hashing: Sparse Tables, Choosing Hash function, Collision Resolution with Open Addressing, Collision Resolution by Chaining, Text Books: 1. Seymour Lipschutz, “Data Structures with C”, Schaum's outL ines, Tata Me Graw Hill, 2011 2. Robert Kruse, C L.Tondo, Bruce Leung,Shashi Mogalla,“Data Structures and Program Design using C”, Pearson Education, 2009, Reference Books: 1. Mark Allen Weiss," Data Structures and Algorithm Analysis in C”, Second Edition, Pearson Education, 2013 Page 10 of 35‘MSC10SP: PROBLEM SOLVING TECHNIQUE LAB 41. Write a program to demonstrate different number data types in python. 2. Write a program to perform different arithmetic operations on numbers in python, 3. Write a program to create, concatenate and print a string and accessing substring from a given string. 4, Write a python script to print the current date in following format “Sun May 29 02:26:23 IST 2017” 5, Write a python program to ereate, append and remove lists in python, 6. Write a program to demonstrate working with tuples in python. 7. Write a program to demonstrate working with dictionaries in python 8, Write a python program to find largest of three numbers, 9. Write a python program to convert temperature to and from Celsius to Fahrenheit 410, Write a python program to construct the following pattern using nested for loop 411, Write a python program to print prime numbers less than 20, 42. Write a python program to find factorial of a number using recursion. 43, Write a python program to that accepts length of three sides of a triangle as inputs. The program should indicate whether or not the triangle is a right angled triangle (use Pythagorean theorem). 14, Write a python program to define a module to find Fibonacci Numbers and import the ‘module to another program. 415, Write a Python class to reverse a string word by word. Page 11 of 35MSC1O06P: DATA STRUCTURES LAB For all the programs write the output, flowchart and number of basic operations performed. 1. Given {4,7,3,2,1,7,9.0, find the location of 7 using Binary search and also display its first 2. Given {5,3,1,6,0,2,4) order the numbers in ascending order using Quick Sort 3. Perform the Merge sort on the input {75,8,1,16,48,3,7,0} and display the output in descending order 4. Write a program to insert the elements 61,16,8.27 into singly linked list and delete 8,61,27 from the list. Display your list after each insertion and deletion 5. Write a program to add 6x3+10x2+0x+5 and 4x2+2x+1 using linked list. 6. Write a program to push 5,9,34,17,32 into stack and pop 3 times from the stack, also display the popped numbers, 7. Write a recursive program to find GCD of 46,8. 8, Write a program to inert the elements {5,7,0,6,3,9} into circular queue and delete 6,985 from it(using linked list implementation). 9. Given $1={“Flowers”) ; S2=[“are beautiful”) 1) Find the lengtin of SL 'b) Concatenate S1 and $2. ©) Extract the substring “low” from S1 4) Find “are” in S2 and replace it with “is” 10. Write a program to convert an infix expression x*y/(5*2)+2 to its postfix expression, 11. Write a program to evaluate a postfix expression 5 348 2 -* 12, Write a program to create a binary tree with the elements 18,15,40,50,30,17.41 after creation insert 45 and 19 into tree and delete 15,17 and 41 from tree. Display the tree on each insertion and deletion opetation. 13, Write program to create binary search tree withthe elements {2,5,1,3,9,0,6} and perform inorder, preorder and post order traversal 14, Write a program to Sort the following elements using heap sort {9.16,32,8,4,1,5,8.0} Page 12 of 35MSC 1071: QUANTITATIVE, TEACHING AND RESEARCH APTITUDE Total Teaching Hours: 36 No. of Hours / Week: 03 UNIT-1 [8 Hours] Numbers Property — Simplification — Divisibility — HCF and LCM ~ Decimal Fractions Square roots and Cube Roots — Logarithms — Antilogarithms - Surds and indices - Permutation and Combination — Probability — Odd man out series - Number series - letter series — codes — Relationships — classification. UNIT-I (7 Hours) Time and work — Problems on Ages ~ Calendar — Clock — Pipes and Cistetn — Time and Distance — Problems of Train — Boats and Streams. Area ~ Volume and surface Areas ~ Heights and Distances — Data Interpretation: Tabulation ~ Bar Graphs ~ Pie Charts ~ Line Graphs. Data Interpretation - Sources, acquisition and interpretation of data; Quantitative and qualitative data; Graphical representation and mapping of data UNIT- (7 Hours] Simple Interest ~ Compound Interest ~ Stocks and Shares — True Discount ~ Banker's discount ‘Averages ~ Percentage ~ Profit and Loss - Ratio and Proposition ~ Partnership ~ Allegation and. mixture — Chain rule. Understanding the structure of arguments; Evaluating and distinguishing deductive and inductive reasoning; Verbal analogies: Word analogy Applied analogy; Verbal classification; Reasoning Logical Diagrams: Simple diagrammatic relationship, multi diagrammatic relationship; Venn diagram; Analytical Reasoning, UNIT-IV (7 Hours) Teaching: Nature, objectives, characteristics and basic requirements; Leamer’s characteristics Factors affecting teaching; Methods of teaching; Teaching aids, Evaluation systems. Research Aptitude: Meaning, characteristics and types; Steps of research: Methods of research; Research Fthics; Paper, article, workshop, seminar, conference and symposium; Thesis writing: its characteristics and format. Reading Comprehension: A passage to be set with questions to be answered. Communication: Nature, characteristics, types, barriers and effective classroom communication. UNIT-V (7 Hours] Higher Education System: Governance, Polity and Administration; Structure of the institutions for higher learning and research in India; formal and distance education; professional/technical and. general education; value education: governance, polity and administration; concept, institutions Reference L.RS. Aggarwal, Quantitative Aptitude, S. Chand & Company, New Delhi, 2012 2. Govind Prasad Singh and Rakesh Kumar, Text Book of Quickest Mathematics (for all Competitive Examinations), Kiran Prakashan, 2012. 3. RS. Aggarwal, Objective Arithmetic, S. Chand & Company, New Delhi, 2005. Page 13 of 354. Dr. Lal.Jain,Dr. K. C. Vashistha, “U.G.C- NETJRFISET Teaching & Research Aptitude”, Upkar Prakashan, 2010, 5. “UGC NET/SLET: Teaching & Research Aptitude”, Bright Publications, 2010. SECOND SEMESTER MSC MSC201- COMPUTER NETWORKS Total Teaching Hours: 52 No. of Hours / Week:04 UNIT [2 Hours} Introduction: Data Communications, Networks, Network hardware, Network software, Network Types, Internet History, Network Models: Protocol Layering, The OSI Model, ‘TCP/IP Protocol Suite UNIT I [10 hours} Introduction to Physical Layer: Data and signals, Analog and digital transmission, Transmission ‘media, Data Rate Limits, Performance, Introduction to Data-Link- Layer: Link-Layer Addressing, Error Detection and Correction: Bit stuffing, Block Coding, CRC, Checksum, UNIPAIL [10 Hours} Data Link Control: Data-Link Layer Protocols, HDLC, Point-To-Point (PPP), Media Access Control (MAC): ALOHA,pure ALOHA, slotted ALOHA, CSMA, CSMA/CD, CSMA/CA, Reservation, Polling, Token Passing, FDMA, TDMA, CDMA UNITIV [10 Hours} Introduction to Network Layer: Network-Layer Services, Packet Switching, Network-Layer Performance, IPV4 Addresses, Network Layer Protocols: Intemet Protocol (IP), ICMPv4, Mobile IP, Unicast Routing: Routing Algorithms, Unicast Routing Protocols, Next Generation IP: IPv6 Addressing, The IPv6 Protocol. [10 Hours} jon to Transport Layer Introduction, Transport-Layer Protocols, Transport-Layer Protocols: Uset Datagram Protocol, Transmission Control Protocol: TCP Services, TCP Features, ‘Segment, A TCP Connection, TCP Congestion Control, Flow Control, Error Control, Application Layer: WWW, E-MAIL, Domain Name System (DNS), Quality of Service: Flow Control To Improves QoS, Integrated Services, Cryptography and Network Security: Introduction, Confidentiality, Other Aspects of Security Text Bool 1, Bebrouz A. Forouzan, “Data Communications and Networking”, Sth Edition, MeGraw Hill Education, 2013. Page 14 of 35Reference Books: 1, Andrew $. Tanenbaum, David J. Wetherall, “C Hall, 2011 2. Lary L. Peterson and Bruce S. Davie, “Computer Networks A System Approach”, Sth Edition, MKP, 2012. 3. James F. Kurose , Keith W. Ross, * Computer Networking, Top-Down Approach”, Sth Edition, Pearson,2012 ymputer Networks”, Sth Edition, Prentice Web Resources: 1. hitps:/Avww.geeksforgeeks org/computer-network-tutorials! 2. https: //eodescracker.com/networking/https://youtube.com/playlist? list-PLxC2COWd7aiGFBD2-2j0CpWOLU:DLVVV_ ‘MSC202T : ARTIFICIAL INTELLIGENCE Total Teaching Hours: 52 No. of Hours / Week: 04 UNIT [12 Hours] Introduction to Artificial Intelligence: Definition, AI Applications, AI representation. Properties of internal Representation, Heuristic search techniques. Best fist search, mean and end analysis, ‘A* and AO* Algorithm, Minimize search procedure, Alpha beta cutoffs, waiting for Quiscence, Secondary search. UNIFAL (10 Hours} Knowledge representation using predicate logic: predicate calculus, Predicate and arguments, ISA hierarchy, frame notation, resolution, Natural deduction. Knowledge representation using non ‘monotonic logic: TMS (Truth maintenance system), statistical and probabilistic reasoning, fuzzy logic, structure knowledge representation, semantic net, Frames, Script, Conceptual dependency. UNTIL [10 Hours} Planning: block world, strips, Implementation using goal stack, Non linear planning with goal stacks, Hierarchical planning, list commitment strategy-Perception: Action, Robot Architecture, Vision, Texture and images, representing and recognizing scenes, waltz algorithm, Constraint determination, Trihedral and non trihedral figures labeling. UNIT-IV, [10 Hours] Learning: Learning as induction matching algorithms, Failure driver learning, learning in general problem solving concept learning, Neural Networks: Introduction to neural networks and perception-qualitative Analysis only, neural net architecture and applications. Machine Learning, Deep Learning UNIT-V [10 Hours} Natural language processing and understanding and pragmatic, syntactic, semantic, analysis, RTN, ATN, understanding sentences, Expert system: Utilization and functionality, architecture of expert system, knowledge representation, two case studies on expert systems, Page 15 of 35TEXT BOOKS: 1. Stuart Russel, Peter Norvig, “Artificial Intelligence A Modern Approach”, 4th Edition, Pearson Education, 2020. 2, Ela Kumar, “Artificial Intelligence”, IK. International Publishing House Pvt.Ltd, 2008, Reference 1B, Chamaik and D, McDermott,” Introduction to artificial Intelligence", Pearson Education, 1992, 2. Dan W. Patterson, “Introduction to Artificial Intelligence and Expert Systems”, PHI, 2003 3. E. Rich and K. Knight," Artificial Intelligence”, Tata McGraw Hill, 2003. 4. Nils J. Nilson, “Principles of Artificial Intelligence”, Narosa Publishing Co. 2002. MSC203T OBJECT ORIENTED PROGRAMM (G USING JAVA, Unit 1 [15 hrs) The Salient Features of the JAVA Language, The Java Byte Code and the JVM, Structure of a Java Program, Selection Structures, Switch Statement, Looping, The Break and the Continue Statement. Data Types, Operators, Classes, Inheritance, Packages and Interfaces, Exception Handling, String handling. Unit 11 [13 hrs} Threads -Extending the Thread Class, Implementing the Runnable Interface, Thread Priorities, Concurrency and Multithreaded programming, Thread synchronization, Deadlock. Applets - The Life Cycle of an Applet, Creating and Executing Applets, The Attributes in the tag, Passing Parameters to Applets, working with Graphics, Event Handling: Event Classes, Event Listener Interfaces, Unit 1 [10 hrs} Java Design pattems: Singleton, Observer, Adaptor, Proxy, Decorator, Factory, AbstractFactory, Faseade, Command, Template Method patterns, MVC Unit IV (14 hrs} Java Networking ~ Networking Classes and Interfaces, TCPAP Sockets, Datagrams, Server side programming - Java Servlets, JSP, Java XML library - IAXPSpring and Hibernate framework, Spring Flow, Hibemate Flow. XML Parsing - DOM, SAX, Stax. Java Web Services - RESTful Web Services, SOAP Web Services Textbooks: 1. E. Balagurusamy, Programming with JAVA, McGraw Hill, New Delhi, 2007 Reference Books: 1. Raj Kumar Buyya, Object Oriented Programming with IAVA, McGraw Hill, 2009 Page 16 of 352. Herbert Schildt, Java A Beginner’s Guide — Create, Compile, and Run Java Programs Today, Sixth Edition, Oracle Press, 2014 3. Ken Amold, James Gosling, “The Java Programming Language, Fourth Edition, Addison Wisely, 2005 4, Herbert Schi t, ‘The Complete Reference Java, 7th Edition, McGraw Hill, 2007. Web Resources 1. https:/docs.oracle.comyjavase/tutorial/ 2. https://javabeginnerstutorial. com/core-java-tutorial/ MSC204T DATABASE MANAGEMENT SYSTEM ‘Total Teaching Hours: $2 No, of Hours / Week: 04 UNIT [10Hours} Databases and Database Users: Introduction, An example, Characteristics of the Database Approach, Actors on the Scene, Workers behind the Scene, Advantages of Using DBMS. Approach, A Brief History of Database Applications, When Not to Use a DBMS. Database System Concepts and Architecture: Data Models, Schemas, and Instances, Three-schema Architecture and Data Independence, Database Languages and Interfaces, The Database System Environment, Centralized and Client-Server Architectures, Classification of Database ‘Management Systems. UNIT2 [12 Hours} Data Modeling Using Fntity-Relationship Model: Using High-Level Conceptual Data Models for Database Design, An Example Database Application, Entity Types, Entity Sets, Attributes and Keys, Relationship Types, Relationship Sets, Roles and Structural Constraints, Weak Entity ‘Types, Refining the ER Design Company Database Diagrams, Naming Conventions and Design. Issues, File organization and storage, secondary storage devices, operations in file, heap files and sorted files, hashing techniques, type of single level ordered index, multi-level indexes, indexes, ‘on multiple keys, other types of indexes, UNIT-3 [10 Hours] Relational Model and Relational Algebra: Relational Model Concepts, Relational Model Constraints and Relational Database Schemas, Update Operations, Transactions and Dealing with Constraint Violations, Unary Relational Operations: SELECT and PROJECT, Relational Algebra Operations from SET Theory, Binary Relational Operations: JOIN and DIVISION, Additional Relational Operations, Examples of Queries in Relational Algebra UNIT-4 (10 Hours} Relational Database Design: Anomalies in a database, fumetional dependency, normal forms, lossless join and dependency, BCNF, normalization through synthesis, higher order normal forms SQL- SQL. Data Definition and Data Types, Specifying Constraints in SQL, Schema Change Statements in SQL, Basic Queries in SQL, More Complex SQL Queries, Insert, Delete and Page 17 of 35Update Statements in SQL, Specifying Constraims as Assertion and Trigger, Views(Virtual Tables) in SQL, Embedded SQL, Dynamic SQL, UNIT-5 (10 Hours} Introduction to transaction processing, transaction and system concepts, desirable properties of transactions, transaction support in SQL.Concurrency control techniques: two-phase locking techniques, concurrency control based on timestamp ordering, multi-version concurrency control techniques, validation concurrency control techniques. Recovery techniques: recovery concepts, recovery in multi-database systems, database backup and recovery from catastrophic failures, ‘Text Books: 1. Elmasri and Navathe: Fundamentals of Database Systems, 7th Edition, Addison-Wesley, 2016. 2, Silberschatz, Korth and Sudharshan Data base System Concepts, 7th Edition, Tata McGraw Hill, 2019. References: 1, C.J. Date, A. Kannan, S. Swamynatham: An Introduction to Database Systems, 8th Edition, Pearson education,2009 2. Database Management Systems ‘Raghu Ramakrishnan and Johannes Gehrke: , 3rd Edition, MoGraw-Hill,2003 MSC20SP: JAVA LAB 1. Write a Java program that works as a simple calculator. Use a grid layout to arrange buttons for the digits and for the +, -,¥, % operations. Add a text field to display the result. 2. Write a Java program that creates three threads. First thread displays “Good Morning” every one second, the second tread displays “Hello” every two seconds and the third thread displays: “Welcome” every three seconds. 3. Write a java program that simulates a traffic light. The program lets the user select one of three lights: red, yellow, or green. When a radio button is selected, the light is tured on, and only one light can be on at a time No light is on when the program starts 4. Write a Java Program to execute select query using JDBC 5. Write a JAVA program to demonstrate the life cycle of applet 6. Write a Java Program to Implement Producer and Consumer problem using Threads 7. Write a Java Program to Implement DOM parser. 8, Write a Java Program to Implement SAX parser. 9. Write a Java Program to Implement Singleton design pattern using java, 10, Write a Java Program fo Implement Factory and Abstract Factory design pattern using java. 11, Write a Java Program to Implement Observer Design pattern method using java, 12, Write a Java Program to Implement Adapter design design pattern using java 13, Write @ Java Program to Implement proxy design pattem using java 14, Write a Java Program to Implement Helloworld program using servlets. 15, Write a JSP Program using Expression, Scriplet and Directive. Page 18 of 35MSC206P: DATABASE MANAGEMENT SYSTEMS LAB PARTA 1. Draw E-R diagram and convert entities and relationships to relation table for a given scenario, 1. Two assignments shall be carried out ie. consider two different scenarios (eg. bank, college) Consider the Company database with following Schema EMPLOYEE(FNAME, MINIT, LNAME, SSN, BDATE, ADDRESS,SEX, SALARY,SUPERSSN, DNO) DEPARTMENT(DNAME,DNUMBER.MGRSSN,MSRSTARTDATE) DEPT_LOCATIONS(DNUMBER,DLOCATION) PROJECT(PNAME,PNUMBER,PLOCATION,DNUM) WORKS_ON(ESSN,PNO