CS6302 Database Management Systems Question Bank Regulation 2013 Anna University

Post author By Mr. Padeepz
Post date May 9, 2018
No Comments on CS6302 Database Management Systems Question Bank Regulation 2013 Anna University

CS6302 Database Management Systems Question Bank

CS6302 Database Management Systems Question Bank Regulation 2013 Anna University free download. Database Management Systems CS6302 Question Bank pdf free download.

Sample CS6302 Database Management Systems Question Bank:

Part A 2 Marks CS6302 Database Management Systems Question Bank

1. What are the disadvantages of file processing system?

2. Explain the basic structure of a relational database with an example.

3. What do you mean by weak entity set?

4. Give example for one to one and one to many relationships.

5. What is the need of normalization?

6. Write a note on functional dependencies. (CS6302 Database Management Systems Question Bank)

7. Who is a DBA? What are the responsibilities of a DBA?

8. What is a data model? List the types of data models used.

9. What are the components of storage manager?

10. What is a data dictionary?

11. What is an entity relationship model?

12. Define single valued and multi valued attributes.

13. What are stored, composite and derived attributes?

14. What is meant by the degree of relationship set?

15. Define weak and strong entity sets? (CS6302 Database Management Systems Question Bank)

16. Explain the two type’s o f participation constraint.

17. Define the two levels of data independence.

18. Write down any two major responsibilities of a database administrator.

19. Define irreducible sets of dependencies.

20. Define the normal forms.

Part B 16 Marks CS6302 Database Management Systems Question Bank

1. With a neat diagram, explain the structure of a DBMS.

2. What is data integrity? Explain the types of integrity constraints.

3. Explain 1NF, 2NF, 3NF and BCNF with suitable example.

4. What are the pitfalls in relational database design? With a suitable example, explain the role of functional dependency in the process of normalization.

Subject Name	Database Management Systems
Subject code	CS6302
Regulation	2013

CS6302 Database Management Systems Question Bank Click here to download

CS6302 Database Management Systems Syllabus

CS6302 Database Management Systems Notes

CS6302 Database Management Systems Important Questions

Uncategorized

CS6302 Database Management Systems Important questions Regulation 2013 Anna University

Post author By Mr. Padeepz
Post date May 9, 2018
No Comments on CS6302 Database Management Systems Important questions Regulation 2013 Anna University

CS6302 Database Management Systems Important questions

CS6302 Database Management Systems Important questions Regulation 2013 Anna University free download. Database Management Systems CS6302 Important questions pdf free download.

Sample CS6302 Database Management Systems Important questions:

1. Who is a DBA? What are the responsibilities of a DBA? April/May-2011

A database administrator (short form DBA) is a person responsible for the design,
implementation, maintenance and repair of an organization’s database. They are also known by the titles Database Coordinator or Database Programmer, and is closely related to the Database Analyst, Database Modeller, Programmer Analyst, and Systems Manager. The role includes the development and design of database strategies, monitoring and improving database performance and capacity, and planning for future expansion requirements. They may
also plan, co-ordinate and implement security measures to safeguard the database (CS6302 Database Management Systems Important questions)

2. What is a data model? List the types of data model used. April/May-2011

A database model is the theoretical foundation of a database and fundamentally determines in which manner data can be stored, organized, and manipulated in a database system. It thereby defines the infrastructure offered by a particular database system. The most popular example of a database model is the relational model.
Types of data model used
 Hierarchical model
 Network model
 Relational model
 Entity-relationship
 Object-relational model
 Object model (CS6302 Database Management Systems Important questions)

3. Define database management system?

Database management system (DBMS) is a collection of interrelated data and a set of programs to access those data.

(CS6302 Database Management Systems Important questions)

Subject Name	Database Management Systems
Subject code	CS6302
Regulation	2013

CS6302 Database Management Systems Important questions Click here to download

CS6302 Database Management Systems Syllabus

CS6302 Database Management Systems Notes

CS6302 Database Management Systems Question Bank

r2013 notes

