Categories
r2013 notes

Digital Signal Processing Notes IT6502 Regulation 2013 Anna University

Digital-Signal-Processing-Notes-IT6502-Regulation-2013-Anna-University

Digital Signal Processing Notes IT6502

Digital Signal Processing Notes IT6502 Regulation 2013 Anna University free download. IT6502  Notes free pdf download.

OBJECTIVES Digital Signal Processing Notes:

To introduce discrete Fourier transform and its applications.

Teach the design of infinite and finite impulse response filters for filtering undesired signals.

To introduce signal processing concepts in systems having more than one sampling frequency.

OUTCOMES Digital Signal Processing Notes:

Upon completion of the course, students will be able to:

Perform frequency transforms for the signals.

Design IIR and FIR filters.

Finite word length effects in digital filters

TEXT BOOK Digital Signal Processing Notes:

1. John G. Proakis and Dimitris G.Manolakis, “Digital Signal Processing – Principles, Algorithms & Applications”, Fourth Edition, Pearson Education, Prentice Hall, 2007.

REFERENCES Digital Signal Processing Notes:

1. Emmanuel C.Ifeachor, and Barrie.W.Jervis, “Digital Signal Processing”, Second Edition, Pearson Education, Prentice Hall, 2002.

2. Sanjit K. Mitra, “Digital Signal Processing – A Computer Based Approach”, Third Edition, Tata Mc Graw Hill, 2007.

3. A.V.Oppenheim, R.W. Schafer and J.R. Buck, Discrete-Time Signal Processing, 8th Indian Reprint, Pearson, 2004.

4. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill, 2006.

System:
A system is a set of elements or functional block that are connected together and produces an output in response to an input signal.
Processing:
Operations performed by the system on the signal is called
Types of signal processing:
1.Analog signal processing.
2.Digital signal processing.
Analog signal processing:
In this processing input signal,output signal and the system are all analog in nature.
Digital signal processing:
Dsp is the processing of signals by digital
systems.Input and output signals are also digital in nature. Basic elements of Digital signal processing:

Subject Name Digital Signal Processing
Subject code IT6502
Regulation 2013

IT6502 Notes click here to download

IT6502 Syllabus

Digital Signal Processing important questions

Digital Signal Processing Question Bank

Categories
UG syllabus R 2013

Digital Signal Processing Syllabus IT6502 Regulation 2013 Anna University

Digital-Signal-Processing-Syllabus-IT6502-Regulation-2013-Anna-University

Digital Signal Processing Syllabus IT6502

Digital Signal Processing Syllabus IT6502 Regulation 2013 Anna University free download. IT6502  syllabus free pdf download.

UNIT I SIGNALS AND SYSTEMS Digital Signal Processing Syllabus

Basic elements of DSP – concepts of frequency in Analog and Digital Signals – sampling theorem – Discrete – time signals, systems – Analysis of discrete time LTI systems – Z transform – Convolution – Correlation.

UNIT II FREQUENCY TRANSFORMATIONS Digital Signal Processing Syllabus

Introduction to DFT – Properties of DFT – Circular Convolution – Filtering methods based on DFT – FFT Algorithms – Decimation – in – time Algorithms, Decimation – in – frequency Algorithms – Use of FFT in Linear Filtering – DCT – Use and Application of DCT.

UNIT III IIR FILTER DESIGN IT6502  syllabus

Structures of IIR – Analog filter design – Discrete time IIR filter from analog filter – IIR filter design by Impulse Invariance, Bilinear transformation, Approximation of derivatives – (LPF, HPF, BPF, BRF) filter design using frequency translation.

UNIT IV FIR FILTER DESIGN Digital Signal Processing Syllabus

Structures of FIR – Linear phase FIR filter – Fourier Series – Filter design using windowing techniques (Rectangular Window, Hamming Window, Hanning Window), Frequency sampling techniques

UNIT V FINITE WORD LENGTH EFFECTS IN DIGITAL FILTERS Digital Signal Processing Syllabus

Binary fixed point and floating point number representations – Comparison – Quantization noise – truncation and rounding – quantization noise power- input quantization error- coefficient quantization error – limit cycle oscillations-dead band- Overflow error-signal scaling.

