Categories
UG syllabus R 2013

CS6403 Syllabus Software Engineering Regulation 2013 Anna University

CS6403 Syllabus Software Engineering

CS6403 Syllabus Software Engineering Regulation 2013 Anna University free download. Software Engineering Syllabus pdf free download.

UNIT I SOFTWARE PROCESS AND PROJECT MANAGEMENT CS6403 Syllabus

Introduction to Software Engineering, Software Process, Perspective and Specialized Process Models – Software Project Management: Estimation – LOC and FP Based Estimation, COCOMO Model – Project Scheduling – Scheduling, Earned Value Analysis – Risk Management.

UNIT II REQUIREMENTS ANALYSIS AND SPECIFICATION Software Engineering Syllabus

Software Requirements: Functional and Non-Functional, User requirements, System requirements, Software Requirements Document – Requirement Engineering Process: Feasibility Studies, Requirements elicitation and analysis, requirements validation, requirements management-Classical analysis: Structured system Analysis, Petri Nets- Data Dictionary.

UNIT III SOFTWARE DESIGN CS6403 Syllabus

Design process – Design Concepts-Design Model– Design Heuristic – Architectural Design – Architectural styles, Architectural Design, Architectural Mapping using Data Flow- User Interface Design: Interface analysis, Interface Design –Component level Design: Designing Class based components, traditional Components.

UNIT IV TESTING AND IMPLEMENTATION Software Engineering Syllabus

Software testing fundamentals-Internal and external views of Testing-white box testing- basis path testing-control structure testing-black box testing- Regression Testing – Unit Testing – Integration Testing – Validation Testing – System Testing And Debugging – Software Implementation Techniques: Coding practices-Refactoring.

UNIT V PROJECT MANAGEMENT CS6403 Syllabus

Estimation – FP Based, LOC Based, Make/Buy Decision, COCOMO II – Planning – Project Plan, Planning Process, RFP Risk Management – Identification, Projection, RMMM – Scheduling and Tracking –Relationship between people and effort, Task Set & Network, Scheduling, EVA – Process and Project Metrics.

Subject Name Software Engineering
Subject code CS6403
Regulation 2013

CS6403 Syllabus click here to download

Software Engineering Notes click here


CS6403 Important Questions click here


CS6403 question bank click here

Categories
Important question

EC6504 Questions Bank Microprocessor and Microcontroller Regulation 2013

EC6504 Question Bank Microprocessor and Microcontroller

EC6504 Questions Bank Microprocessor and Microcontroller Regulation 2013 Anna University free download. Microprocessor and Microcontroller Questions Bank pdf free download.

Sample EC6504 Questions Bank:

1. When the 8086 processor is in minimum mode and maximum mode?

2. Define segment override prefix.

3. What are the 8086 instructions used for BCD arithmetic?

4. List any four program control instructions available in 8086?

5. What do you mean by sample and hold circuit?

6. List the major functions performed by CRT interface?

7. What happens in power down mode of 8051 microcontroller?

8. What are the different ways of operand addressing in 8051?

9. Why are relays that use coils called electromagnetic relays?

10. What is PWM?

PART-B

11.(a) (i) Explain the internal hardware architecture of 8086 microprocessor with neat diagram. (12)
(ii) Write briefly about the Direct Memory Access. (4)
(or)
(b) (i) Explain the external memory addressing in 8086 (8)
(ii) Discuss the interrupts types of 8086 microprocessor. (8)

12.(a) (i) Explain the assembler directives ASSUME,EQU,DW,and EVEN with suitable
examples. (8)
(ii) Write an 8086 ALP to sort the array of elements in a nding order. (8)
(or)

(b) (i) Write an 8086 ALP to find the largest element in an array elements. (6)
(ii) Explain the data transfer group and logical group of 8086 instructions. (10)

13.(a) With neat block diagram explain the 8255 Programmable Peripheral Interface and its operating modes. (16)
(or)

(b) Draw and explain the block diagram of 8254 Programmable Interval Timer. Also explain the various modes of operation. (16)

14.(a) (i) Explain the architecture of 8051 microcontroller with neat diagram. (12)

