Latest Data Structure Question Banks Lecture notes and Question papers huge collections free download IT 2201

 DATA STRUCTURES

Latest Data Structure Question Banks Lecture notes

 and Question papers huge collections free download IT 2201

anna university question bank for CSE, CSE THIRD,

 IT THIRD, IT, IT FIFTH SEM, CSE FIFTH, ECE THIRD, 

QUESTION BANKS, LECTURE NOTES, QUESTION PAPERS, 

DEPARTMENT OF INFORMATION TECHNOLOGY

ACADEMIC YEAR 2011- 2012 / ODD SEMESTER

QUESTION BANK

SUBJECT NAME : CS1201-DATA STRUCTURES

YEAR / SEM : II / III

UNIT- I

FUNDAMENTALS OF ALGORITHMS

Click here to Download more details contact us

PART – A

1. Define Data structure.

2. Give few examples for data structures.

3. Define Algorithm.

4. What are the features of an efficient algorithm?

5. List down any four applications of data structures.

6. What is Divide and Conquer?

7. State the importance of dynamic programming.

8. Define storage structure.

9. Define file structure.

10. What are the four major parts in an iterative process?

11. Write down the algorithm for solving Towers of Hanoi problem.

12. What are the different types of data structures?

13. What do you mean by primitive data structure?

14. What are the three stages of problem solving aspect?

15. Define depth of recursion.

16. What is searching?

17. What is linear search?

18. Define Space Complexity

19. Define Time Complexity

20. What are asymptotic notations?

21. What is information?

22. Define Recursion?

23. What is a Fibonacci sequence?

PART – B

1. Explain in detail the steps involved in Top down Design. (16)

2. Write the verification condition of a program segments with

a. Straight line statements (04)

b. Branches (06)

c. Loops (06)

3. Write short notes on efficiency of an algorithm (16)

4. Write short notes on analysis of an algorithm (16)

5. (a) Develop an algorithm to compute the sums for the first n terms

S=1+ (1/2) + (1/3) +…. (08)

(b) Discuss in detail about the implementation of the algorithm. (08)

6. (a) Write an algorithm to reverse the digits of a decimal number. (08)

(b) Write an algorithm to compute the Fibonacci series for ‘n’ terms. (08)

7. Explain Asymptotic Notation in detail. (16)

Click here to Download more details contact us

UNIT-II

FUNDAMENTALS OF DATA STRUCTURES

PART – A

1. What is an Abstract Data type (ADT)? Explain.

2. What is a Stack?

3. What are the two operations of Stack?

4. Write postfix form of the expression –A+B-C+D?

5. What is a Queue?

6. What is a Priority Queue?

7. What are the different ways to implement list?

8. What are the advantages in the array implementation of list?

9. What is a linked list?

10. Name the two fields of Linked list?

11. What is a doubly linked list?

12. Name the three fields of Doubly Linked list.

13. Define double circularly linked list.

14. What is the need for the header?

15. List three examples that uses linked list.

16. Give some examples for linear data structures.

17. Write postfix from of the expression –A+B-C+D.

18. How do you test for an empty queue?

19. What are the postfix and prefix forms of the expression?

20. Explain the usage of stack in recursive algorithm implementation.

21. Write down the operations that can be done with queue data structure.

22. What is a circular queue?

PART – B

1. Write a program in C to return the position of an element X in a List L. (16)

2. (a) State and explain the algorithm to perform Radix Sort. (08)

(b) Write a Program in C to create an empty stack and to push an element into it. (08)

3. Explain how queues can be implemented using Arrays (16)

4. (a) Write a ‘c’ program to multiply two polynomials. (08)

(b) Write a ‘c’ program to add two polynomials. (08)

5. (a) Write an algorithm to convert infix to postfix expression and explain it with

example. (08)

(b) Write an algorithm to evaluate a postfix expression and explain it with example.

(08)

6. (a) Write an algorithm to check given expression contains balanced parenthesis or

not. (08)

(b) Write an algorithm for insertion and deletion operation in a circular queue. (08)

7. Define Queue and briefly explain its various operations. (16)

8. Explain doubly linked list in detail. (16)

9. Compare and contrast the different features of various linked lists. (16)

10. Explain stack in detail. (16)

UNIT III

TREES

PART – A

1. Define non-linear data structure.

2. Define tree.

3. Define leaf.

4. What is meant by directed tree?

5. What is an ordered tree?

6. What is a Binary tree?

7. What are the applications of binary tree?

8. What is meant by traversing?

9. What are the different types of traversing?

10. What are the two methods of binary tree implementation?

11. Define pre-order traversal.

