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

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

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

ENGINEERING ECONOMICS AND FINANCIAL ACCOUNTING Lecture Notes free download

MG2452 ENGINEERING

 ECONOMICS AND 

FINANCIAL 

ACCOUNTING Lecture Notes for IT - Fifth (5th) 

semester

MG2452 Lecture Notes two marks and 16 marks free download

Syllabus :

UNIT I INTRODUCTION
Managerial Economics - Relationship with other disciplines - Firms: Types, objectives
and goals - Managerial decisions - Decision analysis.

UNIT II DEMAND & SUPPLY ANALYSIS

Demand - Types of demand - Determinants of demand - Demand function - Demand
elasticity - Demand forecasting - Supply - Determinants of supply - Supply function -
Supply elasticity.

UNIT III PRODUCTION AND COST ANALYSIS

Production function - Returns to scale - Production optimization - Least cost input -
Isoquants - Managerial uses of production function.
Cost Concepts - Cost function - Determinants of cost - Short run and Long run cost
curves - Cost Output Decision - Estimation of Cost.

UNIT IV PRICING

Determinants of Price - Pricing under different objectives and different market structures
- Price discrimination - Pricing methods in practice.

UNIT V FINANCIAL ACCOUNTING (ELEMENTARY TREATMENT)

Balance sheet and related concepts - Profit & Loss Statement and related concepts - -
Financial Ratio Analysis - Cash flow analysis - Funds flow analysis - Comparative
financial statements - Analysis & Interpretation of financial statements.

UNIT VI CAPITAL BUDGETING. (ELEMENTARY TREATMENT)

Investments - Risks and return evaluation of investment decision - Average rate of return
- Payback Period - Net Present Value - Internal rate of return.

UNIT –I

ECONOMICS

Economics is the study of how societies use scarce resources to produce valuable commodities and

distribute them among different people.

SCOPE OF ECONOMICS

1. Consumption: Satisfaction of human wants is called consumption which forms one of the

important branches of economics. This tells how people behave in consumption of goods and

services in order to maximize their satisfaction.

2. Production: Goods and services have to be produced with the help of factors of production. So,

production is another branch of economics. It concerned with how maximum goods are produced

with minimum cost or how the scarce factors could be utilized economically for better results.

3. Exchange: Goods and services cannot be produced at one place or at one point of time. Goods

produced by one are exchanged for the goods produced by the others. So, exchange forms another

branch of study in economics.

4. Distribution: Goods and services are produced with efforts, i.e., by combining the factors of

production. These efforts have to be paid for or rewarded. The land gets rent, the labor get wages,

the capital gets interest and the organizer gets profit. This branch of study is called distribution in

economics.

5. Public Finance: This branch of study in economics studies about the sources of revenue to the

government and the principles governing the expenditure for the benefit of the people. It also studies

about public debt and financial administration.

ECONOMICS IS A SCIENCE OR AN ART

Economics as a Science: A science is a systematized body of knowledge ascertainable by

observation experimentation. It is a body of generalizations, principles, theories or laws which traces

out a casual relationship between cause and effect.

Economics is a systematized body of knowledge in which economic facts are studied and analyzed in

a systematic manner. For instance, economics is divided into consumption, production, exchange,

distribution and public finance which have their laws are theories on whose basis these departments

are studied and analyzed in a systematic manner.

Hence economics is a science like any other science which has its own theories and laws which

establish a relation between cause and effect. Economics is also a science because its laws possess

universal validity such as the law of diminishing returns, the law of diminishing marginal utility the

law of demand, Gresham’s law, etc.

Again, economics is a science because of its self corrective nature. It goes on revising its conclusions

in the light of new facts based on observations. Economic theories or principles are being revised in

the fields of macro economics, monetary economics, international economics, public finance and

economic development.

Economics as an Art: Unlike natural science, there is no scope for experimentation in economics

because economics is related to man, his problems and activities. Economic phenomena are very

Click here to download full notes

Read More

Anna University Exam Time Table for Nov/Dec 2012

Anna University Exam Time Table for Nov/Dec 2012 ODD semester and arrears time table will be published ....

Dear Prof/Stud/Folks

                   We already updated the last working day of odd semster for all dept under the anna university.Now Anna University Exam Time Table for Nov/Dec 2012 ODD semester and arrears time table will be published on before second week of October 2012.Stay with us for more updates and latest question banks for your odd semester.

More Details 

Subscribe your email id with our portal and then contact us ....  

TIME TABLE, 

2012 EXAMS,

  ALL DEPT, 

Anna University, 

OTHERS, HOW TO, CSE THIRD, CSE FIFTH, ECE FIFTH, EEE FIFTH, IT FIFTH SEM,