Subject Name Digital Signal Processing
Subject code IT6502
Regulation 2013

IT6502 Syllabus click here to download

Digital Signal Processing Notes

Digital Signal Processing important questions

IT6502 Question Bank

Categories
question bank

Compiler Design Question Bank CS6660 Regulation 2013 Anna University

Compiler Design Question Bank CS6660 Regulation 2013 Anna University

Compiler Design Question Bank CS6660 

Compiler Design Question Bank CS6660 Regulation 2013 Anna University free download. CS6660 Question Bank Regulation 2013 pdf free download.

Sample Compiler Design Question Bank:

1. What are the issues in the design of code generator? Explain in detail.

2. Discuss about the run time storage management.

3. Explain basic blocks and flow graphs.

4. Explain about transformation on a basic block.

5. Write a code generation algorithm. Explain about the descriptor and function getreg().Give an example.

6. Explain peephole optimization

7. Explain DAG representation of basic blocks.

8. Explain principle sources of code optimization in details.

9. Explain the Source language issues with details.

10. Explain the Storage organization strategies with examples.

11. Explain storage allocation strategy.

12. Explain about Parameter passing.

13. Explain the non local names in runtime storage managements.

14. Explain about activation records and its purpose.

15. Explain about Optimization of basic blocks.

16. Explain the various approaches to compiler development.

17. Explain simple code generator with suitable example.

18. Discuss about the following:
a) Copy Propagation b) Dead-code Elimination and c) Code motion

19) Discuss in detail about the run time storage arrangement.

20) What are different storage allocation strategies. Explain.

21) Write in detail about the issues in the design of code generator.

22) Explain how declarations are done in a procedure using syntax directed translations.

23) What is a three address code? Mention its types. How would you implement these address statements? Explain with suitable examples.

24) Write syntax directed translation for arrays.

25) Compare top down parsing and bottom up parsing methods.

26) Compare SLR, LALR and LR parses.

27) What are LR parsers? Explain with a diagram the LR parsing algorithm.

28) What are parser generators?

29) Explain recursive descent parser with appropriate examples.

Subject Name Compiler Design
Subject code CS6660
Regulation 2013

CS6660 Question Bank click here to download

Compiler Design Syllabus

Compiler Design Notes

CS6660 Important questions

Categories
Important question

Compiler Design Important questions CS6660 Regulation 2013 Anna University

Compiler Design Important questions CS6660 Regulation 2013 Anna University

Compiler Design Important questions CS6660 

Compiler Design Important questions CS6660 Regulation 2013 Anna University free download. CS6660 Important questions Regulation 2013 pdf free download.

Sample Compiler Design Important questions:

1. Define compiler?

A compiler is a program that reads a program written in one language (source language) and translates it into an equivalent program in another language (target language) and the compiler reports to its user the presence of errors in the source program.

2. What are the classifications of compiler?

 Single pass compiler
 Multi pass compiler
 Load-and-go compiler
 Debugging or optimizing compiler

3. What are the phases of compiler?

 Lexical analyzer
 Syntax analyzer
 Semantic analyzer
 Intermediate code generation
 Code generation
 Code optimization
 Symbol table manager.

4. Define preprocessor & what are the functions of preprocessor?

Preprocessor produce input to the compilers (i.e.) the program will be divided in to the modules. They may perform the following functions.
 Macro processing
 File inclusion
 Rational preprocessor
 Language extension

5. What are the tools available in analysis phase?

 Structure editors
 Pretty printer
 Static checkers
 Interpreters.

6. Define pretty printers?

A pretty printer analyzes a program and prints it in such a way that the structure of the program becomes clearly visible. For the comments may appear with an amount of indentation proportional to the depth of their nesting in the hierarchical organization of the statement.

7. Define assembler and its types?

It is defined by the low level language is assembly language and high level language is machine language is called assembler.
 One pass assembler
 Two pass assembler

Subject Name Compiler Design
Subject code CS6660
Regulation 2013

CS6660 Important questions click here to download

Compiler Design Syllabus

CS6660 Notes

Compiler Design Question bank

Categories
r2013 notes

Compiler Design Notes CS6660 Regulation 2013 Anna University

