What is data structure?

A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data List out the areas in which data structures are applied extensively? Compiler Design, Operating System, Database Management System, Statistical analysis package, Numerical Analysis, Graphics, Artificial Intelligence, Simulation What is the data structures used to perform recursion? Stack. Because of its LIFO (Last In First Out) property it remembers its caller, so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used. List out few of the Application of tree data-structure? The manipulation of Arithmetic expression, Symbol Table construction, Syntax analysis What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? Minimal spanning tree assures that the total weight of the tree is kept at its minimu m. But it doesn't mean that the distance between any two nodes involved in the minimum -spanning tree is minimum. What is the quickest sorting method to use? The answer depends on what you mean by quickest. For most sorting problems, it just doesn't matter how quick the sort is because it is done infrequently or other operations take significantly more time anyway. Even in cases in which sorting speed is of the essence, there is no one answer. It depends on not only the size and nature of the data, but also the likely order. No algorithm is best in all cases. There are three sorting methods in this author's toolbox that are all very fast and that are useful in different situations. Those methods are quick sort, merge sort, and radix sort.

Whether Linked List is linear or Non-linear data structure? According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one.

The Quick Sort The quick sort algorithm is of the divide and conquer type. That means it works by red ucing a sorting problem into several easier sorting problems and solving each of them. A dividing value is chosen from the input data, and the data is partitioned into three sets: elements that belong before the dividing value, the value itself, and elemen ts that come after the dividing value. The partitioning is performed by exchanging elements that are in the first set but belong in the third with elements that are in the third set but belong in the first Elements that are equal to the dividing element can be put in any of the three sets the algorithm will still work properly. The Merge Sort The merge sort is a divide and conquer sort as well. It works by considering the data to be sorted as a sequence of already-sorted lists (in the worst case, each list is one element long). Adjacent sorted lists are merged into larger sorted lists until there is a single sorted list containing all the elements. The merge sort is good at sorting lists and other data structures that are not in arrays, and it can be used to sort things that don't fit into memory. It also can be implemented as a stable sort. The Radix Sort The radix sort takes a list of integers and puts each element on a smaller list, depending on the value of its least significant byte. Then the small lists are concatenated, and the process is repeated for each more significant byte until the list is sorte d. The radix sort is simpler to implement on fixed-length data such as ints. How can I search for data in a linked list? Unfortunately, the only way to search a linked list is with a linear search, because the only way a linked list's members can be accessed is sequentially. Sometimes it is quicker to take the data from a linked list and store it in a different data structure so that searches can be more efficient. What is the heap? The heap is where malloc(), calloc(), and realloc() get memory. Getting memory from the heap is much slower than getting it from the stack. On the other hand, the heap is much more flexible than the stack. Memory can be allocated at any time and deallocated in any order. Such memory isn't deallocated automatically; you have to c all free(). Recursive data structures are almost always implemented with memory from the heap. Strings often come from there too, especially strings that could be very long at runtime. If you can keep data in a local variable (and allocate it from the stack), your code will run faster than if you put the data on the heap. Sometimes you can use a better algorithm if you use the heap faster, or more robust, or more flexible. Its a tradeoff. If memory is allocated from the heap, its available until the program ends. That's great if you remember to deallocate it when you're done. If you forget, it's a problem. A memory leak is some allocated memory that's no longer needed but isn't deallocated. If you have a memory leak inside a loop, you can use up all the memory on the heap and not be able to get any more. (When

that happens, the allocation functions return a null pointer.) In some environments, if a program doesn't deallocate everything it allocated, memory stays unavailable even after the program ends. What is the easiest sorting method to use? The answer is the standard library function qsort(). It's the easiest sort by far for several reasons: It is already written. It is already debugged. It has been optimized as much as possible (usually). Void qsort(void *buf, size_t num, size_t size, int (*comp)(const void *ele1, const void *ele2));