12. Define post-order traversal.

13. Define in-order traversal.

14. What is the length of the path in a tree?

15. Define expression trees.

16. Define strictly binary tree.

17. Define complete binary tree.

18. What is an almost complete binary tree?

19. Define AVL Tree.

20. Define collision resolution.

PART – B

1. (a) Construct an expression tree for the expression A+(B-C)*D+(E*F). (08)

(b) Write a function to delete the minimum element from a binary heap. (08)

2. Write a program in C to create an empty binary search tree & search for an element

X in it. (16)

3. Explain in detail about Open Addressing. (16)

4. Explain in detail insertion into AVL Trees. (16)

5. Write a recursive algorithm for binary tree traversal with an example. (16)

6. Write an algorithm for initializing the hash table and insertion in a separate

Chaining (16)

7. State & explain the algorithm to perform Heap sort. Also analyze the time complexity

of the algorithm (16)

8. Write a C program to perform Merge sort and analyze time complexity of the

algorithm. (16)

9. State & explain the algorithm to perform Quick sort. Also analyze the time complexity

of the algorithm. (16)

10. State & explain the algorithm to perform Shell sort. Also analyze the time complexity

of the algorithm. (16)

11. Explain Huffman Algorithm with an example. (16)

12. Discuss about Hashing in detail. (16)

Click here to Download more details contact us

UNIT-IV

GRAPHS AND THEIR APPLICATIONS

PART – A

1. Define Graph.

2. Define adjacent nodes.

3. What is a directed graph?

4. What is an undirected graph?

5. What is a loop?

6. What is a simple graph?

7. What is a weighted graph?

8. Define out degree of a graph.

9. Define in degree of a graph.

10. Define path in a graph.

11. What is a simple path?

12. What is a cycle or a circuit?

13. What is an acyclic graph?

14. What is meant by strongly connected in a graph?

15. When is a graph said to be weakly connected?

16. What is meant by sorting?

17. What are the two main classifications of sorting based on the source of data?

18. What is meant by external sorting?

19. What is meant by internal sorting?

20. What are the various factors to be considered in deciding a sorting algorithm?

21. What is the main idea behind insertion sort?

22. What is the main idea behind selection sort?

23. What is the basic idea of shell sort?

24. What is the other name for shell sort?

25. What is the purpose of quick sort?

PART – B

1. Formulate an algorithm to find the shortest path using Dijkstra’s algorithm and explain

with example. (16)

2. Explain the minimum spanning tree algorithms with an example. (16)

3. (a) Write short notes on Biconnectivity. (08)

(b) Write an algorithm for Topological Sort of a graph. (08)

4. Write and explain weighted and unweighted shortest path algorithm. (16)

5. Explain the various applications of Depth First Search. (16)

6. Explain warshall’s algorithm in detail. (16)

7. Explain kruskal’s algorithm in detail. (16)

8. Explain prim’s algorithm in detail. (16)

UNIT-V

STOARAGE MANAGEMENT

PART-A

1. Mention the types of automatic list management?

2. What do you meant by reference count method?

3. What is Garbage collection?

4. What is compaction?

5. Give the purpose of list management.

6. What are the disadvantages of reference count method?

7. What are the phases of garbage collection?

8. What do you mean by thrashing?

9. What are the types of pointers?

10. What are methods of implementing add on and tail operations in linked list?

11. Define first fit.

12. Define best fit.

13. Define worst fit.

14. What is internal and external fragmentation?

15. What are the types of buddy system?

PART – B

1. Explain the linked list representation of a list with an example. (16)

2. Explain reference count method with an example. (16)

3. Explain garbage collection with their variations. (16)

4. Explain the dynamic memory management with necessary methods. (16)

5. Write about operations in linked linear lists. (16)

6. Explain collection and compaction in detail. (16)

Click here to Download more details contact us

Read More

ANNA UNIVERSITY FIFTH SEMESTER QUESTION BANKS FOR ECE/EEE/IT/CSE

http://jntu.ravvavamsi.com/StudyMaterials/JNTU/CN%20_uandistar.zip

Computer Networks Question banks for ece

CS 2363 — COMPUTER NETWORKS

ANNA UNIVERSITY QUESTION BANKS FOR ECE,

 ECE FIFTH, COMPUTER NETWORKS, CSE FIFTH,

 QUESTION BANKS, 

QUESTION PAPERS, 

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. Define a computer network.

2. What is FDDI?

3. What is internet working?

4. What is IPV6?

5. What is queuing?

6. Define congestion.

7. Define cryptography.

8. What is PGP.

9. What is HTTP?

10. List multimedia applications.

