Scheme of examination
Participating in a Group Discussion
Yüklə 1,11 Mb.
|
| Participating in a Group Discussion -- Structure and dynamics of a GD; Techniques of effective participation in group discussion; Preparing for group discussion; Accepting others’ views / ideas; Arguing against others’ views or ideas, etc.
Participating in Mock Interviews -- Job Interviews: purpose and process; How to prepare for an interview; Language and style to be used in an interview; Types of interview questions and how to answer them. Suggested Lab Activities:
Reference Books:
Note: The Communication Skills Lab should be equipped with computers, microphones, an internet connection, overhead projector, screen, sound system, audio/video recording facilities, and seating arrangement for GDs and mock interviews. The student activities may be recorded and students may replay them to analyse and improve their pronunciation, tone, expressions, body language, etc. Traditional language lab softwares are not mandatory and may be used by students to practice and enhance their language competence. Such softwares are usually elementary in nature and are mostly based on British/American English (pronunciation, accent and expression). They should preferably be in Indian English. COMPILER DESIGN Paper Code: ETCS-302 L T/P C Paper: Compiler Design 3 1 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be of 12.5 marks.
Objective: This course aims to teach students the principles involved in compiler design. It will cover all the basic components of a compiler, its optimizations and machine code generation. Students will be able to design different types of compiler tools to meet the requirements of the realistic constraints of compilers. UNIT- I Brief overview of the compilation process, structure of compiler & its different phases, lexical analyzer, cross compiler, Bootstrapping, quick & dirty compiler, Shift-reduce parsing, operator- precedence parsing, top-down parsing, predictive parsing ,LL(1) and LL(k) grammar, bottom up parsing, SLR, LR(0), LALR parsing techniques. [T1][T2][R1][No. of Hrs. 12] UNIT- II Design and implementation of a lexical analyzer and parsing using automated compiler construction tools(eg. Lex, YACC, PLY), Syntax-directed translation schemes, implementation of syntax directed translations, intermediate code, postfix notation, three address code, quadruples, and triples, translation of assignment statements, Boolean expressions, control statements, Semantic Analysis, Type Systems, Type Expressions, Type Checker, Type Conversion [T2][R1][R3][R4][R5][No. of Hrs. 12] UNIT- III Symbol table, data structures and implementation of symbol tables, representing scope information. Run Time Storage Administration, implementation of a simple stack allocation scheme, storage allocation in block structured languages and non block structured languages, Error, Lexical-phase errors, syntactic-phase errors, semantic errors.
The principle sources of optimization, loop optimization, the DAG representation of basic blocks, value number and algebraic laws, global dataflow analysis, Object programs, problems in code generation, a machine model, a single code generator, register allocation and assignment, code generation from DAGs, peephole optimization. [T1][T2] [No. of Hrs. 10] Text Books: [T1] Alfred V. Aho & J.D. Ullman, “Compiler Principles ,Techniques& Tools”, Pearson [T2] Kenneth C. Louden, “Compiler Design”,Cengage Publication
[R1] Kakde O.G., “Complier Design”, Laxmi Publication [R2] Trembley and Sorenson, “Theory and Practice of Compiler Writing”, McGraw Hill [R3] Vinu V. DAS, “Compiler Design Using FLEX and YACC , PHI [R4] Jhon R. Levine, Tony Mason and Doug Brown, “Lex &Yacc”, O’Reilly.pdf [R5] Andrew W. Appel, Maia Ginsburg, “Modern Compiler Implementation in C”, Cambridge University Press OPERATING SYSTEMS Paper Code: ETCS-304 L T/P C Paper: Operating Systems 3 1 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be of 12.5 marks.
Objective: The goal of this course is to provide an introduction to the internal operation of modern operating systems. The course will cover processes and threads, mutual exclusion, CPU scheduling, deadlock, memory management, and file systems. UNIT I Introduction: What is an Operating System, Simple Batch Systems, Multiprogrammed Batches systems, Time-Sharing Systems, Personal-computer systems, Parallel systems, Distributed Systems, Real-Time Systems, OS – A Resource Manager. Memory Organization & Management: Memory Organization, Memory Hierarchy, Memory Management Strategies, Contiguous versus non- Contiguous memory allocation, Partition Management Techniques, Logical versus Physical Address space, swapping, Paging, Segmentation, Segmentation with Paging Virtual Memory: Demand Paging, Page Replacement, Page-replacement Algorithms, Performance of Demand Paging, Thrashing, Demand Segmentation, and Overlay Concepts. [T1] [T2][R2][R3] [No. of hrs. 10] UNIT II Processes: Introduction, Process states, process management, Interrupts, Interprocess Communication Threads: Introduction, Thread states, Thread Operation, Threading Models. Processor Scheduling: Scheduling levels, pre emptive vs no pre emptive scheduling, priorities, scheduling objective, scheduling criteria, scheduling algorithms, demand scheduling, real time scheduling. Process Synchronization: Mutual exclusion, software solution to Mutual exclusion problem, hardware solution to Mutual exclusion problem, semaphores, Critical section problems. Case study on Dining philosopher problem, Barber shop problem etc. [T1][T2][[R3] [No. of hrs. 10] UNIT III Deadlocks: examples of deadlock, resource concepts, necessary conditions for deadlock, deadlock solution, deadlock prevention, deadlock avoidance with Bankers algorithms, deadlock detection, deadlock recovery. Device Management: Disk Scheduling Strategies, Rotational Optimization, System Consideration, Caching and Buffering [T1][T2][R1] [No. of hrs. 10] UNIT IV File System: Introduction, File Organization, Logical File System, Physical File System , File Allocation strategy, Free Space Management, File Access Control, Data Access Techniques, Data Integrity Protection, Case study on file system viz FAT32, NTFS, Ext2/Ext3 etc. [T1] [T2][R4][R5] [No. of hrs. 10] Text Books: [T1] Deitel & Dietel, “Operating System”, Pearson, 3rd Ed., 2011 [T2] Silbersachatz and Galvin, “Operating System Concepts”, Pearson, 5th Ed., 2001 [T3] Madnick & Donovan, “Operating System”, TMH,1st Ed., 2001 Reference Books: [R1] Tannenbaum, “Operating Systems”, PHI, 4th Edition, 2000 [R2] Godbole, “Operating Systems”, Tata McGraw Hill, 3rd edition, 2014 [R3] Chauhan, “Principles of Operating Systems”, Oxford Uni. Press, 2014 [R4] Dhamdhere, “Operating Systems”, Tata McGraw Hill, 3rd edition, 2012 [R5] Loomis, “Data Management & File Structure”, PHI, 2nd Ed. DATA COMMUNICATION & NETWORKS Paper Code: ETEC-310 L T/P C Paper: Data Communication & Networks 3 1 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be 12.5 marks.
Objectives: The objective of the paper is to provide an introduction to the fundamental concepts on data communication and the design, deployment, and management of computer networks. UNIT- I Data Communications : Components, protocols and standards, Network and Protocol Architecture, Reference Model ISO-OSI, TCP/IP-Overview ,topology, transmission mode, digital signals, digital to digital encoding, digital data transmission, DTE-DCE interface, interface standards, modems, cable modem, transmission media- guided and unguided, transmission impairment, Performance, wavelength and Shannon capacity. Review of Error Detection and Correction codes. Switching: Circuit switching (space-division, time division and space-time division), packet switching (virtual circuit and Datagram approach), message switching. [T1, T2, R1, R4] [No. of Hours: 11] UNIT- II Data Link Layer: Design issues, Data Link Control and Protocols: Flow and Error Control, Stop-and-wait ARQ. Sliding window protocol, Go-Back-N ARQ, Selective Repeat ARQ, HDLC, Point-to –Point Access: PPP Point –to- Point Protocol, PPP Stack, Medium Access Sub layer: Channel allocation problem, Controlled Access, Channelization, multiple access protocols, IEEE standard 802.3 & 802.11 for LANS and WLAN, high-speed LANs, Token ring, Token Bus, FDDI based LAN, Network Devices-repeaters, hubs, switches bridges. [T1, T2,R1][No. of Hours: 11] UNIT- III Network Layer: Design issues, Routing algorithms, Congestion control algorithms, Host to Host Delivery: Internetworking, addressing and routing, IP addressing (class full & Classless), Subnet, Network Layer Protocols: ARP, IPV4, ICMP, IPV6 ad ICMPV6. [T1, T2,R1][No. of Hours: 11] UNIT- IV Transport Layer: Process to Process Delivery: UDP; TCP, congestion control and Quality of service. Application Layer: Client Server Model, Socket Interface, Domain Name System (DNS): Electronic Mail (SMTP), file transfer (FTP), HTTP and WWW. [T2, T1, R1, R4][No. of Hours: 11] Text Books: [T1] A. S. Tannenbum, D. Wetherall, “Computer Networks”, Prentice Hall, Pearson, 5th Ed [T2] Behrouz A. Forouzan, “Data Communications and Networking”, Tata McGraw-Hill, 4th Ed
[R1] Fred Halsall, “Computer Networks”, Addison – Wesley Pub. Co. 1996. [R2] Larry L, Peterson and Bruce S. Davie, “Computer Networks: A system Approach”, Elsevier, 4th Ed [R3] Tomasi, “Introduction To Data Communications & Networking”, Pearson 7th impression 2011 [R4] William Stallings, “Data and Computer Communications”, Prentice Hall, Imprint of Pearson, 9th Ed. [R5] Zheng , “Network for Computer Scientists & Engineers”, Oxford University Press [R6] Data Communications and Networking: White, Cengage Learning
1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be of 12.5 marks.
History of the Internet, Basic internet protocols, World Wide Web (W3C), HTTP: Hypertext Transfer Protocol. Markup languages-XHTML: Introduction to HTML, basics of XTHML, HTML elements, HTML tags, lists, tables, frames, forms, defining XHTML’s abstract syntax, defining HTML documents. CSS style sheets: Introduction, CSS core syntax, text properties, CSS box model, normal flow box layout, other properties like list, tables, DHTML, XML, XML documents & vocabulary, XML versions & declarations, Introduction to WML. [T1,T2][No. of hrs. 10] UNIT – II Client Side Programming: JAVA Scripts, basic syntax, variables & data-types, literals, functions, objects, arrays, built-in objects, JAVA Script form programming, Intrinsic event handling, modifying element style, document trees, Server side programming – Java Servlets: Servlet architecture, life cycle, parameter data, sessions, cookies, servlets capabilities, servlets & concurrency. Introduction to JSP, JSP Tags, JSP life cycle, custom tags. [T1,T2][No. of hrs. 12] UNIT - III Security Threats, Security risks of a site, Web attacks and their prevention, Web security model, Session management, authentication, HTTPS and certificates, Application vulnerabilities and defenses. Client-side security, Cookies security policy, HTTP security extensions, Plugins, extensions, and web apps, Web user tracking. Server-side security tools, Web Application Firewalls (WAFs) and Fuzzers. ` [T1,T2][No. of hrs. 10]
Introduction to Web 2.0 and Web 3.0, Concepts and Issues, Latest Trends in Web Technologies. Web Security concerns. Applications of Web Engineering Technologies in distributed systems etc. Case studies using different tools. [T1,T2][No. of hrs. 12] Text Books: [T1] Web Technologies: A Computer Science Perspective, Jackson, Pearson Education India, 2007. [T2] Web Engineering: A Practitioner's Approach by Roger S Pressman, David Lowe, TMH, 2008.
[R1] Achyut Godbole,Atul Kahate, “Web Technologies”, McGraw-Hill Education, Third Edition. [R2] Uttam K Roy, “Web Technologies”, Oxford University Press, 2012. [R3] Chris Bates, "Web Programming", Wiley [R4] Web Engineering by Gertel Keppel, Birgit Proll, Siegfried Reich, Werner R., John Wiley. [R5] Thinking on the Web: Berner's LEE, Godel and Turing, John Wiley & Sons Inc. ARTIFICIAL INTELLIGENCE Paper Code: ETCS-310 L T/P C Paper: Artificial Intelligence 3 1 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be of 12.5 marks.
Objective: To learn the basics of designing intelligent agents that can solve general purpose problems, represent and process knowledge, plan and act, reason under uncertainty and can learn from experiences UNIT-I Introduction: Introduction to intelligent agents Problem solving: Problem formulation, uninformed search strategies, heuristics, informed search strategies, constraint satisfaction Solving problems by searching, state space formulation, depth first and breadth first search, iterative deepening [T1,T2][No. of hrs. 12] UNIT-II Logical Reasoning : Logical agents , propositional logic, inferences ,first-order logic, inferences in first order logic, forward chaining, backward chaining, unification , resolution [T1,T2][No. of hrs. 10] UNIT-III Game Playing: Scope of AI -Games, theorem proving, natural language processing, vision and speech processing, robotics, expert systems, AI techniques- search knowledge, abstraction [T1,T2][No. of hrs. 12] UNIT-IV Learning from observations: Inductive learning, learning decision trees, computational learning theory, Explanation based learning Applications: Environmental Science, Robotics, Aerospace, Medical Sciences etc. [T1,T2][No. of hrs. 10] Text Book: [T1] Rich and Knight, “Artificial Intelligence”, Tata McGraw Hill, 1992 [T2] S. Russel and P. Norvig, “Artificial Intelligence – A Modern Approach”, Second Edition, Pearson Edu. Reference Books: [R1] KM Fu, "Neural Networks in Computer Intelligence", McGraw Hill [R2] Russel and Norvig, "Artificial Intelligence: A modern approach", Pearson Education
1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be of 12.5 marks
[T1] Muhammad Ali Mazidi, “Microprocessors and Microcontrollers”, Pearson, 2006 [T2] Douglas V Hall, “Microprocessors and Interfacing, Programming and Hardware” Tata McGraw Hill, 2006.
[T3] Ramesh Gaonkar, “MicroProcessor Architecture, Programming and Applications with the 8085”, PHI References Books: [R1] Muhammad Ali Mazidi, Janice Gillispie Mazidi, Rolin D. MCKinlay “The 8051 Microcontroller and Embedded Systems”,2nd Edition, Pearson Education 2008. [R2] Kenneth J. Ayala, “The 8086 Microprocessor: Programming & Interfacing The PC”, Delmar Publishers, 2007.
[R3] A K Ray, K M Bhurchandi, “Advanced Microprocessors and Peripherals”, Tata McGraw Hill, 2007. [R4] Vaneet Singh, Gurmeet Singh, “Microprocessor and Interfacing”, Satya Prakashan, 2007. OPERATING SYSTEMS (LINUX PROGRAMMING AND ADMINISTRATION) LAB Paper Code: ETCS-352 L T/P C Paper: Operating Systems (Linux Programming and Administration) Lab 0 2 1 List of Experiments:
NOTE:- At least 8 Experiments out of the list must be done in the semester. DATA COMMUNICATION & NETWORKS LAB Yüklə 1,11 Mb. Dostları ilə paylaş:
|