proposed syllabus for second year degree course in computer

PROPOSEDSYLLABUSFORSECOND YEAR DEGREE COURSE IN COMPUTER SCIENCEENGINEERING AND INFORMATION TECHNOLOGYDR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADWith effect from Academic Year 2012-2013

Sub No.FACULTY OF ENGINEERING AND TECHNOLOGYProposed Revised Structure[Second Year CSE/IT]With effective from 2012-13SEMESTER-I Contact Hrs / Week Examination SchemeSubject L T P Total CT THTWPRTotalDuration ofTheoryExaminationBSH-201 Engineering Mathematics-III 4 - - 4 20 80 - - 100 3 HrsCSE-202 Digital Electronics 4 - - 4 20 80 - - 100 3 HrsCSE-203 Data Structures using C 4 - - 4 20 80 - - 100 3 HrsCSE-204 Computer Networks-I 4 - 4 20 80 - - 100 3 HrsCSE-205 Unix and Shell Programming 4 - - 4 20 80 - - 100 3 HrsCSE-221CSE-222CSE-223CSE-224CSE-225LAB-I Digital ElectronicsLab- - 2 2 - - 50 - 50 ---LAB-II Data Structure usingC- - 2 2 - - - 50 50 ---LAB-III Computer Network-ILab- - 2 2 - - 50 - 50LAB-IV Unix and ShellProgramming- - 2 2 - - - 50 50 ---LAB-V Introduction to WebProgramming2 - 2 4 - - - 50 50 ---Total 22 10 32 100 400 100 150 750SubNo.SEMESTER-II Contact Hrs / Week Examination SchemeSubject L T P Total CT THTotal 24 - 10 34 100 400 100 150 750 ---L: Lecture hours per week T: Tutorial hours per week P: Practical hours per week CT: ClassTest TH: University Theory Examination TW: Term Work PR: Practical/Oral ExaminationTWPRTotalDuration ofTheoryExaminationBSH-252 Engineering Mathematics-IV 4 - 4 20 80 - - 100 3 HrsCSE-253 Discrete Mathematics 4 - - 4 20 80 - - 100 3 HrsCSE-254Object OrientedProgramming with C++4 - - 4 20 80 - - 100 3 HrsCSE-255 Microprocessors 4 - - 4 20 80 - - 100 3 HrsCSE-256 Computer Graphics 4 - - 4 20 80 - - 100 3 HrsCSE-271CSE-272CSE-273LAB-VI Object OrientedProgramming with C++ LabLAB-VII MicroprocessorsLabLab-VIII Computer GraphicsLab- - 2 2 - - - 50 50 ---- - 2 2 - - - 50 50 ---- - 2 2 - - 50 - 50 ---CSE-274 LAB-IX Open Source Lab 2 - 2 4 - - - 50 50 ---BSH-275 Communication Skills 2 - 2 4 - - 50 - 50

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-ITeaching SchemeBSH-201: Engineering Mathematics-IIIExamination SchemeLectures 4 Hrs/week Theory 80 MarksClass Test20 MarksDuration of Theory paper3HrsObjectives:1. To develop Logical understanding of the subject2. To develop mathematical skill so that students are able to applymathematical methods & Principal’s in solving problems fromEngineering fields3. To produce graduates with mathematical knowledge & computationalskill.Unit 1:[6 Hours]Linear Differential Equations : Linear Differential Equations with constantcoefficients General method, shortcut methods to find particular integral,Homogenous Linear differential equations (Cauchy’s & Legendre’s form),method of variation of parameters.Unit 2:[6 Hours]Application of LDE: To Electrical circuits & to Mechanical system(Analogous study of two systems),To Civil Engineering, Free oscillations /vibrations, Forced oscillation /vibrations, Damped Free oscillations /vibrations, Damped Forced oscillations / vibrations.Unit 3:[8 Hours]Statistics & Probability: Measures of Dispersion, Moments, coefficient ofskewness and Kurtosis, Probability distribution for random variables,Binomial, Poisson and Normal distributions, Curve fitting: Principle of leastsquares, Fitting of linear curve, parabola, exponential curve.Unit4:[6 Hours]Vector Differentiation: Differentiation of vectors, Gradient of scalar pointfunction, Directional derivative, Divergence of vector point function, Curl ofa vector point function. Irrotational and solenoidal vector field.

Unit 5:[6 Hours]Vector Calculus (Integral calculus): The line integral, Surface integral,volume integral, Gauss Divergence theorem, Stoke’s theorem, Green’stheoremUnit 6:[8 Hours]Numerical Methods: Solution of transdental equations by Newton Raphsonmethod, Gauss Seidel method to solve simultaneous linear equations,Lagranges Interpolation formula for unequal intervals, NumericalDifferentiation: - Newton’s forward and Newton’s Backward differenceformulae, Solution of ordinary differential equation by Euler’s modifiedmethod, and Runge-Kutta IV th order method.Note: All Theorems are without proofsSection A: Unit 1, 2, 3Section B: Unit 4, 5, 6Reference Books:1. P. N. Wartikar and J. N. Wartikar, “A Text Book of EngineeringMathematics (Volume-I, II,III),” Pune Vidyarthi Griha Prakashan,Pune.2. B. S. Grewal, “Higher Engineering Mathematics,” KhannaPublications, New Delhi.3. H.K. Das, “Advanced Engineering Mathematics ,” S. Chand &Company.4. B.V. Ramana, “Higher Engineering Mathematics,” (Tata McGraw-Hill).5. Erwin Kreyszig , “Advanced Engineering Mathematics,” WileyEastern Ltd.6. Ravish R Singh, Mukul Bhat, “Engineering Mathematics,” A TutorialApproach, Mc Graw HillPattern of Question Paper:The units in the syllabus shall be divided in two equal sections. Questionpaper shall be set having two sections A and B. Section A questions shall beset on first three units (1,2,3) and Section B questions on remaining threeunits (4,5,6) . Question paper should cover the entire syllabus.For 80 marks Paper:1. Minimum ten questions2. Five questions in each section3. Question no 1 and 6 be made compulsory and should have at least ten bitsof two marks out of which FIVE to be solved.4. Two questions from remaining questions from each section be asked tosolve having weightage of 15 marks

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYTeaching SchemeSecond Year EngineeringSemester-ICSE-202: DIGITAL ELECTRONICSExamination SchemeLectures 4 Hrs/week Theory 80 MarksClass TestDuration of Theory paper20 Marks3HrsObjectives: To understand different methods used for the simplification ofBoolean functions To design and implement combinational circuits To design and implement synchronous sequential circuits To design and implement asynchronous sequential circuitsUNIT – 15 HoursDigital Principles, Digital Logic: Definitions for Digital Signals, DigitalWaveforms, Digital Logic, 7400 TTL Series, TTL Parameters The BasicGates: NOT, OR, AND, Universal Logic Gates: NOR, NAND, Positive andNegative Logic, Introduction to HDL.UNIT – 25 HoursCombinational Logic Circuits Sum-of-Products Method, Truth Table toKarnaugh Map, Pairs Quads, andOctets, Karnaugh Simplifications, Don’t-care Conditions, Product-of-sumsMethod, Product-of-sums simplifications, Simplification by Quine-McClusky Method, Hazards and Hazard Covers, HDL ImplementationModels.UNIT – 310 HoursData-Processing Circuits: Multiplexers, Demultiplexers, 1-of-16 Decoder,Encoders, Exclusive-or Gates, Parity Generators and Checkers, MagnitudeComparator, Programmable Array Logic, Programmable Logic Arrays, HDLImplementation of Data Processing CircuitsClocks, Flip-Flops: Clock Waveforms, TTL Clock, Schmitt Trigger,Clocked D FLIP-FLOP, Edge-triggered D FLIP-FLOP, Edge-triggered JKFLIP-FLOP, FLIP-FLOP Timing, JK Master-slave FLIP-FLOP, SwitchContact Bounce Circuits, Various Representation of FLIP-FLOPs, Analysisof Sequential Circuits, HDL Implementation of FLIP-FLOP