What is a data structure? 2. What does abstract data type means? 3. Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked) 4. Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 (Similar types can be asked) 5. How is it possible to insert different type of elements in stack? Write a Binary Search program Explain about the types of linked lists What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero) 17. How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3? A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute? 19. A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute? What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? Which sort show the best average behavior? 24. What is the average number of comparisons in a sequential search? 25. Which data structure is needed to convert infix notations to post fix notations? 26. What do you mean by: * Syntax Error * Logical Error * Runtime Error How can you correct these errors? 27. In which data structure, elements can be added or removed at either end, but not in the middle? 28. How will inorder, preorder and postorder traversals print the elements of a tree? 29. Parenthesis are never needed in prefix or postfix expressions. Why?

1. What is an algorithm? The process of providing solution to a problem is a sequence of steps is called an algorithm. 2. What are the properties of an algorithm?An algorithm must possess the following properties: a. It should get input data. b. It should produce output. c. The algorithm should terminate. d. Algorithm should be clear to understand. e. It should be easy to perform. 3. What are the types of algorithms? Algorithms are of two types: repetitive and recursive algorithms. 4. Define iterative algorithms.

Algorithms which use loops and conditions to solve the problem are called iterative algorithms. 5. Define recursive algorithms. Algorithms which perform the recursive steps in a divide and conquer method are called recursive algorithms. 6. What is an array? An array is a sequential collection of same kind of data elements. 7. What is a data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data. 8. Name the areas of application of data structures.The following are the areas of application of data structures:a. Compiler design b. Operating system c. Statistical analysis package d. DBMS e. Numerical analysis f. Simulation g. Artificial Intelligence h. Graphics 9. What are the major data structures used in the following areas: Network data model, Hierarchical data model, and RDBMS?The major data structures used in the above areas are: Network data model Graph Hierarchical data model Trees RDBMS Array 10. What are the types of data structures? Data structures are of two types: Linear and non linear data structures. 11. What is a linear data structure? If the elements of a data structure are stored sequentially, then it is a linear data structure. 12. What is non linear data structure? If the elements of a data structure are not stored in sequential order, then it is a non linear data structure. 13. What are the types of array operations?The following are the operations which can be performed on an array: Insertion, Deletion, Search, Sorting, Merging, Reversing and Traversal. Q: What is the difference between an Interface and an Abstract class? A: An abstract class can have instance methods that implement a default behavior. An Interface can only declare constants and instance methods, but cannot implement default behavior and all methods are implicitly abstract. An interface has all public members and no implementation. An abstract class is a class which may have the usual flavors of class members (private, protected, etc.), but has some abstract methods.

Q: What is the purpose of garbage collection in Java, and when is it used? A: The purpose of garbage collection is to identify and discard objects that are no longer needed by a program so that their resources can be reclaimed and reused. A Java object is subject to garbage collection when it becomes unreachable to the program in which it is used. What are pass by reference and passby value? A: Pass By Reference means the passing the address itself rather than passing the value. Passby Value means passing a copy of the value to be passed. Difference between Vector and ArrayList? A: Vector is synchronized whereas arraylist is not.

Q: What is an Iterator? A: Some of the collection classes provide traversal of their contents via a java.util.Iterator interface. This interface allows you to walk through a collection of objects, operating on each object in turn. Remember when using Iterators that they contain a snapshot of the collection at the time the Iterator was obtained; generally it is not advisable to modify the collection itself while traversing an Iterator.

Q: State the significance of public, private, protected, default modifiers both singly and in combination and state the effect of package relationships on declared items qualified by these modifiers. A: public : Public class is visible in other packages, field is visible everywhere (class must be public too) private : Private variables or methods may be used only by an instance of the same class that declares the variable or method, A private feature may only be accessed by the class that owns the feature. protected : Is available to all classes in the same package and also available to all subclasses of the class that owns the protected feature.This access is provided even to subclasses that reside in a different package from the class that owns the protected feature. default :What you get by default ie, without any access modifier (ie, public private or protected).It means that it is visible to all within a particular package.

Q: What is an abstract class?

A: Abstract class must be extended/subclassed (to be useful). It serves as a template. A class that is abstract may not be instantiated (ie, you may not call its constructor), abstract class may contain static data. Any class with an abstract method is automatically abstract itself, and must be declared as such. A class may be declared abstract even if it has no abstract methods. This prevents it from being instantiated.