Anna University Exam Time Table for Nov/Dec 2012 ODD semester and arrears time table will be published ....Anna University Exam Time Table for Nov/Dec 2012 ODD semester and arrears time table will be published ....Anna University Exam Time Table for Nov/Dec 2012 ODD semester and arrears time table will be published ....

Read More

Software Engineering Question Banks 2m and 16m

UNIT-I II II IV V

Uploaded by Ms Archana

Prepared By Dr Priya

2MARKS

1. What is software engineering?

Software engineering is an engineering discipline that is concerned with all aspects of

software production. Software engineers should adopt a systematic and organised approach

to their work and use appropriate tools and techniques depending on the problem to be

solved, the development constraints and the resources available.

2. What is Software?

Software is nothing but a collection of computer programs that are

documents that are indented to provide desired features, functionalities and

performance.

3. What is the process of Analysis?

In Analysis, the Problem breaking into pieces that we can understand and try to deal

with. We can thus describe the larger problem as a collection of small problems and their

interrelationships. Analysis plays a major role for any problem solving technique

Process of Analysis

14. . What is the process of Synthesis?

In Synthesis, it is the process of putting together of a large structure from small

building blocks. It is the reverse process of Analysis. Synthesis plays a major role for any

problem solving technique

Process of Synthesis

5.What is a Method?

A Method or Technique is a formal procedure for producing some result. We use this

technique to solve a problem. For Example, a chef may prepare a sauce using a sequence

of ingredients combined in a carefully timed and ordered way so that the sauce thickness

but does not curdle or separate. The procedure for preparing the sauce involves timing and

ingredients but may not depend on the type of cooking equipment used.

6. What is a Tool?

A Tool is an instrument or automated system for accomplishing something in a better

way. This “better way” can mean that the tool makes us more accurate, more efficient, or

more productive or that it enhances the quality of the resulting product.

7.What is a Procedure?

A Procedure is like a Recipe. A combination of tools and techniques that, in concert,

produce a particular product. Test plan which describes Test procedures and also tells

which tools will be used on which data sets under which circumstances so we can determine

tags : anna university question bank for CSE, CSE FIFTH, IT, Software Engineering, Anna University Chennai Question Bank, QUESTION BANKS, Anna University, MCA QUESTION BANKS, MCA, IT FIFTH SEM, 

Software Engineeirng Full Notes-New

Title One

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

Title Two

This is the example text for title two.

Title Three

This is the example text for title three.

Read More

system software notes MCA/CSE/IT

THANKS TO steffi jenifer 

KEEP UPLOADING FOR US :)

1. Explain about the Cray T3E architecture

Memory
Size-64 MB to 2 GB and 64 bit virtual address space.
Basic unit-byte
2byte-word,4 byte-long word,8 byte –quad word
Registers
-32 general purpose registers(R0-R31) –64 bits
-32 floating point registers(F0-F31)
-some status and control registers.
Data Format
-integers-word,long word,quad word integer format
-negative numbers-2’s complement form
-characters-ASCII code
-two different floating point datas
Instruction format
-5 different formats-32 bitds length
-6 bits opcode field
-some instructions having additional field is used(functional field)
Addressing modes
-immediate
-register direct
-PC relative mode(used for branch instructions)
-register indirect with displacement(load &store instructions in subroutine)
Instruction sets
-130 machine instructions
-only load & store instructions refers memory
I/O devices
-I/O operations are performed through multiple ports.
-one or more I/O channels are used.

