Ans. A compiled language is translated into machine code by a compiler before execution (e.g., C, C++), while an interpreted language is executed line-by-line by an interpreter at runtime (e.g., Python, JavaScript).

Ans. An operating system (OS) is system software that manages computer hardware, software resources, and provides common services for computer programs. Examples include Windows, macOS, Linux.

Ans. A data structure is a way of organizing and storing data so that it can be accessed and modified efficiently. Common data structures include arrays, linked lists, stacks, queues, trees, and graphs.

Ans. An array is a fixed-size data structure where elements are stored in contiguous memory locations. A linked list is a dynamic structure where each element (node) contains a value and a reference to the next node, allowing dynamic memory allocation.

Ans. A stack is a linear data structure that follows the Last In First Out (LIFO) principle. It is used for function calls, expression evaluation, undo mechanisms, etc. Common operations: push (insert), pop (remove).

Ans. A queue is a linear data structure that follows the First In First Out (FIFO) principle. It is used in scheduling processes, handling requests, and more. Operations include enqueue (insert), dequeue (remove).

Ans. A binary tree is a hierarchical data structure where each node has at most two children: left and right. It is used in searching, sorting, and hierarchical data representation.

Ans. A database is an organized collection of data that can be easily accessed, managed, and updated. Databases are managed using Database Management Systems (DBMS) like MySQL, PostgreSQL, and MongoDB.

Ans. Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. It involves dividing large tables into smaller ones and defining relationships between them.

Ans. An algorithm is a step-by-step procedure or set of rules to solve a problem or perform a task. Algorithms are essential in programming and are used to manipulate data, perform calculations, and automate tasks.

Ans. Primary memory (e.g., RAM) is the main memory that the CPU accesses directly for processing. It is fast but volatile, meaning data is lost when power is off. Secondary memory (e.g., HDD, SSD) provides long-term storage and is non-volatile, retaining data even when the computer is turned off.

Ans. When you type a URL into a browser, several steps occur:

1. DNS Lookup: The domain name is converted into an IP address using DNS.
2. Establish Connection: A TCP connection (and TLS if HTTPS) is made with the server.
3. Send Request: The browser sends an HTTP request to the server.
4. Receive Response: The server responds with HTML, CSS, JavaScript, etc.
5. Render Page: The browser processes and displays the web page to the user.

Ans. A stack is a data structure that follows the Last In First Out (LIFO) principle, where the last element added is the first to be removed. A queue follows the First In First Out (FIFO) principle, where the first element added is the first to be removed.

Ans. A database is an organized collection of data that can be easily accessed, managed, and updated. Databases are used to store large volumes of information and support efficient data retrieval and manipulation using a Database Management System (DBMS).

Ans. Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. It involves dividing tables into smaller, related tables and defining relationships between them using keys.

Ans. A foreign key is a column or a set of columns in a database table that establishes a link between data in two tables. It refers to the primary key in another table, enabling referential integrity between related tables.

Ans. A programming language is a formal language comprising a set of instructions that produce various kinds of output. Programmers use these languages to write software programs, algorithms, and scripts. Examples include Python, Java, C++, and JavaScript.

Ans. OOP is a programming paradigm based on the concept of "objects," which can contain data and code to manipulate that data. Key principles of OOP include encapsulation, inheritance, polymorphism, and abstraction. It allows for modular, reusable, and organized code.

Ans. Inheritance is an OOP concept where a class (called a child or subclass) can inherit properties and methods from another class (called a parent or superclass). It promotes code reusability and hierarchical classification.

Ans. A compiler is a program that translates high-level source code into machine code or bytecode that a computer's processor can execute. It compiles the entire code before execution, helping detect errors early and improving performance.

Ans. An operating system (OS) is system software that manages computer hardware, software resources, and provides services for computer programs. Common OS examples include Windows, macOS, Linux, and Android.