UNIT – 46 HoursRegisters: Types of Registers, Serial In - Serial Out, Serial In - Parallel out,Parallel In - Serial Out, Parallel In - Parallel Out, Universal Shift Register,Applications of Shift Registers, Register Implementation in HDLUNIT – 56 HoursCounters: Asynchronous Counters, Decoding Gates, Synchronous Counters,Changing the Counter Modulus, Decade Counters, Presettable Counters,Counter Design as a Synthesis problem, A Digital Clock, Counter Designusing HDLUNIT – 68 HoursD/A Conversion and A/D Conversion: Variable, Resistor Networks, BinaryLadders, D/A Converters, D/A Accuracy and Resolution, A/D Converter-Simultaneous Conversion, A/D Converter-Counter Method, Continuous A/DConversion, A/D Techniques, Dual-slope A/D Conversion, A/D Accuracyand ResolutionText Book:1. Donald P Leach, Albert Paul Malvino & Goutam Saha, “DigitalPrinciples and Applications,” 7th Edition, Tata McGraw Hill, 2010.Reference Books:1. Stephen Brown, Zvonko Vranesic, “Fundamentals of Digital LogicDesign with VHDL,” 2nd Edition, Tata McGraw Hill, 2005.2. R D Sudhaker Samuel, Illustrative Approach to Logic Design,Sanguine-Pearson, 2010.3. Charles H. Roth, Fundamentals of Logic Design, Jr., 5th Edition,Cengage Learning, 2004.4. Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss “ Digital SystemsPrinciples and Applications,” 10th Edition, Pearson Education, 2007.M Morris Mano: Digital Logic and Computer Design, 10th Edition,Pearson Education, 2008.Section A: Unit 1, 2, 3Section B: Unit 4, 5, 6PATTERN OF QUESTION PAPER:Six units in the syllabus shall be divided in two equal parts i.e. 3 units ineach part. Question paper shall be set having two sections A and B. SectionA questions shall be set on first part and Section B questions on second part.Question paper should cover the entire syllabus.For 80 marks Paper:1. Minimum ten questions2. Five questions in each section3. Question no 1 from section A and Question no 6 from section B havingweightage of 10 marks each be made compulsory and should have at leasteight bits of two marks out of which five to be solved.4. Two questions from remaining questions from each section A and B beasked to solve each having weightage of 15 marks.

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-ICSE-203: DATA STRUCTURE USING CTeaching SchemeExamination SchemeLectures 4 Hrs/week Theory 80 MarksClass Test 20 MarksDuration of Theory paper 3HrsObjective:To study the representation, implementation and applications of datastructuresUNIT - 16 HoursBASIC CONCEPTS: Pointers and Dynamic Memory Allocation, AlgorithmSpecification, Data Abstraction, Performance Analysis, Performance MeasurementUNIT - 24 HoursARRAYS and STRUCTURES: Arrays, Dynamically Allocated Arrays, Structuresand Unions, Polynomials, Sparse Matrices, Representation of MultidimensionalArraysUNIT - 310 HoursSTACKS AND QUEUES: Stacks, Stacks Using Dynamic Arrays, Queues, CircularQueues Using Dynamic Arrays, Evaluation of Expressions, Multiple Stacks andQueues.LINKED LISTS: Singly Linked lists and Chains, Representing Chains in C, LinkedStacks and Queues, Polynomials, Additional List operations, Sparse Matrices,Doubly Linked ListsUNIT - 410 HoursTREES-1: Introduction, Binary Trees, Binary Tree Traversals, Threaded BinaryTrees,HeapTREES -2, GRAPHS: Binary Search Trees, Selection Trees, Forests, Representationof Disjoint Sets, Counting Binary Trees, The Graph Abstract Data Type.UNIT - 55 HoursPRIORITY QUEUES Single- and Double-Ended Priority Queues, Leftist Trees,Binomial Heaps, Fibonacci Heaps, Pairing Heaps.