2. Write in detail about Pentium Pro architecture.
Memory
-physical memory-basic unit byte-2 bytes word-4 bytes double word
-virtual memory-memory is a combination of segments.
-segments may some times divided into pages of equal size
Registers
-8 general purpose registers-32 bits
-EAX,EBX,ECX,EDX-data registers &EBP.ESP.EDI,ESI-address registers
-EIP –acts like a program counter
-FLAGS-gives status information
-6 segment registers(CS,DS,ES,FS,GS&SS)-16 bits
-CS-contains the address of currently executable instruction
-SS-address of stack segment
Data
integers-word,long word,quad word integer format
-negative numbers-2’s complement form
-characters-ASCII code
-packed and unpacked decimals are also used
-3 different floating point datas(single precision –24 bits 1S,7E,24F,
double precision-64 bits 1S,10E,53E,extended precision-80 bits (1S,15E,64F)
Instruction format
-3fields-flag field(gives the type of operation)-opcode field(gives the operation to be performed 1
or 2 byte)-operand field
Addressing modes
-immediate mode
-register mode
-direct mode-Target address = base register + C[X]*(scale factor)+displacement.

this formula gives 8 different addressing modes.
-relative mode(Target address = displacement + C[EIP])
Instruction Set
-Depends on the type of operand-3 types(register-register ,register-
memory, memory-memory instructions)
-Depends upon operation-arithmetic, data transfer, control, string
manipulation and bit manipulation instructions,
Input &Output
-1 byte is transferred at a time
-EAX acts as a accumulator
-input device to EAX,EAXto output device.

3. Explain the architecture of SIC/XE machine.
Draw neatly the Block diagram
Explain each block separately

4. Explain the General structure of IBM 370 system with a neat sketch and also explain the different
instruction formats used in it. Give one example for each instruction format.

Draw the general structure IBM 370
Mention all the instruction formats
SS instruction format
Give explanation for the formats with example

Opcode

0

L

B
D1
1
15 16 19 20

78

B
D2
2
31 32 35 36

It is a 6 byte instruction used to move L+I bytes data fro the storage location1 to
the storage location2.
Storage location1 = D1+[B1]
Storage location2 = D2+[B2]
Eg: MOV 60,400(3),500(4)

5. Mention the differences between SIC and SIC/XE.

SIC
Here only five registers are used.
A,X,L,SW and PC
There is no floating point hardware

Only one instruction format is used

Two different addressing modes are

used

6. Explain Ultra sparc architecture
SPARC-Scalable Processor Architecture
a.)Memory
-8 bit bytes,byte address
-2 consecutive bytes form half word
- 4 bytes –word,8 bytes –double word
-virtual address space-2^64 byte
b.) Registers:
-use 32 registers (r0-r31)
-r0 to r7-global
-general purpose register 32 bit long
-floating point computation using FPU

SIC/XE
Here there are nine
A,X,L,SW ,PC,B,S,T and F

Floating point hardware is used

Four different type of instruction
formats
Here there are many addressing
modes

c.)Data Formats
-stored as 8,16,32,64 bit binary numbers
-2’s complement for negative values
-big endian
d.)Instruction formats:
format 1,format 2,format 3
e.)Addressing modes
immediate,register direct mode
f.) Instruction set:
pipelined
conditional move instruction
g.)Input/Output:
load & store instruction.

UNIT-II

1. Explain in detail about basic assembler functions.
A simple SIC assembler
Assembler Algorithm
Data structures

2. Explain about the machine-Dependent Assembler features.
Instruction formats
Addressing modes
Program Relocation

3. Discuss in detail about the machine-Independent Assembler features.
Literals
Symbol-Defining Statements
Expressions
Program blocks
Control sections and Program Linking

4. Explain in detail about the assembler Design options.
One-pass Assembler
Multi-pass Assembler

5. Discuss in detail about MASM Assembler
Classes
Data Segments
Near jump
Far jump problem
Segments
MASM directives

UNIT-III

1. Explain in detail about basic loader functions.
Design of an Absolute Loader
A simple Bootstrap loader

2. Explain about Machine-Dependent Loader Features.
Relocation
Program Linking
Algorithm
Data structures

3. Discuss in detail about Machine-independent Loader features
Automatic Library Search
Loader Options

www.collegebudies.blogspot.com

4. Explain about the Loader Design Options.
Linkage Editor
Dynamic linking
Bootstrap loaders

5. Explain in detail about MS-DOS Linker
MS-DOS Assemblers and Compilers
MS-DOS LINK
MS-DOS Object modules

UNIT-IV

1. Explian in detail about the basic Macro Processor functions.
Macro Definition
Macro expansion
Algorithm
Data Structures

2. Discuss in detail about the Machine-independent macro processor features.
Concatenation of Macro parameters
Generation of unique labels
conditional macro Expansion
Keyword macro parameters

3.Explain about Macro Processor Design options
Recursive Macro Expansion
General purpose Macro Procesors
Macroprocessing within Language Translators

Explain in detail about MASM Macro Processor
Conditional assembly statements
MASM macro
Conditional statements

5. Explain in detail about ANSI C macro Language
Macro definitions with parenthesis
Macro expansion with parenthesis
Conditional compilation statements
Debugging statements

Explain in detail about the following
i)
Editing process
ii)
User Interface
Editing process:
Tasks
Select the part of the target document
Determine how to format
Specify and execute operations
Update
UI-Conceptual model
Operations on numbered sequence
Manipulate portions of the plane
Concerned i/p devices
Explain about the editor structure.
Diagram
Explanation
Discuss in detail about debugging functions and capabilities.
Different levels

Procedure
Branch
Individual Instructions
Examples

Explain in detail about the following
i)Relationships with other parts of the system
ii)User Interface criteria

i.Requirement-Always be available
Debugging
Application development time
Production environment
Coordinate with existing and future language compilers and interpreters
ii. simple organization
full screen displays and windowing systems
command language should be clear
On-line help facility

5. Explain about various software tools.

Text editors
Debugging systems

Read More