E—BSANDIP UNIVER SITY School of Computing Science and Engineering Department of Computer Science and Engineering B. Tech Computer Seience and Engineering Semester —V ‘Teaching Scheme eg (Hrs./Week) Examination Scheme 7 ; - Sr. Course Formative | Summative] Total INo. |"! Code eon Assessment] Assessment/Marks, L}T| P}c|_ ca ESE Cours] yp [Cours| yay, e e Formal Languages and - 1 | PC [I7¥CSS01 somata Theery a) le 3] so | — | so} — | 100 2_| Pc |17vCs502| Operating System Bale ines. | soa] sel soni) apo. 3 | PC [I7YCS503{ Internet and Web Programming | 3. | ~ 3| 50 | - | so] — | 100 4 | PC |I7¥CS504] Python Programming Boas) S0, tl esos | meee 100 5 | PC |I7¥CS505, Computer Network Slim fag || 50) gh eal S00 5 | pc hirycssii| memet and Web Programming |_| | yo _ | os] — | a5 | so Laboratory 6 | PC |i7¥cssi2| Python Programming ee ena bao | Ee s|pos | =| osc '(tesg) Laboratory 7_| UC }17¥CSS13| Industry Internship 11 = Se SS TOTAL 15 | 02] 08|21| 250 | 100 | 250 |s0 | 650 Value Added Course (Any One) 1 [vac] vcss11 | Advanced Computer Networks | - [-[4]=| - | 100] - | — | 100 2 [vac] vess12 | loT Architecture and Protocols | - [-|4]-| - | 100] - | — | 100 CIA: Continuous Internal | #: Internship for 15 days. CIA] Weightage Description Assessment *: Oral Examination CAT 10% Gn SRGEIMET L: Theory Lecture UC: University Core CIA2 | 20% | Mid-Term Exam (MTE) T: Tutorial PC: Programme Core P: Practical PE: Programme Elective | C43 Le ee TH: Theory Exam. Scle ROR Research-Based Document Reference Revision No. / Date SUN/SOCSE/BTECH/CSE/2024 R10/20_January_ 2024Year: Cours UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering Ge SANDIP Third Year Semester —V e: Formal Languages and Automata Theory Course Code: 17¥CSS01 Teaching Scheme | Continuous Internal Assessment (CIA) (Hrs. /Week) | Total End Semester Examination P| C) CIA-1] CIA2 | CIA3 | CL ase Lab | Theory | Lab =[3 | 10 20 10_| 10 = 30 = 100 Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) - 00 Hrs. Prerequisit Turing Machine, Logic tives: Odjec 1 To Recall the theoretical underpinnings of Finite Automata, comprehending their significance in the context of formal languages and automata theory. To Recognize the key components and characteristics of regular languages and grammar formalism, To Understand the relationship between Context-Free Grammars and Push Down Automata, including their formal definitions, structures, and limitations. To Utilize Turing Machines, Linear Bounded Automata, and Context-Sensitive Languages to solve computational tasks and demonstrate problem-solving proficiency. To Comprehend the definition and implications of P and NP problems in computational complexity theory. Unit No Det Is Hours Module 1; Fundamentals: Strings, Alphabet, Language, Operations, Finite state machine, definitions, finite automaton model, acceptance of strings, and languages, deterministic finite automaton and non deterministic finite automaton, transition diagrams and Language recognizers. Module 2: Finite Automata: NFA with T transitions - Significance, acceptance of languages. Conversions and Equivalence: Equivalence between NFA with and| 5 without | transitions, NFA to DFA conversion, minimization of FSM, equivalence between two FSM’s, Finite Automata with output- Moore and Melay machines. ‘Module 1: Regular Languages: Regular sets, regular expressions, identity rules, Constructing finite Automata fora given regular expressions, Conversion of Finite Automata to. Regular expressions. Pumping lemma of regular sets, closure | properties of regular sets (proofs not required). Module 2: Grammar Formalism: Regular grammars-right linear and left linear grammars, equivalence between regular linear grammar and FA, inter conversion, | Context free grammar, derivation trees, and sentential forms. Right most and leftmost derivation of strings. Module 1: Context Free Grammars: Ambiguity in context free grammars. Minimization of Context Free Grammars. Chomsky normal form, Greibach normal Document Reference Revision No./Date | Prepared By Appro SUN/SOCSE/B HICSE/2008inst School of Computing Science and Engineering Department of Computer Science and Engineering form, Pumping Lemma for Context Free Languages. Enumeration of Properties of CFL (proofs omitted), Module 2: Push Down Automata: Push down automata, definition, model, acceptance of CFL, Acceptance by final state and acceptance by empty state andits| ‘equivalence. Equivalence of CFL and PDA, inter-conversion. (Proofs not required), Introduction to DCPL and DPDA. Module 1: Turing Machine, definition, model, design of TM, Computable 4 | functions, recursively enumerable languages. ¢ Module 2: Church's hypothesis, counter machine, types of Turing machines (poo | not required). Linear bounded automata and context sensitive language. Module 1: Overview of Compilers: Definition of compilers and their role in software development, Phases of a compiler: Lexical analysis, syntax analysis, | 4 semantic analysis, optimization, code generation, and code optimization, Compiler 5 | front-end and back-end, Module 2: Syntax Analysis: Context-free grammars (CFG), Top-down and bottom- up parsing, LL(1) and LR(1) parsing techniques, Parsing tables and parse tree} 5 generation, Outcomes: ‘Atthe end of the course, the leaner will be able to: T” | Recall the theoretical underpinnings of languages and automata theory. 2 | Demonstrate an understanding of the Key components and characteristics of regular languages and grammar formalism, recognizing their importance within computational theory. 3° | Understand the relationship between Context-Free Grammars and Push Down Automata, including their formal definitions, structures, and limitations, thereby deepening their comprehension of formal language theory. 4 | Utilize Turing Machines, Linear Bounded Automata, and Context-Sensitive Languages to solve computational tasks, showcasing proficiency in problem-solving techniques within the realm of automata theory. 5 | Comprehend the definition and implications of P and NP problems in computational complexity theory, allowing them to analyze and evaluate the efficiency and complexity of algorithms and computational problems. ‘Text Books 3 1, “Introduction to Automata Theory Languages and Computation”. Hoperoft H1 J.D. Pearson Education 2._Introduction to Theory of Computation ~ Sipser 2nd edition Thomson. Reference Book 1. Introduction to Formal Languages Automata Theory and Computation Kamala Krithivasan Rama R. ite Automata and their significance in formal and Ullman 2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley. 3. Theory Of Computation: A Problem-Solving Approach, Kavi Mahesh, Wiley India Pvt. Ltd 4. “Elements of Theory of Computation”, Lewis H.P. and Papadimitriou C.H. Pearson /PHI. | 5. Theory of Computer Science — Automata languages and computation -Mishra and Chandrashekaran, 2nd edition, PHI. Document Reference Revision No. / Date Pi SUN/SOCSE/BTECHICSE2024 | RIO20-Aawary2024 [ : or@—SANvIP UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering Year: Third Year Semester - V Course: Operating System Course Code: 17¥CS502 Teaching | Scheme | Continuous Internal Assessment (CIA) Pd Semester ee (irs. (Week) | L[T [P| C| Cia-t] Cla? [CIA3 | CIAd [Lab| Theory | Lab Ge SSP aL eT 100, Max. Time, End Semester Exam (Theory) - 03 Hrs, | End Semester Exam (Lab) ~ 00 Firs. Prerequisit Basic Electronics, Computer Organization, and Computer Architecture. Objectives: 1 | To Comprehend the concept of multitasking and its role in optimizing system efficiency and user productivity 2 | To Memorize key terms and concepts related to process management and scheduling, such as CPU scheduling algorithms and process states. es 3° | To Remember the fundamental concepts of Process Communication, Deadlock, and Synchronization in Operating Systems, including their definitions, characteristics, and basic principles. 4 | To Apply memory management techniques such as swapping, segmentation, and paging t0 design efficient memory allocation strategies for various operating system environments, considering factors like system architecture and workload characteristics. 5 | To Identify key components and concepts associated with I/O Management, Disk Scheduling, File Management, and Computer Security and Protection. Unit < No Details Hours Module I: Introduction, Architecture of OS, Operating system objectives and functions, Virtual Computers, Interaction of OS and hardware architecture, | 5 | Evolution of operating systems, Batch, multiprogramming. ‘Module 2: Multitasking, Multiuser, parallel, distributed and real -time OS, System calls, OS Shell, Linux Shell commands, Shell programming, Awk programming, | 4 Examples of OS: Linux, MS-Windows, Handheld OS. Module 1: Process Management, Process description, Process states, Process control, Threads, Processes and Threads, Uniprocessor. 2 | Module 2: Scheduling: Types of scheduling. Scheduling algorithms: FCFS, SIP, Priority, Round Robin, UNIX Multi-level feedback queue scheduling, Thread | 5 Scheduling, Multiprocessor Scheduling concept, Real Time Scheduling concept. Module 1: Process Communication and Synchronization. Concurrency: Principles of Concurrency, Mutual Exclusion H/W Suppon, software approaches, Semaphores and Mutex, Message Passing, Monitors, Classical Problems of Synchronization: | 6 3 Readers-Writers Problem, Producer Consumer Problem, Dining Philosopher problem, Module 2: Deadlock: Principles of deadlock, Deadlock Prevention, Deadlock 3 Avoidance, Deadlock Detection, An Integrated Deadlock Strategies. [ Document Reference Revision No./Date | Prepared By Approve [[ SONSocSEIBTECH ICSEGe SANDIP UNIVERSITY School of Computing Science and Engineering, Department of Computer Science and Engineering Module 1: Memory Management, Memory Management requirements, Memory partitioning: Fixed, dynamic partitioning, Buddy System Memory allocation| 5 | Strategies (First Fit, Best Fit, Worst Fit, Next Fit) Module 2: Fragmentation, Swapping, Segmentation, Paging, Virtual Memory, Demand paging, Page Replacement Policies (FIFO, LRU, Optimal, clock), | 4 ‘Thrashing, Working Set Model ! ‘Module 1: 1/0 Management and Disk Scheduling: /]0 Devices, Organization of /O functions, Operating System Design issues, /)O Buffering, Disk Scheduling (FCFS,| 4 SCAN, C-SCAN, STF), Disk Caches. Module 2: File Management: Overview, File Organization and access, File Directories, File Sharing, Security issues, Record Blocking, Secondary Storage Management, Comparative study of Windows and UNIX file system Computer| 5 security and protection: Security Threats, Attacks and assets, Intruders, Malicious sofiware's. Ou tcomes: ‘At the end of the course, the learner will be able to: Demonstrate how multitasking is implemented in operating systems to manage tasks concurrently. 2 | Explain the significance and purpose of CPU scheduling algorithms and process states in operating systems. 3° | Recall the definitions, characteristics, and basic principles of process communication, deadlock, and synchronization. 4 | Design and implement memory allocation strategies using swapping, segmentation, and paging techniques considering different system architectures and workload characteris 5 | Recall key components and concepts related to /O Management, Disk Scheduling, File Management, and Computer Security and Protection. Text Books 1. Operating System Principles, Abraham Silberchatz, Peter B. Galvin, Greg Gagne 8th Edition, Wiley Student Edition. 2._Operating systems - Internals and Design Principles, W. Stallings, 6th Edition, Pearson. Reference Book erschatzand P.B. Gal ed., 2009. 2. Tanenbaum, ‘Modern Operating Systems’, Prentice Hall India, 2003, 3. W. Stallings, “Operating Systems: Internals and designPrinciples’, Pearson Ed., LPE, 6th Ed., 2009. M.J. Bach, ‘Design of Unix Operating system’, Prentice Hall, 1986. 4. Milan Milenkovie "Operating Systems Concepts and Design ", ISBN 9780074632727, TMGH 5. Silberschatz A.Galvin P., Gagne G.,"Operating System Concepts 8e"John Wiley and Sons,2003,ISBN 9812-53-055-X. Andrew S. Tanenbaum,Modem Operating Systems, 3/E, ISBN-13: 9780136006633,PHI M. J. Bach, “The Design of The Unix Operating System”, ISBN: 978-81-203-0516-8, PHI. Charles Crowley, “Operating Systems: A Design-oriented Approach” ISBN:0074635514 “Operating System concepts and principles’, Wiley India, 8th Document Reference TMH By ao ‘SUN/SOCSE/BTECH/CSE2024@D oatenstny School of Computing Science and Engineering Department of Computer Science and Engineering Year: Third Year Semester -V Course: Internet and Web Programming Course Code: 17YC8503 Teaching Scheme (Hrs. | Continuous Internal Assessment (CIA) | El Semester i ans ‘xamination Total L[T [PC] Gat | CA2 | CIA3 | CIA] Lab _| Theory | Lab icf rs oh Gla (eee [ea ed PCT Oe | ee S0isalir 100 Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) — 00 Hrs. Prerequisites: Basies of Computers and Internet, Objectives: || To Explain the interplay between the Internet and the World Wide Web, delineating their respective functions and how they interact to facilitate information exchange globally. 2 | To Explain the role of HTML in creating structured documents for the web. 3 | To Recognize the importance of CSS in web development and its role in separating presentation from content. 4 | To Grasp the relationship between event handlers and user interactions using scripts on a web page. 5__| To Utilize XML, PHP, and MySQL to structure and organize data for web applications. Unit Aa Details Hours Internet and World Wide Web: What is the Internet? Introduction to the applications, E-mail, telnet, FTP, e-commerce, videoconferencing, e-| 4 business. Internet service providers, domain name server, internet address. 1 Module 2: World Wide Web (WWW): World Wide Web and its evolution, uniform resource locator (URL), browsers-internet Explorer, Netscape Navigator, opera, firefox, chrome, Mozilla. Search engine, web saver-apache, IIS, proxy server, HTTP | 5 protocol. Module 1: HTML and Graphics: Text Level formatting, Block Level formatting, List Tags, Hyperlink tags, Image and Image maps, Tabletags, Form Tags, Frame Tags, Executable content tags. Image maps: What are Image maps? Client-side Image maps and server-side Image maps. Tables: Introduction to HTML tables and their structure, The table tags, Alignment, Aligning the Entire Table, Alignment within a row, Alignment within a cell, Attributes, and Alll color tags. 2 | Module 2: Frames: Introduction to Frames, Applications, Frames document, The tag, Nesting tag, Placing content in frames with the | tag Forms: Creating Forms, The