UNIT-65 HoursEFFICIENT BINARY SEARCH TREES: Optimal Binary Search Trees, AVLTrees, Red-Black Trees, Splay Trees.Text Book:1. Horowitz, Sahni, Anderson-Freed, “Fundamentals of Data Structures in C,”2nd Edition, Universities Press, 2007.(Chapters 1, 2.1 to 2.6, 3, 4, 5.1 to 5.3,5.5 to 5.11, 6.1, 9.1 to 9.5,10)Reference Books:1. Yedidyah, Augenstein, Tannenbaum, “Data Structures Using C and C++,”“2nd Edition, Pearson Education, 2003.2. Debasis Samanta, “Classic Data Structures, 2nd Edition,” PHI, 2009.3. Richard F. Gilberg and Behrouz A. Forouzan, “Data Structures A PseudocodeApproach with C,” Cengage Learning, 2005.Section A: Unit 1, 2, 3Section B: Unit 4, 5, 6PATTERN OF QUESTION PAPER:Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part.Question paper shall be set having two sections A and B. Section A questions shallbe set on first part and Section B questions on second part. Question paper shouldcover the entire syllabus.For 80 marks Paper:1. Minimum ten questions2. Five questions in each section3. Question no 1 from section A and Question no 6 from section B having weightageof 10 marks each be made compulsory and should have at least eight bits of twomarks out of which five to be solved.4. Two questions from remaining questions from each section A and B be asked tosolve each having weightage of 15 marks.

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYTeaching SchemeSecond Year EngineeringSemester-ICSE-204: COMPUTER NETWORKS-IExamination SchemeLectures 4 Hrs/week Theory 80 MarksClass Test20 MarksDuration of Theory paper 03 HrsUnit-1:[5 Hours]Introduction: Data Communications, Networks, the Internet, Protocols &Standards, Layered Tasks,The OSI model, Layers in OSI model, TCP/IP Protocol suite, addressingUnit 2:[5 Hours]Physical Layer-1: Analog & Digital Signals, Transmission Impairment,Data Rate limits, Performance, Digital-digital conversion (Only Line coding:Polar, Bipolar and Manchester coding), Analog-to-digital conversion (onlyPCM), Transmission Modes, Digital-to-analog conversionUnit 3:[10 Hours]Physical Layer-2 and Switching: Multiplexing, Spread Spectrum,Introduction to switching, Circuit Switched Networks, Datagram Networks,Virtual Circuit NetworksData Link Layer-1: Error Detection & Correction: Introduction, Blockcoding, linear block codes, cyclic codes, Checksum.Unit 4:[10 hours]Data Link Layer-2: Framing, Flow and Error Control, Protocols, NoiselessChannels, Noisy channels, HDLC, PPP (Framing, Transition phases only)Multiple Access & Ethernet: Random access, Controlled Access,Channelization, Ethernet: IEEE standards, Standard Ethernet, Changes in thestandard, Fast Ethernet, Gigabit EthernetUnit 5:[5 hours]Wireless LANs and Cellular Networks: Introduction, IEEE 802.11,Bluetooth, Connecting devices, Cellular TelephonyUnit 6:[5 hours]Network Layer: Introduction, Logical addressing, IPv4 addresses, IPv6addresses, Internetworking basics, IPv4, IPv6, Comparison of IPv4 and IPv6Headers

Text Books:1. Behrouz A. Forouzan: Data Communication and Networking, 4 thEdition Tata McGraw-Hill, 2006.(Chapters 1.1 to 1.4, 2.1 to 2.5, 3.1 To 3.6, 4.1 to 4.3, 5.1, 6.1, 6.2,8.1 to 8.3, 10.1 to 10.5, 11.1 to 11.7, 12.1 to 12.3, 13.1 to 13.5, 14.1,14.2, 15.1, 16.1, 19.1, 19.2, 20.1 to 20.3)Reference Books:1. Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts and Key architectures, 2 nd Edition TataMcGraw-Hill, 2004.2. William Stallings: Data and Computer Communication, 8 th Edition,Pearson Education, 2007.3. Larry L. Peterson and Bruce S. Davie: Computer Networks – ASystems Approach, 4 th Edition, Elsevier, 2007.4. Nader F. Mir: Computer and Communication Networks, PearsonEducation, 2007.Section A: Unit 1, 2, 3Section B: Unit 4, 5, 6PATTERN OF QUESTION PAPER:Six units in the syllabus shall be divided in two equal parts i.e. 3 units ineach part. Question paper shall be set having two sections A and B. SectionA questions shall be set on first part and Section B questions on second part.Question paper should cover the entire syllabus.For 80 marks Paper:1. Minimum ten questions2. Five questions in each section3. Question no 1 from section A and Question no 6 from section B havingweightage of 10 marks each be made compulsory and should have at leasteight bits of two marks out of which five to be solved.4. Two questions from remaining questions from each section A and B beasked to solve each having weightage of 15 marks.

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYTeaching SchemeSecond Year EngineeringSemester-ICSE-205: UNIX AND SHELL PROGRAMMINGExamination SchemeLectures 4 Hrs/week Theory 80 MarksClass Test 20 MarksDuration of Theory paper 3HrsUnit-1:[6 hours]The Unix Operating System, The UNIX architecture and Command Usage,The File SystemUnit-2:Basic File Attributes, the VI Editor, More file attributes,Unit 3:The Shell, The Process, Customizing the environmentUnit 4:[6 Hours][8 Hours][8 Hours]Simple filters, filters using regular expressions, awk – An Advanced FilterUnit-5:Essential Shell ProgrammingUnit 6:perl - The Master Manipulator[6 Hours][6 Hour]Text Book:1. Sumitabha Das: UNIX – Concepts and Applications, 4 th Edition, TataMcGraw Hill, 2006. (Chapters 1.2, 2, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14,18, 19)Reference Books:1. Behrouz A. Forouzan and Richard F. Gilberg: UNIX and ShellProgramming, Cengage Learning, 2005.2. M.G. Venkateshmurthy: UNIX & Shell Programming, PearsonEducation, 2005.