CS6302 Database Management Systems Notes Regulation 2013 Anna University

Post author By Mr. Padeepz
Post date May 9, 2018
No Comments on CS6302 Database Management Systems Notes Regulation 2013 Anna University

CS6302 Database Management Systems Notes

CS6302 Database Management Systems Notes Regulation 2013 Anna University free download. Database Management Systems CS6302 Notes pdf free download.

OBJECTIVES: CS6302 Database Management Systems Notes

 To expose the students to the fundamentals of Database Management Systems.

 To make the students understand the relational model.

 To familiarize the students with ER diagrams.

 To expose the students to SQL.

 To make the students to understand the fundamentals of Transaction Processing and Query Processing.

 To familiarize the students with the different types of databases.

 To make the students understand the Security Issues in Databases.

OUTCOMES: CS6302 Database Management Systems Notes

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

 Design Databases for applications.

 Use the Relational model, ER diagrams.

 Apply concurrency control and recovery mechanisms for practical problems.

 Design the Query Processor and Transaction Processor.

 Apply security concepts to databases.

TEXT BOOK: CS6302 Database Management Systems Notes

1. Ramez Elmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”, Fifth Edition, Pearson Education, 2008.

REFERENCES: CS6302 Database Management Systems Notes

1. Abraham Silberschatz, Henry F. Korth and S. Sudharshan, “Database System Concepts”, Sixth Edition, Tata Mc Graw Hill, 2011.

2. C.J.Date, A.Kannan and S.Swamynathan, “An Introduction to Database Systems”, Eighth Edition, Pearson Education, 2006.

3. Atul Kahate, “Introduction to Database Management Systems”, Pearson Education, New Delhi, 2006.

4. Alexis Leon and Mathews Leon, “Database Management Systems”, Vikas Publishing House Private Limited, New Delhi, 2003.

5. Raghu Ramakrishnan, “Database Management Systems”, Fourth Edition, Tata Mc Graw Hill, 2010.

6. G.K.Gupta, “Database Management Systems”, Tata Mc Graw Hill, 2011.

7. Rob Cornell, “Database Systems Design and Implementation”, Cengage Learning, 2011.

Subject Name	Database Management Systems
Subject code	CS6302
Regulation	2013

CS6302 Database Management Systems Notes Click here to download

CS6302 Database Management Systems Syllabus

CS6302 Database Management Systems Important Questions

CS6302 Database Management Systems Question Bank

UG syllabus R 2013

CS6302 Database Management Systems Syllabus Regulation 2013 Anna University

Post author By Mr. Padeepz
Post date May 9, 2018
No Comments on CS6302 Database Management Systems Syllabus Regulation 2013 Anna University

CS6302 Database Management Systems Syllabus

CS6302 Database Management Systems Syllabus Regulation 2013 Anna University free download. Database Management Systems CS6302 Syllabus pdf free download.

UNIT I INTRODUCTION TO DBMS CS6302 Database Management Systems Syllabus

File Systems Organization – Sequential, Pointer, Indexed, Direct – Purpose of Database System- Database System Terminologies-Database characteristics- Data models – Types of data models – Components of DBMS- Relational Algebra. LOGICAL DATABASE DESIGN: Relational DBMS – Codd’s Rule – Entity-Relationship model – Extended ER Normalization – Functional Dependencies, Anomaly- 1NF to 5NF- Domain Key Normal Form – Denormalization

UNIT II SQL & QUERY OPTIMIZATION CS6302 Database Management Systems Syllabus

SQL Standards – Data types – Database Objects- DDL-DML-DCL-TCL-Embedded SQL-Static Vs Dynamic SQL – QUERY OPTIMIZATION: Query Processing and Optimization – Heuristics and Cost Estimates in Query Optimization.

UNIT III TRANSACTION PROCESSING AND CONCURRENCY CONTROL CS6302 Database Management Systems DMS Syllabus

Introduction-Properties of Transaction- Serializability- Concurrency Control – Locking Mechanisms- Two Phase Commit Protocol-Dead lock.