Ans. Multithreading is the concurrent execution of multiple threads (smaller units of a process) within a single program. It allows efficient use of CPU resources and improves performance in tasks like data processing or user interface responsiveness.

Ans. Recursion is a programming technique where a function calls itself directly or indirectly to solve a problem. It is commonly used for problems that can be divided into smaller, similar subproblems, such as calculating factorial or traversing a tree.

Ans. A linked list is a linear data structure where each element (node) contains data and a reference (link) to the next node. Unlike arrays, linked lists allow dynamic memory allocation and efficient insertions and deletions.

Ans. A deadlock is a situation in an operating system where two or more processes are unable to proceed because each is waiting for a resource held by the other. This causes the processes to remain in a blocked state indefinitely.

Ans. SDLC is a structured process followed by software developers to design, develop, test, and maintain software systems. Common phases include requirement analysis, design, implementation, testing, deployment, and maintenance.

Ans. Big O notation is used to describe the time complexity or space complexity of an algorithm in terms of input size. It provides a way to analyze the efficiency and scalability of algorithms, e.g., O(1), O(n), O(log n), O(n^2).

Ans. Cloud computing is the delivery of computing services—including servers, storage, databases, networking, software—over the internet (the cloud) to offer faster innovation, flexible resources, and economies of scale.

Ans. Cybersecurity involves protecting computer systems, networks, and data from digital attacks, unauthorized access, and damage. It includes measures like firewalls, encryption, antivirus software, and access controls.

Ans. Artificial Intelligence is the simulation of human intelligence in machines that are programmed to think and learn. AI applications include machine learning, natural language processing, robotics, and computer vision.

Ans. Machine learning is a subset of artificial intelligence where algorithms enable computers to learn from and make predictions based on data, without explicit programming.

Ans. In supervised learning, the algorithm is trained on labeled data and learns to map inputs to known outputs. In unsupervised learning, the algorithm works with unlabeled data to find hidden patterns or groupings.

Ans. A neural network is a computational model inspired by the human brain, consisting of layers of nodes (neurons) that work together to process information and solve tasks like classification and prediction.

Ans. A database is a structured collection of data that is stored and accessed electronically. It is managed by a Database Management System (DBMS), such as MySQL, Oracle, or MongoDB.

Ans. SQL databases are relational and use structured query language (SQL) for querying and managing data. NoSQL databases are non-relational and are more flexible, often used for unstructured or semi-structured data.

Ans. An index in a database is a data structure that improves the speed of data retrieval operations. It provides a quick lookup of data based on a specific key or attribute.

Ans. A primary key uniquely identifies each record in a table, while a foreign key is a field in a table that links to the primary key in another table, establishing a relationship between the two.

Ans. Normalization is the process of organizing data in a database to reduce redundancy and dependency. It involves dividing large tables into smaller ones and defining relationships between them.

Ans. A stack is a data structure that follows the Last In, First Out (LIFO) principle, while a queue follows the First In, First Out (FIFO) principle. Stacks are used in recursion, and queues are used in scheduling tasks.

Ans. Recursion is a programming technique where a function calls itself in order to solve smaller instances of the same problem. It is often used in problems like tree traversal and factorial computation.

Ans. An algorithm is a step-by-step procedure or formula for solving a problem or performing a task. Algorithms are fundamental to computer science and form the basis of computer programs.

Ans. A process is an independent program in execution, while a thread is the smallest unit of a process that can be scheduled for execution. Multiple threads can exist within a single process.

Ans. Deadlock is a condition in which two or more processes are unable to proceed because each is waiting for the other to release resources. It can result in system performance issues or crashes.

Ans. A hash function is an algorithm that converts input data (like a file or string) into a fixed-size value, typically for efficient data retrieval, indexing, or ensuring data integrity.

Ans. A compiler translates the entire source code into machine code before execution, while an interpreter translates and executes code line-by-line during runtime.