Compiler Design Notes CS6660 Regulation 2013 Anna University

Compiler Design Notes CS6660 

Compiler Design Notes CS6660 Regulation 2013 Anna University free download. CS6660 Notes Regulation 2013 pdf free download.

OBJECTIVES Compiler Design Notes:

The student should be made to:

Learn the design principles of a Compiler.

To learn the various parsing techniques and different levels of translation.

Learn how to optimize and effectively generate machine codes.

OUTCOMES CS6660 Notes:

At the end of the course, the student should be able to:

Design and implement a prototype compiler.

Apply the various optimization techniques.

Use the different compiler construction tools.

TEXT BOOK Compiler Design Notes:

1. Alfred V Aho, Monica S. Lam, Ravi Sethi and Jeffrey D Ullman, “Compilers – Principles, Techniques and Tools”, 2nd Edition, Pearson Education, 2007.

REFERENCES Compiler Design Notes:

1. Randy Allen, Ken Kennedy, “Optimizing Compilers for Modern Architectures: A Dependence-based Approach”, Morgan Kaufmann Publishers, 2002.

2. Steven S. Muchnick, “Advanced Compiler Design and Implementation, “Morgan Kaufmann Publishers – Elsevier Science, India, Indian Reprint 2003.

3. Keith D Cooper and Linda Torczon, “Engineering a Compiler”, Morgan Kaufmann Publishers Elsevier Science, 2004.

4. Charles N. Fischer, Richard. J. LeBlanc, “Crafting a Compiler with C”, Pearson Education, 2008.

Subject Name Compiler Design
Subject code CS6660
Regulation 2013

CS6660 Notes click here to download

CS6660 Syllabus

Compiler Design Important questions

Compiler Design Question bank

Categories
UG syllabus R 2013

Compiler Design Syllabus CS6660 Regulation 2013 Anna University

Compiler-Design-Syllabus-CS6660-Regulation-2013-Anna-University

Compiler Design Syllabus CS6660 

Compiler Design Syllabus CS6660 Regulation 2013 Anna University free download. CS6660 Syllabus Regulation 2013 pdf free download.

UNIT I INTRODUCTION TO COMPILERS Compiler Design Syllabus

Translators-Compilation and Interpretation-Language processors -The Phases of Compiler-Errors Encountered in Different Phases-The Grouping of Phases-Compiler Construction Tools – Programming Language basics.

UNIT II LEXICAL ANALYSIS Compiler Design Syllabus

Need and Role of Lexical Analyzer-Lexical Errors-Expressing Tokens by Regular Expressions-Converting Regular Expression to DFA- Minimization of DFA-Language for Specifying Lexical Analyzers-LEX-Design of Lexical Analyzer for a sample Language.

UNIT III SYNTAX ANALYSIS CS6660 Syllabus

Need and Role of the Parser-Context Free Grammars -Top Down Parsing -General Strategies-Recursive Descent Parser Predictive Parser-LL(1) Parser-Shift Reduce Parser-LR Parser-LR (0)Item-Construction of SLR Parsing Table -Introduction to LALR Parser – Error Handling and Recovery in Syntax Analyzer-YACC-Design of a syntax Analyzer for a Sample Language .

UNIT IV SYNTAX DIRECTED TRANSLATION & RUN TIME ENVIRONMENT Compiler Design Syllabus

Syntax directed Definitions-Construction of Syntax Tree-Bottom-up Evaluation of S-Attribute Definitions- Design of predictive translator – Type Systems-Specification of a simple type checker-Equivalence of Type Expressions-Type Conversions. RUN-TIME ENVIRONMENT: Source Language Issues-Storage Organization-Storage Allocation-Parameter Passing-Symbol Tables-Dynamic Storage Allocation-Storage Allocation in FORTAN.

UNIT V CODE OPTIMIZATION AND CODE GENERATION Compiler Design Syllabus

Principal Sources of Optimization-DAG- Optimization of Basic Blocks-Global Data Flow Analysis-Efficient Data Flow Algorithms-Issues in Design of a Code Generator – A Simple Code Generator Algorithm.

Subject Name Compiler Design
Subject code CS6660
Regulation 2013

