Programming World👨‍💻

DSA INTERVIEW QUESTIONS AND ANSWERS 1. What is the difference between file structure and storage structure? The difference lies in the memory area accessed. Storage structure refers to the data structure in the memory of the computer system, whereas file structure represents the storage structure in the auxiliary memory. 2. Are linked lists considered linear or non-linear Data Structures? Linked lists are considered both linear and non-linear data structures depending upon the application they are used for. When used for access strategies, it is considered as a linear data-structure. When used for data storage, it is considered a non-linear data structure. 3. How do you reference all of the elements in a one-dimension array? All of the elements in a one-dimension array can be referenced using an indexed loop as the array subscript so that the counter runs from 0 to the array size minus one. 4. What are dynamic Data Structures? Name a few. They are collections of data in memory that expand and contract to grow or shrink in size as a program runs. This enables the programmer to control exactly how much memory is to be utilized.Examples are the dynamic array, linked list, stack, queue, and heap. 5. What is a Dequeue? It is a double-ended queue, or a data structure, where the elements can be inserted or deleted at both ends (FRONT and REAR). 6. What operations can be performed on queues? enqueue() adds an element to the end of the queue dequeue() removes an element from the front of the queue init() is used for initializing the queue isEmpty tests for whether or not the queue is empty The front is used to get the value of the first data item but does not remove it The rear is used to get the last item from a queue. 7. What is the merge sort? How does it work? Merge sort is a divide-and-conquer algorithm for sorting the data. It works by merging and sorting adjacent data to create bigger sorted lists, which are then merged recursively to form even bigger sorted lists until you have one single sorted list. 8.How does the Selection sort work? Selection sort works by repeatedly picking the smallest number in ascending order from the list and placing it at the beginning. This process is repeated moving toward the end of the list or sorted subarray. Scan all items and find the smallest. Switch over the position as the first item. Repeat the selection sort on the remaining N-1 items. We always iterate forward (i from 0 to N-1) and swap with the smallest element (always i). Time complexity: best case O(n2); worst O(n2) Space complexity: worst O(1) 9. What are the applications of graph Data Structure? Transport grids where stations are represented as vertices and routes as the edges of the graph Utility graphs of power or water, where vertices are connection points and edge the wires or pipes connecting them Social network graphs to determine the flow of information and hotspots (edges and vertices) Neural networks where vertices represent neurons and edge the synapses between them 10. What is an AVL tree? An AVL (Adelson, Velskii, and Landi) tree is a height balancing binary search tree in which the difference of heights of the left and right subtrees of any node is less than or equal to one. This controls the height of the binary search tree by not letting it get skewed. This is used when working with a large data set, with continual pruning through insertion and deletion of data. 11. Differentiate NULL and VOID ? Null is a value, whereas Void is a data type identifier Null indicates an empty value for a variable, whereas void indicates pointers that have no initial size Null means it never existed; Void means it existed but is not in effect 12. Do dynamic memory allocations help in managing data? How? Dynamic memory allocation stores simple structured data types at runtime. It has the ability to combine separately allocated structured blocks to form composite structures that expand and contract as needed, thus helping manage data of data blocks of arbitrary size, in arbitrary order. ENJOY LEARNING 👍👍

Beautify your GitHub profile with this repository https://github.com/programmingworld-dev/beautify-github-profile

Top Programming Interview Questions and Answers (General) Question: Please explain what you understand by computer programming. Answer: Also known as coding or programming, computer programming is the process of encoding an algorithm into a notation, typically a computer program, by means of some programming language so that it can be executed by a computer. Each programming language contains a set of instructions for the computer to execute a set of tasks. Programming is a complex process that includes designing an algorithm, coding the same in a programming language, debugging a program, maintaining, and updating the code. Question: Can you enumerate and explain the various types of errors that can occur during the execution of a computer program? Answer: Three types of errors can occur during the execution of a computer program. These are: Logical errors – This occurs in the scenario of a computer program implementing the wrong logic. As there is no report generated for these types of programming errors, they are the most difficult ones to deal with. Runtime errors – Occurs when the program contains an illegal operation. For example, dividing a number by 0. These are the only errors that are displayed instantly during the program execution. Upon the occurrence of a runtime error, the program execution is stopped and a diagnostic message is displayed. Syntax errors – Occurs when one or more grammatical rules of the programming language being used is violated. Such errors are detected during compile time. Question: Please explain an algorithm. What are some of its important features? Answer: An algorithm can be defined as a set of finite steps that when followed helps in accomplishing a particular task. Important features of an algorithm are clarity, efficiency, and finiteness. Question: What do you understand by maintaining and updating a computer program? Answer: The maintenance and updating process of a computer program starts post its successful installation. While program maintenance is the continuous process of monitoring the computer program for bugs and errors, updating the computer program means making it better with minor and major changes over time. Question: Please provide a brief explanation on variables. Answer: Variables are used for storing the input of a program as well as the computational results during program execution. These are actually named memory locations. The value stored in a variable can change during the program execution. Source: Vijay Singh

Guys who don't have medium membership use this chrome extension in your browser https://t.me/Programmingworld_dev/1150

Interview Preparation Plan for 30 Days: 200+ coding and Behavioural questions Table of contents Day 1: Arrays Day 2: Sorting Day 3: Searching Day 3: Matrix Day 4: Sliding Window Patten Day 5: Maths Day 6 & 7: Linked list Day 8: 2 Pointer Day 9: Fast & Slow Pointers Day 10: Stack Day 11: Queue Day 12: Hashing Day 13 & 14: Heap Day 15: Greedy Day 16: Recursion Day 17: Backtracking Day 18: Divide & Conquer Day 19: String Day 20 & 21: Binary Tree Day 22: Binary Search Tree Day 23: Mixed Topics Day 24: Graph Day 25 & 26: Dynamic Programming Day 27: Design Patterns Bits Manipulation (optional) System Design — Key Concepts and Terms (Interview notes) Day 28 & 29: Theory (OS, CN, DB) (To be added) Day 30: Behavioural Interview (To be added) Day 30: Projects (How to discuss projects in interviews) 🔗 Link: https://ganeshpr227.medium.com/30-days-interview-preparation-plan-200-best-coding-questions-and-behavioural-interviews-3f8fc19c2361

Top 9 websites for practicing algorithms and Data structure. ⛓ https://www.hackerrank.com/ ⛓ https://leetcode.com/ ⛓ https://www.codewars.com/ ⛓ https://www.hackerearth.com/for-developers ⛓ https://coderbyte.com/ ⛓ https://www.coursera.org/browse/computer-science/algorithms ⛓ https://www.codechef.com/ ⛓ https://codeforces.com/ ⛓ https://www.geeksforgeeks.org/

http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html C tutorials + Data Structure

▪️Win 10 Pro Key WKFQP-N47CJ-9M3CW-CBDCP-Q3WXM Q3CNW-D4Q4W-6XCT6-Y48R7-7QWXM TKR6D-TN72T-QRPG9-K2FDF-3DBQB FPB27-2CNM2-726P7-W38BJ-WB49M

DSA sheet by ARSH. https://docs.google.com/spreadsheets/d/1MGVBJ8HkRbCnU6EQASjJKCqQE8BWng4qgL0n3vCVOxE/htmlview?usp=sharing&pru=AAABgKkdtIE*rPv8dPkWyOpfwjprKvKSeA

250 DSA problem sheet by FRAZ. https://docs.google.com/spreadsheets/u/0/d/1-wKcV99KtO91dXdPkwmXGTdtyxAfk1mbPXQg81R9sFE/htmlview