Ans. OOP is a programming paradigm based on the concept of objects, which are instances of classes. It focuses on encapsulation, inheritance, polymorphism, and abstraction to create modular and reusable code.

Ans. Polymorphism allows objects of different classes to be treated as objects of a common superclass. It enables methods to behave differently depending on the object calling them.

Ans. Encapsulation is the concept of bundling the data (variables) and methods (functions) that operate on the data into a single unit, known as a class, and restricting access to some of the object's components.

Ans. Inheritance is a mechanism where a new class (subclass) acquires properties and behaviors (methods) of an existing class (superclass), allowing code reuse and logical hierarchy.

Ans. Abstraction is the concept of hiding the complex implementation details of a system and exposing only the essential features to the user. It simplifies the interaction with the system.

Ans. A linked list is a linear data structure in which elements (nodes) are stored in memory, and each node points to the next one. It allows efficient insertion and deletion of elements.

Ans. In a singly linked list, each node points to the next node, whereas in a doubly linked list, each node has pointers to both the next and the previous node.

Ans. A binary tree is a data structure where each node has at most two children, referred to as the left and right child. It is used in various applications like searching, sorting, and decision making.

Ans. A stack is a linear data structure that follows the Last In, First Out (LIFO) principle, meaning the last element added is the first one to be removed.

Ans. A queue is a linear data structure that follows the First In, First Out (FIFO) principle, meaning the first element added is the first one to be removed.

Ans. Dynamic programming is a technique used to solve problems by breaking them down into simpler subproblems, solving each subproblem once, and storing the results for future use to avoid redundant computations.

Ans. A greedy algorithm makes the locally optimal choice at each stage with the hope of finding the global optimum. It doesn't always guarantee the best solution but works well for certain problems like coin change or interval scheduling.

Ans. A heap is a binary tree-based data structure that satisfies the heap property: the key of a parent node is always greater (max-heap) or smaller (min-heap) than its children. It is often used in priority queues.

Ans. A hash table is a data structure that stores key-value pairs, where a hash function is used to map the keys to indices in an array, allowing fast lookups, insertions, and deletions.

Ans. Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the root and explores as far as possible along each branch before backtracking.

Ans. Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the root and explores all the neighbors at the present depth before moving on to nodes at the next depth level.

Ans. Dijkstra’s algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph, where all edge weights are non-negative.

Ans. An array is a collection of elements stored in contiguous memory locations, whereas a linked list consists of nodes where each node points to the next node, allowing for dynamic memory allocation.

Ans. Quicksort is a divide-and-conquer sorting algorithm that selects a pivot element and partitions the array into two sub-arrays, recursively sorting the sub-arrays.

Ans. Merge sort is a divide-and-conquer sorting algorithm that divides the array into two halves, sorts them recursively, and then merges them into a sorted array.

Ans. Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. This process is repeated until the list is sorted.

Ans. A process is an independent program running in a computer, while a thread is a smaller unit of a process that executes tasks concurrently within the process.

Ans. Multithreading is the ability of a CPU to execute multiple threads concurrently, enabling better CPU utilization and improved performance for applications that require multitasking.

Ans. Concurrency is the ability to handle multiple tasks at once, whereas parallelism is the simultaneous execution of multiple tasks. Parallelism improves performance, while concurrency improves resource utilization.

Ans. A deadlock occurs in a multi-threaded environment when two or more threads are blocked forever, waiting for each other to release resources. It results in the system being stuck in a permanent wait state.

Ans. A database is a structured collection of data that is stored and accessed electronically. Databases use a management system (DBMS) to store, retrieve, and manipulate data efficiently.

Ans. Normalization is the process of organizing data in a database to reduce redundancy and dependency by dividing large tables into smaller ones and defining relationships between them.

Ans. A primary key is a unique identifier for a record in a database table. It ensures that no two rows have the same value in the primary key column(s).

Ans. SQL (Structured Query Language) is a domain-specific language used for managing and manipulating relational databases. It allows users to query, insert, update, and delete data in a database.