UNIT IV TRENDS IN DATABASE TECHNOLOGY CS6302 Database Management Systems Syllabus

Overview of Physical Storage Media – Magnetic Disks – RAID – Tertiary storage – File Organization – Organization of Records in Files – Indexing and Hashing –Ordered Indices – B+ tree Index Files – B tree Index Files – Static Hashing – Dynamic Hashing – Introduction to Distributed Databases- Client server technology- Multidimensional and Parallel databases- Spatial and multimedia databases- Mobile and web databases- Data Warehouse-Mining- Data marts.

UNIT V ADVANCED TOPICS CS6302 Database Management System DMS Syllabus

DATABASE SECURITY: Data Classification-Threats and risks – Database access Control – Types of Privileges –Cryptography- Statistical Databases.- Distributed Databases-Architecture-Transaction Processing-Data Warehousing and Mining-Classification-Association rules-Clustering-Information Retrieval- Relevance ranking-Crawling and Indexing the Web- Object Oriented Databases-XML Databases.

Subject Name	Database Management Systems
Subject code	CS6302
Regulation	2013

CS6302 Database Management Systems Syllabus Click here to download

CS6302 Database Management Systems Notes

CS6302 Database Management Systems Important Questions

CS6302 Database Management Systems Question Bank

question bank

CS6301 Programming and Data Structures 2 Question Bank Regulation 2013 Anna University

Post author By Mr. Padeepz
Post date May 8, 2018
No Comments on CS6301 Programming and Data Structures 2 Question Bank Regulation 2013 Anna University

CS6301 Programming and Data Structures 2 Question Bank

CS6301 Programming and Data Structures 2 Question Bank Regulation 2013 Anna University free download. Programming and Data Structures 2 CS6301 Question Bank pdf free download.

Sample CS6301 Programming and Data Structures 2 Question Bank:

PART-A cs6301 programming and data structures 2 question bank

1. What is String iterator?

2. Define String Constructor.

3. List the String Errors.

4. Define Copy Constructor.

5. Define Polymorphism

6. List the types of polymorphism. (cs6301 programming and data structures 2 question bank)

7. What is function overloading?

8. Define operator overloading.

9. List the operator cannot overload in C++.

10. List the Advantage and disadvantage of operator overloading.

11. How we achieve dynamic memory allocation in C++?

12. What is nested Class? (cs6301 programming and data structures 2 question bank)

13. Define inheritance.

14. List the types of inheritance.

15. Difference between multi level and multiple inheritance.

16. Define Virtual Function. (cs6301 programming and data structures 2 question bank)

17. Define pure Virtual function.

18. What is Virtual table.?

19. What is Virtual Destructor?

20. How to implement default argument with Virtual function

PART-B (cs6301 programming and data structures 2 question bank)

1. Explain briefly about Copy Constructor with example program in C++.

2. Explain briefly about Inheritance with example program in C++.

3. Explain about the function overloading with suitable example program in C++.

4. Explain the syntax of operator overloading.How many arguments are needed in the definition of an overloaded binary operator with and without friend function and give example

5. Explain about the operator overloading through friend function with example program.

6. Write a C++ program to add two complex number using operators overloading.

7. Explain about nested class with suitable example.

8. Explain briefly about virtual function with suitable example program.

9. Write a C++ program the takes two values of Time(hr,min,sec) and the sum using constructor and operator overloading

10. Consider a fruit basket class with no of apples, no of mangos as data member. Overload the + operator to add two object of the class

Subject Name	Programming and Data Structures 2
Subject code	CS6301
Regulation	2013

CS6301 Programming and Data Structures 2 Question Bank Click here to download

CS6301 Programming and Data Structures 2 Syllabus

CS6301 Programming and Data Structures 2 Notes

CS6301 Programming and Data Structures 2 Important questions

Important question

CS6301 Programming and Data Structures 2 Important questions Regulation 2013 Anna University

Post author By Mr. Padeepz
Post date May 8, 2018
No Comments on CS6301 Programming and Data Structures 2 Important questions Regulation 2013 Anna University