(ii) Write briefly about the operating modes for serial port of 8051 microcontroller. (4)
(or)

(b) (i) Write an 8051 ALP to create a square wave of 66% duty cycle on bit 3 of port 1. (6)

(ii) Describe the different modes of operation of timers/counters in 8051 with its associated register. (10)

Subject Name Microprocessor and Microcontroller
Subject code EC6504
Regulation 2013

EC6504 Questions Bank click here to download

Microprocessor and Microcontroller Syllabus click here


EC6504 Notes click here


Microprocessor and Microcontroller Important Questions click here

Categories
Important question

EC6504 Important Questions Microprocessor and Microcontroller Regulation 2013 Anna University

EC6504 Important Questions Microprocessor and Microcontroller

EC6504 Important Questions Microprocessor and Microcontroller Regulation 2013 Anna University free download. Microprocessor and Microcontroller Important Questions pdf free download.

Sample EC6504 Important Questions:

1. What is microprocessor?

A microprocessor is a multipurpose, programmable, clock-driven , register-based electronic device that reads binary information from a storage device called memory, accepts binary data as input and processes data according to those instructions, and provides result as output.

2. What is Accumulator?

The Accumulator is an 8-bit register that is part of the arithmetic/logic unit (ALU). This register is used to store 8-bit data and to perform arithmetic and logical operations. The result of an operation is stored in the accumulator. The accumulator is also identified as
register A.

3. What is stack?

The stack is a group of memory locations in the R/W memory that is used for temporary storage of binary information during the execution of a program

4. What is a subroutine program?

A subroutine is a group of instructions written separately from the main program to perform a function that occurs repeatedly in the main program. Thus subroutines avoid the repetition of same set of instructions in the main program.

5. Define addressing mode.

Addressing mode is used to specify the way in which the address of the operand is specified within the instruction.

6. Define instruction cycle.

It is defined as the time required to complete the execution of an instruction.

 

Subject Name Microprocessor and Microcontroller
Subject code EC6504
Regulation 2013

EC6504 Important Questions click here to download

Microprocessor and Microcontroller Syllabus click here


EC6504 Notes click here


EC6504 Question Bank click here

Categories
r2013 notes

EC6504 Notes Microprocessor and Microcontroller Regulation 2013 Anna University

EC6504 Notes Microprocessor and Microcontroller

EC6504 Notes Microprocessor and Microcontroller Regulation 2013 Anna University free download. Microprocessor and Microcontroller Notes pdf free download.

OBJECTIVES EC6504 Notes:

The student should be made to:

Study the Architecture of 8086 microprocessor.

Learn the design aspects of I/O and Memory Interfacing circuits.

Study about communication and bus interfacing.

Study the Architecture of 8051 microcontroller.

OUTCOMES Microprocessor and Microcontroller Notes:

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

Design and implement programs on 8086 microprocessor.

The Design I/O circuits.

Design Memory Interfacing circuits.

Design and implement 8051 microcontroller based systems.

TEXT BOOKS EC6504 Notes:

1. Yu-Cheng Liu, Glenn A.Gibson, “Microcomputer Systems: The 8086 / 8088 Family – Architecture, Programming and Design”, Second Edition, Prentice Hall of India, 2007.

2. Mohamed Ali Mazidi, Janice Gillispie Mazidi, Rolin McKinlay, “The 8051 Microcontroller and Embedded Systems: Using Assembly and C”, Second Edition, Pearson Education, 2011

REFERENCE Microprocessor and Microcontroller Notes:

1. Doughlas V.Hall, “Microprocessors and Interfacing, Programming and Hardware:,TMH, 2012.

It is a semiconductor device consisting of electronic logic circuits manufactured by using either a Large scale (LSI) or Very Large Scale (VLSI) Integration Technique.

It includes the ALU, register arrays and control circuits on a single chip. The microprocessor has a set of instructions, designed internally, to manipulate data and communicate with
peripherals.

The era microprocessors in the year 1971, the Intel introduced the first 4-bit microprocessor is 4004. Using this the first portable calculator is designed

