STUDY FREEVR

My Dear Friends join us on uc news to learn complete Face Reading and Palmistry Astrology free by Acharaya shree Grija shankar ji maharaj . Face Reading  Palmistry  If you know your future by yourself without any astrologers so join us fast on uc news   click the link below to get full details--- http://tz.ucweb.com/12_4zub8

Buy Now-- All in ONE book for -C and C++ Language at Instamojo This book is important for those people who want to do O level courses but they do not have enough money for coaching fee.so they just have to fill their O level registration and form from any internet cafe and the rest the work will do this book and you can pass your   O level exam without any coaching or institute. This   book are also for those people   who have less time to read and if they want to quick revision to pass the O level exam . Please like share and comments

Java Interview Questions Java is one of the most used programming language in the world. Java is versatile and covers most of the domains from desktop applications to cloud application. Several IT companies requires java professionals (fresher or experienced). Here we try to provide list of frequently asked java interview questions. What is immutable object in Java? Immutable classes are Java classes whose objects can not be modified once created. Any modification in Immutable object result in new object. For example is String is immutable in Java. Mostly Immutable are also final in Java, in order to prevent sub class from overriding methods in Java which can compromise Immutability. You can achieve same functionality by making member as  non final but private and not modifying them except in constructor. source thanks to  - www.mysirg.com  for providing this materials     What is the difference among String, StringBuffer and StringBuilder in Java? String String

Important topic of  Data Structure    :- Stack Queue Linked List Sorting Heap Tree AVL Tree Hashing C language questions C ++ Language questions campus/interview preparation Objective type questions or multiple choice questions (MCQ) are often asked in various exams, including job recruitment tests. It also helps in understanding language constructs, syntax and fundamental rules. click the link given in above list to go to that topic. source - www.mysirg.com Hashing 1. If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is : (a) Less than 1 (b) Less than n (c) Less than m (d) Less than n/2 [expand title="Answer" ](a) Hashing is also a method of sorting key values in a database table in an efficient manner. [/expand] 2. A technique for direct search is (a) Binary Search (b) Linear Search (c) Tree S

Important topic of  Data Structure    :- Stack Queue Linked List Sorting Heap Tree AVL Tree Hashing C language questions C ++ Language questions campus/interview preparation Objective type questions or multiple choice questions (MCQ) are often asked in various exams, including job recruitment tests. It also helps in understanding language constructs, syntax and fundamental rules. click the link given in above list to go to that topic. Tree 1.  The height of a BST is given as h. Consider the height of the tree as the no. of edges in the longest path from root to the leaf. The maximum no. of nodes possible in the tree is? (a) 2h-1 -1 (b) 2h+1 -1 (c) 2h +1 (d) 2h-1 +1 Answer (b) none 2.  The no of external nodes in a full binary tree with n internal nodes is? (a) n (b) n+1 (c) 2n (d) 2n + 1 Answer (b) An extended binary tree with n internal nodes has n+1 external nodes. 3.  The difference betw

Important topic of  Data Structure    :- Stack Queue Linked List Sorting Heap Tree AVL Tree Hashing C language questions C ++ Language questions campus/interview preparation Objective type questions or multiple choice questions (MCQ) are often asked in various exams, including job recruitment tests. It also helps in understanding language constructs, syntax and fundamental rules. click the link given in above list to go to that topic. Heap in Data Structure 1.  Which of the following sequences of array elements forms a heap? (a) {23, 17, 14, 6, 13, 10, 1, 12, 7, 5} (b) {23, 17, 14, 6, 13, 10, 1, 5, 7, 12} (c) {23, 17, 14, 7, 13, 10, 1, 5, 6, 12} (d) {23, 17, 14, 7, 13, 10, 1, 12, 5, 7} Answer (c) Heap has the following two properties:- 1) All the levels are filled in the order i.e. all the levels have maximum number of nodes except possibly the last level. In the last level all the nodes occur to

Important topic of  Data Structure    :- Stack Queue Linked List Sorting Heap Tree AVL Tree Hashing C language questions C ++ Language questions campus/interview preparation Objective type questions or multiple choice questions (MCQ) are often asked in various exams, including job recruitment tests. It also helps in understanding language constructs, syntax and fundamental rules. click the link given in above list to go to that topic. Sorting in Data Structure 1.  Select the sorting that always has a time complexity O(n2 ),irrespective of the condition of array. (a) Bubble sort (b) Selection sort (c) Quick sort (d) Merge sort Answer (b) Selection sort Bubble sort can have O(n) time complexity if elements are already sorted. Quick sort and merge sort have time complexity of O(nlogn ) (though worst case complexity of Quicksort is O(n2). While selection sort always have O(n2 ) complexity. It is pretty obviou

Important topic of  Data Structure    :- Stack Queue Linked List Sorting Heap Tree AVL Tree Hashing C language questions C ++ Language campus/interview preparation Objective type questions or multiple choice questions (MCQ) are often asked in various exams, including job recruitment tests. It also helps in understanding language constructs, syntax and fundamental rules. click the link given in above list to go to that topic. Linked List in Data Structure 1.  Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worst-case time complexity of the best known algorithm to delete the node x from the list? (a) O(n) (b) O(log2 n) (c) O(logn) (d) O(1) Answer (a) To delete an intermediate node, the next pointer of Q should be copied to previous node’s next pointer. For this to happen, previous node address should be known. So a traversal of linked list should be done wh