PTSP | DAA | CAO Important Questions in description #studenttribe

Subject 1: PTSP
UNIT I: INTRODUCTION TO PROBABILITY
*Discrete and Continuous Sample Spaces
*Events, Probability Definitions, and Axioms
*Binomial, Poisson, Uniform, Gaussian
Distribution

UNIT II: OPERATIONS ON SINGLE VARIABLE – EXPECTATIONS
*Expected Value and Function of a Random Variable
*Variance and Skew
*Monotonic Transformations and Non-monotonic Transformations of Continuous Random Variable

UNIT III : OPERATIONS ON & MULTIPLE RANDOM– EXPECTATIONS
*Joint Distribution Function and Properties
*Sum of Two or more Random Variables
*Central Limit Theorem and Expected Value of a Function of
Random Variables

UNIT IV: RANDOM PROCESSES -TEMPORAL and SPECTRAL CHARACTERISTICS
*Stationarity and statistical independence
*Autocorrelation and Cross-correlation
*The Power Spectrum and Types

UNIT V: MODELLING OF NOISE

*Classification of Noise
*Types and Sources of noises
*Average noise Figures

Subject 2: Design and Analysis of Algorithms

UNIT I: Introduction
*Performance Analysis-Space and Time complexity
*Divide and conquer- General method
*applications and Strassen’s Matrix Multiplication.

UNIT II: Disjoint Set Operations
*Union and find algorithms
*Bi-connected components Backtracking
*8 Queen problem and Hamiltonian cycles

UNIT III: Greedy Method
*Knapsack problem
*Minimum cost spanning trees
*Single source shortest path problem

UNIT IV: Dynamic Programming
* Chained matrix multiplication
*Optimal binary search trees
*0/1 Knapsack and Travelling salesperson problem.

UNIT V: Branch and Bound
*LC Branch and Bound solution
*FIFO Branch and Bound solution
*NP-Hard and NP-Complete problems and Cook’s theorem

Subject 3: Computer Architecture and Organization
UNIT I:
*Basic operational concepts
*Memory locations and addresses
*Memory Operations
*Addressing modes

UNIT II:
*Instruction fetch and execution steps
*Addition and subtraction of signed numbers
*Multiplication of unsigned and signed numbers
*Floating-point numbers and operations

UNIT III :
* Semiconductor RAM memories
*Read-only memories
*I/O bus and interface modules
*Asynchronous data transfer and serial transfer

UNIT IV:
*Modes of transfer and Priority interrupt
*Parallel processing and Pipelining
*Instruction pipeline and Vector processing
*Characteristics of multiprocessors
Subject 3: Computer Architecture and Organization

UNIT I:
*Basic operational concepts
*Memory locations and addresses
*Memory Operations
*Addressing modes

UNIT II:
*Instruction fetch and execution steps
*Addition and subtraction of signed numbers
*Multiplication of unsigned and signed numbers
*Floating-point numbers and operations

UNIT III :
* Semiconductor RAM memories
*Read-only memories
*I/O bus and interface modules
*Asynchronous data transfer and serial transfer

UNIT IV:
*Modes of transfer and Priority interrupt
*Parallel processing and Pipelining
*Instruction pipeline and Vector processing
*Characteristics of multiprocessors

[StudentTribe]

Subject 1: PTSP UNIT
I: INTRODUCTION TO PROBABILITY
*Discrete and Continuous Sample Spaces *Events, Probability Definitions, and Axioms *Binomial, Poisson, Uniform, Gaussian Distribution
UNIT II: OPERATIONS ON SINGLE VARIABLE – EXPECTATIONS *Expected Value and Function of a Random Variable *Variance and Skew *Monotonic Transformations and Non-monotonic Transformations of Continuous Random Variable UNIT III : OPERATIONS ON & MULTIPLE RANDOM– EXPECTATIONS *Joint Distribution Function and Properties *Sum of Two or more Random Variables *Central Limit Theorem and Expected Value of a Function of Random Variables UNIT IV: RANDOM PROCESSES -TEMPORAL and SPECTRAL CHARACTERISTICS *Stationarity and statistical independence *Autocorrelation and Cross-correlation *The Power Spectrum and Types UNIT V: MODELLING OF NOISE *Classification of Noise *Types and Sources of noises *Average noise Figures Subject 2: Design and Analysis of Algorithms UNIT I: Introduction *Performance Analysis-Space and Time complexity *Divide and conquer- General method *applications and Strassen’s Matrix Multiplication. UNIT II: Disjoint Set Operations *Union and find algorithms *Bi-connected components Backtracking *8 Queen problem and Hamiltonian cycles UNIT III: Greedy Method *Knapsack problem *Minimum cost spanning trees *Single source shortest path problem UNIT IV: Dynamic Programming * Chained matrix multiplication *Optimal binary search trees *0/1 Knapsack and Travelling salesperson problem. UNIT V: Branch and Bound *LC Branch and Bound solution *FIFO Branch and Bound solution *NP-Hard and NP-Complete problems and Cook’s theorem Subject 3: Computer Architecture and Organization UNIT I: *Basic operational concepts *Memory locations and addresses *Memory Operations *Addressing modes UNIT II: *Instruction fetch and execution steps *Addition and subtraction of signed numbers *Multiplication of unsigned and signed numbers *Floating-point numbers and operations UNIT III : * Semiconductor RAM memories *Read-only memories *I/O bus and interface modules *Asynchronous data transfer and serial transfer UNIT IV: *Modes of transfer and Priority interrupt *Parallel processing and Pipelining *Instruction pipeline and Vector processing *Characteristics of multiprocessors Subject 3: Computer Architecture and Organization UNIT I: *Basic operational concepts *Memory locations and addresses *Memory Operations *Addressing modes UNIT II: *Instruction fetch and execution steps *Addition and subtraction of signed numbers *Multiplication of unsigned and signed numbers *Floating-point numbers and operations UNIT III : * Semiconductor RAM memories *Read-only memories *I/O bus and interface modules *Asynchronous data transfer and serial transfer UNIT IV: *Modes of transfer and Priority interrupt *Parallel processing and Pipelining *Instruction pipeline and Vector processing *Characteristics of multiprocessors

[errojudeepika]

Ece 3rd year control system important questions plss..,