Q: What is static in java? A: Static means one per class, not one for each object no matter how many instance of a class might exist. This means that you can use them without creating an instance of a class.Static methods are implicitly final, because overriding is done based on the type of the object, and static methods are attached to a class, not an object. A static method in a superclass can be shadowed by another static method in a subclass, as long as the original method was not declared final. However, you can't override a static method with a nonstatic method. In other words, you can't change a static method into an instance method in a subclass.
TOP

Q: What is final? A: A final class can't be extended ie., final class may not be subclassed. A final method can't be overridden when its class is inherited. You can't change value of a final variable (is a constant). What if the main method is declared as private? A: The program compiles properly but at runtime it will give "Main method not public." message.

Q: What if the static modifier is removed from the signature of the main method? A: Program compiles. But at runtime throws an error "NoSuchMethodError". Q: What if I write static public void instead of public static void? A: Program compiles and runs properly.

Q What if I do not provide the String array as the argument to the method? : A Program compiles but throws a runtime error "NoSuchMethodError". : If I do not provide any arguments on the command line, then the String array of Main method will be empty or null? A: It is empty. But not null. What environment variables do I need to set on my machine in order to be able to run Java programs? A: CLASSPATH and PATH are the two variables. Can an application have multiple classes having main method? A: Yes it is possible. While starting the application we mention the class name to be run.

The JVM will look for the Main method only in the class whose name you have mentioned. Hence there is not conflict amongst the multiple classes having main method.

Q: Can I have multiple main methods in the same class? A: No the program fails to compile. The compiler says that the main method is already defined in the class.

Q: Do I need to import java.lang package any time? Why ? A: No. It is by default loaded internally by the JVM.

Q: Can I import same package/class twice? Will the JVM load the package twice at runtime? A: One can import the same package or same class multiple times. Neither compiler nor JVM complains abt it. And the JVM will internally load the class only once no matter how many times you import the same class.

Q: What are Checked and UnChecked Exception? A: A checked exception is some subclass of Exception (or Exception itself), excluding class RuntimeException and its subclasses. Making an exception checked forces client programmers to deal with the possibility that the exception will be thrown. eg, IOException thrown by java.io.FileInputStream's read() method Unchecked exceptions are RuntimeException and any of its subclasses. Class Error and its subclasses also are unchecked. With an unchecked exception, however, the compiler doesn't force client programmers either to catch the exception or declare it in a throws clause. In fact, client programmers may not even know that the exception could be thrown. eg, StringIndexOutOfBoundsException thrown by String's charAt() method Checked exceptions must be caught at compile time. Runtime exceptions do not need to be. Errors often cannot be.

Q: What is Overriding? A: When a class defines a method using the same name, return type, and arguments as a method in its superclass, the method in the class overrides the method in the superclass. When the method is invoked for an object of the class, it is the new definition of the method that is called, and not the method definition from superclass. Methods may be overridden to be more public, not more private. Does importing a package imports the subpackages as well? e.g. Does importing com.MyTest.* also import com.MyTest.UnitTests.*? A: No you will have to import the subpackages explicitly. Importing com.MyTest.* will import classes in the package MyTest only. It will not import any class in any of it's subpackage.

Q What is the difference between declaring a variable and defining a variable? : A declaration we just mention the type of the variable and it's name. We do not initialize it. In : But defining means declaration + initialization. e.g String s; is just a declaration while String s = new String ("abcd"); Or String s = "abcd"; are both definitions. Objects are passed by value or by reference? A Java only supports pass by value. With objects, the object reference itself is passed by : value and so both the original reference and parameter copy both refer to the same object . What are wrapper classes? A Java provides specialized classes corresponding to each of the primitive data types. These :are called wrapper classes. They are e.g. Integer, Character, Double etc. Q: Why do we need wrapper classes? A: It is sometimes easier to deal with primitives as objects. Moreover most of the collection classes store objects and not primitive data types. And also the wrapper classes provide many utility methods also. Because of these resons we need wrapper classes. And since we create instances of these classes we can store them in any of the collection classes and pass them around as a collection. Also we can pass them around as method parameters where a method expects an object. Q: What are checked exceptions? A: Checked exception are those which the Java compiler forces you to catch. e.g. IOException are checked Exceptions. Q: What are runtime exceptions? A: Runtime exceptions are those exceptions that are thrown at runtime because of either wrong input data or because of wrong business logic etc. These are not checked by the compiler at compile time. Q: What is the difference between error and an exception? A: An error is an irrecoverable condition occurring at runtime. Such as OutOfMemory error. These JVM errors and you can not repair them at runtime. While exceptions are conditions that occur because of bad input etc. e.g. FileNotFoundException will be thrown if the specified file does not exist. Or a NullPointerException will take place if you try using a null reference. In most of the cases it is possible to recover from an exception (probably by giving user a feedback for entering proper values etc.).