CS6660 Syllabus click here to download

Compiler Design Notes

Compiler Design Important questions

CS6660 Question bank

Categories
question bank

Artificial Intelligence Question Bank CS6659 Regulation 2013 Anna University

Artificial-Intelligence-Question-Bank-CS6659-Regulation-2013-Anna-University

Artificial Intelligence Question Bank CS6659

Artificial Intelligence Question Bank CS6659 Regulation 2013 Anna University free download. CS6659 Question Bank pdf free download. CS6659 Question Bank regulation 2013.

Sample Artificial Intelligence Question Bank:

1. What is informed search?

One that uses problem – specific knowledge beyond the definition of the problem itself and it can find solutions more efficiently than an uninformed strategy.

2. What is the use of QUEUING_FN?

QUEUING_FN inserts asset of elements into the queue. Different varieties of queuing fn produce different varieties of the search algorithm.

3. Mention the criteria for the evaluation of search strategy.

There are 4 criteria: Completeness, time complexity, space complexity, optimality

4. List the various search strategies.

a. BFS
b. Uniform cost search
c. DFS
d. Depth limited search
e. Iterative deepening search
f. Bidirectional search

5. List the various informed search strategy.

Best first search –greedy search ,A* search
Memory bounded search-Iterative deepening A*search -simplified memory bounded A*search -Iterative improvement search –hill climbing -simulated annealing

6. What is Best First Search?

Best First Search is an instance of the general TREE SEARCH or GRAPH SEARCH algorithm in which a node is selected for expansion based on an evaluation function, f(n).

7. Define Evaluation function, f(n).

A node with the lowest evaluation is selected for expansion, because evaluation measures distance to the goal.

8. Define Heuristic function, h (n).

h (n) is defined as the estimated cost of the cheapest path from node n to a goal node.

9. Define Greedy Best First Search.

It expands the node that is closest to the goal (i.e.) to reach solution in a quicker way. It is done by using the heuristic function: f(n) = h(n).

Subject Name Artificial Intelligence
Subject code CS6659
Regulation 2013

CS6659 Question Bank click here to download

Artificial Intelligence Syllabus

Artificial Intelligence Notes

CS6659 Important Questions

 

Categories
Important question

Artificial Intelligence Important questions CS6659 Regulation 2013 Anna University

Artificial-Intelligence-Important-questions-CS6659-Regulation-2013-Anna-University

Artificial Intelligence Important questions CS6659

Artificial Intelligence Important questions CS6659 Regulation 2013 Anna University free download. CS6659 Important questions pdf free download. CS6659 Important questions regulation 2013.

Sample Artificial Intelligence Important questions:

1(A). Define Artificial Intelligence (AI).

The study of how to make computers do things at which at the moment, people are better.
 Systems that think like humans
 Systems that act like humans
 Systems that think rationally
 Systems that act rationally

1(B). Define Artificial Intelligence formulated by Haugeland.

The exciting new effort to make computers think machines with minds in the full and literal sense.

1(C). Define Artificial Intelligence in terms of human performance.

The art of creating machines that performs functions that require intelligence when performed by people.

1(D). Define Artificial Intelligence in terms of rational acting.

A field of study that seeks to explain and emulate intelligent behaviors in terms of computational
processes-Schalkoff. The branch of computer science that is concerned with the automation of intelligent
behavior-Luger & Stubblefield.

1(E). Define Artificial in terms of rational thinking.

The study of mental faculties through the use of computational models-Charniak & McDermott. The study
of the computations that make it possible to perceive, reason and act-Winston.

2. What is meant by Turing test?

To conduct this test we need two people and one machine. One person will be an interrogator (i.e.) questioner, will be asking questions to one person and one machine.

Three of them will be in a separate room.
Interrogator knows them just as A and B. so it has to identify which is the person and machine.

The goal of the machine is to make Interrogator believe that it is the person’s answer.

If machine succeeds by fooling Interrogator, the machine acts like a human.

Programming a computer to pass Turing test is very difficult.

Subject Name Artificial Intelligence
Subject code CS6659
Regulation 2013

CS6659 Important questions click here to download

Artificial Intelligence Syllabus

CS6659 Notes