CS6301 Programming and Data Structures 2 Important questions

CS6301 Programming and Data Structures 2 Important questions Regulation 2013 Anna University free download. Programming and Data Structures 2 CS6301 Important questions pdf free download.

Sample CS6301 Programming and Data Structures 2 Important questions:

PART-A 2 Marks CS6301 Programming and Data Structures 2 Important questions

1. Define ob ject oriented programming

2. Define Object.

3. Define Class.

4. Define Encapsulation.

5. Define Data Hiding.

6. Define Data Abstraction. (CS6301 Programming and Data Structures 2 Important questions)

7. Define Data Members.

8. Define Constructor.

9. List the Types of Constructor.

10. Define Static Member.

11. List the storage class in C++.

12. List out the operators used in pointer concepts.

13. Define Pointer Variable.

14. What is the use of Scope resolution operator.

15. What is call by reference and address

16. State the Advantages of Default Argument. (CS6301 Programming and Data Structures 2 Important questions)

17. Define Constant members.

18. Define Copy Constructor.

19. Difference between Copy Constructor and Assignment Constructor.

20. Define this pointer.

PART-B 16 Marks CS6301 Programming and Data Structures 2 Important questions

1. Explain the basic features of Object oriented programming in C++.(16)

2. Difference between Struct and Class in also illustrate with Example.(8)

3. Explain briefly about Constructor and it types with suitable Example.(16)

4. Explain about Storage Classes in C++ with Examples(16).

5. Explain about static members with suitable example.(8).

6. Explain the following (8)

i) Pointer object.
ii) This pointer.

7. Explain about call by reference and return by reference with C++ Programs(16)

8. Write a C++ program to get and display employee details using class and object.(16)

9. Write a C++ program to get and display student details using static members.(16)

10. Write a C++ program to use destructor and constructor in C++.(10)

Subject Name	Programming and Data Structures 2
Subject code	CS6301
Regulation	2013

CS6301 Programming and Data Structures 2 Important questions Click here to download

CS6301 Programming and Data Structures 2 Syllabus

CS6301 Programming and Data Structures 2 Notes

CS6301 Programming and Data Structures 2 Question Bank

r2013 notes

CS6301 Programming and Data Structures 2 Notes Regulation 2013 Anna University

Post author By Mr. Padeepz
Post date May 8, 2018
No Comments on CS6301 Programming and Data Structures 2 Notes Regulation 2013 Anna University

CS6301 Programming and Data Structures 2 Notes

CS6301 Programming and Data Structures 2 Notes Regulation 2013 Anna University free download. Programming and Data Structures 2 CS6301 Notes pdf free download.

OUTCOMES: CS6301 Programming and Data Structures 2 Notes

At the end of the course, the student should be able to:
 Design problem solutions using Object Oriented Techniques.
 Apply the concepts of data abstraction, encapsulation and inheritance for problem solutions.
 Use the control structures of C++ appropriately.
 Critically analyse the various algorithms.
 Apply the different data structures to problem solutions.

TEXT BOOKS: CS6301 Programming and Data Structures 2 Notes

1. Bjarne Stroustrup, “The C++ Programming Language”, 3rd Edition, Pearson Education, 2007.

2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, 2nd Edition, Pearson Education, 2005

REFERENCES: CS6301 Programming and Data Structures 2 Notes

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Second Edition, Mc Graw Hill, 2002.

2. Michael T Goodrich, Roberto Tamassia, David Mount, “Data Structures and Algorithms in C++”, 7th Edition, Wiley Publishers, 2004.

The C++ programming language is based on the C language.
C++ (pronounced see plus plus) is a general purpose programming language that is free-form and compiled. (cs6301 programming and data structures 2 notes)

It is regarded as an intermediate-level language, as it comprises both high-level and lowlevel language features.

It provides imperative, object-oriented and generic programming features.
C++ is one of the most popular programming languages and is implemented on a wide variety of hardware and operating system platforms.

As an efficient performance driven programming language it is used in systems
software, application software, device drivers, embedded software, high-performance server and client applications, and entertainment software such as video games.