Section A: Unit 1, 2, 3Section B: Unit 4, 5, 6PATTERN OF QUESTION PAPER:Six units in the syllabus shall be divided in two equal parts i.e. 3 units ineach part. Question paper shall be set having two sections A and B. SectionA questions shall be set on first part and Section B questions on second part.Question paper should cover the entire syllabus.For 80 marks Paper:1. Minimum ten questions2. Five questions in each section3. Question no 1 from section A and Question no 6 from section B havingweightage of 10 marks each be made compulsory and should have at leasteight bits of two marks out of which five to be solved.4. Two questions from remaining questions from each section A and B beasked to solve each having weightage of 15 marks.

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-ICSE-221: LAB-I: DIGITAL ELECTRONICS LABORATORYTeaching SchemeExamination SchemePractical: 2 Hrs/week Term Work: 50 MarksTerm Work:Term work shall consists of record of the experiments carriedout during the course, which should include neat labeled figuresand appropriate explanation for the corresponding experimentindicating what is learnt from the experiment. The term workshall consist of at least 10 experiments.Assessment of term work should be done as follows:* Continuous lab assessment: 40 %* Actually performing practical in the laboratory: 40 %* Oral Examination conducted (internally) at the time ofsubmission: 20%LIST OF EXPERIMENTS1. Given a 4-variable logic expression, simplify it using Entered VariableMap and realize the simplified logic expression using 8:1 multiplexerIC.2. Design and develop the Verilog /VHDL code for an 8:1 multiplexer.Simulate and verify its working.3. Realize a J-K Master / Slave Flip-Flop using NAND gates and verify itstruth table.4. Design and develop the Verilog / VHDL code for D Flip-Flop withpositive-edge triggering. Simulate and verify its working.5. Design and implement a mod-n (n

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-ICSE-222: LAB-II: DATASTRUCTURE USING C LABORATORYTeaching SchemeExamination SchemePractical: 2 Hrs/week Practical & Oral: 50 MarksDesign, develop and implement for the following problems using C Language inLINUX /Windows environment1. Write a C program to implement stack using dynamic array.2. Write a C program to implement 2 stacks in one static array.3. Using circular representation for a polynomial, design, develop, and execute aprogram in C to accept two polynomials, add them, and then print the resultingpolynomial.4. Design, develop, and execute a program in C to convert a given validparenthesized infix arithmetic expression to postfix expression and then to printboth the expressions. The expression consists of single character operands andthe binary operators + (plus), - (minus), * (multiply) and / (divide).5. Design, develop, and execute a program in C to evaluate a valid postfixexpression using stack. Assume that the postfix expression is read as a singleline consisting of non-negative single digit operands and binary arithmeticoperators. The arithmetic operators are + (add), - (subtract), * (multiply) and /(divide).6. Design, develop, and execute a program in C to simulate the working of aqueue of integers using an array. Provide the following operations:a. Insert b. Delete c. Display7. Design, develop, and execute a program in C to read a sparse matrix of integervalues and to search the sparse matrix for an element specified by the user. Printthe result of the search appropriately. Use the triple torepresent an element in the sparse matrix8. Design, develop, and execute a program in C to create a max heap of integers byaccepting one element at a time and by inserting it immediately in to the heap.Use the array representation for the heap. Display the array at the end ofinsertion phase.

9. Design, develop, and execute a program in C to implement a doubly linked listwhere each node consists of integers. The program should support the followingoperations:a. Create a doubly linked list by adding each node at the front.b. Insert a new node to the left of the node whose key value is read as aninput.c. Delete the node of a given data if it is found, otherwise displayappropriate message.d. Display the contents of the list.(Note: Only either (a,b and d) or (a, c and d) may be asked in theexamination)10. Write a C program to construct binary tree & binary tree traversal.11. Write a C program to construct binary search tree.Practical Examination:Practical Examination should be conducted for three hours under the supervision ofexternal examiner. External examiner should evaluate student by practically and orally.Note: In the examination each student picks one question from a lot of all the 11question

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-ICSE-223: LAB-III: COMPUTER NETWORKS-I LABORATORYTeaching SchemeExamination SchemePractical: 2 Hrs/week Term Work: 50 MarksTerm Work:Term work shall consists of record of the experiments carriedout during the course, which should include appropriateexplanation for the corresponding experiment indicating what islearnt from the experiment. The term work shall consist of atleast 10 experimentsAssessment of term work should be done as follows:* Continuous lab assessment: 40 %* Actually performing practical in the laboratory: 40 %* Oral Examination conducted (internally) at the time ofsubmission: 20LIST OF EXPERIMENTS1. Study of Data Communication and Networking. Identify fivecomponents of Data communication system.2. Study of computer network topology and OSI model layered architecture.3. Installation of TC/IP protocol configuration and study the classificationof addresses employing TCP/IP protocols.4. Write a C program to determine if the IP address is in Class A, B, C, D, or E.5. Write a C program to translate dotted decimal IP address into 32 bit address.6. Study of basic network commands: ipconfig, hostname, ping, tracert , netstat etc..7. To establish a straight over and a cross over cable in LAN8. Study of Digital-Digital Conversion and Analog-Digital Conversion9. Study of multiplexing and switching.10. Write a C program to generate Hamming code.11. Study of IEEE Standards12. Study of IEEE 802.11 wireless standard13. Study of IPv4 and IPv6

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-ICSE 224: LAB-IV: UNIX AND SHELL PROGRAMMING LABORATORYTeaching Scheme Examination SchemePractical: 2 Hrs/week Practical/Oral: 50 MarksLIST OF EXPERIMENTS1. Execution of various file/directory handling commands.2. Simple shell script for basic arithmetic and logical calculations.3. Shell scripts to check various attributes of files and directories.4. Shell scripts to perform various operations on given strings.5. Shell scripts to explore system variables such as PATH, HOME etc.6. Shell scripts to check and list attributes of processes.7. Execution of various system administrative commands.8. Write awk script that uses all of its features.9. Use seed instruction to process /etc/password file.10. Write a shell script to display list of users currently logged in.11. Write a shell script to delete all the temporary files.12. Write a shell script to search an element from an array using binarysearching.Practical Examination:Practical Examination should be conducted for three hour under the supervision ofexternal examiner. External examiner should evaluate student by practically and orally.Note: In the examination each student picks one question from a lot of all the 12question

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-ICSE 225: LAB-V: INTRODUCTION TO WEB PROGRAMMINGTeaching SchemeExamination SchemePractical: 2 Hrs/week Practical/Oral: 50 MarksTheory: 2 Hrs/weekContents1. Introduction to web design: Web page & web site, Web Publishing. Introduction to HTML: Structure tags: , , , Block level tags: Headings, Paragraph, Comments, Breaks, Center, Division, Preformatted,Text alignment and font size. Text level tags: Bold, Italic, Underlined, Strike‐through, superscript, subscript. Horizontal Rules Colours in web page: Background colour, Text colour, Link colour. Lists: Ordered Lists, Unordered Lists,Definition List, Nesting lists. Linking HTML Documents. 4 hours2. URLs Types of URLs: Absolute URLs, Relative URLs. Linking HTMLDocuments: The Anchor tag, Linking to document in same folder,Linking to document in Different folder, Linking to document on theweb, Linking to specific location within document.Inserting E‐mail links Including Images: Image formats Linking HTML Documents: The Anchor tag, Linking to document in same folder, Linking to document in Different folder, Linking to document on the web, Linking to specificlocation Within document.4 hours3. Inserting E‐mail links tables, Forms, Frames: Tables: CreatingTables, Editing of rows and columns of table, rowspan, colspan, formatting tables using attributes border, Border colour, back ground, align, width, cell spacing, cell height. Forms: Creating Forms, Forms controls: text controls,Password fields, Radio Buttons, Check boxes, Reset and Submit buttons. The, and tags.3 hours4. Frames: Introduction to frames, Advantages and disadvantages of frames, creating basic frames Frame targeting. Style sheets: Adding style sheet to document: Linking to a Style sheet, Embedding style sheet, Using inline Style sheetBuilding a small web site3 hours5. JavaScript: Introduction to JavaScript, difference between Java and JavaScript, JavaScript syntax, variables and their types, JavaScript operators, arrays and array methods, Program flow: Control statements, exercise, Built‐in objectsin JavaScript, Array, String, Math, Date objects, documents forms andform elements window location, History object.6 hours

Reference Books:1. Castro, “HTML 4 for World Wide Web, 3 rd ed. Pearson education, 1998.2. Barrett, “Essential JavaScript for web professionals,”Pearson Education, 2000.LIST OF EXPERIMENTS1. Design a home page which will display your information i.e Bio data.2. Create Hyperlinks in home page i.e educational details, Hobbies,Achievement, My Ideals etc3. Use table tag to format web page. Also display educational details in tabularformat.4. Create Style sheet to set formatting for text tags. Use it in above pages5. Design signup form to validate username, password, phone numbers etc .usingJava script.6. Design a sign up form information in database. Perform change passwordoperation on it7. Develop and demonstrate a DHTML file that includes Javascript for thefolloing problems :a. Input : A number n obtained using promptOutput: The factorial of a number nb. Input : A number n obtained using promptOutput: The first n Fibonacci numbers8. Develop and demonstrate a DHTML file the includes JavaScript for usingvarious menu items and submenu items9. Design a web page for departmental information system.10. Design and Develop a shopping cart using HTML and JavaScriptPractical Examination:Practical Examination should be conducted for three hours under the supervision of externalexaminer. External examiner should evaluate student by practically and orally.Note: In the examination each student picks one question from a lot of all the 10question

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-IIBSH-252: Engineering Mathematics-IVTeaching SchemeExamination SchemeLectures 4 Hrs/week Theory 80 MarksClass Test20 MarksDuration of Theory paper 3HrsObjectives:1. To develop Logical understanding of the subject2. To develop mathematical skill so that students are able to applymathematical methods & Principal’s in solving problems from Engineeringfields3. To produce graduates with mathematical knowledge & computationalskill.Unit-1:[7 Hours]Function of complex variable (Differential calculus): Introduction, Analyticfunction Cauchy Riemann equations in Cartesian and Polar form, Harmonicfunction, Taylor’s series & Laurent’s series (without proof), Conformal mapping(geometrical representation of function of complex variable), bilineartransformation.Unit 2:[7 Hours]Function of complex variable: (Integral calculus): Line integral, contourintegral: Cauchy’s integral theorem, Cauchy’s integral formula (without proof),Residues, Cauchy’s residue theorem, Integration along unit circle and along upperhalf of semi circle.Unit 3:[6 Hours]Z Transform: Definition, Z transform of elementary functions, properties of Ztransform, Inverse Z transform, Solution of difference equation by Z transform.

Unit 4:[6 Hours]Laplace transform: Definition, Transforms of elementary functions,Properties &theorems of Laplace transforms(without proof ), transforms of periodicfunction,Heaviside unit step function, displaced unit step function, Dirac deltafunction, error function,Bessel’ function of zero order.Unit 5:[6 Hours]Inverse Laplace transform and its applications : Inverse Laplace transforms byusing (i) properties, ii) partial fractions, iii) Convolution theorem, Applicationsto solve linear differential equations with constant coefficients (Initial valueproblems), Simultaneous Linear differential equations .Unit 6:[8 Hours]Fourier Transform and its applications: Fourier integral, Fourier sine and cosineintegral, complex form of Fourier integral, Fourier transforms Fourier sine andcosine transform and inverse Fourier transforms Finite Fourier sine and cosinetransforms. Solution of one dimensional heat equation by using Fourier transform.Note: All Theorems are without proofsSection A: Unit 1, 2, 3Section B: Unit 4, 5, 6Reference Books:1. P. N. Wartikar and J. N. Wartikar, A Text Book of EngineeringMathematics (Volume-I, II,III), Pune Vidyarthi Griha Prakashan, Pune.2. B. S. Grewal, “Higher Engineering Mathematics,” Khanna Publications,New Delhi3. H.K. Das, “Advanced Engineering Mathematics,” S. Chand & Company.4. B.V. Ramana, “Higher Engineering Mathematics ,” (Tata McGraw-Hill).5. Erwin Kreyszig, “Advanced Engineering Mathematics,” Wiley EasternLtd.6. Ravish R Singh, Mukul Bhat, “Engineering Mathematics A TutorialApproach,” by,Mc Graw HillPattern of Question Paper:The units in the syllabus shall be divided in two equal sections. Question papershall be set having two sections A and B. Section A questions shall be set on firstthree units (1,2,3) and Section B questions on remaining three units (4,5,6) .Question paper should cover the entire syllabus.