PART B — (5 × 16 = 80 marks)

11. (a) (i) Describe network architecture in detail. (8)

(ii) What is Ethernet? Explain in detail. (8)

Or

(b) (i) What is error detection? Explain with examples. (8)

(ii) Write a note on bridges. (8)

12. (a) (i) Explain in detail about internet control message protocol. (8)

(ii) Describe any one routing algorithm. (8)

Or

(b) (i) What is dynamic host configuration protocol? Explain in detail.

(8)

(ii) Write a note on addressing. (8)

13. (a) (i) Explain the user datagram protocol (UDP) in detail. (8)

(ii) What is flow control? Explain in detail. (8)

Or

(b) (i) Explain in detail the transmission control protocol. (8)

(ii) Write a note on congestion avoidance mechanisms. (8)

14. (a) (i) Write a note on JPEG, MPEG and MP3. (8)

(ii) What is IP security? Explain in detail. (8)

Or

(b) (i) Explain fire walls in detail. (8)

(ii) Explain the basic principles of authentication. (8)

15. (a) (i) Describe domain name system in detail. (8)

(ii) Write a note on e-mail. (8)

Or

(b) (i) Explain simple network management protocol in detail. (8)

(ii) Describe in detail the file transfer protocol (FTP). (8)

CS2361 , CS2363 Computer Networks - QUESTION BANK

ME /M.Tech

UNIT-I PHYSICAL LAYER

PART-A ( 2 Marks)

1. What are the five important components of data communication?

2. List two advantages of layering principle in computer networks.

3. With the example explain half duplex communication.

4. Mention any two functions of session layer.

5. Name four topologies of computer networks.

6. Suggest two points to improve the performance of network.

7. With the example explain half duplex communication.

8. Define protocol.

9. Differentiate guided and unguided media.

10. What is the Null modem?

11. Define Topology.

12. Define standards.

13. What are the design factors for transmission media?

14. Difference between Guided media and un guided media.

15. Define line coding.

16. What are most popular modems?

17. Define network.

18. What are the criteria for networks for networks?

19. Define point to point and Multi point.

20. What is DSL

PART-B

1. Explain the OSI-ISO model I of computer with neat diagram. (16)

2. Distinguish between Point to Point links and multi-point links

with relevant diagram. (16)

3. (i) compare connection oriented and connection less service. (8)

(ii) Differentiate Guided media and un guided media. (8)

4. Write shot notes on

a. TCP/IP protocol suite(4)

b. Networks Model(4)

c. datagram network(4)

d. Virtual circuit network(4)

5. Perform a comparative study between the ISO-OSI model and TCP/IP reference

model. (16)

6.Explain how cable TV used for data transfer?

7.Explain different switched networks

UNIT-II DATA LINK LAYER

PART-A ( 2Marks)

1. Define framing?
2. What is byte stuffing?
3. Write the importance of CRC in the network.
4. Sketch the Manchester encoding for the bit steam 0001110101.
5. Name the protocols used for CSMA
6. Wireless network and mobile networks are not identical explain
7. What is importance of hamming distance? What is Manchester Encoding?
8. What is mean by count to infinity problem?






Lecture Notes Download here

QUESTION BANKS 1

QUESTION BANKS ALL


OTHERQUESTION BANKS FREE DOWNLOAD 

Read More

LATEST SOFTWARE ENGINEERING QUESTION BANKS/PAPERS CSE

Anna University Chennai Question Bank, anna university question bank for CSE, CSE, CSE FIFTH, QUESTION BANKS, QUESTION PAPERS, Software Engineering,

Today Dr Archana Raju Birth day

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

IIT NOTES

Software Engineering	Syllabus  click here to watch the  contents	Prof. N.L. Sarda Prof. Umesh Bellur Prof. Rushikesh K Joshi	IIT Bombay	Syllabus Course contents
Software Engineering	Web Syllabus Courseclcik here to watch the  contents	Prof. Rajib Mall	IIT Kharagpur	Syllabus Course contents

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

Read More

LATEST SOFTWARE ENGINEERING QUESTION BANKS/PAPERS CSE

Software Engineering, anna university question bank for CSE, CSE, CSE FIFTH, Anna University Chennai Question Bank, QUESTION BANKS, QUESTION PAPERS, 

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

UNIT 1-SOFTWARE PROCESS

Part A (2 marks)

1. What is software engineering?

2. What is Software?

3. Write out the reasons for the Failure of Water Fall Model.

4. What are the characteristics of the software?

5. Define the terms :

i. Agility

ii. Agile Team

6. What are the various categories of software?

7. What are the challenges in software?

8. Define software process