In Java the

Q How to create custom exceptions? : A: Your class should extend class Exception, or some more specific type thereof. What are the different ways to handle exceptions? A: There are two ways to handle exceptions, 1. By wrapping the desired code in a try block followed by a catch block to catch the exceptions. and 2. List the desired exceptions in the throws clause of the method and let the caller of the method hadle those exceptions. What is the basic difference between the 2 approaches to exception handling. 1> try catch block and 2> specifying the candidate exceptions in the throws clause?

When should you use which approach? A:In the first approach as a programmer of the method, you urself are dealing with the exception. This is fine if you are in a best position to decide should be done in case of an exception. Whereas if it is not the responsibility of the method to deal with it's own exceptions, then do not use this approach. In this case use the second approach. In the second approach we are forcing the caller of the method to catch the exceptions, that the method is likely to throw. This is often the approach library creators use. They list the exception in the throws clause and we must catch them. You will find the same approach throughout the java libraries we use. 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data. 2. List out the areas in which data structures are applied extensively? a) Compiler Design, b) Operating System, c) Database Management System, d) Statistical analysis package, e) Numerical Analysis, f) Graphics, g) Artificial Intelligence, h) Simulation Please enable JavaScript to view this page content properly. 3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model. a) RDBMS Array (i.e. Array of structures) b) Network data model Graph c) Hierarchical data model Trees 4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void pointer is capable of storing pointer to any type as it is a generic pointer type. 5. Minimum number of queues needed to implement the priority queue? Two. One queue is used for actual storing of data and another for storing priorities. 6. What is the data structures used to perform recursion? Stack. Because of its LIFO (Last In First Out) property it remembers its caller so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used. 7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms? Polish and Reverse Polish notations. 8. Convert the expression ((A + B) * C (D E) ^ (F + G)) to equivalent Prefix and Postfix notations. Prefix Notation:

^ - * +ABC - DE + FG Postfix Notation: AB + C * DE - - FG + ^ 9. Sorting is not possible by using which of the following methods? (a) Insertion (b) Selection (c) Exchange (d) Deletion (d) Deletion. Using insertion we can perform insertion sort, using selection we can perform selection sort, using exchange we can perform the bubble sort (and other similar sorting methods). But no sorting method can be done just using deletion. 10. A binary tree with 20 nodes has null branches? 21 11. What are the methods available in storing sequential files ? a) Straight merging, b) Natural merging, c) Polyphase sort, d) Distribution of Initial runs. 12. How many different trees are possible with 10 nodes ? 1014 General Formula is: If there are n nodes, there exist 2n-n different trees. 13. List out few of the Application of tree data-structure? a) The manipulation of Arithmetic expression, b) Symbol Table construction, c) Syntax analysis. 14. List out few of the applications that make use of Multilinked Structures? a) Sparse matrix, b) Index generation. 15. In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none (b) Linked list 16. What is the type of the algorithm used in solving the 8 Queens problem? Backtracking 17. In an AVL tree, at what condition the balancing is to be done? If the pivotal value (or the Height factor) is greater than 1 or less than 1. 18. What is the bucket size, when the overlapping and collision occur at same time? One. If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. This results in the overlapping of values. 19. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree? 15.