Subject Name Microprocessor and Microcontroller
Subject code EC6504
Regulation 2013

EC6504 Notes click here to download

Microprocessor and Microcontroller Syllabus click here


Microprocessor and Microcontroller Important Questions click here


EC6504 Question Bank click here

Categories
UG syllabus R 2013

EC6504 Syllabus Microprocessor and Microcontroller Regulation 2013 Anna University

EC6504 Syllabus Microprocessor and Microcontroller

EC6504 Syllabus Microprocessor and Microcontroller Regulation 2013 Anna University free download. Microprocessor and Microcontroller Syllabus pdf free download.

UNIT I THE 8086 MICROPROCESSOR EC6504 Syllabus

Introduction to 8086 – Microprocessor architecture – Addressing modes – Instruction set and assembler directives – Assembly language programming – Modular Programming – Linking and Relocation – Stacks – Procedures – Macros – Interrupts and interrupt service routines – Byte and String Manipulation.

UNIT II 8086 SYSTEM BUS STRUCTURE Microprocessor and Microcontroller Syllabus

8086 signals – Basic configurations – System bus timing –System design using 8086 – IO programming – Introduction to Multiprogramming – System Bus Structure – Multiprocessor configurations – Coprocessor, Closely coupled and loosely Coupled configurations – Introduction to advanced processors.

UNIT III I/O INTERFACING EC6504 Syllabus

Memory Interfacing and I/O interfacing – Parallel communication interface – Serial communication interface – D/A and A/D Interface – Timer – Keyboard /display controller – Interrupt controller – DMA controller – Programming and applications Case studies: Traffic Light control, LED display , LCD display, Keyboard display interface and Alarm Controller.

UNIT IV MICROCONTROLLER Microprocessor and Microcontroller Syllabus

Architecture of 8051 – Special Function Registers(SFRs) – I/O Pins Ports and Circuits – Instruction set – Addressing modes – Assembly language programming.

UNIT V INTERFACING MICROCONTROLLER EC6504 Syllabus

Programming 8051 Timers – Serial Port Programming – Interrupts Programming – LCD & Keyboard Interfacing – ADC, DAC & Sensor Interfacing – External Memory Interface- Stepper Motor and Waveform generation.

Subject Name Microprocessor and Microcontroller
Subject code EC6504
Regulation 2013

EC6504 Syllabus click here to download

EC6504 Notes click here


Microprocessor and Microcontroller Important Questions click here


EC6504 Question Bank click here

Categories
question bank

CS6402 Question Bank Design and Analysis of Algorithms Regulation 2013 Anna University

CS6402 Question Bank Design and Analysis of Algorithms

CS6402 Question Bank Design and Analysis of Algorithms Regulation 2013 Anna University free download. Design and Analysis of Algorithms Question Bank pdf free download.

Sample CS6402 Question Bank:

2 MARK QUESTIONS:

1. What is an Algorithm?

2. Write the Euclid’s algorithm for GCD calculation?

3. What is algorithm design Technique?

4. Differentiate time and Space efficiency?

5. Design an algorithm to compute the area and Circumference of a circle

6. List the important problem types

7. How will you measure input size of algorithms

8. Define best, worst and average case efficiency?

9. Define big oh(O),Big omega(Ω ) and big theta(Ө) notations

10. List the basic efficiency classes

11. Define recurrence relation?

12. What is non recursion relation?

13. Define nonrecursive algorithm?

14. Define order of growth? Find the order of growth of 2 + 1)2

16 MARK QUESTIONS:

1. Discuss in detail about fundamentals of algorithmic problem solving?

2. Explain the important problem types in detail

3. Explain the necessary steps for analyzing the efficiency of recursive algorithms

4. Explain the general framework for analyzing the efficiency of algorithm.

5. Write the asymptotic notations used for best case ,average case and worst case analysis of algorithms and Write an algorithm for finding maximum element of an array perform best , worst and average case complexity with appropriate order notations

6. Explain the method of solving recurrence equations with suitable example.

7. Explain the method of solving Non recursive equations with suitable examples