For 80 marks Paper:1. Minimum ten questions2. Five questions in each section3. Question no 1 and 6 be made compulsory and should have at least ten bits oftwo marks out of which FIVE to be solved.4. Two questions from remaining questions from each section be asked to solvehaving weightage of 15 marks

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY, AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-IICSE-253: DISCRETE MATHEMATICSTeaching SchemeExamination SchemeLectures 4 Hrs/week Theory 80 MarksClass Test20 MarksDuration of Theory paper 3HrsCourse Objectives:Students will learn the essential mathematic concepts and ideas in discretemathematics, which are required for rigorous studies in most areas in computerscience. After completing this course satisfactorily, a student will be:1. Able to construct simple mathematical proofs and possess the ability to verifythem2. Able to understand logical arguments and logical constructs3. Have a better understanding of sets, functions, and relations.4. Acquire ability to describe computer programs in a formal mathematicalmanner.5. Possess the mathematical knowledge and maturity that are required for upperlevel computer.UNIT-14 HoursSet Theory: Sets and Subsets, Set Operations and the Laws of Set Theory,Counting and Venn Diagrams, A First Word on Probability, Countable andUncountable SetsUNIT – 25 HoursFundamentals of Logic: Basic Connectives and Truth Tables, LogicEquivalence – The Laws of Logic, Logical Implication – Rules of InferenceUNIT-31 1 HoursFundamentals of Logic contd.: The Use of Quantifiers, Quantifiers, Definitionsand the Proofs of Theorems.Properties of the Integers: Mathematical Induction, The Well OrderingPrinciple – Mathematical Induction, Recursive DefinitionsUNIT–41 0 HoursRelations and Functions: Cartesian Products and Relations, Functions – Plainand One-to-One, Onto Functions – Stirling Numbers of the Second Kind, SpecialFunctions, The Pigeon-hole Principle, Function Composition and InverseFunctions