Various entities provide both open source and proprietary C++ compiler software,
including the FSF, LLVM, Microsoft and Intel.

Subject Name	Programming and Data Structures 2
Subject code	CS6301
Regulation	2013

CS6301 Programming and Data Structures 2 Notes Click here to download

CS6301 Programming and Data Structures 2 Syllabus

CS6301 Programming and Data Structures 2 Important questions

CS6301 Programming and Data Structures 2 Question Bank

UG syllabus R 2013

CS6301 Programming and Data Structures 2 Syllabus Regulation 2013 Anna University

Post author By Mr. Padeepz
Post date May 8, 2018
No Comments on CS6301 Programming and Data Structures 2 Syllabus Regulation 2013 Anna University

CS6301 Programming and Data Structures 2 Syllabus

CS6301 Programming and Data Structures 2 Syllabus Regulation 2013 Anna University free download. Programming and Data Structures 2 CS6301 Syllabus pdf free download.

OBJECTIVES: CS6301 Programming and Data Structures 2 Syllabus

The student should be made to:
 Be familiar with the C++ concepts of abstraction, encapsulation, constructor, polymorphism, overloading and Inheritance.
 Learn advanced nonlinear data structures.
 Be exposed to graph algorithms
 Learn to apply Tree and Graph structures

UNIT I OBJECT ORIENTED PROGRAMMING FUNDAMENTALS CS6301 Programming and Data Structures 2 Syllabus

C++ Programming features – Data Abstraction – Encapsulation – class – object – constructors – static members – constant members – member functions – pointers – references – Role of this pointer – Storage classes – function as arguments.

UNIT II OBJECT ORIENTED PROGRAMMING CONCEPTS CS6301 Programming and Data Structures 2 Syllabus

String Handling – Copy Constructor – Polymorphism – compile time and run time polymorphisms – function overloading – operators overloading – dynamic memory allocation – Nested classes – Inheritance – virtual functions.

UNIT III C++ PROGRAMMING ADVANCED FEATURES CS6301 pds 2 Programming and Data Structures 2 Syllabus

Abstract class – Exception handling – Standard libraries – Generic Programming – templates – class template – function template – STL – containers – iterators – function adaptors – allocators – Parameterizing the class – File handling concepts.

UNIT IV ADVANCED NON-LINEAR DATA STRUCTURES CS6301 Programming and Data Structures 2 Syllabus

AVL trees – B-Trees – Red-Black trees – Splay trees – Binomial Heaps – Fibonacci Heaps – Disjoint Sets – Amortized Analysis – accounting method – potential method – aggregate analysis.

UNIT V GRAPHS CS6301 Programming and Data Structures 2 pds 2 Syllabus

Representation of Graphs – Breadth-first search – Depth-first search – Topological sort – Minimum Spanning Trees – Kruskal and Prim algorithm – Shortest path algorithm – Dijkstra‟s algorithm – Bellman-Ford algorithm – Floyd – Warshall algorithm.

Subject Name	Programming and Data Structures 2
Subject code	CS6301
Regulation	2013

CS6301 Programming and Data Structures 2 Syllabus Click here to download

CS6301 Programming and Data Structures 2 Notes

CS6301 Programming and Data Structures 2 Important questions

CS6301 Programming and Data Structures 2 Question Bank

question bank

CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Question Bank regulation 2013 Anna University

Post author By Mr. Padeepz
Post date May 8, 2018
No Comments on CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Question Bank regulation 2013 Anna University

CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Question Bank

CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Question Bank regulation 2013 Anna University free download. DIGITAL PRINCIPLES AND SYSTEM DESIGN CS6201 Question Bank pdf free download.

Sample CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Question Bank:

PART-A (2 Marks)

1. What are Logic gates?

2. What are the basic digital logic gates?

3. What is BCD adder?

4. What is Magnitude Comparator?

5. What is code conversion?

6. Draw the logic circuit of full adder using half adder

7. What is code converter?

8. Define Combinational circuit.