9. What are the fundamental activities of a software process?

10.What are the umbrella activities of a software process?

11.What are the merits of incremental model?

12.List the task regions in the Spiral model.

13.What are the drawbacks of spiral model?

14.What is System Engineering?

15.List the process maturity levels in SEIs CMM.

16.What is an effectors process?

17.Define the computer based system.

18.What does Verification represent?

19.What does Validation represent?

20.What is the difference between the “Known Risks” and Predictable

Risks”?

21.What are the steps followed in testing?

PART B

1. Explain iterative waterfall and spiral model for software life cycle and

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

CS1301 SOFTWARE ENGINEERING

2

various activities in each phase. (16)

2. Explain about the incremental model. (16)

3. Explain in detail about the software process. (16)

4. Explain in detail about the life cycle process. (16)

5. Explain Spiral model and win-win spiral model in detail? (16)

UNIT II-SOFTWARE REQUIREMENTS

PART A (2 marks)

1. What is the use of CMM?

2. Name the Evolutionary process Models.

3. What are the Objectives of Requirement Analysis?

4. What is requirement engineering?

5. What are the various types of traceability in software engineering?

6. Define software prototyping.

7. What are the Requirements Engineering Process Functions?

8. What are the benefits of prototyping?

9. What are the prototyping approaches in software process?

10.What are the Difficulties in Elicitation?

11.What are the advantages of evolutionary prototyping?

12.What are the various Rapid prototyping techniques?

13.What is the use of User Interface prototyping?

14.What is System Modeling?

15.What are the characteristics of SRS?

16.What are the objectives of Analysis modeling?

17.What is data modeling?

18.What is a data object?

19.What are attributes?

20.What is cardinality in data modeling?

21.What does modality in data modeling indicates?

22.What is ERD?

23.What is DFD?

24.What does Level0 DFD represent?

25.What is a state transition diagram?

26.Define Data Dictionary.

PART B

1. Explain in detail about Functional Modeling. (16)

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

CS1301 SOFTWARE ENGINEERING

3

2. Explain in detail about Structural Modeling. (16)

3. Explain in detail about data modeling. (16)

4. Explain about rapid prototyping techniques. (16)

5. Explain the prototyping approaches in software process. (16)

UNIT III-DESIGN CONCEPTS AND PRINCIPLES

PART A (2 marks)

1. What are the elements of Analysis model?

2. What are the elements of design model?

3. How the Architecture Design can be represented?

4. Define design process.

5. List the principles of a software design.

6. What is the benefit of modular design?

7. What is a cohesive module?

8. What are the different types of Cohesion?

9. What is coupling?

10.What are the various types of coupling?

11.What are the common activities in design process?

12.What are the benefits of horizontal partitioning?

13.What is vertical partitioning?

14.What are the advantages of vertical partitioning?

15.What are the various elements of data design?

16.List the guidelines for data design.

17.Name the commonly used architectural styles.

18.What is Transform mapping?

PART B

1. Explain in detail the design concepts. (16)

2. Explain the design principles. (16)

3. Explain the design steps of the transform mapping. (16)

4. Explain in detail about the real time systems. (16)

5. Explain in detail about SCM. (16)

UNIT IV-TESTING

PART A (2 marks)

1. What is a Real time system?

2. What is SCM?

3. What is SCI?

CS1301 SOFTWARE ENGINEERING

4

4. Define software testing?

5. Define Smoke Testing ?

6. What are the objectives of testing?

7. What are the testing principles the software engineer must apply while

performing the software testing?

8. Define White Box Testing?

9. What are the two levels of testing?

10.What are the various testing activities?

11.Write short note on black box testing.

12.What is equivalence partitioning?

13.What is Regression Testing?

14.What is a boundary value analysis?

15.What are the reasons behind to perform white box testing?

16.What is cyclomatic complexity?

17.How to compute the cyclomatic complexity?

18.Distinguish between verification and validation.

19.What are the various testing strategies for conventional software?

20.Write about drivers and stubs.

21.What are the approaches of integration testing?

22.What are the advantages and disadvantages of big-bang?

23.What are the benefits of smoke testing?

24.What are the conditions exists after performing validation testing?

25.Distinguish between alpha and beta testing.

26.What are the various types of system testing?

PART B

1. Explain the types of software testing. (16)

2. Explain in detail about Black box testing. (16)

3. Explain about the software testing strategies. (16)

4. Explain in detail about Integration testing. (16)

5. Explain in detail about system testing. (16)

UNIT V-SOFTWARE PROJECT MANAGEMENT

PART A (2 marks)

1. Define debugging.

2. What are the common approaches in debugging?