Relations contd.: Properties of Relations, Computer Recognition – Zero-OneMatrices and Directed Graphs, Partial Orders – Hasse Diagrams, EquivalenceRelations and PartitionsUNIT – 55 HoursGroups: Definitions, Examples, and Elementary Properties, Homomorphisms,Isomorphisms, and Cyclic Groups, Cosets, and Lagrange’Theorem.Coding Theory and Rings: Elements of Coding Theory, The Hamming Metric,The Parity Check, and Generator MatricesUnit – 65 HoursGroup Codes: Decoding with Coset Leaders, Hamming MatricesRings and Modular Arithmetic: The Ring Structure – Definition and Examples,Ring Properties and Substructures, The Integers Modulo nText Book:1. Ralph P. Grimaldi, “Discrete and Combinatorial Mathematics, “5 th Edition, Pearson Education, 2004.(Chapter 3.1, 3.2, 3.3, 3.4, Appendix 3,Chapter 2, Chapter 4.1, 4.2, Chapter 5.1 to 5.6, Chapter 7.1 to 7.4, Chapter16.1, 16.2, 16.3, 16.5 to 16.9, and Chapter 14.1, 14.2, 14.3).Reference Books:1. Kenneth H. Rosen, “Discrete Mathematics and its Applications, “7 th Edition, McGraw Hill, 2010.2. Jayant Ganguly, “A Treatise on Discrete Mathematical Structures,”Sanguine-Pearson, 2010.3. D.S. Malik and M.K. Sen, “ Discrete Mathematical Structures: Theory andApplications,” Cengage Learning, 2004.4. Thomas Koshy. Discrete Mathematics with Applications,” Elsevier,2005,Reprint 2008.

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-IICSE-254: OBJECT ORIENTED PROGRAMMING USING C++Teaching SchemeExamination SchemeLectures 4 Hrs/week Theory 80 MarksClass Test20 MarksDuration of Theory paper 03 HrsUnit-1:[5 Hours]Introduction: Overview of C++, Sample C++ program, Different data types,operators, expressions, and statements, arrays and strings, pointers & userdefinedtypes.Function Components, argument passing, inline functions, function overloading,recursive functions.Unit-2:[10 Hours]Classes & Objects – I: Class Specification, Class Objects, Scope resolutionoperator, Access members, Defining member functions, Data hiding,Constructors, Destructors, Parameterized constructors, Static data members,FunctionsFriend functions, passing objects as arguments, Returning objects, Arrays ofobjects, Dynamic objects, Pointers to objects, Copy constructors, Genericfunctions and classes, Applicationspost-Operator overloading using friend functions such as +, - , pre-increment,increment, [ ] etc., overloading .Unit-3:[5 Hours]Inheritance-I: Base Class, Inheritance and protected members, protected baseclass inheritance, inheriting multiple base classes,Unit-4[5 Hours]Inheritance-II: Constructors, Destructors and Inheritance, Passing parameters tobase class constructors, Granting access, Virtual base classes.Unit-5: Virtual functions, Polymorphism:[5 Hours]Virtual function, calling a Virtual function through a base class reference, Virtualattribute is inherited, Virtual functions are hierarchical, pure virtual functions,Abstract classes, Using virtual functions, Early and late binding.

Unit-6: System Basics, File I/0, Exception Handling, STL: [10 Hours]C++ stream classes, Formatted I/O, I/O manipulators, fstream and the Fileclasses, File operations Exception handling fundamentals, Exception handlingoptions STL: An overview, containers, vectors, lists, maps.Text Books:1. Herbert Schildt: The Complete Reference C++, 4 th Edition,Tata McGraw Hill, 2003.Reference Books:1. Stanley B.Lippmann, Josee Lajore: C++ Primer, 4 th Edition, PearsonEducation, 20052. Paul J D e i t e l , Harvey M Deitel: C++ for Programmers, PearsonEducation, 2009.3. K R Venugopal, Rajkumar Buyya, T Ravi Shankar: Mastering C++,TataMcGraw Hill, 1999.Section A: Unit 1, 2, 3Section B: Unit 4, 5, 6PATTERN OF QUESTION PAPER:Six units in the syllabus shall be divided in two equal parts i.e. 3 units in eachpart. Question paper shall be set having two sections A and B. Section Aquestions shall be set on first part and Section B questions on second part.Question paper should cover the entire syllabus.For 80 marks Paper:1. Minimum ten questions2. Five questions in each section3. Question no 1 from section A and Question no 6 from section B havingweightage of 10 marks each be made compulsory and should have at leasteight bits of two marks out of which five to be solved.4. Two questions from remaining questions from each section A and B beasked to solve each having weightage of 15 marks.

Unit – 5[6 Hours]Memory Interface – 2, I/O Interface – 1: Memory Interfacing (continued):Address Decoding, 8088 Memory Interface, 8086 Memory Interface. Basic I/OInterface: Introduction to I/O Interface, I/O Port Address Decoding.Unit -6[7 Hours]I/O Interface – 2, Interrupts, and DMA: I/O Interface (continued): TheProgrammable Peripheral Interface 82C55, Programmable Interval Timer 8254.Interrupts: Basic Interrupt Processing, Hardware Interrupts: INTR and INTA/;Direct Memory Access: Basic DMA Operation and Definition.Text Book:1. Barry B Brey: The Intel Microprocessors, 8 th Edition, PearsonEducation, 2009.(Listed topics only from the Chapters 1 to 13)Reference Books:1. Douglas V. Hall: Microprocessors and Interfacing, Revised 2 nd Edition,TMH, 2006.2. K. Udaya Kumar & B.S. Umashankar : Advanced Microprocessors &IBM-PC Assembly Language Programming, TMH 2003.3. James L. Antonakos: The Intel Microprocessor Family: Hardware andSoftware Principles and Applications, Cengage Learning, 2007.Section A: Unit 1, 2, 3Section B: Unit 4, 5, 6PATTERN OF QUESTION PAPER:Six units in the syllabus shall be divided in two equal parts i.e. 3 units in eachpart. Question paper shall be set having two sections A and B. Section Aquestions shall be set on first part and Section B questions on second part.Question paper should cover the entire syllabus.For 80 marks Paper:1. Minimum ten questions2. Five questions in each section3. Question no 1 from section A and Question no 6 from section B havingweightage of 10 marks each be made compulsory and should have at least eightbits of two marks out of which five to be solved.4. Two questions from remaining questions from each section A and B be askedto solve each having weightage of 15 marks.

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,Teaching SchemeAURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-IICSE-256: COMPUTER GRAPHICSExamination SchemeLectures 4 Hrs/week Theory 80 MarksTutorial --- Class Test 20 MarksDuration of Theory paper 03 HrsObjectives:After completing this course, students will be able toIdentify and explain the core concepts of computer graphics.Apply graphics programming techniques to design, and create computergraphics scenes.Unit 1: Introduction:5 hoursApplications of computer graphics; A graphics system; Images: Physical andsynthetic; Imaging Systems; The synthetic camera model; The programmer’sinterface; Graphics architectures; Programmable Pipelines; PerformanceCharacteristicsGraphics Programming: The Sierpinski gasket; Programming Two DimensionalApplications.Unit 2: The OpenGL:4 hoursThe OpenGL API; Primitives and attributes; Color; Viewing; Control functions;The Gasket program; Polygons and recursion; The three- dimensional gasket;Plotting Implicit FunctionsUnit 3: Input and Interaction:11 hoursInteraction; Input devices; Clients and Servers; Display Lists; Display Lists andModeling; Programming Event Driven Input; Menus; Picking; A simple CADprogram; Building Interactive Models; Animating Interactive Programs; Designof Interactive Programs; Logic OperationsGeometric Objects and Transformations-I:Scalars, Points, and Vectors; Three-dimensional Primitives; Coordinate Systemsand Frames; Modeling a Colored Cube; Affine Transformations; Rotation,Translation and Scaling;Unit-44 hoursGeometric Objects and Transformations-II: Geometric Objects andTransformations; Transformation in Homogeneous Coordinates; Concatenation of