9. Define sequential circuits.

10. What is Binary parallel adder?

PART-B 16 marks CS6201 Digital Principles and System Design Question Bank

1. Design a combinational logic circuit to convert the Gray code into Binary code (16)

2. Draw the truth table and logic diagram for full-Adder (16)

3. Draw the truth table and logic diagram for full-Subtractor (16)

4. Explain Binary parallel adder. (16)

5. Design a combinational logic circuit to convert the BCD to Binary code (16)

Part A 2 Marks CS6201 Digital Principles and System Design Question Bank

1. Define Multiplexing? 2.What is Demultiplexer? 3.Define decoder & binary decoder 4.Define Encoder & priority Encoder 5.Give the applications of Demultiplexer. 6. Mention the uses of Demultiplexer. 7. List the types of ROM. 8. Differentiate ROM & PLD‘s 9. What are the different types of RAM? 10.What are the types of arrays in RAM?

PART-B 16 Marks CS6201 Digital Principles and System Design Question Bank

1. Implement the following function using PLA. (16) A (x, y, z) = _m (1, 2, 4, 6) B (x, y, z) = _m (0, 1, 6, 7) C (x, y, z) = _m (2, 6)

2. Implement the following function using PAL. (16) W (A, B, C, D) = _m (2, 12, 13) X (A, B, C, D) = _m (7, 8, 9, 10, 11, 12, 13, 14, 15) Y (A, B, C, D) = _m (0, 2, 3, 4, 5, 6, 7, 8, 10, 11, 15) Z (A, B, C, D) = _m (1, 2, 8, 12, 13)

3. Implement the given function using multiplexer (16)

4. Explain about Encoder and Decoder? (16)

5. Explain about 4 bit Magnitude comparator? (16)

Subject Name	DIGITAL PRINCIPLES AND SYSTEM DESIGN
Subject code	CS6201
Regulation	2013

CS6201 Digital Principles and System Design Question Bank Click here to download

CS6201 Digital Principles and System Design Syllabus

CS6201 Digital Principles and System Design Notes

CS6201 Digital Principles and System Design Important questions

Important question

CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Important questions regulation 2013 Anna University

Post author By Mr. Padeepz
Post date May 8, 2018
No Comments on CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Important questions regulation 2013 Anna University

CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Important questions

CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Important questions regulation 2013 Anna University free download. DIGITAL PRINCIPLES AND SYSTEM DESIGN CS6201 Important questions pdf free download.

Sample CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Important questions:

PART-A (2 Marks)

1) Define binary logic.

2) State the different classification of binary codes.

3) State the steps involved in Gray to binary conversion.

4) What is meant by bit & byte?

5) What is the use of don‘t care conditions?

6) List the different number systems

7) State the abbreviations of ASCII and EBCDIC code

8) What are the different types of number complements

9) State De Morgan’s theorem.

PART-B (16 Marks) CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Important questions

1.Simplify the following Boolean function by using Tabulation method (16) F (w, x, y, z) =_ (0, 1, 2, 8, 10, 11, 14,15)

2.Simplify the following Boolean functions by using K‘Map in SOP & POS. F (w, x, y, z) =_ (1, 3, 4, 6, 9, 11, 12, 14) (16)

3.Simplify the following Boolean functions by using K‘Map in SOP & POS. F (w, x, y, z) =_ (1, 3, 7, 11, 15) + d (0 , 2, 5) (16)

4.Reduce the given expression. (16) [(AB)‘ + A‘ +AB‘]

5.Reduce the following function using k-map technique (16) f(A,B,C,D)= _ M(0, 3, 4, 7, 8, 10, 12, 14)+d (2, 6)

CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Important questions

Subject Name	DIGITAL PRINCIPLES AND SYSTEM DESIGN
Subject code	CS6201
Regulation	2013

CS6201 Digital Principles and System Design Important questions Click here to download

CS6201 Digital Principles and System Design Syllabus

CS6201 Digital Principles and System Design Notes

CS6201 Digital Principles and System Design Question Bank