Artificial Intelligence Question Bank

 

Categories
r2013 notes

Artificial Intelligence Notes CS6659 Regulation 2013 Anna University

Artificial-Intelligence-Notes-CS6659-Regulation-2013-Anna-University

Artificial Intelligence Notes CS6659

Artificial Intelligence Notes CS6659 Regulation 2013 Anna University free download. CS6659 Notes pdf free download. CS6659 Notes regulation 2013.

OBJECTIVES Artificial Intelligence Notes:

The student should be made to:

Study the concepts of Artificial Intelligence.

Learn the methods of solving problems using Artificial Intelligence.

Introduce the concepts of Expert Systems and machine learning.

OUTCOMES Artificial Intelligence Notes:

At the end of the course, the student should be able to:

Identify problems that are amenable to solution by AI methods.

Identify appropriate AI methods to solve a given problem.

Formalise a given problem in the language/framework of different AI methods.

Implement basic AI algorithms.

Design and carry out an empirical evaluation of different algorithms on a problem formalisation, and state the conclusions that the evaluation supports.

TEXT BOOKS CS6659 Notes:

1. Kevin Night and Elaine Rich, Nair B., “Artificial Intelligence (SIE)”, Mc Graw Hill- 2008. (Units-I,II,VI & V)

2. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education, 2007. (Unit-III).

REFERENCES Artificial Intelligence Notes:

1. Peter Jackson, “Introduction to Expert Systems”, 3rd Edition, Pearson Education, 2007.

2. Stuart Russel and Peter Norvig “AI – A Modern Approach”, 2nd Edition, Pearson Education 2007.

3. Deepak Khemani “Artificial Intelligence”, Tata Mc Graw Hill Education 2013.

4. http://nptel.ac.in

Subject Name Artificial Intelligence
Subject code CS6659
Regulation 2013

CS6659 notes click here to download

CS6659 Syllabus

Artificial Intelligence Important Questions

Artificial Intelligence Question Bank

Categories
UG syllabus R 2013

Artificial Intelligence Syllabus CS6659 Regulation 2013 Anna University

Artificial-Intelligence-Syllabus-CS6659-Regulation-2013-Anna-University

Artificial Intelligence Syllabus CS6659

Artificial Intelligence Syllabus CS6659 Regulation 2013 Anna University free download. CS6659 Syllabus pdf free download.

UNIT I INTRODUCTION TO Al AND PRODUCTION SYSTEMS Artificial Intelligence Syllabus

Introduction to AI-Problem formulation, Problem Definition -Production systems, Control strategies, Search strategies. Problem characteristics, Production system characteristics -Specialized production system- Problem solving methods – Problem graphs, Matching, Indexing and Heuristic functions -Hill Climbing-Depth first and Breath first, Constraints satisfaction – Related algorithms, Measure of performance and analysis of search algorithms.

UNIT II REPRESENTATION OF KNOWLEDGE CS6659 Syllabus

Game playing – Knowledge representation, Knowledge representation using Predicate logic, Introduction to predicate calculus, Resolution, Use of predicate calculus, Knowledge representation using other logic-Structured representation of knowledge.

UNIT III KNOWLEDGE INFERENCE Artificial Intelligence Syllabus

Knowledge representation -Production based system, Frame based system. Inference – Backward chaining, Forward chaining, Rule value approach, Fuzzy reasoning – Certainty factors, Bayesian Theory-Bayesian Network-Dempster – Shafer theory.

UNIT IV PLANNING AND MACHINE LEARNING CS6659 Syllabus

Basic plan generation systems – Strips -Advanced plan generation systems – K strips -Strategic explanations -Why, Why not and how explanations. Learning- Machine learning, adaptive Learning.

UNIT V EXPERT SYSTEMS Artificial Intelligence Syllabus

Expert systems – Architecture of expert systems, Roles of expert systems – Knowledge Acquisition –Meta knowledge, Heuristics. Typical expert systems – MYCIN, DART, XOON, Expert systems shells.

Subject Name Artificial Intelligence
Subject code CS6659
Regulation 2013

CS6659 Syllabus click here to download

Artificial Intelligence Notes

Artificial Intelligence Important Questions

CS6659 Question Bank