Transformations; OpenGL Transformation Matrices; Interfaces to threedimensionalapplications; Quaternion’s.Unit 5: Viewing:10 hoursClassical and computer viewing; Viewing with a Computer; Positioning ofthe camera; Simple projections; Projections in OpenGL; Hidden- surface removal;Interactive Mesh Displays; Parallel-projection matrices; Perspective-projectionmatrices; Projections and Shadows.Hours Lighting and Shading: Light and Matter; Light Sources; The PhongLighting model; Computation of vectors; Polygonal Shading; Approximation of asphere by recursive subdivisions; Light sources in OpenGL; Specification ofmaterials in OpenGL; Shading of the sphere model; Global Illumination.Unit 6: Implementation: 6 hoursBasic Implementation Strategies; Four major tasks; Clipping; Line-segmentclipping; Polygon clipping; Clipping of other primitives; Clipping in threedimensions; Rasterization; Bresenham’s algorithm; Polygon Rasterization;Hidden-surface removal; Antialiasing; Display considerations.Text Books:1. Edward Angel, “Interactive Computer Graphics A Top-DownApproach with OpenGL,” 5 th Edition, Pearson Education, 2008.(Chapters 1 to 7)Reference Books:1. Donald Hearn and Pauline Baker, “ Computer Graphics- OpenGLVersion,” 3 rd Edition, Pearson Education, 2004.2. F.S. Hill Jr, “Computer Graphics Using OpenGL,” 3 rd Edition, PHI,2009.3. James D Foley, Andries Van Dam, Steven K Feiner, John F Hughes,“Computer Graphics,” Pearson Education 1997.Section A: Unit 1, 2, 3Section B: Unit 4, 5, 6PATTERN OF QUESTION PAPER:Six units in the syllabus shall be divided in two equal parts i.e. 3 units in eachpart. Question paper shall be set having two sections A and B. Section Aquestions shall be set on first part and Section B questions on second part.Question paper should cover the entire syllabus.For 80 marks Paper:1. Minimum ten questions2. Five questions in each section3. Question no 1 from section A and Question no 6 from section B havingweightage of 10 marks each be made compulsory and should have at leasteight bits of two marks out of which five to be solved.4. Two questions from remaining questions from each section A and B beasked to solve each having weightage of 15 marks.

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-IICSE-271: LAB-VI: OBJECT ORIENTED PROGRAMMING USINGC++ LABORATORYTeaching SchemeExamination SchemePractical: 2 Hrs/week Practical/Oral: 50 MarksLIST OF EXPERIMENTS1. Design, develop, and execute a program in C++ based on the followingrequirements:An EMPLOYEE class is to contain the following data members andmember functions: Data members: Employee_Number (an integer),Employee_Name (a string of characters), Basic_Salary (an integer), All_Allowances (an integer), IT (an integer), Net_Salary (aninteger).Member functions: to read the data of an employee, to calculateNet_Salary and to print the values of all the data members.(All_Allowances = 123% of Basic; Income Tax (IT) = 30% of thegross salary (= basic_Salary _ All_Allowance);Net_Salary = Basic_Salary + All_Allowances – IT)2. Design, develop, and execute a program in C++ to create a class calledSTRING and implement the following operations. Display the resultsafter every operation by overloading the operator