In general: There are 2n-1 nodes in a full binary tree. By the method of elimination: Full binary trees contain odd number of nodes. So there cannot be full binary trees with 8 or 14 nodes, so rejected. With 13 nodes you can form a complete binary tree but not a full binary tree. So the correct answer is 15. Note: Full and Complete binary trees are different. All full binary trees are complete binary trees but not vice versa. 20. Classify the Hashing Functions based on the various methods by which the key value is found. a) Direct method, b) Subtraction method, c) Modulo-Division method, d) Digit-Extraction method, e) Mid-Square method, f) Folding method, g) Pseudo-random method. 21. What are the types of Collision Resolution Techniques and the methods used in each of the type? a) Open addressing (closed hashing), The methods used include: Overflow block, b) Closed addressing (open hashing) The methods used include: Linked list, Binary tree 22. In RDBMS, what is the efficient data structure used in the internal storage representation? B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes. 23. Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree (b) Complete Binary Tree. By the method of elimination: Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it. 24. What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized. 25. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? No. Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesnt mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.

26. Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential 27. Whether Linked List is linear or Non-linear data structure? According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one. How do you find the middle item in a linked list? If it's important to be able to find the middle element, I'd keep a pointer to it. If it's implemented using an array and it's important, we can store the array length and divide by two. If it's implemented using pointers to elements, we can iterate over the list while counting its length, then iterate from the beginning until we get halfway there. We could also take the size of the structure in memory and divide by two, going straight to that element by adding 1/2 the size to the pointer, but that'd be a mighty WTF to most programmers when trying to understand it How would you write a function to reverse a string? And can you do that without a temporary string? In most instances I'd be working with a language that already implements a reverse method for strings. If not working in such a language, and I'm using a temporary string, the problem boils down to iterating backwards over the given string, and assigning tempstring[realstring_length - i] = realstring[i]. If we restrict the usage of a temporary string, then we can just use a variable to store the current character for swapping: for(i=0; i<len; i++) { lowerchar = realstring[i]; realstring[i] = realstring[len-i-1]; // -1 for 0 based arrays

Write a function (and dictate it to your interviewer) that reverse the order of words in a sentence. The final algorithm should work inplace! E.g.: "This is a sample" --> "sample a is This".
Answer: The trick is this - reverse the entire string, and then reverse each word in place. This way no additional memory is needed (except for one char). void rev(char* &buff, int from, int to) { char tmp; while (from < to) { tmp = buff[from]; buff[from] = buff[to]; buff[to] = tmp; from++; to--; }

} char* Revstr(char* &buf) { int len = strlen(buf); char* curr = buf; int from = 0; // Reverse the whole sentence first.. rev(buf, 0, len-1); // don't include the '\0' char // Now swap each word within sentence... for (int i=0; i<len; i++) { while (buf[i] != ' ' && buf[i] != '\0') i++; rev(buf, from, i-1); from = ++i; } return buf; }
.In a selectionsort of n elements, how many times is the swap function called in the complete execution of the algorithm? A. 1 B. n - 1 C. n log n D. n^2

(Good question)Implement an algorithm to sort a linked list. Why did you pick the method you did?

Algorithms

What's the difference between a linked list and an array? Implement a linked list. Why did you pick the method you did? Implement an algorithm to sort a linked list. Why did you pick the method you did? Now do it in O(n) time. Describe advantages and disadvantages of the various stock sorting algorithms. Implement an algorithm to reverse a linked list. Now do it without recursion. Implement an algorithm to insert a node into a circular linked list without traversing it. Implement an algorithm to sort an array. Why did you pick the method you did? Implement an algorithm to do wild card string matching. Implement strstr() (or some other string library function). Reverse a string. Optimize for speed. Optimize for space.

Reverse the words in a sentence, i.e. "My name is Chris" becomes "Chris is name My." Optimize for speed. Optimize for space. Find a substring. Optimize for speed. Optimize for space. Compare two strings using O(n) time with constant space. Suppose you have an array of 1001 integers. The integers are in random order, but you know each of the integers is between 1 and 1000 (inclusive). In addition, each number appears only once in the array, except for one number, which occurs twice. Assume that you can access each element of the array only once. Describe an algorithm to find the repeated number. If you used auxiliary storage in your algorithm, can you find an algorithm that does not require it? Count the number of set bits in a number. Now optimize for speed. Now optimize for size. Multiple by 8 without using multiplication or addition. Now do the same with 7. Add numbers in base n (not any of the popular ones like 10, 16, 8 or 2 -- I hear that Charles Simonyi, the inventor of Hungarian Notation, favors -2 when asking this question). Write routines to read and write a bounded buffer. Write routines to manage a heap using an existing array. Implement an algorithm to take an array and return one with only unique elements in it. Implement an algorithm that takes two strings as input, and returns the intersection of the two, with each letter represented at most once. Now speed it up. Now test it. Implement an algorithm to print out all files below a given root node. Given that you are receiving samples from an instrument at a constant rate, and you have constant storage space, how would you design a storage algorithm that would allow me to get a representative readout of data, no matter when I looked at it? In other words, representative of the behavior of the system to date. How would you find a cycle in a linked list? Give me an algorithm to shuffle a deck of cards, given that the cards are stored in an array of ints. The following asm block performs a common math function, what is it? cwd xor ax, dx sub ax, dx Imagine this scenario: I/O completion ports are communictaions ports which take handles to files, sockets, or any other I/O. When a Read or Write is submitted to them, they cache the data (if necessary), and attempt to take the request to completion. Upon error or completion, they call a user-supplied function to let the users application know that that particular request has completed. They work asynchronously, and can process an unlimited number of simultaneous requests. Design the implementation and thread models for I/O completion ports. Remember to take into account multi-processor machines. Write a function that takes in a string parameter and checks to see whether or not it is an integer, and if it is then return the integer value.

Write a function to print all of the permutations of a string. Implement malloc. Write a function to print the Fibonacci numbers. Write a function to copy two strings, A and B. The last few bytes of string A overlap the first few bytes of string B. How would you write qsort? How would you print out the data in a binary tree, level by level, starting at the top?

Applications

How can computer technology be integrated in an elevator system for a hundred story office building? How do you optimize for availability? How would variation of traffic over a typical work week or floor or time of day affect this? How would you implement copy-protection on a control which can be embedded in a document and duplicated readily via the Internet? Define a user interface for indenting selected text in a Word document. Consider selections ranging from a single sentence up through selections of several pages. Consider selections not currently visible or only partially visible. What are the states of the new UI controls? How will the user know what the controls are for and when to use them? How would you redesign an ATM? Suppose we wanted to run a microwave oven from the computer. What kind of software would you write to do this? What is the difference between an Ethernet Address and an IP address? How would you design a coffee-machine for an automobile. If you could add any feature to Microsoft Word, what would it be? How would you go about building a keyboard for 1-handed users? How would you build an alarm clock for deaf people?

1. a) What is a data structure? Mention the various types of data structures. b) What is an array? Give the formula to find the address of a particular Location in the array. c). What is a circular queue? How it differs from linear queue? d). Give the postfix form of an expression: (a - b * c + d) / (e + f) e). What is the time complexity of a linear search algorithm, binary search. f). What is a doubly linked list? g).Give the linked memory representation of a binary tree. h). What is a sparse matrix? i). Differentiate between terminal nodes and non-terminal nodes. j) Mention any 2 application of linked list k) What is a graph? l) Mention any 2 application of stack.

