10+ SHIVKRUPA SAHAKARI PATPEDHI Interview Questions and Answers

Maintain relation between broken tables by using foreign keys and cascading updates/deletes.

• Use foreign keys to establish relationships between tables

• Use cascading updates/deletes to maintain referential integrity

• Avoid breaking tables unnecessarily

• Consider using a database management system that supports transactions

• Test thoroughly to ensure data consistency

The primary key in a table uniquely identifies each row in the table.

• Primary key is a column or a combination of columns that uniquely identifies each row in a table

• Primary key values cannot be null or duplicate

• Primary key is used to establish relationships between tables

• Examples of primary keys are social security number, email address, and employee ID

Mesh topology is a network design where each device is connected to every other device, forming a mesh-like structure.

• Mesh topology provides high redundancy and fault tolerance as there are multiple paths for data to travel.

• It offers excellent scalability as new devices can be easily added without disrupting the network.

• Mesh topology is commonly used in wireless networks, such as Wi-Fi, where each device acts as a node.

• In my college, mesh topology is used in the campus-wide W...read more

Mesh topology can be difficult to manage and expensive to implement.

• Mesh topology requires a large number of connections, making it difficult to manage.

• It can be expensive to implement due to the high number of connections required.

• Mesh topology can also suffer from high latency and low bandwidth.

• One solution is to use a hybrid topology, combining mesh with other topologies like star or bus.

• Another solution is to use routing protocols to optimize the flow of data through the ...read more

Operating system components are organized in a layered diagram.

• The top layer is the user interface, which interacts with the user.

• The next layer is the application programming interface (API), which provides a set of functions for applications to use.

• The kernel layer is responsible for managing system resources and providing services to other layers.

• The bottom layer is the hardware layer, which interacts with the physical components of the computer.

• Examples of operating syste...read more

Candidate key is a unique identifier for a record in a database table.

• A candidate key is a column or set of columns that can uniquely identify a record in a table.

• It must be unique and non-null for every record.

• A table can have multiple candidate keys, but only one can be the primary key.

• Example: Employee ID, Email ID, Passport Number can be candidate keys for an Employee table.

A C program to reverse a given number

• Take input number from user

• Initialize a variable to store reversed number

• Use while loop to reverse the number

• Print the reversed number

Primary key is a unique identifier for each record in a database table.

• Primary key ensures data integrity by enforcing uniqueness.

• It is used to establish relationships between tables.

• Primary key can be a single column or a combination of columns.

• It cannot have null or duplicate values.

• Examples: ID column in a user table, ISBN in a book table.

C is a low-level programming language while Java is a high-level programming language.

• C is compiled while Java is interpreted

• C has pointers while Java does not

• Java has automatic garbage collection while C does not

• Java is platform-independent while C is platform-dependent

• Java has built-in support for multithreading while C does not

ArrayList is a resizable array implementation of the List interface in Java.

• ArrayList is a dynamic array that can grow or shrink in size.

• ArrayList allows duplicate elements and maintains insertion order.

• ArrayList provides random access to elements using their index.

• List is an interface in Java that represents an ordered collection of elements.

• List allows duplicate elements and maintains insertion order.

• List provides various methods for manipulating and accessing elements.

A binary search tree is a data structure that organizes elements in a hierarchical manner, allowing for efficient searching and insertion.

• Binary search tree is a binary tree where each node has at most two children.

• The left child of a node contains a value less than the parent node, while the right child contains a value greater than the parent node.

• Binary search tree allows for efficient searching, insertion, and deletion operations with a time complexity of O(log n) on aver...read more

String Pool Locator in Java

• String pool is a special area of heap memory where string literals are stored

• String pool helps in memory optimization by reusing common string literals

• String.intern() method can be used to add a string to the string pool

• String literals are automatically added to the string pool

NAND, NOT, and AND are logical operators used in digital electronics.

• NAND is a combination of NOT and AND operators.

• NAND returns true only when both inputs are false.

• NOT operator negates the input value.

• AND operator returns true only when both inputs are true.

A linked list is a data structure that consists of a sequence of nodes, where each node contains data and a reference to the next node.

• Each node in a linked list contains a data element and a reference (link) to the next node.

• Linked lists can be singly linked (each node has a link to the next node) or doubly linked (each node has links to both the next and previous nodes).

• Linked lists are dynamic in size and can be easily modified by adding or removing nodes.

• Traversal in a li...read more