5. Implement complex number class with necessary operator overloading andtype conversions such as integer to complex, double to complex, complexto double etc.6. Implement Matrix class with dynamic memory allocation and necessarymethods. Give proper constructor, destructor, copy constructor, andoverloading of assignment operator.7. Overload the new and delete operators to provide custom dynamicallocation of memory.8. Develop a template of linked-list class and its methods.9. Develop templates of standard sorting algorithms such as bubble sort,insertion sort; merge sort, and quick sort.10. Design stack and queue classes with necessary exception handling.11. Practical based on implementation of various types of inheritancePractical Examination:Practical Examination should be conducted for three hours under the supervision of externalexaminer. External examiner should evaluate student by practically and orally.Note: In the examination each student picks one question from a lot of all the 11question

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-IICSE-272: LAB-VII: MICROPROCESSORS LABORATORYTeaching SchemeExamination SchemePractical: 2 Hrs/week Practical/Oral: 50 MarksLIST OF EXPERIMENTS1. Study of MASM/TASM.2. Write an assembly language program to perform 8 bit, 16 bit addition.3. Write an assembly language program to perform 8 bit, 16 bit subtraction.4. Write an assembly language program to perform negative result subtraction.5. Write an assembly language program to perform 8 bit, 16 bit Multiplication.6. Write an assembly language program to perform16 bit by 8 bit division7. Write an assembly language program to check whether entered number is even orodd.8. Write an assembly language program to calculate average of temperatures.9. Write an assembly language program to perform sum of digits for 2, 3 digitsnumbers.10. Write an assembly language program to perform conversion from two ASCII no’s topacked BCD.11. Write an assembly language program to perform conversion from BCD to Hex.12. Write an assembly language program to interface stepper motor.(application)13. Write an assembly language program to interface LED (application)Practical Examination:Practical Examination should be conducted for three hours under the supervision of externalexaminer. External examiner should evaluate student by practically and orally.Note: In the examination each student picks one question from a lot of all the 13question

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,AURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-IICSE-273: LAB-VIII: COMPUTER GRAPHICS LABORATORYTeaching SchemeExamination SchemePractical: 2 Hrs/week Term Work: 50 MarksTerm Work:Term work shall consists of record of the experiments carried outduring the course, which should include appropriate explanation forthe corresponding experiment indicating what is learnt from theexperiment. The term work shall consist of at least 10 experimentsAssessment of term work should be done as follows:* Continuous lab assessment: 40 %* Actually performing practical in the laboratory: 40 %* Oral Examination conducted (internally) at the time ofsubmission: 20LIST OF EXPERIMENTS1. Study of basic graphics functions defined in “graphics.h”.2. Study of graphics standards like CORE, GKS (Graphics Kernel System),GKS-3D(Graphics Kernel System -3 Dimensions), PHIGS (Programmer'sHierarchical Interactive Graphics Systems), CGM (Computer GraphicsMetafile), CGI (Computer Graphics Interface).3. Program for Line Drawing using DDA algorithm.4. Program for Line Drawing using Bresenham’s algorithm.5. Implement Polygon filling algorithms.6. Programs using 2-D transformations.7. Programs to study window to viewport transformations.8. Program for Line clipping algorithm.9. Programs to study 3-D transformations..10. Program to create a simple and proper “User Interface” for a definedapplication.

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,Teaching SchemeAURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-IICSE-274: LAB-IX: OPEN SOURCE LABORATORYExamination SchemeLectures 2 Hrs/week Practical & Oral : 50 MarksPractical2 Hrs/weekObjectives:This course is aimed to: Understand open source movement worldwide Use the fastest growing open source operating system, “Linux”, today Effectively install, use and perform basic configuration of Linux system Build user-level skills to perform Linux system administration in itprofession Enable competency in industry-problem identification and resolution Develop application using lampUnit 1: Linux and Open Source3 hoursLinux Usage basics: Logging into the system, changing users and editing textfiles. Running Commands and Getting Help, Browsing the file system, Users,Groups and PermissionUnit 2: Linux Administration3 hoursInstallation of Linux interactively, Perform, user and group administration,Administer the Linux printing subsystem, Automate tasks with at, cron, Install,update, query and remove software packages with RPMUnit 3: Linux Application4 hoursAccessing and Running applications: cc complier, gee complier, Mozilla Firefox.Multimedia in Linux: Listening to audio, Playing video, Using digital camera,Recording musics / video CDs.Unit 4: Apache and PHP4 hoursIntroduction to the web server .installing Apache on Linux: httpd service.PHP: testing installation basics of PHP scripts, variables Data types, Operatorsand – Constants, flow control functions, if statement, loops arrays, strings, Datesand times-

Unit 5: MySQL, server, and Application3 hoursMySQL: configuration MySQL server, working with MySQL Databases, MySQLTables,Commands – INSERT, SELECT, UPDATE, REPLACE, DELETE. Date andTime function MySQL.Unit 6: PHP3 hoursMySQL Application Developemnent: Connecting to MySQL with PHP, Insertingdata with PHP,retrieving data with PHP, Developing PHP scripts for dynamicweb page like Feedback form, online admission form, online test.Reference Books:Title Author Pub1 Red Hat Linux Bible Christopher Negus Wiley PublishingISBN : 0-7645-4333-42 PHP, MySQL and Apache Julie C Meloni Pearson EducationISBN : 81-297-0443-93 The Complete Reference Linux Peterson Tata McGRAW HILLISBN : 0-07-044489-74 UNIX using Linux Jack Dent,Tony GaddisCourse Technology( Thomson Learning)ISBN : 981-240-218-7Internet Resources:Sn Title URL1 Open Source Phenomenon http://opensource.org/2 Open Source Technology : http://www-3 Brief Open Source : Benefits 128.ibm.com/developerworks/opensource/nehttp://www.sun.com/software/opensource/4 Beginner's Guide to Linux http://www.linux.org/lessons/beginner/- Michael Jordan5 Linux Course for IntermediateLevel Usershttp://www.linux.org/lessons/interm/index.html6 - PHP Michael Manual Jordanhttp://www.php.net/tut.php

LIST OF EXPERIMENTS.1. Installation of Linux2. Use of various commands3. Use of Text Processing Tools: grep, cut,4. User and Group Creation5. Back up using tar6. Installation using RPM7. C/C++ program using cc / gcc8. Configuring Apache9. PHP script for sorting the marks10. PHP scripts for other tasks11. MySQL Installation, Configuration and Testing12. Design of admission form using PHP – MYSQLPractical Examination:Practical Examination should be conducted for three hours under the supervision of externalexaminer. External examiner should evaluate student by practically and orally.Note: In the examination each student picks one experiment based on aboveConcept.

DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,Teaching SchemeAURANGABADFACULTY OF ENGINEERING AND TECHNOLOGYSecond Year EngineeringSemester-IIBSH 275: Communication SkillsExamination SchemePractical: 2 Hrs/week Term work: 50 MarksTheory: 2 Hrs/week

BOS in Computer Science & Engineering/Information TechnologyEquivalent subjects at SE (CSE/IT) – I & II Pre-revised course to the RevisedCourse of S. E. (CSE/IT) Sem – III & IV.SE (CSE) Part – ISE (CSE) –I (Pre-Revised)Equivalent / Replacement subject1 Engineering Mathematics-III Engineering Mathematics-III2 Discrete Mathematics Discrete Mathematics of S.E(CSE)Sem-IV (Revised)3 Data Structures using C Data Structures using C4 Data communication Computer Networks-I of S.E.(CSE)Sem-III (Revised)5 Digital Electronics Digital Electronics6 Advance C Programming Lab LAB-V Introduction to web programming ofS.E.(CSE) Sem-III (Revised)7 Communication Skills Communication Skills of S.E(CSE)Sem-IV (Revised)SE (CSE) Part – IISE (CSE) –I (Pre-Revised)Equivalent / Replacement subject1 Engineering Mathematics-IV Engineering Mathematics-III2 Open Source Software Technology Unix and Shell Programming of S.E(CSE)Sem-III (Revised)3 Computer graphics Computer graphics4 Micro processors and Computer Micro processorsorganization5 Object Oriented Programming(using Object Oriented Programming with C++ Labc++)6 Mini Project LAB-IX Open Source Lab7 Communication Skills Communication Skills