8. i)Describe the basic efficiency classes in detail.
ii) Write an algorithm for Fibonacci numbers generation and compute the following
a) How many times is the basic operation executed
b) What is the efficiency class of this algorithm

Subject Name Design and Analysis of Algorithms
Subject code CS6402
Regulation 2013

CS6402 Question Bank click here to download

Design and Analysis of Algorithms Syllabus click here


CS6402 Notes click here


Design and Analysis of Algorithms Important questions click here


 

 

Categories
Important question

CS6402 Important Questions Design and Analysis of Algorithms Regulation 2013 Anna University

CS6402 Important Questions Design and Analysis of Algorithms

CS6402 Important Questions Design and Analysis of Algorithms Regulation 2013 Anna University free download. Design and Analysis of Algorithms Important Questions pdf free download.

Sample CS6402 Important Questions:

1. Define Algorithm.
An algorithm is a sequence of unambiguous instructions for solving a problem in a finite amount of time.

2.Write a short note on Algorithm Design and Analysis of Process.

Understand the problem
Decide onComputational DeviceExact Vs Approximate Algorithms
Algorithm Design Techniques
Design an algorithms
Prove Correctness
Analyze the Algori thm
Code the Algorithm

3. What are the 2 kinds of Algorithm Efficiency Time Efficiency-How fast your algorithm runs?

Space Efficiency-How much extra memory your algorithm needs?

4. How can you specify Algorithms?

Algorithms can be specified natural language or pseudo code.

5. What is Pseudo Code?

Pseudo Code is a mixture of Natural Language and Programming Language Constructs such as functions, loops, decision making statements..etc

6. What are the Important Problem Types?

• Sorting
• Searching
• String Processing
• Graph Problem
• Combinatorial Problem
• Geometric Problem
• Numerical Problem

7.How can you Classify Algorithms

Among several ways to classify algorithms, the 2 principal alternatives are
• To group algorithms according to types of problem they solve com
• To group algorithms according to underlying design techniques they are based upon

8. What is Sorting Problem?

Sorting algorithm is rearrange the items of given list descending/ascending order. Sorting
algorithms classified into
• Stable Sorting Algorithm
• Non-Stable Algorithm

Subject Name Design and Analysis of Algorithms
Subject code CS6402
Regulation 2013

CS6402 Important Questions click here to download

CS6402 Syllabus click here


Design and Analysis of Algorithms Notes click here


CS6402 Question Bank click here


 

Categories
r2013 notes

CS6402 Notes Design and Analysis of Algorithms Regulation 2013 Anna University

CS6402 Notes Design and Analysis of Algorithms

CS6402 Notes Design and Analysis of Algorithms Regulation 2013 Anna University free download. Design and Analysis of Algorithms Notes pdf free download.

OBJECTIVES CS6402 Notes:

The student should be made to:

  • Learn the algorithm analysis techniques.
  • Become familiar with the different algorithm design techniques.
  • Understand the limitations of Algorithm power.

OUTCOMES CS6402 Notes:

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

  • Design algorithms for various computing problems.
  • Analyze the time and space complexity of algorithms.
  • Critically analyze the different algorithm design techniques for a given problem.
  • Modify existing algorithms to improve efficiency.

TEXT BOOK CS6402 Notes:

1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition, Pearson Education, 2012.

REFERENCES CS6402 Notes:

1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Third Edition, PHI Learning Private Limited, 2012.

2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education, Reprint 2006.

3. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education, 2009. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008.

4. http://nptel.ac.in/

An algorithm is a sequence of unambiguous instruction for solving a problem, for obtaining a required output for any legitimate input in a finite amount of time.

Definition

“Algorithmic is more than the branch of computer science. It is the core of computer science, and, in all fairness, can be said to be relevant it most of science, business and technology”

Understanding of Algorithm

An algorithm is a sequence of unambiguous instruction for solving a problem, for obtaining a required output for any legitimate input in a finite amount of time.

Subject Name Design and Analysis of Algorithms
Subject code CS6402
Regulation 2013

CS6402 Notes click here to download

Design and Analysis of Algorithms Syllabus click here


CS6402 Important questions click here


