𝙒𝙝𝙖𝙩 𝙞𝙨 𝙈𝙚𝙢𝙩𝙖𝙗𝙡𝙚...？ ➊ A memtable is basically a write-back cache of data rows that can be looked up by key i.e. unlike a write-through cache, writes are batched up in the memtable until it is full, when a memtable is full, and it is...

See more

Mongodb vs Cassandra

𝘿𝙚𝙩𝙚𝙘𝙩 𝙡𝙤𝙤𝙥 𝙞𝙣 𝙖 𝙡𝙞𝙣𝙠𝙚𝙙 𝙡𝙞𝙨𝙩 Use HashSet Traverse the list one by one and keep putting the node addresses in a Hash Table. At any point, if NULL is reached then return false and if next of current node points to...

See more

𝓓𝓪𝓽𝓪 𝓢𝓽𝓻𝓾𝓬𝓽𝓾𝓻𝓮 𝓪𝓷𝓭 𝓐𝓵𝓰𝓸𝓻𝓲𝓽𝓱𝓶𝓼 - 𝓛𝓲𝓷𝓴𝓮𝓭 𝓛𝓲𝓼𝓽 A linked list is a sequence of data structures, which are connected together via links. Linked List is a sequence of links which...

See more

Do You Know....?

Outer Join.

What is Normalization?

Database normalization is a data design and organization process applied to data structures based on rules that help to build relational databases. In relational database design, the process of organizing data to minimize redundancy is called normali...

See more

SQL injection categories

The SQL command to create a table is:

Total Response

Binary Tree Data Structure *_* A tree whose elements have at most 2 children is called a binary tree. It is made of nodes, where each node contains a "left" reference, a "right" reference, and a data element. The topmost node in the tree is called the root. Nodes which are not le...

See more

SQL

Which of the following products was an early implementation of the relational model developed by E.F. Codd of IBM?

Total Response

Which of the following products was an early implementation of the relational model developed by E.F. Codd of IBM?

What is Big O notation ....? Calculating the exact runtime of an algorithm is difficult because it depends on the machine, the programming language, and the implementation of the algorithm. Instead of calculating the exact runtime or number of operations, we can estimate the ru...

See more

What are the Time Cases..? *_* Worst Case: This is the scenario where a particular data structure operation takes the maximum time it can take. If an operation's worst-case time is ƒ(n) then this operation will not take more than ƒ(n) time where ƒ(n) represents a function of ...

See more

Characteristic of a Data Structure *-* Correctness: Data structure implementation should implement its interface correctly. *-* Time Complexity: Running time or the execution time of operations of the data structure must be as small as possible. *-* Space Complexity: Memory usage...

See more

What is the data structure.....? Data + Structure Data: Data is a set of values of subjects with respect to qualitative or quantitative variables. Structure: Structure is an arrangement and organization of interrelated elements in a material object or system, or the object or sys...

See more