3. Write about the types of project plan.

4. Define measure.

5. Define metrics.

6. What are the types of metrics?

CS1301 SOFTWARE ENGINEERING

5

7. What are the advantages and disadvantages of size measure?

8. Write short note on the various estimation techniques.

9. What is the Objective of Formal Technical Reviews?

10.What is COCOMO model?

11.Give the procedure of the Delphi method.

12.What is the purpose of timeline chart?

13.What is EVA?

14.What are the metrics computed during error tracking activity?

15.Why software change occurs?

16.Write about software change strategies.

17.Define CASE Tools.

18.What is software maintenance?

19.Define maintenance.

20.What are the types of software maintenance?

21.What is architectural evolution?

22.How the CASE tools are classified?

23.What are the types of static testing tools?

Part B

1. Explain about software cost estimation. (16)

2. Explain in detail about COCOMO model. (16)

3. Explain in detail about Delphi Method. (16)

4. Explain in detail about software Maintenance. (16)

5. Explain about CASE tools. (16)

****************

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

Uploaded by Dr ARCHANA  RAJU

Read More

cse fifth semester question papers ans banks with solution free donload

ANNA UNIVERSITY OF TECHNOLOGY, COIMBATORE,Chennai

B E – COMPUTER SCIENCE AND ENGINEERING
Semester – V

Theory
080230017
Discrete Mathematics 3 1 0 4
080230018
PC Hardware and Trouble Shooting 3 0 0 3
080230019
Software Engineering 3 0 0 3
080230020
Formal Languages and Automata Theory 3 1 0 4
080230021
Java Programming 3 0 0 3
080230022
Computer Networks 3 0 0 3
Practical
080230023
Software Engineering Lab 0 0 3 2
080230024
Java Programming Lab 0 0 3 2
080230025
Computer Networks Lab 0 0 3 2

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

CS2301Software Engineering Question Bank :

• Software Engineering - Kings Question Ba nk - 2nd Edition
• Software Engineering - Rec College Question Bank - 1st Edition
• Software Engineering - 2011 Question Bank - 2nd Edition
• Software Engineering - 2011 Question Bank - 1st Edition
• Software Engineering - Question Bank 2011 Edition

MA2265 DiscreteMathematics Question Bank :

• Discrete Mathematics - Rec - Question Bank - 1st Edition
• Discrete Mathematics - Kings - Question Bank - 1st Edition

CS2302 ComputerNetworks Question Bank :

• COMPUTER NETWORKS - Question Bank - 2011 Edition
• Computer Networks REC - 16marks Question Bank - 1st Edition
• Computer Networks - Kings Question Bank - 1st Edition

CS2303 Theory of Computation Question Bank :

• Theory of Computation–Question Bank - Kings - 1st Edition comming soon
• Theory of Computation Question Bank 2011 Edition

CS2304 SystemSoftware Question Bank :

• System Software - Kings Question Bank - 1st Edition
• System Software - REC Question Bank - 1st Edition

CS2305 Programming Paradigms Question Bank :

• Programming Paradigms - REC Question Bank - 1st Edition

CSE FIFTH, anna university question bank for CSE, CSE, IT, IT FIFTH SEM, QUESTION BANKS, Software Engineering, MATHS, COMPUTER NETWORKS, computer science, Theory of communication, System Software, CS 2305 - PROGRAMMING PARADIGMS question Banks, PROGRAMS, LAB MANUALS, 

080230017 DISCRETE MATHEMATICS 

UNIT I PROPOSITIONAL CALCULUS 10 + 3
Propositions – Logical connectives – Compound propositions – Conditional and biconditional
propositions – Truth tables – Tautologies and contradictions – Contrapositive – Logical
equivalences and implications – DeMorgan’s Laws – Normal forms – Principal conjunctive and
disjunctive normal forms – Rules of inference – Arguments - Validity of arguments.
UNIT II PREDICATE CALCULUS 9 + 3
Predicates – Statement function – Variables – Free and bound variables – Quantifiers –
Universe of discourse – Logical equivalences and implications for quantified statements
– Theory of inference – The rules of universal specification and generalization – Validity of
arguments.
UNIT III SET THEORY 10 + 3
Basic concepts – Notations – Subset – Algebra of sets – The power set – Ordered pairs and
Cartesian product – Relations on sets –Types of relations and their properties – Relational
matrix and the graph of relation – Partitions – Equivalence relations – Partial ordering – Poset –
Hasse diagram – Lattices and their properties – Sublattices – Boolean algebra –
Homomorphism.
UNIT IV FUNCTIONS 7 + 3
Definitions of functions – Classification of functions –Type of functions - Examples –
Composition of functions – Inverse functions – Binary and n-ary operations – Characteristic
function of a set – Hashing functions – Recursive functions – Permutation functions.
UNIT V GROUPS 9 + 3
Algebraic systems – Definitions – Examples – Properties – Semigroups – Monoids –
Homomorphism – Sub semigroups and Submonoids - Cosets and Lagrange’s theorem –
Normal subgroups – Normal algebraic system with two binary operations - Codes and group
codes – Basic notions of error correction - Error recovery in group codes.
TUTORIAL 15
TOTAL : 60
Text Book:
1. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to
Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003.
2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”,
Fourth Edition, Pearson Education Asia, Delhi, 2002.
References:
1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical
Structures”, Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003.
2. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Sixth Edition, Tata
McGraw – Hill Pub. Co. Ltd., New Delhi, 2006