Ans. An index is a data structure that improves the speed of data retrieval operations on a database table. It allows for faster searches but can slow down write operations.

Ans. A foreign key is a column or set of columns in one table that refers to the primary key in another table. It is used to establish and enforce a link between the data in the two tables.

Ans. UNION is used to combine the results of two or more SELECT queries into a single result set, eliminating duplicates. JOIN combines columns from two or more tables based on a related column between them.

Ans. A view is a virtual table based on the result of a SELECT query. It does not store data itself but provides a way to access and present data from one or more tables.

Ans. An ER (Entity-Relationship) diagram is a graphical representation of entities and their relationships in a database. It is used to design and model the structure of a database.

Ans. A deadlock in DBMS occurs when two or more transactions are blocked forever because they are waiting for each other to release resources. Deadlock detection and prevention mechanisms are used to handle it.

Ans. NoSQL (Not Only SQL) is a class of database management systems designed to handle large volumes of unstructured or semi-structured data. Examples include MongoDB, Cassandra, and Redis.

Ans. A transaction is a sequence of operations performed as a single logical unit of work. It ensures the ACID properties (Atomicity, Consistency, Isolation, Durability) are maintained in the database.

Ans. ACID stands for Atomicity, Consistency, Isolation, and Durability. These are properties of database transactions that ensure data integrity and correctness during concurrent transactions.

Ans. A cache is a small, fast storage area that stores frequently accessed data. Caching reduces the time it takes to retrieve data, improving the speed of applications and systems.

Ans. A CMS is software that helps users create, manage, and modify content on a website without needing specialized technical knowledge. Examples include WordPress, Joomla, and Drupal.

Ans. RESTful APIs (Representational State Transfer) are web services that allow different applications to communicate with each other over HTTP using standard operations like GET, POST, PUT, and DELETE.

Ans. Microservices is an architectural style where an application is composed of small, independent services that can be developed, deployed, and scaled separately. Each service typically performs a single function.

Ans. A load balancer is a device or software that distributes incoming network traffic across multiple servers to ensure no single server is overwhelmed, improving availability and reliability.

Ans. HTTP (HyperText Transfer Protocol) is an insecure protocol for transferring web pages. HTTPS (HyperText Transfer Protocol Secure) is the secure version, using SSL/TLS encryption to protect data during transmission.

Ans. Version control is the management of changes to source code, documents, or other collections of information. It allows multiple people to collaborate and track the history of changes. Examples include Git and SVN.

Ans. Git is a distributed version control system used for tracking changes in source code during software development. It allows developers to collaborate on projects and manage code versions efficiently.

Ans. Continuous integration is the practice of frequently integrating code changes into a shared repository. It involves automated testing to detect issues early in the development process.

Ans. Continuous delivery is a software development practice where code changes are automatically prepared for a release to production. It ensures that software is always in a deployable state.

Ans. Docker is an open-source platform used to automate the deployment of applications inside lightweight, portable containers that can run consistently across different environments.

Ans. Kubernetes is an open-source container orchestration platform used to automate the deployment, scaling, and management of containerized applications. It is commonly used with Docker.

Ans. Serverless architecture allows developers to build and run applications without managing the underlying servers. Cloud providers handle infrastructure management, enabling automatic scaling and event-driven execution.

Ans. Machine learning is a subset of artificial intelligence (AI) where computers learn from data, identify patterns, and make decisions without being explicitly programmed for each task.

Ans. Supervised learning is a type of machine learning where the model is trained on labeled data. The algorithm learns from the input-output pairs to make predictions on unseen data.

Ans. Unsupervised learning is a type of machine learning where the model is trained on unlabeled data. The algorithm tries to find hidden patterns or intrinsic structures in the data.

Ans. Reinforcement learning is a type of machine learning where an agent learns by interacting with its environment, receiving feedback in the form of rewards or penalties, and improving its actions over time.