Scribd
Upload
179 views

ADE

The document discusses several topics related to computer engineering and software engineering. It covers combinational circuit design, multiplexers, decoders, programmable logic devices, VHDL, latches and flip-flops in computer engineering. It also discusses system models, design and implementation, software testing, and software evolution in software engineering. Other topics covered include memory systems, arithmetic, relations and functions, recurrence relations, linked lists, trees, Fourier transforms, z-transforms, and numerical solutions to ordinary differential equations.

Uploaded by

Syeda Hiba Jasmeen 1HK19IS112
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
179 views

ADE

The document discusses several topics related to computer engineering and software engineering. It covers combinational circuit design, multiplexers, decoders, programmable logic devices, VHDL, latches and flip-flops in computer engineering. It also discusses system models, design and implementation, software testing, and software evolution in software engineering. Other topics covered include memory systems, arithmetic, relations and functions, recurrence relations, linked lists, trees, Fourier transforms, z-transforms, and numerical solutions to ordinary differential equations.

Uploaded by

Syeda Hiba Jasmeen 1HK19IS112
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

ADE

Combinational circuit design and simulation using gates: Review of Combinational circuit
Design, design of circuits with limited Gate Fan-in, Gate delays and Timing diagrams,
Hazards in combinational Logic, simulation and testing of logic circuits
Multiplexers, Decoders and Programmable Logic Devices: Multiplexers, three state buffers,
Decoders and encoders, Programmable Logic devices, Programmable Logic Arrays,
Programmable Array Logic.
Text book 1: Part B: Chapter 8, Chapter 9 (Sections 9.1 to 9.6)
RBT: L1, L2
Module 4
Introduction to VHDL: VHDL description of combinational circuits, VHDL Models for
Multiplexers, VHDL Modules.
Latches and Flip-Flops: Set Reset Latch, Gated Latches, Edge-Triggered D Flip Flop 3, SR
Flip Flop, J K Flip Flop, T Flip Flop, and Flip Flop with additional inputs, Asynchronous
Sequential Circuits
Text book 1: Part B: Chapter 10(Sections 10.1 to 10.3), Chapter 11 (Sections 11.1 to 11.9)
RBT: L1, L2

Computer Organization
Module 3
Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only Memories,
Speed, Size, and Cost, Cache Memories – Mapping Functions, Replacement Algorithms,
Performance Considerations.
Text book 1: Chapter5 – 5.1 to 5.4, 5.5 (5.5.1, 5.5.2), 5.6
RBT: L1, L2, L3
Module 4
Arithmetic: Numbers, Arithmetic Operations and Characters, Addition and Subtraction of
Signed Numbers, Design of Fast Adders, Multiplication of Positive Numbers, Signed
Operand Multiplication, Fast Multiplication, Integer Division.
Text book 1: Chapter2-2.1, Chapter6 – 6.1 to 6.6
RBT: L1, L2, L3

Software Engineering
Module 3
System Models: Context models (Sec 5.1). Interaction models (Sec 5.2). Structural models
(Sec 5.3). Behavioral models (Sec 5.4). Model-driven engineering (Sec 5.5).
Design and Implementation: Introduction to RUP (Sec 2.4), Design Principles (Chap 7).
Object-oriented design using the UML (Sec 7.1). Design patterns (Sec 7.2). Implementation
Issues (Sec 7.3). Open source development (Sec 7.4).
RBT: L1, L2, L3
08
Module 4
Software Testing: Development testing (Sec 8.1), Test-driven development (Sec 8.2),
Release testing (Sec 8.3), User testing (Sec 8.4). Test Automation (Page no 212).
Software Evolution: Evolution processes (Sec 9.1). Program evolution dynamics (Sec 9.2).
Software maintenance (Sec 9.3). Legacy system management (Sec 9.4).
RBT: L1, L2, L3

DMS
Module 3
Relations and Functions: Cartesian Products and Relations, Functions – Plain and One-to-
One, Onto Functions. The Pigeon-hole Principle, Function Composition and Inverse
Functions.
Relations: Properties of Relations, Computer Recognition – Zero-One Matrices and Directed
Graphs, Partial Orders – Hasse Diagrams, Equivalence Relations and Partitions.
Text book 1: Chapter5, Chapter7 – 7.1 to 7.4
RBT: L1, L2, L3
Module 4
The Principle of Inclusion and Exclusion: The Principle of Inclusion and Exclusion,
Generalizations of the Principle, Derangements – Nothing is in its Right Place, Rook
Polynomials.
Recurrence Relations: First Order Linear Recurrence Relation, the Second Order Linear
Homogeneous Recurrence Relation with Constant Coefficients.
Text book 1: Chapter8 – 8.1 to 8.4, Chapter10 – 10.1, 10.2
RBT: L1, L2, L3

Data Structures
Module 3
Linked Lists: Definition, Representation of linked lists in Memory, Memory allocation;
Garbage Collection. Linked list operations: Traversing, Searching, Insertion, and Deletion.
Doubly Linked lists, Circular linked lists, and header linked lists. Linked Stacks and Queues.
Applications of Linked lists – Polynomials, Sparse matrix representation. Programming
Examples
Textbook 1: Chapter 4: 4.1 – 4.6, 4.8, Textbook 2: Chapter 5: 5.1 – 5.10,
RBT: L1, L2, L3
Module 4
Trees: Terminology, Binary Trees, Properties of Binary trees, Array and linked
Representation of Binary Trees, Binary Tree Traversals - In order, post order, preorder;
Additional Binary tree operations. Threaded binary trees, Binary Search Trees – Definition,
Insertion, Deletion, Traversal, Searching, Application of Trees-Evaluation of Expression,
Programming Examples
Textbook 1: Chapter 5: 5.1 –5.5, 5.7; Textbook 2: Chapter 7: 7.1 – 7.9
RBT: L1, L2, L3

Engineering Mathematics
Module-3
Fourier Transforms: Infinite Fourier transforms, Fourier sine and cosine transforms. Inverse Fourier
Transforms. Problems.
Difference Equations and Z-Transforms: Difference equations, basic definition, z-transform-definition,
Standard z-transforms, Damping and shifting rules, initial value and final value theorems (without proof) and
Problems, Inverse z-transform and applications to solve difference equations.
Module-4
Numerical Solutions of Ordinary Differential Equations (ODE’s):
Numerical solution of ODE’s of first order and first degree- Taylor’s series method, Modified Euler’s method.
Runge -Kutta method of fourth order, Milne’s and Adam-Bash forth predictor and corrector method (No
Derivations of formulae)-Problems.

You might also like