2. a) What is a Stack? Explain various operations performed using stack with Examples. b). Write an algorithm to generate first ten Fibonacci numbers recursively. c). What is recursion? How does it differ from iteration? (6+6+3) OR 3. a) . Distinguish between i) Primitive and Non-primitive data structure ii) Array and list. b) Write an algorithm to convert infix to postfix expression. c). Write algorithms to insert and delete elements from a circular queue (4+5+6) UNIT-II 4. a) Write an algorithm to return the maximum number in a linked list b). What is a linear linked list? How do you perform insertion and deletion operation such a list? c). What is a linked list? Explain the different types of linked list with a neat diagram (5+5+5) OR 5. a). Write and explain an algorithm to search for an element in a linked list. b) Write and explain an algorithm to add a node to a doubly linked list. c). Write an algorithm to implement queue using linked list. (5+5+5) UNIT-III 6. a). Define the following terminologies 1) Node 2) Root 3) Siblings 4) level 5) leaf node b).Write a recursive algorithm for Preorder and Postorder traversals of a binary tree. c). How to represent the graph in memory? Explain in detail. (5+6+4) OR 7. a). What is graph? Explain different types of graph. b) The order of nodes of a binary tree in Preorder and Inorder traversal are as under Preorder: A B D G H C E F I K J Inorder : B G H D A E I C K F J . Draw the corresponding binary tree. c). Compare tree and graph. (5+6+4) UNIT-IV 8. a). Write an algorithm to sort a list of numbers using Merge sort. b) Write and explain an algorithm to search a list of numbers using sequential search method. c) Show the bubble sort steps for the following numbers. 25 10 72 18 40 11 32 9 (6+4+5) OR 9. a). Describe the concept of binary search technique. b). Write an algorithm to sort the elements using Quick sort. c). Discuss the procedure and develop an algorithm to sort a list of elements using SELECTION Sort technique (4+6+5)