tag, Named Input fields, The tag, ‘Multiple lines text windows, Drop down and list boxes, Hidden, Text, Text Area,| 5 Password, File Upload, Button, Submit, Reset, Radio, Checkbox, Select, Option, Forms and Scripting. Action Buttons. Document Reference Prepared. By Approved SUN/SOCSE/BTECHICSE/2024es) aa VE re] a School of Computing Science and Engineering Department of Computer Science and Engineering . Module 1: Cascading Style Sheets (CSS): Properties Table: Using the style Attribute, Creating Classes and IDs, Generating External Style Sheets, Typography, | 4 Consistency, Types of styles, Specifying class within HTML document. Module 2: Style placement: Inline style, Span and div tags, header styles, Text and font attributes: Font Vs CSS, changing fonts, text attributes, Advance CSS| 5 properties: Backgrounds, Box properties and Positioning Module 1: Java Seript: Introduction, Client-Side JavaScript, Server-Side JavaScript, JavaScript Objects, JavaScript Security, Operators: Assignment Operators, Comparison Operators, Arithmetic Operators, % (Modulus), ++(Inerement), (Decrement), (Unary Negation), Logical Operators, Short-Circuit Evaluation, String Operators, Special Operators:?(Conditional operator), (Comma operator), delete, 4 | new, this, void. Module 2: Events and Event Handlers: General Information about Events, Defining Event Handlers, event, onAbort, onBlur, onChange, onClick, onDbIClick, onDragDrop, onError, onFocus, onKeyDown, onKeyPress, onKeyUp. onLoad,| 5 ‘onMouseDown, ‘onMouseMove, ‘onMouseOut, onMouseOver, ‘onMouseUp,onMove, onReset, onResize, onSelect, onSubmit. onUnload, Module I: Introduction to XML: Introduction to XML, Anatomy of an XML, | 4 document, Creating XML Documents, Creating XML DTDs, XML Schemas, XSL. Module 2: PHP and MySQL: Why PHP and MySQL?. Server-side web scripting, 5 | installing PHP, Adding PHP to HTML, Syntax, and Variables, Passing information & between pages. Strings, Arrays and Array Functions, Numbers, Basic PHP errors/problems. Guicomes: ‘At the end of the course, the learner will be able to: 1 [Recall the definitions of the Internet and the World Wide Web, and list their respective functions, 2 | Explain the purpose of HTML in structuring web documents and its role in defining the content of a webpage. 3 | Apply CSS styles to HTML elements to modify the appearance of a webpage, demonstrating the separation of presentation from content. 4 _| Explain how event handlers enable user interactions on a webpage and respond to user actions. 5 | Create'@ dynamic web application that utilizes XML for data structuring, PHP for server-side processing, and MySQL for data storage and retrieval, demonstrating the integration of these technologies in web development. ‘Text Books I. Ieffrey C.Jackson, "Web Technologies--A Computer SciencePerspective", PearsonEducation, 2. DeitelandDeitel, Goldberg, “Internet and World Wide Web How to Program”, Pearson Education Asia, 2011 Reference Book 1.” Web Design The Complete Reference, Thomas Powell, TataMeGrawHill 2. HTML and XHTML The Complete Reference, Thomas Powell, Tata MeGraw-Hil 3. JavaScript 2.0: The Complete Reference, Second Edition by Thomas Powell and 4. PHP: The Complete Reference By Steven Holzner, TataMeGrawHill Document Reference “Approved\By SUN/SOCSE/BTECH/CSE/2024Bret School of Computing Science and Engineering Department of Computer Science and Engineering Year: Third Year Semester: V Course: Python Programming Course Code: I7YCS504 Teaching Scheme | Continuous Internal Assessment End Semester (Hrs. Week) (cla) Examination ae Ltr fe] Oe | | SA] cl Tap | Teory | Lab she [=o fe LO 30 = 100 ie, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) — 00 Hrs. Prerequisites: Fundamentals of Java, Object Oriented Concepts. Objectives: 1 | To Demonstrate comprehension of Python program flow control mechanisms. including loops, conditional statements, and exception handling. 2 | To Explain the significance of modules and packages in organizing and structuring Python code. 3 | To Remember the fundamentals of multithreading and Python database programming by recalling key concepts, terminology, and syntax. [4 | To Interpret the significance of different fields and widgets in Django models forms. 5__| To Explain the purpose and advantages of using NumPy and Pandas in Python programming. Unit Details Hours No Module 1: Introduction: Installation and Working with Python, Jupiter 4 Anaconda, Python Identifiers and Keywords, Data Types Manipulations, Operators, Module 2: Python Program Flow Control: Understanding of Flow Control. Conditional statements using if, elif, and else. Iterative statements using For Loop and While Loop. Transfer statements using Break, continue, and pass statements. Loop Manipulation. For Loop using range, string, list, and dictionary datatypes Comparison of string, list and dictionary datatypes Module 1: Module and Packages: Introduction of Modules in Python, Renaming a a Module, Reloading a Module, Various Possibility of Imports, Introducing special variables in Python, Working in different types of modules, Module vs Packages, How to Packages working in Python. Module 2; Fundamentals of Object orientation: Class, Object, Constructor, ‘Types of Variables, Methods and their types, Importing Class, OP's Concepts: Inheritance, Encapsulation, Abstraction, Polymorphism, File handling: text, | binary, CSV, Excel, Exception handling: try, except, else. Module 1: Multithreading: Types of Multi-Threading in Python, Process base ‘Tasking, Thread base Tasing, creating thread by using extending thread class, Document Reference Revision No. / Date Pry SUN/SOCSEIBTECHICSE/2024Geranviv UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering Thread Identification Number. Daemon Threads. Synchronization of Threading. Synchronization by using the lock concept. Lock and Rlock. Bounded ‘Semaphore, Inter Thread Communication. Types Of Queues. Module 2: Python Database Programming: Standard Steps for Python DB Programming, ‘Module 1: Django: Introduction To Web Development and Django, Django and 5 Various IDLE Installation and Development of First Web Application, Django ‘Templates and Static Files, Working with Models and Databases, Working with Django Forms. Module 2: Working with Django Models Forms: Session Management, User 4 Authentication and Authorization, Working with Django Middleware. Module 1: NumPy: (Numerical Python): Introduction to Numpy, Data types of s arrays, Dealing with ndarrays, copies and views, Arithmetic operations, Indexing, Slicing, splitting arrays, Shape manipulation, Stacking together different data Module 2: Pandas: Pandas: (Data Analysis): Data Frame and Series, Data Frame operations, Data Slicing, indexing, Data Frame functions, Reading the files-esv, excel. Outcomes: 1 ‘At the end of the course, the learner will be able to: Explain how loops, conditional statements, and exception handling alter program flow and | ion based on certain conditions or criteria. Apply the concept of modules and packages to break down a large Python codebase into 2 | smaller, manageable components and demonstrate how to import and use them in different contexts. 3 _ | Recall key concepts, terminology, and syntax related to multithreading and Python database programming. =| 4 _| Utilize different fields and widgets effectively within Django model forms to create interactive and user-friendly web forms for data input and manipulation. Apply NumPy and Pandas libraries in Python code to perform tasks such as data 3 | manipulation, statistical analysis, and numerical computations, leveraging their advantages such as efficiency, convenience, and versatility Text Books 2._Learing Python - By Mark Lutz I. Python Cook Book - David Beazley and Brian K. Jones Reference Book i ch Python Crash Course - By Eric Matthes Fluent Python - By Luciano Ramalho Docum went Reference | _ Revision No. / Date Approvi SUN/SOCSE/BTECHICSE: 3 ed ix a isESSANVIvP UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering. Year: Third Year Semester — V. Course: Computer Networks Course Code: 17YCS505 Teaching — | Scheme (irs. | Continuous Internal Assessment (CIA) | End Semester Week) xamination Total L{T{P | C | cia-t | Cia-2 | Cia-3 | CA Lab | Theory Lab 3[-[-[3 10 20 10. 10 : 50 - 100 Max. Time, End Semester Exam. (Theory) - 03 Hrs. End Semester Exam (Lab) -00 Hrs. Prerequisites: Basics of Computer Networks and Data Communications Object iprehensive understanding of computer networks, including th basic concepts, components, and functionalities. a ‘To familiarize students with various network topologies and their implications on network performance and scalability, 3 To introduce students to the OSI (Open Systems Interconnection) and TCP/IP (Transmission Control Protocol/Internet Protocol) models, highlighting their layered architecture and the role of each layer. To explain the importance of network protocols and standards in facilitating communication and interoperability among networked devices. To instill in students the ability to analyze and evaluate different types of computer networks based on their architectures, technologies, and applications, Unit No Details Hours Module 1: Introduction to Computer Networks :Overview of computer networks, Historical development and evolution of networking, Basic terminology and| 4 concepts (¢.2.. protocols, OSI model), Types of networks (¢.g.. LAN, WAN, MAN) Module 2: Network Architecture and Protocols : TCP/IP protocol suite, OSI reference model and its layers, Comparison of TCP/IP and OSI models, Addressing | 5 schemes (¢.g.. IPv4, IPV6), Introduction to routing and switching, Module 1: Network Devices and Technologies: Overview of network devices (ea. routers, switches, hubs, NICs), Funetions and roles of network devices, Ethernet and | 4 wireless technologies, Network topologies (e.g., star, bus, ring), Introduction to network security principles. Module 2: Data Transmission and Media: Basics of data transmission, Transmission media (e.g. twisted pair, fiber optic, wireless), Signal types and |, modulation techniques, Data encoding and transmission methods, Error detection and correction techniques. Module 5: Local Area Networks (LANs): LAN architectures and standards (e.g thernet, Wi-Fi), LAN protocols and technologies (e.g. CSMA/CD, Ethernet frame structure), LAN switching concepts (e.g., VLANs, STP), LAN troubleshooting and management \ Document Reference 7 = [Approved By SUN/SOCSE/BTECHICSE/2024@BSAnviv- UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering Module 2: Wide Area Networks (WANs): WAN technologies and protocols (2, PPP, HDLC, MPLS), Circuit-switched vs. packet-switched networks, WAN. connectivity options (e.g., leased lines, ISDN, DSL), WAN troubleshooting and optimization. Module 1: Network Seurity: Introduction to network security principles, Common network security threats and vulnerabilities, Security protocols (e.g., SSL/TLS, IPsec), Access control mechanisms (e.g.. firewalls, VPNs), Intrusion detection and. 4 _ [Prevention systems. ‘Module 2: Network Management and Administration: Network management protocols (e.g. SNMP), Network monitoring and performance analysis, Configuration management and backup strategies, Troubleshooting methodologies and tools, Network documentation and reporting. Module 1: Wireless and Mobile Networking: Fundamentals of wireless communication, Wireless LAN standards (e.g., IEEE 802.11), Mobile networking concepts (e.g., cellular networks, mobile IP), Wireless security considerations Emerging trends in wireless technology. 5 | Module 2: Emerging Technologies and Future Trends: Overview of emerging networking technologies (e.g, SDN, loT), Cloud computing and its impact on networking, Virtualization and network function virtualization (NFV), Future trends | 4 in networking (e.g., 5G, edge computing), Ethical and societal considerations in networking advancements Outcomes: ‘At the end of the course, the learner will be able to: 1 | Describe the fundamental principles and characteristics of computer networks, including their types, functions, and applications. 2 | Identify and compare various network topologies, selecting appropriate designs based on specific network requirements. 3° | Demonstrate proficiency in explaining the OST and TCP/IP models, illustrating the flow of data through different layers and the functions performed at each layer. 4 [Analyze network protocols and standards, recognizing their role in ensuring reliable and efficient communication in heterogeneous environments 5 Develop the skills to evaluate real-world network scenarios, proposing suitable solutions and configurations to address specific networking challenges or objectives. Text Books 1. Data Communications and Networking, Behrouz A, Forouzan, Fourth Edition TMH, 2006. 2. Computer Networks, Andrew S Tanenbaum, 4th Edition. Pearson Education, PHI. Reference Book 1. Data Communications and Computer Networks, P.C. Gupta, PHI. 2. An Engineering Approach to Computer Networks, S. Keshav, 2nd Edition, Pearson Education. 3. Understanding Communications and Networks, 3rd Edition, W.A. Shay, Cengage Learning. 4. Computer Networking: A Top-Down Approach Featuring the Internet. James F. Kurose and Keith W. Ross, 3rd Edition, Pearson Education. 5. Data and Computer Communication, William Stallings, Sixth Edition, Pearson Education, 2000. Document Reference Revision No. / Date ap 5: Paro SUN/SOCSE/BTECH/CSE/2024 i~|-See any UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering Year: Third Year Semester — V Course: Internet and Web Programming Laboratory Course Code: 17YCS511 ‘Teaching F Scheme | Continuous Internal Assessment (CLA) | Pad Semester Total (Hrs. /Week) L]T]P|C | Cia-1] CIA-2 [CIA-3] CIA-] Lab | Theory | Lab 4 0 = Sa 0 25 30 Max. Time, End Semester Exam (Theory) -00 Hrs. | End Semester Exam (Lab) - 03 Hrs. Prerequisites: C C++, Basies of Computer Networks and Data Communications To Identify key components and technologies used in web programming, such as HTML, _CSS, and JavaScript. 2 | To Comprehend the significance of web standards and their impact on interoperability and accessibility. 3 | To Utilize appropriate programming languages and frameworks to develop interactive and dynamic web applications. Guidelines for Assessment Term Work assessment shall be conducted for the Project, Tutorials, and Seminar. Term work is continuous assessment based on work done, submission of work in the form of a reportfjournal, timely completion, attendance, and understanding. It should be assessed by a subject teacher of the institute. At the end of the semester, the final grade for a Term Work shall be assigned based on the performance of the student and is to be submitted to the University. ‘The experiments from the regular practical syllabus will be performed (15 Marks). The regular attendance of students during the syllabus practical course will be monitored and marks will be given accordingly (S Marks). Good Laboratory Practices (5 Marks) ines for Laboratory Conduction |/Oral/Presentation shall be conducted and assessed jointly by internal and external examiners. The performance in the Practical/Oral/Presentation examination shall be assessed by at least a pair of exar ted as examiners by the University. The examiners will prepare the mark/grade sheet in the format specified by the University, authenticate and seal it. A sealed envelope shall be submitted to the head of the department or authorized person, ‘One experiment from the regular practical syllabus will be conducted, (Total 15 Marks). Complete laboratory journal/records (05 Marks). Viva-voce (05 Marks). Operating System recommended: Programming tools recommended: Suggested List of Laboratory Assignments Document Reference ‘SUNISOCSE/BTECH/CSE/2024eS SANDIP UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering Group A (Compulsory Assignments) I. Design a web page using different text formatting tags. 2. Design a web page with links to different pages and allow navigation between pages. 3. Design a web page with Image maps. 4, Design a web page with different tables. De: appears well-placed. 5. Design a webpage using frames. 6, Design a web page with a form that uses all types of controls. 7. Design a website using style sheets so that the pages have uniform style. 8. Using Java Script design a web page that prints factorial / Fibonacci series / any given series, 9. Design a form with a text box anda command button, Using JavaScript write a program whether the number entered in the text box is a prime number ot not. 10. Design a form and validate all the controls placed on the form using JavaScript. 11. Design a DTD, and corresponding XML document, and display it in the browser using CSS. 12. Design an XML document and 13. Design XML Schema and corresponding XML document. 14 Write a Basie PHP program to display “Hello World” using PHP programming. a webpage using a table so that the content play it in the browser using XSL. Outcomes: At the end of the course, the learner will be able to: Explain the roles and functions of HTML, CSS, and JavaScript in web development, demonstrating comprehension of how they contribute to building web applications. 2 Apply knowledge of web standards to evaluate and optimize web applications for improved interoperability and accessibility, demonstrating an understanding of their practical implications. Recall the programming languages and frameworks commonly used for developing interactive and dynamic web applications. Document Reference SUN/SOCSE/BTECHICSE/2024Gea UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering Year: Third Year Semester—V Course: Python Programming Laboratory Course Code: 17YCS512 Teaching Sehieme | Continuous Internal Assessment (CIA) | Pid Semester Total | (Hrs. Week) | la L|T P| C CIA | ClA-2 | CIA-3 | CIA- | Lab Theory | Lab 4 dlol4l2[ — = = Sms aoe. 25 30 Max. Time, End Semester Exam (Theory) -00 Hrs. _End Semester Exam (Lab) — 03 Hrs. Prerequisi Basic Networking Skills and Python Programming. Objectives: I ‘To Memorize key terminology and language features specific to Python and Ruby on Rails. 2 _ | To Interpret and explain code snippets written in Python and Ruby on Rails, 3° | To Develop, debug, and optimize Python and Ruby on Rails programs to achieve specific functionalities and meet given requirements. i Guidelines for Assessment ‘Term Work assessment shall be conducted for the Project, Tutorials, and Seminar. Term work Is continuous assessment based on work done, submission of work in the form of report/journal, timely completion, attendance, and understanding. It should be assessed by the subject teacher of the institute, At the end of the semester, the final grade for a Term Work shall be assigned based on the performance of the student and is to be submitted to the University. |. ‘The experiments from the regular practical syllabus will be performed (15 Marks). 2. The regular attendance of students during the syllabus practical course will be monitored and marks will be given accordingly (5 Marks). 3. Good Laboratory Practices (S Marks) Guidelines for Laboratory Conduction Practical/Oral/Presentation shall be conducted and assessed jointly by internal and extemal examiners. The performance in the Practical/Oral/Presentation examination shall be assessed by at least a pair of examiners appointed as examiners by the University. The examiners will prepare the mark/grade sheet in the format specified by the University, authenticate and seal it, A sealed envelope shall be submitted to the head of the department or authorized person. 1. One experiment from the regular practical syllabus will be conducted. (Total 15 Marks) 2. Complete laboratory journal/records (05 Marks). 3. Viva-voce (05 Marks) Operating System recommended: Programming tools recommended: Suggested List of Laboratory Assignments Group A (Any 13) Document Reference SUN/SOCSE/BTECHICSE/2024 "CS \pproved BIeae UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering Implement a Python program to Calculate the GCD of two numbers. Implement a Python Program to calculate the square root of a number by Newton's Method. Implement a Python Program to find the largest number from a list of numbers. Implement a Python Program to perform a Liner search 5. Implement a Python Program to perform a Binary search Implement a Python Program to perform insertion sort. Implement a Python Program to perform selection sort. Implement a Python program to multiply matrices. Implement a Python program to calculate the most frequent words in a text from a file. ). Implement function overloading with different function signatures. - Implement the concept of class, instances, and inheritance. . Implement internal and external libraries. . Solve algorithmic problems by program using different problem-solving strategies. . Search content using a regular expression library in Python. 3. Implement Matrix multiplication using multi-threading in Python. . Perform Linux administration tasks using Python. GroupB (Any 1) Sending Emails with Python Django Chat App Group C: (Compulsory): Mini Project. I Note: Instructor may change project topi Project Development for Flight Ticket Price Predictor and reservation using Python in consultation with Dean and HOD of the School. ‘Outcomes: At the end of the course, the learner will be able to: 1 | Recall key terminology and language features by rote memorization. 2 _| Explain the meaning of code snippets by interpreting their functionality and purpose. 3 _ | Use acquired knowledge to develop, debug, and optimize programs in Python and Ruby on Rails to fulfill specific requirements. Document Reference Revision No. / Date B ‘Approved BDV? SUN/SOCSE/BTECH/CSE/2024SD iavensiry ee School of Computing Science and Engineering Department of Computer Science and Engineering Year: Third Year Semester ~V Course: Industry Internship-I1 Course Code: 17YCSS13 Teaching Scheme (Hrs. | Continuous Internal Assessment (CIA) | End Semester Examination Total veel) L[T|P[C | Clas | CIA? | CAS | CIA | Lab | Theory | Lab Sejm aula a = = 30 Max. Time, End Semester Exam (Theory) 0 Hrs. End Semester Exam (Lab) —= - Hrs, Prerequisites: Problem Solving Sills and Project Formulation Skills. Objectives: 1 | To Apply theoretical concepts learned in academic settings to real-world sit in the | industry. communication skills, and problem-solving abilities. 2) To Acquire and enhance specific skills relevant to the field of study, such as technical skills, colleagues. which can be valuable for future career opportunities. objectives and gaining hands-on experience in project management and execution. 3 | To Gain exposure to the professional work environment, including industry practices, work cthies, and the overall culture of the workplace. 4 | To Build a professional network by connecting with industry professionals, mentors, and 5 | To Work on real projects or assignments within the industry, contributing to the organization's Details Hours Course (catalog) description: As a part of the B. Tech Curriculum, Industry Internship is a Practical course, in which the students of CSE are trained in presentation skills. Grading: The Course is graded based on: Presentation: 50% Student's reports: 50% Employers Expectations: Source of highly motivated pre-professionals. Students bring new perspectives to old problems. Visibility of your organization is increased on campus. Quality candidates for temporary or seasonal positions and projects. Freedom for professional staff to pursue more creative projects. Flexible, cost-effective workforce not requiring a long-term employer commitment. ‘The proven, cost-effective way to recruit and evaluate potential employees. ‘Your image in the community is enhanced as you contribute your expertise to the educational enterprise. 15 Days \ Document Reference Pi 7 Approv, oy ‘SUN/SOCSE/BTECHICSE/2rent School of Computing Science and Engineering Department of Computer Science and Engineering ‘Outcomes: ‘AL the end of the course, the learner will be able to: |] Demonstrate an improved understanding of how theoretical knowledge translates into practical solutions and applications within a specific industry. 2 | Showcase enhanced proficieney in the skills relevant to the internship, such as programming Janguages, software tools. or industry-specifie techniques. 3 | Develop adaptability and resilience by navigating challenges within the industry setting, demonstrating the ability to learn quickly and respond to dynamic work environments. 4 | Establish a broader professional network by connecting with colleagues, supervisors, and professionals in the industry, creating potential opportunities for mentorship and future collaborations. 3 | Gain insights into the industry Tandseape, roles, and responsibilities, helping to clarify career goals and providing a foundation for making informed decisions about future career paths. SUN/SOCSEIBTECHICSE/2024SANDIP UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering Year: TI Year ‘Semester —V Course: Advanced Computer Networks. Course Code: VCSSI1 pee . End Semester Ets rs. Continuous Internal Assessment (CIA) Teun ination! Total L[T|P|C | CiA-t | CIA2 | CIA3 | CIA-4| Lab | Theory [ Lab Sedalia iar : Bie ibaa 100 = =e 0100, Max. Time, End Semester Exam (Theory) - 02 Hrs. End Semester Exam (Lab) ~ 00. Hrs. Prerequisites: Basics of Computer Networks and Data Communications ‘Objectives: 1 | To Recall the fundamental concepts and terminologies related to advanced computer networks. 2 | To Demonstrate the implementation of specific protocols and IEEE standards to address framing and error detection and correction issues in computer networks. 3 | To Describe how logical addressing and various routing protocols function within advanced computer networks. 4 To Assess the performance and effectiveness of UDP and TCP protocols in relation to data traffic and QoS requirements. 5 ‘To Use the key protocols such as DNS, SMTP, FTP, HTTP, and SNMP used in internet communication. Nat | Details Hours Module 1: Components ~ Direction of Data flow — Networks — Components and Categories — Types of Connections ~ Topologies Protocols and Standards — ISO / 4 , | OSL model, Example Networks such as ATM. Module 2: Frame Relay, ISDN Physical layer: Transmission modes, Multiplexing, Transmission Media, Switching, Circuit Switched Networks, Datagram Networks, 5 Virtual Circuit Networks. ‘Module 1: Introduction, Framing, and Error — Detection and Correction — Parity — LRC-CRC Hamming code, Flow and Error Control, Noiseless Channels, Noisy} 4 2 Channels. HDLC. Module 2: Point to Point Protocols. 111 Medium Access sub layer: ALOHA, CSMA/CD, LAN -Ethernet IEEE 802.3, IEEE 802.5 - IEEE 802.11, Random s access, Controlled access, Channelization. Module 1: Logical Addressing, Internetworking, Tunneling, Address mapping, | 4 3 ICMP. IGMP. Module 2: Forwarding, Uni-Cast Routing Protocols, Multicast Routing Protocols. 2. 4g _ | Module 1: Process to Process Delivery. UDP and TCP protocols, Data Traffica) Congestion, Congestion Control. Document Reference Revision N Prepared By oN SUN/SOCSE/BTECH/CSE/2024SANDIP UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering | Module 2:QoS, Integrated Services, Differentiated Services, QoS in Switched 5 Networks. 5 _ | Module 1: Domain name space. DNS in internet, electronic mail. 4 Module 2: , SMTP. FTP, WWW, HTTP, SNMP. 5 Outcomes: ‘At the end of the course, the learner will be able to: || Explain the basic principles behind each fundamental concept and terminology in the context of advanced computer networks. 2 | Implement specific protocols and IEEE standards to solve framing and error detection and -orrection issues in practical scenarios. Compare the effectiveness of different routing protocols in various network scenarios, 4 | Describe the key differences between UDP and TCP protocols in terms of their functionality and use cases, 5 | Utilize key intemet communication protocols (DNS, SMTP, FTP, HTTP, SNMP) in practical network configurations and troubleshooting scenarios. ‘Text Books 3. Data Communications and Networking, Behrouz A. Forouzan , Fourth Edition TMH, 2006, 4. Computer Networks, Andrew $ Tanenbaum, 4th Edition. Pearson Education, PHI. Reference Book 5. Data communications and Computer Networks, P.C Gupta, PHI. 6. An Engineering Approach to Computer Networks, S. Keshav, 2nd Edition, Pearson Education. 7. Understanding communications and Networks, 3rd Edition, W.A. Shay, Cengage Leaming. 8. Computer Networking: A Top-Down Approach Featuring the Internet. James F. Kurose & Keith W. Ross, 3 rd Edition, Pearson Education. 9. Data and Computer Communication, William Stallings, Sixth Edition, Pearson Education, 2000. Document Reference Revision No. / Date Prepared By ‘Appieved SUN/SOCSE/BTECH/CSE/2024 | R-10/20-tanuary 2024 = aeSANDIP School of Computing Science and Engineering Department of Computer Science and Engineering Year: Third Year Semester-V Course: IOT Architecture & Protocols Course Code:VCS513 Teaching Scheme (Hrs. | Continuous Internal Assessment (CIA) | End Semester wen Examination Total L [rip {C {cia | ciaz | cas [eras] tab | Theory [tab ai 2 =| 100 = 100 Max. Time, End Semester Exam (Theory) “02 Hrs, End Semester Exam (Lab) —00 __ Hrs. [Prerequisit s Basics of Computer Networks and Data Communications Objectives: 1 [To Identify the key components involved in the Togical design of loT systems and describe the basic principles of Radio Frequency Identification (RFID) and its applications in loT. 2] To Recall the key functions and components of the PHY/MAC layer in loT architecture and learn the primary roles and protocols associated with the Network layer in loT systems. 3 | To Describe the role and importance of the Transport Layer and Session Layer in ensuring reliable communication in loT systems. 4 [To Examine and differentiate between various IoT security protocols and evaluate their effectiveness in mitigating vulnerabilities and addressing security requirements and threats. 3__| To Utilize various software tools and platforms for developing loT solutions, Unit No Details Hours. ‘Module 1: Introduction: Enabling Technologies of loT, Logical Design of loT, loT | communication Models, loT Communication APIs 4 Cloud Services: AAS, PAS, SAAS. loT Specific Cloud Services Module 2: RFID: Introduction to RFID and its Applications in loT | Module 1: PHY/MAC Layer: Wireless HART, ZWave, Bluetooth Low Energy, 2 | Zighee Smart Energy. Module 2: Network Layer: IPv4, IPv6, 6LOWPAN, ICMP, RPL,COAP. 3 | Module 1: Transport Layer: (TCP, UDP, DCCP, SCTP)(TLS, DTLS) Module 2: Session Layer: HTTP. CoAP, XMPP. AMQP. MQTT Module 1: Vulnerabilities Security Requirements and Threat Analysis, Misuse | 4 | Cases, loT Security Tomography, and Layered Attacker Model. ‘Module 2: Identity Management and Establishment, Access Control and Secure Message Communi Security Models, loT Security Protocols. Module 1: Software for loT Development Boards like Arduino, Raspberry Pi, 3 | Beagle Bone, Intel Galileo: IDE, Simulator, Emulator, Debugger, OS , Sofiware | 5 Libraries for Internet Document Reference | Revision No. / Date Prepared By pproved By SUN/SOCSE/BTECHICSE/2024 \SANDIP UNIVERSITY School of Computing Science and Engineering Department of Computer Science and Engineering connectivity Module 2:loT Case Studies: Smart Cities, Agriculture a (Outcomes: ‘At the end of the course, the learner will be able to: TJ Recall the key components involved in the logical design of loT systems and the basic principles of Radio Frequency Identification (RFID) and its applications in 1oT. 2 | Explain the key funetions and components of the PHY/MAC layer in loT architecture and the primary roles and protocols associated with the Network layer in IoT systems. 3 | Analyze the role and importance of the Transport Layer and Session Layer in ensuring reliable communication in loT systems. 4 Apply knowledge of various IoT security protocols to evaluate their effectiveness in ting vulnerabilities and addressing security requirements and threats, e various software tools and platforms for developing 1oT solutions. Text Books 1. Jeeva Jose, “Internet of Things”, ISBN-10 : 938617359X, Khanna Book Publishing, 2018 2. Raj Kamal, Internet of Things: Architecture and Design Principle” , ISBN-13: 978-93-5260- 522-4, McGraw Hill Education (India) 2017 Reference Book I. The Internet of Things: From RFID to the Next-Generation Pervasive Networked Lu Yan, Yan Zhang, Laurence T. Yang, Huansheng Ning 2. Designing the Intemet of Things . Adrian McEwen (Author), Hakim Cassimally Document Reference Revision No. / Date Prepared By proved By SUNISOCSE/BTECH/CSE/2024 : 3)