Syllabus for B. Tech course in Computer Science & Engineering and Information Technology Detailed Syllabus ‘Computer Science & Engineering and Information Technology Code: CSC501_| Computer Organization and Architecture Li[tlPle 3 o[s ‘This course open to all branch except CSE/T. Course Outcomes: Ability to describe the organization of computer and mchine instructions and programs Ability co analyze Input / Output Organization ‘Analyze the working of the memory system and basie processing unit Ability to solve problems of multi cores, multiprocessors and clusters. ‘Choose optical storage media suitable for multimedia applications vRee CO-PO Mapping: Por _[Po2 [POs PO: POs [Pos [POs |PO7 [POS |POo [PIO [Pil [PID cory sf. 2a - fe - |. coz [2 (2 (2 +2 2 ~ ~ |. [2 cos 2 (22 ~ =e 12 cos 33 [3 a - = ee Se 2 ‘Average *3: high, 2: moderate, T Tow MODULE-[: Basics of Digital Electronics: Multiplexers and De multiplexers, Decoder andEncoder, Codes, Logic gates, Flip flops, Registers. Register Transfer and Micro Operations: Bus and Memory ‘Transfer, Logic Mieto Operations, Shift Micro Operations, Register transfer and register transfer language, Design of arithmetic logic unit MODULE Ti: Basic Computer Organization: Instruction codes, Computer instructions, Timing and Control, Instruction cycle, Memory reference Instruction, Complete computer description, Design of basic computer, Input output and interrupt MODULE II: Control Unit: Hardwired controls, Micto programmed controls, Central Processing Unit; Program control, Reduced instruction set computer, Complex instruction set computer, Data Transfer, Manipulation, General register and stack organization, Addressing mode. MODULEI'Syllabus for B. Tech course in Computer Science & Engineering and Information Technology Computer Arithmetie: Addition and subtraction algorithm, Multiplication algorithm, Division algorithms. MODULE Y: rtupt, Peripheral devices, Input output interface, Data transfer schemes, Program control and interrupls, Direct memory access transfer, Inpuv/output processor. ‘Memory Unit: High speed memories, Memory hierarchy, Processor Vs Memory speed, Cache memory, Associative memory, Inter leave, Virtual memory, Memory management, Input-Output Organization: Priority MODULE VI: Introduction to Parallel Processing: Pipelining, Characteristics of multiprocessors, Interconnection structures, Inter processor arbitration, Inter processor communication, Synchronization ‘Text Books: 1. Computer System Architecture by Morris Mano, Prentice hall, 3" Edition, (2007) References: 1. Computer Organization by Carl Hamacher, ZvonkoVeunesic, SafwatZaky, Tata Megraw Hill, Sth Exition, (2011) 2. Computer Architecture : A Quantitative Approach by Hennessy, J. L, David A Patterson, and Goldberg, Pearson Education, 4" Edition, (2006)Syllabus for B. Tech course in Computer Science & Engineering and Information Technology ‘Computer Science & Engineering Code: CSC502_[ Compiler Design L[t|Ple 0 Pre-requisites: knowledge of automata theory, context free languages, computer architecture, data structures and simple graph algorithms, logic or algebra, MODULE-[: Introduction to compiler and Finite automata Compilers, Analysis of source programs, Tokens, patterns, lexemes, Phases of compilers, Parsing, Parse trees, Ambiguity, Associativity and precedence of operators, Top -down parsing, Bottom-up parsing, Left recursion, Syntax directed translation, Classification of grammars, NFA. DFA, Conversion of NFA to DEA, RE to NFA (Thompson's Construction), Optimization of NFA/DFA using FIRSTPOS, LASTPOS, FOLLOWPOS. MODULE-It: Context Free Grammar RE vs, CFG, Eliminating ambiguity and let recursion, Left factoring MODULE-I: Compiler Parser ‘Top down parsing-LL parser, LL grammars. Bottom up parsing- LR parser, SLR parser, CLR parser, LALR parser. Polishing expressions Operator precedence grammar. LR. grammars. Comparison of parsing methods. Error handling, MODULE-IV: Run time environments ‘Symbol tables, Language facilities for dynamic storage allocation, Dynamic storage allocation technique, ‘Organization for non-black and block structured languages. MODULE- Intermediate eode generation Intermediate languages, graphical representations, Synthesized and inherited attributes, Dependency graph, ‘Syntax directed translation, $ and L- attributed definitions, Polish notation, Three address, quadruples, triples, indirect triples Flow of control statement MODULE-VI; Code optimization and code generationSyllabus for B. Tech course in Computer Science & Engineering and Information Technology Basie blocks and flow graphs, Optimization of basic blocks, Code optimization techniques, Issues in design of code generator, Target machine code and simple code generator. Suggested Text Books ‘© Alfted V. Aho, Ravi Sethi, Jeffrey D. Ullman, Monica $. Lam, Compilers: Principles, Techniques, and Tools. Addison Wesley, 2006 (optional). © Thomas W. Parsons, Introduction to Compiler Construction. Computer Science Press,1992. Suggested Reference books © Compiler design in C, A.C. Holub, PHIL ‘© Compiter construction (Theory and Practice), .Barret William and R.M, Bates, Galgotia Publication, © Compiler Design, Kakde COURSE OUTCOMES [I Paenify the issue that arises in the design and construction of translator for programming language. “2 RE and CFG to specify the lexical and syntactic siructure of programming language, B | Design different parsers from given spec fy [Assess the various program transi ‘Design a compiler for a programming language. CO-PO MAPPING PO2 3 3 2 "high, 2: moderate, Ts TowSyllabus for B. Tech course in Computer Science & Engineering and Information Technology ‘Computer Science & Engineering ‘Code: CSC503_[ Computer Graphies Lt S/5) ela) Objectives of the course: This course covers basics of computer graphics, Computer graphies are pictures and films created using computers. Usually, the term refers to computer-generated image data created with the help of specialized ‘graphical hardware and software. It is a vast and recently developed area of computer science. Computer _graphics is responsible for displaying art and image data effectively and meaningfully to the consumer. tis aso used for processing image data received from the physical world. Computer graphics development has had significant impact on many types of media and has revolutionized animation , movies, advertising, video games, and graphic design in general. Course Outcomes After completing this course, the student will be able to: bor Understand the basies of computer graphics, different graphies systems and applications YF computer graphics. 02 __| Discuss various algorithms for sean conversion and filling of Basic objects and their somparaive analysis. 03 Use of geometric transformations on graphies objects and their application in mmposite form. koa xiract scene with different clipping methods and its ansformation wo graphics display kos fender projected objects to naturalize the scene in 2D view and use of i nodels for this ‘Module ~ I: Introduction to computer graphics and graphics systems. Raster and vector graphics systems, video display devices, physical and logical input devices, simple color models, ‘Module 1: Points & Tines, Line drawing algorithms; DDA algorithm, Bresenham’s Tine algorithm, Ci rele generation algorithm; scan line polygon, fill algorithm, boundary fill algorithm, flood fill algorithm, ‘Module —Syllabus for B. Tech course in Computer Science & Engineering and Information Technology 2D Transformation: Basic transformations ; translation, rotation, scaling ; Matrix representations & homogeneous coordinates, transformations between coordinate systems ; reflection shear ; Transformation of points, Hines, parallel lines, intersecting lines. ‘Module ~ IV: Viewing pipeline, Window to Viewport co-ordinate transformation, clipping operations, point clipping, line clipping, clipping circles, polygons & ellipse. ‘Module ~ V: Hidden Surfaces: Depth comparison, Z-buffer algorithm, Back face detection, BSP (ree method, the Printer’s algorithm, scan-line algorithm; Hidden line elimination, wire frame methods, fractal - geometry. Rendering of a polygonal surface; Flat, Gouraud, and Phong shading; Texture mapping, bump texture, environment map: Introduction to ray tracing: Image synthesis, sampling techniques, and anti-aliasing, Text Books 1 Donald Hear and Pauline Baker Computer Graphics, Prentice Hall, New Delhi, 2012 2. Steven Hartington, "Computer Graphies- A programming approach", MeGraw 3. Hill, 2nd Edition, 1987, Reference Book 3. Foley J.D., Van Dam A, "Fundamentals of Interactive Computer Graphi Addison Wesley, 1990Syllabus for B. Tech course in Computer Science & Engineering and Information Technology ‘Computer Science & Engineering ‘Code: CSP504 | Linux Programming Lit Sle ‘Sle Course objectives: COL: able to understand the basic commands of Linux operating system and can write shell serps (CO2: able to create filesystems and directories and operate them (COS: Students willbe able to create processes background and fore ground etc. by fork() system calls CO4: able to create shared memory segments, pipes, message queues and can exercise inter process communication CO PO Mapping, Poi [Poz [Pos [Pos [Pos [Pos [PO7 [POs [PO [Pio [Pil [PID cor [2 2 2 |e 7 : a = ee ee coz [2/2 2 |: : : : = = > cox 33. 3 fe : : : 7 = 7 fe cos. 3 7 : 7 = = oe ‘Module -K: Linux Utilities: File handling utilities, Security by file permissions, Process utilities, Disk utilities, Networking commands, Filters, Text processing utilities, Backup utilities: Shell programming with Bourne Again Shell (bash): Introduction, Shell responsibilities, Pi pes and redirection, here documents, Running a shell script, Shell as a programming language, Shell meta characters, File -name substitution, Shell variables, Command substitution, Shell commands, The environment, Quoting, test command, Control structures, Arithmetic in shell, Shell script examples, Interrupt processing functions, Debugging shell scripts ‘Module-II: Files and Directories: File concepts, File types File system structure, file metadata - Inodes, kernel support for files, System calls for the file V1 operations- open create,read,ssrirte,close,Iseek,dup? file status information -stat family, file and record locking-fent! function, file permissions- chmod, fehmod, file ownership chown, Iehown, fehown, links soft links and hard links- symlink, link, unlink. Directories: Creating, removing and changing Directories - mkdir, emir, chdir, obtaining current working irectory- getcwd, directory contents, scanning directories ~ opendir, readir, rewin functions. ‘Module. 1:Syllabus for B. Tech course in Computer Science & Engineering and Information Technology Process: Process concept, Layout of « C program image in main memory, Provess environment ~ environment list, environment variables, geteny, setenv, Kernel support for process, Process identification, Process control - Process creation, replacing a process image, waiting for process, Process termination, Zombie process, Orphan process, system call interface for process management — fork, vfork, exit, wait, waitpid, exec family, process _groups, sessions and controlling Terminal, differences between threads and processes. Signals: Introduction to signals, Signal generation, Signal handling, Kernel support for signals, signal function, Unreliable signals, Reliable signals, Signal functions: kill, raise, alarm, pause, abort, sleep, ‘Module 1V: Inter process Communication: Introduction to TPC, IPC between processes on a single computer system, IPC between processes on different systems, Pipes-creation IPC between related processes using FIFOs (Named pipes), differences between unnamed and named pipes, popen and pelose library functions. ‘Message Queues: Kernel support for messages, APIs for message queues, Client/Server example ‘Semaphores: Kernel support for semaphores, APIS for semaphores, file locking with semaphores. ‘Module-V: ‘Shared Memory: Kernel support for Shared Memory, APIs for Shared Memory, Shared Memory example. Sockets: Introduction to Berkley Sockets, IPC over a network, client ~ server model, Socket address structures (Unix domain and internet domain), Socket system calls for connection oriented protocol and connectionless protocol, example- elientserver programs- single server- client connection, multiple simultaneous clients, socket ‘options: setsockopt and fent! system calls, comparison of IPC mechanisms, ‘TEXT BOOKS:- Unix System Programming using C}-+, T. Chan, PHL 1 2. Unix concepts and Applications, 4th Edition, Sumitabha Das, TMH. 3. Beginning Linux Programming, 4th Edition, N. Matthew, R.Stones, Wrox, Willey India Edition. REFERRENCE BOOKS 1. Linux System Programming. Robert Love, O'Reilly, SPD. 2. Advanced Programming in the Unix environment, 2nd Edition, W.R.Stevens, Pearson Education, 3. Unix Network Programming, W.R.Steven, PHL 4. UNIX for Programming and users, 3rd Edition, Graham Glass, King Ables, Pearson Edition. 5. UNIX and shell Programming, B.A Forouzan and R-F.Koretsky, S.A Sarawar, Pearson edition 6. Unix The Text book, 2nd edition, S.M.Surawar, Koretsky, S.A.Sarawar, Pearson EditionSyllabus for B. Tech course in Computer Science & Engineering and Information Technology ‘Computer Science & Engineering Code: ITO502_| Data Communication L{r{P lala Module 1: Signals and Signal Analysis: Periodic and nonperiodic signals, Composite signals, Signal analysis, Time and frequency domain representation. Introduction to Data and signal fundamentals, Analog and digital signals Module 2: Analog Transmission: Concepts of carrier signal, noise, modulating signal and modulated signal; Amplitude modulation ~ double sideband suppressed carrier, double sideband transmitted carrier, single sideband; Frequency modulation — Narrowband FM and wideband FM; Digital to analog conversion ~ Amplitude shift keying, Frequency shift keying, Phase shift keying, Quadrature amplitude modulation, Performance. Module 3: Digital Transmission: Problems with digital transmission, Different line coding schemes, Block coding schemes, Scrambling techniques; Analog to digital conversion — Sampling techniques, Sampling theorem, Pulse amplitude modulation, Pulse code modulation, Differential pulse code modulation, Delta modulation (along with advantages and disadvantages of each technique), Transmission modes (serial and parallel), Module 4: Multiplexing and Spreading: Concept of multiplexing, Frequency division multiplexing, Time division multiplexing — Synchronous and Statistical time division multiplexing, Module 5: Introduction: Data Communications, Networks, Network Types, Internet History, Networks Models: Protocol Layering, TCP/IP Protocolsuite, The OSI model, Introduction to Physical Layer-I: Data and Signals, Digital Signals, Transmission Impairment, Data Rate limits, Performance, Digital Transmission: Digital to digital conversion (Only Line coding: Polar, Bipolar and Manchester coding)Syllabus for B. Tech course in Computer Science & Engineering and Information Technology Reference books:~ 1. “Data and Computer Communication” by William Stallings 2. “Data Communication and Networking” by Behrouz A Forouzan 3. “Computer Networks” by Andrew S Tanenbaum 4, “Communication Systems” by B P Lathi 5. “Communication Systems: Analog and Digital” by Sanjay SharmaSyllabus for B. Tech course in Computer Science & Engineering and Information Technology ‘Computer Science & Engineering ‘Code: CSSOIP-| Computer Organization and Architecture Tab L [rir fe oo List of Experiments: 1. To design Half adder and Full adder circuit using Multi -Sim and verify the truth table. 2. To design Half sub-tractor and Full sub-tractor circuit using Multi-Sim and verify the uth table. 3, To construct and verify the operation of Parity Bit Generator and Checker. 4. To construct and verify operation of 4x1, 8x1 Multiplexer. 5. To construct and verify the operation of 3x8 Decoder and 8x3 Encoder. 6. To design 2-bit arithmetic and logie unit and verify the truth table. 7. To design 4-bit universal shift register and verify the truth table, 8, To design the 4-bit ALU and verify the truth table, 9. To generate digital clock signal using $55 Timer. 10, To design 4-bit Binary Up Counter and verify the truth table. a. Tostudy Cache Memory. 'b, To study Hardwired Control Unit$Micro-programmed Control Unit. ‘Computer Science & Engineering Code: CS502P | Compiler Design Lab lr 25 ule =le Listof Experiments 1. To Design a lexical analyzer for given language to recognize a few patterns in C (EX. identifiers constants, comments, operators etc.) and the lexical analyzer should ignore redundant spaces, tabs, and new lines. 2. To test whether a given idemitier is valid or not 3, To find out the FIRSTPOS and FOLLOWPOS for a given expression. 4, To implement LL (1) parser. 5. To implement Recursive Descent parser. 6 7 To implement a Symbol Table. identify that, for a given set of grammar, whether the sting belongs to that grammar or not.Syllabus for B. Tech course in Computer Science & Engineering and Information Technology ‘Computer Science & Engineering Code: CS503P_[ Computer Graphies Lab l= =\5 ule A List of Experiments: ‘To implement DDA Line Drawing Algorithm. To implement Bresenham’s Line Drawing Algorithm, To implement Mid-Point Circle Drawing Algorithm. ‘To implement Mid-Point Ellipse Drawing Algorithm, To implement 2-D Transformation, ‘To implement Boundary Fill Algorithm. To implement Flood Fill Algorithm, ‘To implement Cohen Sutherland Line Clipping Algorithm, ‘To implement Sutherland Hodgeman Polygon Clipping Algorithm. ‘Computer Science & Engineering Code: CSS04P | Linux Programming Lab. l=/5 = List of experiments: 4. Execute various Linux shell commands in bash shell and explore various options and arguments using man page. 2. Shell Script basis i, Write a shell script that accepts a file name, starting and ending line numbers as arguments and displays all the lines between the given line numbers ii, Write a shelf script that deletes all lines containing a specified word in one or more files supplied as arguments to it iii, Write a shelf script that displays a list of all files in the current directory to whi ch the user has read, write and execute permission iv. Write a shell script that receives any number of file names as its arguments, checks if ‘every argument supplied is a file or a directory and reports accordingly. Whenever the argument is a file, the number of lines on itis also reported.Syllabus for B. Tech course in Computer Science & Engineering and Information Technology ¥. Write a shell seripr that receives any number of file names as its arguments, counts and reports the occurrence of each word that is present in the first argument file on other argument files. vi. Write a shell script to list all of the directory files in a directory. 3. i, Write aC program that makes a copy of a file using standard VO and system call ii, Write a € program to emulate the Unix Is -!’ command. iii, Write client and server programs (using C) for interaction between server and client processes using Unix Domain socket iv, Write aC program to list every file in a ditectory, its inode number and file name. ¥. Implement in C the following Linux commands using system calls (aycat (b)Is- (@) my vi. Write a C program to emulate the UNIX Is -1 command. Vii, Write a C program to list for every file in a directory, its inode number and file name Vili. Write a C program that demonstrates redirection of standard output toa file. Ex:Is>fL 4, Write a C program to create a child process and allow the parent to display “parent” and the child to display “child” on the sereen. 5. Write a C program to ereate a Zombie process and orphan process. 6. Write a C program that illustrates how to execute two commands concurrently with a command pipe, Ex: —Is1| sort 7. Write C programs that illustrate communication between two unrelated processes using named pipe 8, Write a C program to create a message queue with read and write permis messages to it with different priority number. 9. Write a C program to allow cooperating processes to lock a resource for exclusive use, using a) Semaphores b) flock or lock system calls. 10. Write a C program that illustrates suspending and resuming processes using signals. 22, Write a C program that implements a producer-consumer system with two processes. (Using Semaphores ) 12. Write client and server programs (using c) for interaction between server and client processes using Unix Domain sockets. 13, Write client and server programs (using c) for interaction between server and using Internet Domain sockets. 14, Write a C program that illustrates two processes communicating using shared memory. ns to write 3 nt processesSyllabus for B. Tech course in Computer Science & Engineering and Information Technology ‘Computer Science & Engineering Code: ITS01P | Information System Lab le os le la List of Experiments: 1. Develop a student management system, ‘© It should contain all the information of University or a school ‘© Itshould contain all the information of University Infrastructure or a school. ‘© It should contain all the information of University Students 2. Design a marketing information system with fundamental inputs and outputs Inputs: 1. Sales on units by each salesman for a period, above. 3. Economic conditions and trends. Estimated sales in units of competitor corresponding to ‘Outputs: 1. Sales by product i.e. month wise and till date. 2, Sales by salesman ie. month wise and till date. 3, Sales by trend analysis. 4, Sales forecasting 3. Given a fact table with sales data (for example sales (market, product#, time, amount) ~ see the lecture notes) and relevant dimension tables, write an SQL statement that slices the cube to select sales only in week 2, and dice it by regions. 4. To design a Personal Management Information System using XML to implement E-Commerce Marketing Strategies. 5. To identify top retail web sites and online sales volume of those websites and perform pattern analysis using data mining concepts, 66. To design an online learning database application with DBMS operations, working with tables, queries, forms, reports and data analysis, 7. To develop a transaction processing application to discover or identify similar patterns from transaction data using data mining techniques, 8, Case study 1 9. Case study 2 10, Mini ProjectSyllabus for B. Tech course in Computer Science & Engineering and Information Technology ‘Computer Science & Engineering ‘Code: 1T502P | Web Technology Lab L{t[P{c 0 fo [2 List of Experiments 1, Design a web page using HTML which includes the following: ‘© To display your education details in a tabular format, To illustrate the usage of HTML Lists. © Toembed an image and create a link such that clicking on image takes user to other page. © Toembed an image map in a web page. + Toembed Audio and Video in a web page. 2.Design a static web page using HTML which includes the following: © Tocreate a frameset having header, navigation and content sections, © To-create frames such that page is divided into 3 frames 20% on left to show contents of pages, 60% in center to show body of page, remaining on right to show remarks. 3. Write an HTML program to design an Entry form of student details and send it to store at databa se server like SQL, Oracle or MS Access, 4, Design a web page using CSS which includes the following: Use different font styles. ‘* Set background image for both the page and single elements on page. ‘* Control the repetition of image with background -repeat property ‘* Define style for links as a:link, a:active, achover, a:visited Add customized cursors for links, © Work wit layers. 5, Write a Java applet program: * To display moving text or content. ‘To draw lines, ovals, and rectangles. * Todisplay a Digital Clock * Toselect a URL from my Applet and send the browser to that page. 6.Write a JavaScript program: ‘* To design the scientific calculator and make event for each button ‘+ To compute the squares and cubes of the numbers from 0 to 10 and outputs HTML. text that, displays the resulting values in an HTML table format 7. Write JavaScript to validate the following fields of the above registration page:Syllabus for B. Tech course in Computer Science & Engineering and Information Technology ‘+ Name (Name should contains alphabets and the length should not be less than 6 characters). ‘Password (Password should not be less than 6 characters length), -mail id (should not contain any invalid and must follow the standard pattem name@ domain.com). + Phone number (Phone number should contain 10 digits only). 8, Write a JavaBeans program to converts value of INR (Indian Rupees) into equivalent American/Canadian/Australian Dollar value, ‘9, Write a Java servlet programs to conduct online examination and to display student mark list available in a Database. 10. Write an XML program: ‘* To display the Book information which includes the following: © Title of the book © Author Name © ISBN number © Publisher name © Edition © Price