I want to read even more things about it! Why users still use to read news papers when in this technological globe everything is existing on web? Post a Comment. January 26, Well, you are on the right page.
All our Advertisements are Decent ads [we don't compromise in the Quality] and if anyone have any problem with website or advertisements please contact me exammaterials6 gmail. Thank you. Diksha 27 January at Best minecraft hacks 1. Kiersten 27 January at Jack 28 January at Jain Grammer, Spoken and Word Power. Ebook Days. Contemporary English Grammar Structures and Composition. Objective English. General English Grammar. A bit stream is transmitted using the standard CRC method.
Suppose the third bit from left is inverted during transmission show that this error is detected at receivers end. Identify and define the data models needed to design a database 2. Create conceptual and logical database design for Large enterprises 3. Demonstrate the relational data model 4. Apply Integrity constrains over the relations 5. Apply normalization process on existing database for eliminating redundancy 6. Apply the recovery techniques for managing the database effectively to avoid the data lose.
Remember 1. List any four application of DBMS 2. Define data model 3. List any four applications for triggers 4. Define functional dependency 5. List the 4 properties of Transaction Understand 1. Explain E-R Model with suitable example 2. Explain the role of integrity constraints in database design 3. Differentiate 3NF and 4NF 5. Explain Two Phase Locking Protocol. When multiple transactions are being executed by the operating system in a multiprogramming environment, there are possibilities that instructions of one transaction are interleaved with some other transaction.
Apply the suitable concept to overcome the problem 2. Classify various normal forms according to their applicability 3. Give some real world applications of Normalization 4. Illustrate the Commit and Rollback operations of Transaction Control 5.
Give some real world applications for Database indexing techniques. Analyze different locking protocol for concurrency control and serializability 3. Normalization will increase the complexity of the database design. Justify 4. Compare and Contrast Serializability and Recoverability. Evaluate 1. Is database redesign is necessary? How can you evaluate the performance of two data models? Evaluate the performance of query processor and list the corresponding metrics 4.
How can you assess the throughput and delay for any DBMS? How can you evaluate the impact of data models on the query processing?
Apply K-maps to Minimize and optimize two-level Logic Functions to several variables 3. Explain the Properties of Registers and Counters in different devices 5. Realization of Logic gates and verification of Truth tables 2. Practical Components 1. Construction of half-adder, half-subtractor, full-adder, full-subtractor and verification of their truth tables 2.
Verification of the properties of decoders and encoders 2. Charles H. List the first 16 numbers in base12 2. Define Priority Encoder 6. List basic types of programmable logic devices. Explain the functioning of Carry-Lookahead-Adder 2.
Describe working Johnson Counter and Ring Counter 3. Draw 5 variable K-map structure 4. Convert decimal number Show that a full adder can be constructed with two half adders and one OR gate 2. Show dual of X-OR is its complement 3. Demonstrate full adder with MUX 4. Show that a half adder can be constructed with two half adders and one OR gate Analyze 1. Analyze the following circuit and prove that it is equivalent to T-flipflop.
Differentiate Synchronous and Asynchronous counters 5. Differentiate flip flop and latch Evaluate 1. Assess the performance carry-look-ahead adder with ripple carry adder 2. Master-Slave flip flop eliminates race around condition. Defend 3.
Hamming Code can correct single bit errors. Defend 4. Construct simple Mathematical proofs and possess the ability to verify them and comprehend Formal Logical Arguments via Propositional Logic and Predicate Logic 2. Identify the basic Mathematical objects such as sets-functions-and relations and also verify simple mathematical properties that these objects possess 3.
Demonstrate the ability to describe computer programs in a Formal Mathematical manner using Recursive Functions 4.
Apply basic Counting techniques to solve Combinatorial Problems 5. Apply various techniques of Mathematical Induction weak - strong and structural induction to prove simple Mathematical properties of a variety of Discrete Structures 6.
Tremblay J. Mott, A. Kenneth H. Liu and D. Ltd, Hyderabad, 4th Edition, Define converse, contra positive and inverse of an implication 2. List out the different Principal normal forms with example 3. State the property of first theory of digraph theory by taking a suitable example 4. Define monoid and abelian group with a suitable example 5.
Define Pigeonhole Principle and the generalization of the Pigeonhole Principle. Explain the General Principle of Inclusion-Exclusion for n-sets 3.
Draw the Hasse diagram of the following relation R is a relation defined as the divisors of 60 and denoted by D Compare between Eulerian graph and Hamiltonian graph Apply 1. Show that the identity.
Show that the complete graphs K2, K3, K4 are planar 3. Find the coefficient of x9y3 in the expansion of 2x-3y Differentiate between Permutation and Combination and find the relation between them. Justify, whether the following argument is valid or not. Identify the combinations in set of electives of 7 subjects that has no repetitions for a group of 10 members having 5 students in each group.
In a sample of logic chips, 23 have a defect type D1, 26 have a defect type D2, 30 have a defect type D3, 7 have defects types D1 and D2, 8 have defects types D1 and D3, 10 have defects types D2 and D3 and 3 have all three types defects.
A woman has 11 close relatives and she wishes to invite 5 of them to dinner. Determine the number of ways can she invite them in the following situations. There is no restriction on the choice. Two particular persons will not attend separately.
Two particular persons will not attend together. Determine the number of vertices and number of edges of the complete bipartite graphs K 4,7 and K 7, Apply the data structure array for various list processing operations such as searching and sorting 2. Apply the data structures like arrays, linked structures, stacks, and queues to solve real world problems. Explain the linked implementation, and its uses both in linear and non-linear data structure.
Design and implement an appropriate hashing function for an application. Demonstrate and apply binary tree and height balanced binary trees to solve real world problems. Demonstrate and apply different methods for traversing the graphs.
Gilberg, B. Tanenbaum, Y. List out linear data structures 2. Name the basic operations of stack data structure 3. Define balance factor of AVL tree 4. Define complete binary tree 5. What is self-referential structure? Name two basic operations on stack data structure supports 7. Define a double linked list structure 8. What are advantages and disadvantages of circular linked list? Explain Bubble Sort Process with an example 2.
Demonstrate with neat diagram and algorithm to insert a node before the given key 3. Explain Deletion process using an example binary search tree 4. Explain why the selection sort is more efficient than the bubble sort. Demonstrate the application of singly linked lists for the addition of the polynomials P1 and P2 Apply 1.
Develop an algorithm to concatenate two single linked lists 3. Construct a priority queue and implement all basic operations to demonstrate priority queue 4. Build a recursive procedure to count the number of nodes in a binary tree 5. Develop a queue using single linked list data structure Analyze 1. Analyze the efficiency of BST deletion to delete a node with two children 3.
Choose a suitable data structure to implement a linked stack 5. Analyze the efficiency of BFS graph traversal method Evaluate 1. Justify that the height of the AVL tree is O log n where n is the no of nodes in the tree 2. The worst time complexity of binary search is O log n , Justify 4. Choose a suitable data structure to implement double ended queue 5. Modify the routine BST-branch so that the nodes of the tree are freed after they are no longer required.
Modify the bubble sort algorithm so that a record is kept of the actual number of comparisons and interchanges made 4.
Construct the binary tree for the given in-order and post-order traversal of a tree In-order: 4 2 5 1 6 7 3 8 , Post-order: 4 5 2 6 7 8 3 1. Apply object oriented concepts to real world problems 2. Develop applications using different types of inheritances 3. Create and use user defined packages 4.
Analyze and recover runtime exceptions arise in the applications 5. Apply parallel processing applications using threads 6. Event Handling: Events, Delegation event model, handling mouse and keyboard events, Adapter classes, inner classes, Compare basic AWT components with swing components, More user interface components-canvas, scrollbars, check box, choices, lists panels—scroll pane, dialogs, menu bar, layout managers.
Horstmann and G. Cornell, Core Java, Vol 1. Fundamentals, 7 th Edition, Pearson Education, 3. List all OOPs principles 2. Define class and object 3. Illustrate various data types supported by JAVA 4. State various access controls available in JAVA 5.
Define inheritance 6. Define thread Understand 1. Explain byte code 2. Explain the use of super, static and final keywords 3. Illustrate the use of try, catch, throw and throws 4.
Java is purely object oriented programming language. Explain 5. Explain types of polymorphism with Example. Write statements that perform the following one-dimensional-array operations: a Set the 10 elements of integer array counts to zero b Add one to each of the 15 elements of integer array bonus c Display the five values of integer array best Scores in column format 2.
Write a java program to implements final variable, Method and classes 4. Explain the reason for the following code giving compiling errors. Write a java program to implement the following techniques a Method Overloading b Method Overriding 6.
Write a Java program to implement Virtual function technique. Compare and Contrast an abstract class and an interface 2. Differentiate method overloading and overriding 3. Differentiate abstraction and encapsulation 4.
Identify the uses of calling a synchronize method inside a synchronize method 5. Identify memory leak problems in Java objects. Define the structure of SQL query 2.
Experiment with different Data Base languages 3. Interpret Embedded and Nested Queries 6. Creating users - roles and Granting privileges. Creating and altering tables for various relations in SQL 4. Implement Integrity Constraints. Key constraints - Domain constraints 5. Implementing queries in SQL using 5. Implementing joins - sub queries - nested and co related nested queries 7.
Built in functions in oracle String - Date - Aggregate functions etc. Working with views 9. Creating triggers and exception handling Implementing cursors Implementing functions and stored procedures Implementing the concepts of Rollback - commit and checkpoints List of Augmented Experiments9 1. Inventory control management System 2.
College Management System 3. Hospital management System 4. Library management System 5. Payroll management System 6. Health care organization Management System 7. Restaurant Management System 8. Blood Donation Management System 9. Art Gallery Management System Hotel Management System School Management System Salary Management System Wholesale Management System Time Table Management System Website Management Reading Material s 1.
Implement array - stack - and queue data structures to solve various computing applications 3. Implement linked list data structure to solve various computing problems 4. Design and develop applications using appropriate hashing method 5. Demonstrate and apply binary tree and its applications 6. Demonstrate and apply different methods for traversing graphs List of Experiments 1.
Implement Stack and queue operations using array 2. Implement Singly Linked Lists 3. Implement Stacks and queues using linked lists 4. Implement Doubly Linked Lists 5.
Implement to search an element using iterative linear and binary search 6. Implement Open Hashing and closed hashing any one using appropriate data structures 8. Write a program to demonstrate Max-Heap operations and application Heapsort 9. Write a program to demonstrate Max-Heap operations and application priority queue with operations insert and extract-max Write a program to demonstrate different Binary search Tree Traversals Write a program to demonstrate BST searching and deletion operations Develop an application to create one dimensional - two dimensional and three dimensional arrays in memory and then verify the various address calculation formulae for any arbitrary element of these arrays.
Develop an application to implement a sparse matrix for the given matrix A. Develop an application to implement a queue using stack operations. Develop an application to convert the following expression to its postfix equivalent using stack I. Develop an application to evaluate any given postfix expression. Develop an application to declare a priority queue using two-dimensional array - store elements and priority.
Display the elements according to priority from higher to lower. Develop an application dequeue using a one dimensional array of size N. Implement the lists using array and singly linked list. Write a menu driven application which will maintain a list of car models - their price - name of the manufacturer - engine capacity etc. The menu should make provisions for inserting information pertaining to new car models - delete obsolete models - and update data such as price besides answering queries such as listing all car models within a price range specified by the user and listing all details given a car model.
Develop an application to perform the inorder, preorder and postorder traversals of a binary tree using non- recursive methods. Develop an application to perform inserting and deleting a node in a graph Develop an application to simulate a calculator which performs the addition, subtraction, multiplication and division of polynomials using linked list. Develop an application to perform construction of an AVL search tree using insertion and deletion operations. Create applications based on code reusability 3.
Develop programs using threads 4. Develop and debug real time problems using exception handling 5. Create interactive applications using event handling mechanisms 6. Write a Java program to demonstrate String handling methods.
Write a Java program for sorting a given list using inheritance concept. Write a Java program for creating one base class for student personal details and inherit those details into the sub class of student Educational details to display complete student information. Write a Java program to implement matrix operations using multidimensional arrays. Write a Java program that illustrates runtime polymorphism. Write a Java program to create a package which has classes and methods to read Student Admission details.
Write a Java program to define and handle Exceptions in the implementation of Program3. Also make use of throw - throws. Java program that simulates a traffic light. Write a Java program for handling mouse events. Write a Java program that works as a simple Calculator.
List of Augmented Experiments7 1. New Patient Registry Management System 2. Restaurant Billing Management System 3. Library Management System 4. ATM Management System 5. Bus Ticket Booking Management System 6. Movie Ticket Booking Management System 7. Queuing Management System 8. Attendance Management System 9. Medical Store Billing Management System Text Editor Projects in Java Google Search Engine Filter Electronic voting System Day Planner Library management System Personal Finance Management System.
How to communicate effectively. Steps to Overcoming the Fear of Public Speaking? Quantitative Aptitude: Problems on numbers - H. Red Light. Justin Bieber. Bio Tile. Multipurpose Professional Bags. United States. Keith Haring. Pet Kit. Contactless Contact Lens Cleaners. Princess Diana. CBG Consumption. Crystal-Covered Low Top Sneakers. Jil Sander. Eco Organization. Multifunctional Pet Leash Accessories.
Van Gogh. Trader Joe. Low-Waste Holiday. Cartoon Sponge Board Games. New York.
0コメント