proposed syllabus for second year degree course in computer

More documents

Recommendations

Info

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
Page 1 and 2: PROPOSEDSYLLABUSFORSECOND YEAR DEGR
Page 3 and 4: DR. BABASAHEB AMBEDKAR MARATHWADA U
Page 15 and 16: 9. Design, develop, and execute a p
Page 19 and 20: Reference Books:1. Castro, “HTML
Page 21: Unit 4:[6 Hours]Laplace transform:
Page 28 and 29: Unit - 5[6 Hours]Memory Interface -
Page 30 and 31: Transformations; OpenGL Transformat
Page 32 and 33: 5. Implement complex number class w
Page 36 and 37: Unit 5: MySQL, server, and Applicat

proposed syllabus for second year degree course in computer

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?