CS6402 Question Bank click here


 

Categories
UG syllabus R 2013

CS6402 Syllabus Design and Analysis of Algorithms Regulation 2013 Anna University

CS6402 Syllabus Design and Analysis of Algorithms

CS6402 Syllabus Design and Analysis of Algorithms Regulation 2013 Anna University free download. Design and Analysis of Algorithms Syllabus pdf free download.

UNIT I INTRODUCTION CS6402 Syllabus

Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types – Fundamentals of the Analysis of Algorithm Efficiency – Analysis Framework – Asymptotic Notations and its properties – Mathematical analysis for Recursive and Non-recursive algorithms.

UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER Design and Analysis of Algorithms Syllabus

Brute Force – Closest-Pair and Convex-Hull Problems-Exhaustive Search – Traveling Salesman Problem – Knapsack Problem – Assignment problem. Divide and conquer methodology – Merge sort – Quick sort – Binary search – Multiplication of Large Integers – Strassen‟s Matrix Multiplication-Closest-Pair and Convex-Hull Problems.

UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE CS6402 Syllabus

Computing a Binomial Coefficient – Warshall‟s and Floyd‟ algorithm – Optimal Binary Search Trees – Knapsack Problem and Memory functions. Greedy Technique– Prim‟s algorithm- Kruskal’s Algorithm-Dijkstra’s Algorithm-Huffman Trees.

UNIT IV ITERATIVE IMPROVEMENT Design and Analysis of Algorithms Syllabus

The Simplex Method-The Maximum-Flow Problem – Maximm Matching in Bipartite Graphs- The Stable marriage Problem.

UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER CS6402 Syllabus

Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P, NP and NP-Complete Problems–Coping with the Limitations – Backtracking – n-Queens problem – Hamiltonian Circuit Problem – Subset Sum Problem-Branch and Bound – Assignment problem – Knapsack Problem – Traveling Salesman Problem- Approximation Algorithms for NP – Hard Problems – Traveling Salesman problem – Knapsack problem.

Subject Name Design and Analysis of Algorithms
Subject code CS6402
Regulation 2013

CS6402 Syllabus click here to download

CS6402 Notes click here


Design and Analysis of Algorithms Important questions click here


CS6402 Question Bank click here


 

Categories
question bank

CS6401 Question Bank Operating Systems Regulation 2013 Anna University

CS6401 Question Bank Operating Systems

CS6401 Question Bank Operating Systems Regulation 2013 Anna University free download. Operating Systems Question Bank pdf free download.

Sample CS6401 Question Bank

1. Define system process

2. What is an interrupt?

3. What is a system call?

4. What is an interrupt vector?

5. Define bootstrap program

6. Define operating system

7. What is a resource allocator?

8. What is Moore’s law?

9. What is kernel?

10. Draw the storage device hierarchy

11. What is fault tolerant?

12. Define job pool

13. what are the types of operation in operating system ?

14. What is a privileged instruction?

15. What is a trap?

16. What is bitmap?

17. What is real time operating system?

18. What is boot disk?

19. Draw the system structure for unix

20. What is the layered approach in OS?

16 MARK QUESTIONS:

1. Explain in detail the modern computer system

2. Explain the abstract view of the components of a computer system

3. Explain Von Neumann architecture

4. Explain multiprocessor system

5. Explain operating system structure in detail

6. Explain computing environments

7. Explain open source operating system

8. Explain in detail the operating system services

9. Explain in detail operating system structure

10. Write about OS generation

11. Explain in detail Contiguous Memory Allocation.

12. Explain in detail about segmentation.

13. Explain in detail about paging.

14. Explain in detail about segmentation with paging.

15. Describe the following allocation algorithms:

a. First fit
b. Best fit
c. Worst fit

16. Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB( in order), how would each off the first‐fit, best‐fit, and worst‐fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order) ? Which algorithm makes the most efficient use of memory?

Subject Name Operating Systems
Subject code CS6401
Regulation 2013

CS6401 Question Bank click here to download

Operating Systems Syllabus click here


CS6401 Notes click here


Operating Systems Important questions click here