What is data structure? A data structure is a way of organizing data that considers not only the items store d, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data. List out the areas in which data structures are applied extensively? Compiler Design, Operating System, Database Management System, Statistical analysis package, Numerical Analysis, Graphics, Artificial Intelligence, Simulation List out few of the Application of tree data-structure? The manipulation of Arithmetic expression, Symbol T able construction, Syntax analysis What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn't mean that the distance between any two nodes involved in the minimum-spanning tree is minimum. Whether Linked List is linear or Non-linear data structure? According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one. What is the quickest sorting method to use? The answer depends on what you mean by quickest. For most sorting problems, it just doesn't matter how quick the sort is because it is done infrequently or other operations take significantly more time anyway. Even in cases in which sorting speed is of the essence, there is no one answer. It depends on not only the size and nature of the data, but also the likely order. No algorithm is best in all cases. There are three sorting methods in this author's toolbox that are all very fast and that are useful in different situations. Those methods are quick sort, merge sort, and radix sort.

The Quick Sort The quick sort algorithm is of the divide and conquer type. That means it works by reducing a sorting problem into several easier sorting problems and solving each of them. A dividing value is chosen from the input data, and the data is partitioned into three sets: elements that belong before the dividing value, the value itself, and elements that come after the dividing value. The partitioning is performed by exchanging elements that are in the first set but belong in the third with elements that are in the third set but belong in the first Elements that are equal to the

dividing element can be put in any of the three sets the algorithm wil l still work properly. The Merge Sort The merge sort is a divide and conquer sort as well. It works by considering the data to be sorted as a sequence of already-sorted lists (in the worst case, each list is one element long). Adjacent sorted lists are merged into larger sorted lists until there is a single sorted list containing all the elements. The merge sort is good at sorting lists and other data structures that are not in arrays, and it can be used to sort things that don't fit into memory. It also can be implemented as a stable sort. The Radix Sort The radix sort takes a list of integers and puts each element on a smaller list, depending on the value of its least significant byte. Then the small lists are concatenated, and the process is repeated for each more significant byte until the list is sorted. The radix sort is simpler to implement on fixed-length data such as ints. How can I search for data in a linked list? Unfortunately, the only way to search a linked list is with a linear search, beca use the only way a linked list's members can be accessed is sequentially. Sometimes it is quicker to take the data from a linked list and store it in a different data structure so that searches can be more efficient.

B Write an algorithm for finding minimum & maximum element among n elements stored in an array A. Calculate the frequency of execution of each statement. 2. A number is entered through keyboard. Write a program using array to find whether the number is even or odd. (Without using if-else, switch statement, loop or conditional operator). 3.A Explain with syntax how static and dynamic array are created in C programming language. 3.B Write a program to check the balanced parenthesis using stack.

a) What are primitive data structures? 1.5 Marks 1. (b) Differentiate between static and dynamic storage with the help of an example. 2. Discuss the merits and demerits of binary search algorithm. Also write the algorithm for binary search in an array of 20 elements. -2 Marks
.(b) Explain overflow and underflow in a linked list.
1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data. 2. List out the areas in which data structures are applied extensively? * Compiler Design, * Operating System, * Database Management System, * Statistical analysis package, * Numerical Analysis, * Graphics, * Artificial Intelligence, * Simulation 3. What are the major data structures used in the

following areas : RDBMS, Network data model & Hierarchical data model. * RDBMS Array (i.e. Array of structures) * Network data model Graph * Hierarchical data model Trees

7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms? Polish and Reverse Polish notations. 8. Convert the expression ((A + B) * C (D E) ^ (F + G)) to equivalent Prefix and Postfix notations.

