Search Interview Questions |  More than 3000 questions in repository. There are more than 900 unanswered questions. Click here and help us by providing the answer. Have a video suggestion. Click Correct / Improve and please let us know. |
|
|||
|
| ||||
| Interview Questions and Answers for 'General atomics' - 14 question(s) found - Order By Newest | ||||
| ||||
| Ans. OOPs or Object Oriented Programming is a Programming model which is organized around Objects instead of processes. Instead of a process calling series of processes, this model stresses on communication between objects. Objects that all self sustained, provide security by encapsulating it's members and providing abstracted interfaces over the functions it performs. OOP's facilitate the following features 1. Inheritance for Code Reuse 2. Abstraction for modularity, maintenance and agility 3. Encapsulation for security and protection 4. Polymorphism for flexibility and interfacing | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
 Discuss Correct / Improve  oops oops features  Asked in 260 Companies  basic  frequent | ||||
 Very frequently asked. Favorite question in Walk in Drive of many Indian service companies. | ||||
| ||||
| Ans. Underlying data structure for ArrayList is Array whereas LinkedList is the linked list and hence have following differences - 1. ArrayList needs continuous memory locations and hence need to be moved to a bigger space if new elements are to be added to a filled array which is not required for LinkedList. 2. Removal and Insertion at specific place in ArrayList requires moving all elements and hence leads to O(n) insertions and removal whereas its constant O(1) for LinkedList. 3. Random access using index in ArrayList is faster than LinkedList which requires traversing the complete list through references. 4. Though Linear Search takes Similar Time for both, Binary Search using LinkedList requires creating new Model called Binary Search Tree which is slower but offers constant time insertion and deletion. 5. For a set of integers you want to sort using quicksort, it's probably faster to use an array; for a set of large structures you want to sort using selection sort, a linked list will be faster. | ||||
 Sample Code for ArrayList Sample Code for LinkedList | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve collections java data structures arraylist linkedlist arraylist vs linkedlist Asked in 61 Companies Basic frequent | ||||
 Try 1 Question(s) Test | ||||
| Basic and Very Frequently asked. | ||||
| ||||
| Ans. Polymorphism means the condition of occurring in several different forms. Polymorphism in Java is achieved in two manners 1. Static polymorphism is the polymorphic resolution identified at compile time and is achieved through function overloading whereas 2. Dynamic polymorphism is the polymorphic resolution identified at runtime and is achieved through method overriding. | ||||
| Sample Code for overloading Sample Code for overriding | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve polymorphism object oriented programming (oops) oops concepts oops concepts Asked in 108 Companies Basic frequent | ||||
| Try 2 Question(s) Test | ||||
| Frequently asked. | ||||
| ||||
| Ans. ArrayList are implemented in memory as arrays and hence allows fast retrieval through indices but are costly if new elements are to be inserted in between other elements. LinkedList allows for constant-time insertions or removals using iterators, but only sequential access of elements 1. Retrieval - If Elements are to be retrieved sequentially only, Linked List is preferred. 2. Insertion - If new Elements are to be inserted in between other elements , Linked List is preferred. 3. Search - Binary Search and other optimized way of searching is not possible on Linked List. 4. Sorting - Initial sorting could be pain but lateral addition of elements in a sorted list is good with linked list. 5. Adding Elements - If sufficiently large elements needs to be added very frequently ,Linked List is preferable as elements don't need consecutive memory location. | ||||
| Sample Code for ArrayList Sample Code for LinkedList | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve java collections list arraylist linkedlist difference between architecture data structure ebay Asked in 2 Companies basic frequent | ||||
| Try 2 Question(s) Test | ||||
| ||||
| Ans. Heap memory. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve memory management stack heap garbage collection Asked in 2 Companies | ||||
| ||||
| Ans. Array List works on Array and when we add an element in middle of the list, Array List need to update the index of all subsequent elements. I the capacity is full, it even may need to move the whole list to a new memory location . Linked List works on Double linked list algorithm and all it has to do is to adjust the address of the previous and next elements. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve arraylist vs linkedlist collections list Asked in 2 Companies | ||||
| ||||
| Ans. <a href="http://javahungry.blogspot.com/2015/03/difference-between-array-and-arraylist-in-java-example.html" rel="nofollow">http://javahungry.blogspot.com/2015/03/difference-between-array-and-arraylist-in-java-example.html</a> | ||||
| Sample Code for ArrayList | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve array arraylist Asked in 11 Companies basic frequent | ||||
| ||||
| Ans. Sample Answers - Getting better with upcoming technologies and be a Lead developer. In accordance with the company, working as a permenant employee. Be an associate architect. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve Asked in 2 Companies | ||||
| ||||
| Ans. Garbage collection mechanism frees up the memory that is no longer needed. In languages like C / C++ the deallocation needs to be done explicitly by the programmer and hence any leniency may result in memory leak. Garbage collection in java ensures that all unused memory is reclaimed and hence there are no memory leaks.Moreover it relieves the programmer from the hassle of carefully releasing all memory. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve Garbage Collection memory management Asked in 2 Companies | ||||
| ||||
| This question was recently asked at 'Acute Informatics,General Atomics'.This question is still unanswered. Can you please provide an answer. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve Asked in 2 Companies | ||||
| ||||
| Ans. There are four main OOP concepts in Java. These are: Abstraction. Abstraction means using simple things to represent complexity. We all know how to turn the TV on, but we don?t need to know how it works in order to enjoy it. In Java, abstraction means simple things like objects, classes, and variables represent more complex underlying code and data. This is important because it lets avoid repeating the same work multiple times. Encapsulation. This is the practice of keeping fields within a class private, then providing access to them via public methods. It?s a protective barrier that keeps the data and code safe within the class itself. This way, we can re-use objects like code components or variables without allowing open access to the data system-wide. Inheritance. This is a special feature of Object Oriented Programming in Java. It lets programmers create new classes that share some of the attributes of existing classes. This lets us build on previous work without reinventing the wheel. Polymorphism. This Java OOP concept lets programmers use the same word to mean different things in different contexts. One form of polymorphism in Java is method overloading. That?s when different meanings are implied by the code itself. The other form is method overriding. That?s when the different meanings are implied by the values of the supplied variables. See more on this below. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve oops oops concepts Asked in 16 Companies basic frequent | ||||
| ||||
| Ans. The garbage collection is a facility wherein a program runs on the Java Virtual Machine which gets rid of objects, which are not being used by a Java application anymore. It is a form of automatic memory management and recollection. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve Asked in 4 Companies | ||||
| ||||
| Ans. O(1) for ArrayList O(n) for LinkedList | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve Asked in 2 Companies | ||||
| ||||
| Ans. All threads share a common heap. Each thread has a private stack, which it can quickly add and remove items from. This makes stack based memory fast, but if you use too much stack memory, as occurs in infinite recursion, you will get a stack overflow. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
| Discuss Correct / Improve memory management heap memory Asked in 1 Companies | ||||
What will be the output of exceuting main method ?
