Algorithm Analysis and Design. Question 1: What do you understand by algorithm?
Explain the term definiteness with regard to algorithm. How algorithm can be analysed? What are directly affecting the analysis of algorithm? Ans 1: An Algorithm is a finite set of instruction that, if followed, accomplishes a particular task. In addition, if we want to say more precisely, than an algorithm is an effective method expressed as finite list of well-defined instructions for calculation of a function. Input- Zero or more quantities are externally supplied. Note: You can learn the above five properties with the help of short cut IO-DEF, I-input, O-Output, D-Definiteness, F-Finiteness, E-Effectiveness. Definiteness: Definiteness means each instruction should be clear and preciously defined and it should be unambiguous.
Factors Affecting the Algorithm Analysis: Goal of the algorithm analysis is to make comparisons between the algorithms. Question 2: Solve the Following recurrence relation : T(n) = 3 T(n/2) + n2, T(1)=1 Ans 9: else. Algorithms Interview Questions-Interview Questions and Answers-25061. Algorithms Interview Questions-Interview Questions and Answers-25061.
56 data structure interview questions answers - freshers, experienced. Part 1 Part 2 Part 3 Part 4 Part 5 What is hashing technique?
Describe in brief. In general, in all searching techniques, search time is dependent on the number of items. Sequential search, binary search and all the search trees are totally dependent on number of items and many key comparisons are involved. Hashing is a technique where search time is independent of the number of items or elements. We can write hash function as follows h(k)=a; Where h is hash function, k is the key, a is the hash value of the key. While choosing a hash function we should consider some important points. It should be easy to compute It should generate address with minimum collision. What are different techniques for making hash function? Techniques for making hash function. Truncation Method Midsquare Method Folding Method Division Method Truncation Method This is the simplest method for computing address from a key.In this method we take only a part of the key as address.
Top 50 Data Structure Interview Questions. 1) What is data structure?
Data structure refers to the way data is organized and manipulated. It seeks to find ways to make data access more efficient. When dealing with data structure, we not only focus on one piece of data, but rather different set of data and how they can relate to one another in an organized manner. 2) Differentiate file structure from storage structure.
Basically, the key difference is the memory area that is being accessed. Quora - The best answer to any question. General Knowledge, Computer Engineering, Aptitude, Interview, Jobs - gkseries. Technical Interview Questions and Answers-Interview Questions and Answers-21418. Computer Science Interview Questions and answers - Programming interview questions and answers. Computer Science & Engineering( Example FAQ in interviews) C, Data structures, C++ & OOPS: 9) Given inorder & preorder traversal or inorder & postorder traversal of a tree, build a tree. 10) Why prototypes are used?
11) What are inline functions and scope resolution12) What are pre-processors? What is their use? Virtual functions, encapsulation, data hiding etc4) Do virtual constructors & destructors exist? 5) What is the memory used by an integer pointer, float pointer etc. 6) What are: binary tree, strictly binary tree, completely binary tree, almost complete binary tree, threaded binary tree, etc. 7) Conversion of expression from infix to postfix & to prefix 8) Evaluation of postfix and prefix expressions ||Note||: In most of the cases small program code is given & output is asked or to identify the error in it.
Operating Systems: Computer Science Technical Aptitude Questions Free Ebook. Technical interview questions and answers, interview FAQ. CS Interview Question & Answers with pdf and technical questionsOurEdu Blog. CS Interview Question Answer Q1.
What do you mean by a File? Ans: A File contains contains data/information which are stored permanently in a storage device.Floppy disk and hard disk are commonly used to store file information.When large quantity data is required to be stored and processed, the concept of file is used. A file stored in a storage device is always identified using a file name(e.g. STUDENT.DAT). Note:- A filename normally has a primary name and a secondary name which are separated by a Dot(.) Computer Science Q2. Types of File Handling in C: The file handling in C can be categorized in two types- High level (Standard files or stream oriented files)- High level file handling is managed by library function. Q3: What are the ways of storing data in Files? 2. Q4: What are the operations that can be performed on Files?
Creation of a file of a specific type.Reading/processing a file.Append/add information to a file.Modify/edit data in a file.Delete items in a file.Update the file. Computer Science Engineering Interview Questions. Computer Science Engineering Interview Questions. How shall I start preparing for interviews in companies like Microsoft, Google, Directi, Flipkart, Amazon, and other such large conglomerates? - Quora. How shall I start preparing for interviews in companies like Microsoft, Google, Directi, Flipkart, Amazon, and other such large conglomerates? - Quora. Technical Interview Questions and Answers. Computer Science Interview Questions.