12. How many different trees are possible with 10 nodes ? 1014 For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 23 - 3 = 5) trees. i ii iii iv v In general: Note - If there are n nodes, there exist 2n-n different trees. 13. List out few of the Application of tree data-structure? * The manipulation of Arithmetic expression, * Symbol Table construction, * Syntax analysis. 14. List out few of the applications that make use of Multilinked Structures? * Sparse matrix, * Index generation. 15. In tree construction which is the suitable efficient data structure?

(a) Array (e) none

(b) Linked list

(c) Stack

(d) Queue

(b) Linked list 16. What is the type of the algorithm used in solving the 8 Queens problem? Backtracking 17. In an AVL tree, at what condition the balancing is to be done? If the pivotal value (or the Height factor) is greater than 1 or less than 1. 18. What is the bucket size, when the overlapping and collision occur at same time? One. If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. This results in the overlapping of values. 19. Traverse the given tree using Inorder, Preorder and Postorder traversals. * * * Inorder : Preorder: Postorder: D H B E A F C I G J A B D H E C F G I J H D E B F I J G C A

20. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree? 15. In general: There are 2n-1 nodes in a full binary tree. By the method of elimination: Full binary trees contain odd number of nodes. So there cannot be full binary trees with 8 or 14 nodes, so rejected. With 13 nodes you can form a complete binary tree but not a full binary tree. So the correct answer is 15. Note: Full and Complete binary trees are different. All full binary trees are complete binary trees but not vice versa. 21. In the given binary tree, using array you can store the node 4 at which location? At location 6

Root

LC1

RC1

LC2

RC2

LC3

RC3

LC4

RC4

where LCn means Left Child of node n and RCn means Right Child of node n 22. Sort the given values using Quick Sort?

65

70

75

80

85

60

55

50

45

Sorting takes place from the pivot value, which is the first value of the given elements, this is marked bold. The values at the left pointer and right pointer are indicated using L and R respectively.

65

70L

75

80

85

60

55

50

45R

Since pivot is not yet changed the same process is continued after interchanging the values at L and R positions

65

45

75 L

80

85

60

55

50 R

70

65

45

50

80 L

85

60

55 R

75

70

65

45

50

55

85 L

60 R

80

75

70

65

45

50

55

60 R

85 L

80

75

70

When the L and R pointers cross each other the pivot value is interchanged with the value at right pointer. If the pivot is changed it means that the pivot has occupied its original position in the sorted order (shown in bold italics) and hence two different arrays are formed, one from start of the original array to the pivot position-1 and the other from pivot position+1 to end.

60 L

45

50

55 R

65

85 L

80

75

70 R

55 L

45

50 R

60

65

70 R

80 L

75

85

50 L

45 R

55

60

65

70

80 L

75 R

85

In the next pass we get the sorted form of the array.

45

50

55

60

65

70

75

80

85

23. For the given graph, draw the DFS and BFS? * * BFS: DFS: A X G H P E M Y J A X H P E Y M J G

24. Classify the Hashing Functions based on the various methods by which the key value is found. * Direct method, * Subtraction method, * Modulo-Division method, * Digit-Extraction method, * Mid-Square method, * Folding method, * Pseudo-random method. 25. What are the types of Collision Resolution Techniques and the methods used in each of the type? * Open addressing (closed hashing), The methods used include: Overflow block, * Closed addressing (open hashing) The methods used include: Linked list, Binary tree 26. In RDBMS, what is the efficient data structure used in the internal storage representation? B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes. 27. Draw the B-tree of order 3 created by inserting the following data arriving in sequence 92 24 6 7 11 8 22 4 5 16 19 20 78 28. Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree (b) Complete Binary Tree. By the method of elimination: Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it. 29. What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized. 30. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? No. Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesnt mean that the distance between any two nodes involved in the minimum-spanning tree is minimum. 31. Convert the given graph with weighted edges to minimal spanning tree. the equivalent minimal spanning tree is: 32. Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential 33. Whether Linked List is linear or Non-linear data structure? According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one. 34. Draw a binary Tree for the expression : A * B - (C + D) * (P / Q) 35. For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.