#1
| |||
| |||
![]()
Here I am looking for the Syllabus and Question paper of Discrete Mathematical Structures offered during 3rd Sem of Computer Science & Engineering (CSE) at Visvesvaraya Technological University (VTU). Can you please tell me form where I can get it?? As you are looking for the Syllabus and Question paper of Discrete Mathematical Structures offered during 3rd Sem of Computer Science & Engineering (CSE) at Visvesvaraya Technological University so here I am giving you same Course structure of 3rd Sem CSE 10MAT31 Engineering Mathematics -III 10CS32 Electronic Circuits 10CS33 Logic Design 10CS34 Discrete Mathematical Structures 10CS35 Data Structures with C 10CS36 Object Oriented Programming with C++ 10CSL37 Data Structures with C/C++ Laboratory 10CSL38 Electronic Circuits & Logic Design Laboratory Syllabus of Discrete Mathematical Structures: PART – A UNIT 1: Set Theory: Sets and Subsets, Set Operations and the Laws of Set Theory, Counting and Venn Diagrams, A First Word on Probability, Countable and Uncountable Sets UNIT 2: Fundamentals of Logic: Basic Connectives and Truth Tables, Logic Equivalence – The Laws of Logic, Logical Implication – Rules of Inference UNIT 3: Fundamentals of Logic contd.: The Use of Quantifiers, Quantifiers, Definitions and the Proofs of Theorems UNIT 4: Properties of the Integers: Mathematical Induction, The Well Ordering Principle – Mathematical Induction, Recursive Definitions PART – B UNIT 5: Relations and Functions: Cartesian Products and Relations, Functions – Plain and One-to-One, Onto Functions – Stirling Numbers of the Second Kind, Special Functions, The Pigeon-hole Principle, Function Composition and Inverse Functions UNIT 6: Relations contd.: Properties of Relations, Computer Recognition – Zero-One Matrices and Directed Graphs, Partial Orders – Hasse Diagrams, Equivalence Relations and Partitions UNIT 7: Groups: Definitions, Examples, and Elementary Properties, Homomorphisms, Isomorphisms, and Cyclic Groups, Cosets, and Lagrange’s Theorem Coding Theory and Rings: Elements of Coding Theory, The Hamming Metric, The Parity Check, and Generator Matrices UNIT 8: Group Codes: Decoding with Coset Leaders, Hamming Matrices Rings and Modular Arithmetic: The Ring Structure – Definition and Examples, Ring Properties and Substructures, The Integers Modulo n Here I am uploading the question paper of Discrete mathematics for you which is free of cost Address: Visvesvaraya Technological University "Jnana Sangama" Machhe Belgaum: 590 018 Tele: 0831-2498100 Fax: 0831-2405467 e-mail : registrar[@]vtu.ac.in Map: Quote:
SEMESTER III Subject Code 15CS32 Analog and Digital Electronics Module -1 Field Effect Transistors: Junction Field Effect Transistors, MOSFETs, Differences between JFETs and MOSFETs, Biasing MOSFETs, FET Applications, CMOS Devices. Wave-Shaping Circuits: Integrated Circuit(IC) Multivibrators. Introduction to Operational Amplifier: Ideal v/s practical Opamp, Performance Parameters, Operational Amplifier Application Circuits:Peak Detector Circuit, Comparator, Active Filters, NonLinear Amplifier, Relaxation Oscillator, Current-To-Voltage Converter, Voltage-ToCurrent Converter. Module -2 The Basic Gates: Review of Basic Logic gates, Positive and Negative Logic, Introduction to HDL. Combinational Logic Circuits: Sum-of-Products Method, Truth Table to Karnaugh Map, Pairs Quads, and Octets, Karnaugh Simplifications, Dont-care Conditions, Product-of-sums Method, Product-of-sums simplifications, Simplification by QuineMcClusky Method, Hazards and Hazard covers, HDL Implementation Models. Module 3 Data-Processing Circuits: Multiplexers, Demultiplexers, 1-of-16 Decoder, BCD to Decimal Decoders, Seven Segment Decoders, Encoders, Exclusive-OR Gates, Parity Generators and Checkers, Magnitude Comparator, Programmable Array Logic, Programmable Logic Arrays, HDL Implementation of Data Processing Circuits. Arithmetic Building Blocks, Arithmetic Logic Unit Flip- Flops: RS Flip-Flops, Gated Flip-Flops, Edge-triggered RS FLIP-FLOP, Edge-triggered D FLIP-FLOPs, Edge-triggered JK FLIPFLOPs. Module-4 Flip- Flops: FLIP-FLOP Timing, JK Master-slave FLIP-FLOP, Switch Contact Bounce Circuits, Various Representation of FLIP-FLOPs, HDL Implementation of FLIP-FLOP. Registers: 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 HDL. Counters: Asynchronous Counters, Decoding Gates, Synchronous Counters, Changing the Counter Modulus. Module-5 Counters: Decade Counters, Presettable Counters, Counter Design as a Synthesis problem, A Digital Clock, Counter Design using HDL. D/A Conversion and A/D Conversion: Variable, Resistor Networks, Binary Ladders, D/A Converters, D/A Accuracy and Resolution, A/D Converter-Simultaneous Conversion, A/D Converter-Counter Method, Continuous A/D Conversion, A/D Techniques, Dual-slope A/D Conversion, A/D Accuracy and Resolution. Last edited by Udai Kant; December 6th, 2019 at 12:42 PM. |
#2
| ||||
| ||||
![]()
The syllabus of DATA Structures with C is as follows: DATA STRUCTURESWITH C: PART-A UNIT - 1 8 Hours BASIC CONCEPTS: Pointers and Dynamic Memory Allocation, Algorithm Specification, Data Abstraction, Performance Analysis, Performance Measurement UNIT - 2 6 Hours ARRAYS and STRUCTURES: Arrays, Dynamically Allocated Arrays, Structures and Unions, Polynomials, Sparse Matrices, Representation of Multidimensional Arrays UNIT - 3 6 Hours STACKS AND QUEUES: Stacks, Stacks Using Dynamic Arrays, Queues, Circular Queues Using Dynamic Arrays, Evaluation of Expressions, Multiple Stacks and Queues. UNIT - 4 6 Hours LINKED LISTS: Singly Linked lists and Chains, Representing Chains in C, Linked Stacks and Queues, Polynomials, Additional List operations, Sparse Matrices, Doubly Linked Lists PART – B UNIT - 5 6 Hours TREES – 1: Introduction, Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Heaps. UNIT – 6 6 Hours TREES – 2, GRAPHS: Binary Search Trees, Selection Trees, Forests, Representation of Disjoint Sets, CountinBinary Trees, The Graph Abstract Data Type. UNIT – 7 6 Hours PRIORITY QUEUES Single- and Double-Ended Priority Queues, Leftist Trees, Binomial Heaps, Fibonacci Heaps, Pairing Heaps UNIT – 8 8 Hours EFFICIENT BINARY SEARCH TREES: Optimal Binary Search Trees, AVL Trees, Red-Black Trees, Splay Trees. Text Book: 1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures in C, 2 nd 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 Pseudocode Approach with C, Cengage Learning, 2005. 4. Robert Kruse & Bruce Leung: Data Structures & Program Design in C, Pearson Education, 2007 Question Paper: ![]() ![]()
__________________ Answered By StudyChaCha Member Last edited by Aakashd; July 31st, 2018 at 03:26 PM. |
#4
| |||
| |||
![]() i wnt all sub model quen paper plz give me
|