Download Question banks 2m + 16 marks ppt seminar doc pdf 

click this Link 1 to download

Download Ebooks

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

080230018 PC HARDWARE AND TROUBLE SHOOTING

L T P M C

3 0 0 100 3

Unit – I Introduction 9
Introduction - Computer Organization – Number Systems and Codes – Memory – ALU – CU –
Instruction prefetch – Interrupts – I/O Techniques – Device Controllers - Error Detection
Techniques – Microprocessor – Personal Computer Concepts – Advanced System Concepts –
Microcomputer Concepts – OS – Multitasking and Multiprogramming – Virtual Memory – Cache
Memory – Modern PC and User.
Unit – II Peripheral Devices 9
Introduction – Keyboard – CRT Display Monitor – Printer – Magnetic Storage Devices – FDD –
HDD – Special Types of Disk Drives – Mouse and Trackball – Modem – Fax Modem – CD ROM
Drive – Scanner – Digital Camera – DVD – Special Peripherals.
Unit – III PC Hardware Overview 9
Introduction – Hardware BIOS DOS Interaction – The PC family – PC hardware – Inside the
System Box – Motherboard Logic – Memory Space – Peripheral Interfaces and Controllers –
Keyboard Interface – CRT Display interface – FDC – HDC.
Unit – IV Installation and Preventive Maintenance 9
Introduction – system configuration – pre installation planning – Installation practice – routine
checks – PC Assembling and integration – BIOS setup – Engineering versions and compatibility
– preventive maintenance – DOS – Virus – Data Recovery.
Unit – V Troubleshooting 9
Introduction – computer faults – Nature of faults – Types of faults – Diagnostic programs and
tools – Microprocessor and Firmware – Programmable LSI’s – Bus Faults – Faults Elimination
process – Systematic Troubleshooting – Symptoms observation and analysis – fault diagnosis –
fault rectification – Troubleshooting levels – FDD, HDD, CD ROM Problems.
Total : 45
Text Book:
1. B. Govindarajalu, “IBM PC Clones Hardware, Troubleshooting and Maintenance”, 2/E,
TMH, 2002. [
References:
1. Peter Abel, Niyaz Nizamuddin, “IMB PC Assembly Language and Programming”,
Pearson Education, 2007
2. Scott Mueller, “Repairing PC's”, PHI,1992

Download Question banks 2m + 16 marks ppt seminar doc pdf 

Download Ebooks

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

080230019 SOFTWARE ENGINEERING

L T P M C

3 0 0 100 3

UNIT I Introduction to Software Engineering 9

Introduction to Software Engineering - A systems Approach- An Engineering Approach-
Members of the Development Team- How Has Software Engineering changed?- Information
Systems Example- Real- Time Example
Modeling the process and Life cycle
The meaning of process –Software process Models- Tools and Techniques for Process
Modeling- Practical process modeling- Information system Example- Real- Time Example
Unit II 9
Planning and Managing the project
Tracking progress-project personnel-Effort Estimation-Risk Management-The project Plan-
Process Models and Project Management-Information System Example- Real Time Example
Capturing the Requirements
The Requirements Process- Requirements Elicitation-Types of Requirements-Characteristic of
Requirements- Modeling Notations- Requirements and Specification Languages-Prototyping
Requirements-requirements Documentation-Validation and Verification- Measuring
Requirements –choosing a specification Technique.
Unit III 9
Designing the System
Introduction to Design- decomposition and Modularity-Architectural styles and Strategies-
Issues in Design Creation-Characteristics of Good Design-Techniques of Improving Design-
Design Evaluation and Validation-Documenting the Design-Information system Example-Real-
Time Example
Considering objects
What is OO-the OO Development process –use cases- Representing OO:An Example using
UML-OO System Desing-OO Program Desingn-OO Measurement-Information systems
Example-Real-Time Example
Unit IV 9
Writing the programs
Programming standards and procedures-Programming Guidelines-Documentation-The
Programming process-Information systems Example-Real-Time Example
Testing the programs
Software faults and failures-Testing Issues-unit Testing Integration Testing-Testing Object-
Oriented Systems-Test Planning-Automated Testing Tools-When to stop Testing-Information’s
Systems Example-Real-Time Example
Unit V 9
Testing the Systems
Principles of system testing -function testing-performance Testing-Reliability, Availability and
Maintainability-Acceptance Testing-Installation Testing-Automated system Testing-Test
Documentation-Testing safety-Critical systems-Information systems Example.
Maintaining the system
The changing system-The nature of maintenance-Maintenance Problems-Measuring
Maintenance characteristics-Maintenance Techniques and Tools-Software Rejuvention-
Information Systems Example-Real-Time Example.
Total : 45
Text Book:
1. Software Engineering Theory and Practice, Shari Lwarence Pfleeger, Joanne
M.Atlee, Third Edition, Pearson Education, 2006
2. Object-Oriented Software Engineering Using UML, Patterns, and Java,Bernd
Bruegge,Allen H.Dutoit, Second Editon, Pearson Edition, 2006
3. Roger S. Pressman, Software Engineering- A Practitioners Approach, McGraw-Hill
International Edition, Seventh Edition, 2009

Download Question banks 2m + 16 marks ppt seminar doc pdf 

click this Link 1 for software engineering notes

Download Ebooks

080230020 FORMAL LANGUAGES AND AUTOMATA THEORY

L T P M C

3 1 0 100 4

UNIT I 9

Mathematical preliminaries and notations – Central concepts of automata theory – Finite
automata - Deterministic Finite Automata - Nondeterministic Finite Automata – Equivalence of
DFA and NFA – Finite Automata with Epsilon transitions - Application of FA.
UNIT II 9
Regular languages: Regular Expressions – Finite Automata and Regular Expressions –
Applications of Regular Expressions - Regular Grammars.
UNIT III 9
Properties of regular languages: Pumping lemma for regular languages – Closure properties of
regular languages – Decision properties of Regular languages - Equivalence and Minimization
of Finite Automata.
UNIT IV 9
Context Free languages: Context Free Grammars – Parse Trees - Ambiguity in Grammars and
languages – Applications of Context Free Grammars - Pushdown automata (PDA) – Languages
of a PDA - Equivalence of PDA’s and CFG’s
UNIT V 9
Properties of Context Free Languages: Normal Forms(CNF,GNF) for Context Free Grammars -
Pumping lemma for CFL’s - Closure properties of CFL – Decision properties of CFL’s.
Total : 45
Text Book:
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, “Introduction to Automata Theory,
Languages and Computation”, 3/E, Pearson Education, 2009.
2. Peter Linz, “An Introduction to formal Languages and Automata”, 4/ E, Jones &
Bartlett Pub, 2006.
References:
1. Kamala Krithivasan, Rama R, “Introduction to Formal Languages, Automata
Theory and Computation”, Pearson, 2009
2. Dr. B. N. Srinivasa Murthy, “Formal Languages and Automata Theory”, Sanguine
Publishers, 2006.

Download Question banks 2m + 16 marks ppt seminar doc pdf 

Download Ebooks

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

080230021 JAVA PROGRAMMING

L T P M C

3 0 0 100 3

UNIT I 8
A look at procedure oriented programming – Object oriented programming paradigm – Basic
concepts of object oriented programming – Benefits of OOP –What is java? - Simple java
program- Java vs. C++-Tokens – Keywords – Identifiers and constants –Data types – Type
Conversions and Casting - Arrays-Operators - Control statements in java. Class fundamentals –
Declaring Objects- Assigning Object Reference Variables – introducing methods- constructors –
this keyword- garbage Collection – finalize () method – overloading methods- objects as
parameters- returning objects- access control – static- final keyword- Nested classes – Inner
classes- classes with command line arguments
UNIT II 8
Basics- Super keyword- Multilevel Hierarchy- Invoking Constructors- Method overriding Abstract
Classes – Using Final with Inheritance- Packages- Access Protection – Importing a Packages-
Interfaces-Special String Operations – Character Extraction – String Comparison – Modifying a
String –String Buffer.
UNIT III 9
Exception Types – Uncaught Exceptions – Using Try Catch – Multiple Catch – Nested Try –
throw- throws- finally – Built in Exceptions- Using Exceptions- Thread Model – Character
Streams- Stream I/O- Serialization- Files
UNIT IV 10
Applet Architecture – Skeleton- Simple Applet Display Methods- HTML APPLET tag – Passing
Parameters to the Applet- AudioClip and AppletStub Interface - Delegation Event Model – Event
Classes. Collection Interfaces – Collection Classes – Using Iterator – Maps- Comparators-
Legacy Classes and Interfaces
UNIT V 10
String Tokenizer – BitSet – Calendar – Gregorian – TimeZone – Locale – Random- Currency-
Case studies – Real time application development- Debugging the application – Testing the
application.
TOTAL = 45
Text Book:
1. D.Norton and H. Schildt, “Java 2 the complete Reference Fifth edition”, TMH, 2002 (Re
print 2009)
References:
1. By Kathy Sierra, Bert Bates, “Head First Java”, Second Edition, O'Reilly Media,
2005
2. M.Deitel and Deitel, “Java How To Program” 7/e, Prentice Hall Publications.
3. Paul Deitel , Harvey M Deitel, Java for Programmers, Pearson, 2010.
4. Elliote Rusty Harold, “Java Network Programming” Third Edition, O’Reilly
Publishers.
5. “Java Cook Book”, Second Edition O’Reily Media 2002.

Download Question banks 2m + 16 marks ppt seminar doc pdf 

Download Ebooks

080230022 COMPUTER NETWORKS

L T P M C

3 0 0 100 3

Unit I 8
Uses of Computer Networks, Components, and Direction of Data flow, Networks Components
and Categories, types of Connections, Topologies, and Reference models: OSI and TCP/IP.
Multiple Access: Random Access, Controlled Access. LAN: Token Ring, FDDI, Ethernet- Fast
Ethernet, Gigabit Ethernet, Wireless LANs: IEEE 802.11 a/b/g/n
Unit II 8
Data Link Layer: Error Detection and Correction (Parity – LRC – CRC – Hamming code), Flow
Control and Error control protocols (stop and wait – go back-N ARQ – selective repeat ARQsliding
window), HDLC, Bridges: Spanning tree .
Unit III 9
Network Layer: IP addressing methods – Subnetting, Routing Algorithms: Shortest path
Algorithm, Flooding, Flow based routing, Distance vector routing, Link state routing, Hierarchical
routing.
Unit IV 10
Transport Layer: Duties of transport layer, Multiplexing and Demultiplexing, Sockets, UDP,
TCP. Congestion Control Techniques: Leaky bucket algorithm, Token bucket algorithm.
Congestion prevention Policies: Traffic shaping, Choke packets, Load Shedding, Jitter Control.
Application Layer: DNS, SMTP, FTP, HTTP.
Unit V 10
Introduction: Storage Area Network, Peer to Peer network, Overlay network, Wireless network:
Adhoc, Sensor network, optical Network.
Total: 45
Text Book:
1. Behrouz A. Forouzan, “Data Communications and Networks”, 4/E, Tata McGraw Hill
Publication, 2006.
2.
References:
1. William Stallings ,”Data & Computer Communications”, Sixth Edition,
Pearson Education Asia, 2002.
2. Andrew. S. Tanenbaum, “Computer Networks”, Forth edition,
Pearson Education, 2002.
3. Larry L. Peterson and Bruce S. Davie ,” Computer Networks: A systems
approach” , Third Edition, Morgan Kaufmann Publishers, 2003.

Download Question banks 2m + 16 marks ppt seminar doc pdf 

Click here to download

Download Ebooks

080230023 SOFTWARE ENGINEERING LAB

L T P M C

0 0 3 100 2

Solving Simple problems using CASE tools for Planning, cost estimation, Modeling the
requirements and configuration management
1. Payroll system (pay slip generation, detection and pay master report generation)
2. On line shopping ( Web based)
3. Banking system (with debit and credit ledger report creation)
4. Text editor
5. Online voting system
6. Library automation system (Flash message generation of new arrivals for all the users
via sms / mail alerts)

080230024 JAVA PROGRAMMING LAB

L T P M C

0 0 3 100 2

Solving Simple problems using,
1. Abstract classes
2. Inheritance
3. Interfaces
4. Event handling using applets
5. Threads(single and multiple)
6. Swings
7. File handling and I/O handling
8. Database applications (JDBC)

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

080230025 COMPUTER NETWORKS LAB

L T P M C

0 0 3 100 2

Implementing the following programs
1. Network topology configuration with hubs/ switches
2. Socket programming
3. Data grams
4. TCP
5. SMTP
6. FTP
7. Implementation of any two congestion control algorithms
8. Study of various IP Address classes practically(IPv4 , IPv6 dual stack configuration)

Read More