study24x7
Data Structure
  • Followers
  • Latest Feeds
  • About
  • Review
  • Gallery
  • Question
Interests
GATE/ESE/PSU Java Technologies Databases Big Data & Analytics ...
Data Structure
20 May, 2019 01:00 am study24x7 study24x7

SQL

study24x7
Write a comment
Data Structure
02 May, 2019 07:21 pm study24x7 study24x7

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

A

IDMS

B

DB2

C

dBase-II

D

R:base

study24x7
Write a comment
Data Structure
30 Apr, 2019 01:58 am study24x7 study24x7

study24x7
Write a comment
Data Structure
30 Apr, 2019 01:37 am study24x7 study24x7

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 runtime using big O notation, which ignores constant factors. We associate with each algorithm a function f(n), which is the number of operations performed for input size n. We say that f(n) is O(g(n)) if for some positive constants c and n0, f(n) ≤ cg(n) for all n ≥ n0 For example, if an algorithm's runtime is O(n), then the runtime is ≤ c * n for all sufficiently large n. We can also use big O notation to describe how much space an algorithm uses. Sometimes space is described in terms of extra space (not including the space used by the input). Example 3n2 + 100n is O(n2). A simple way to find the big O is by looking at the largest exponent. As n becomes large, the 100n becomes insignificant. * Basic operations such as comparison or arithmetic take constant time. * A loop that repeats n times, with a constant number of operations per loop, takes O(n) time. * A nested loop where each loop repeats n times takes O(n2) time. * A loop that repeatedly halves n takes O(logn) time.

study24x7
Write a comment
Data Structure
30 Apr, 2019 01:31 am study24x7 study24x7

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 n. *_* Average Case: This is the scenario depicting the average execution time of an operation of a data structure. If an operation takes ƒ(n) time in execution, then m operations will take mƒ(n) time. *_* Best Case: This is the scenario depicting the least possible execution time of an operation of a data structure. If an operation takes ƒ(n) time in execution, then the actual operation may take time as the random number which would be maximum as ƒ(n).

study24x7
Write a comment
Data Structure
30 Apr, 2019 01:24 am study24x7 study24x7

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 of a data structure operation should be as little as possible.

study24x7
Write a comment
Data Structure
30 Apr, 2019 01:16 am study24x7 study24x7

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 system so organized. In simple terms, we can say Data Structure is a systematic way to organize data in order to use it efficiently. A data structure is a specialized format for organizing and storing data. General data structure types include the array, the file, the record, the table, the tree, and so on. Any data structure is designed to organize data to suit a specific purpose so that it can be accessed and worked with in appropriate ways.

study24x7
Write a comment
Data Structure
04 Apr, 2019 12:59 pm study24x7 study24x7

What is the correct method used to insert and delete items from the queue?

A

push and pop

B

 enqueue and peek

C

 enqueue and dequeue

D

add and remove

study24x7
Write a comment
Data Structure
04 Apr, 2019 12:46 pm study24x7 study24x7

What is the difference between Queue and Stack?

A

Stack is LIFO; Queue is FIFO

B

Queue is LIFO; Stack is FIFO

C

Stack and Queue is FIFO

D

Stack and Queue is LIFO

study24x7
Write a comment
Data Structure
03 Apr, 2019 03:52 am study24x7 study24x7

DATA STRUCTURE: In computer science, a data structure is a data organization, management and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data. A data structure is a specialized format for organizing and storing data. General data structure types include the array, the file, the record, the table, the tree, and so on. Any data structure is designed to organize data to suit a specific purpose so that it can be accessed and worked with in appropriate ways. In computer programming, a data structure may be selected or designed to store data for the purpose of working on it with various algorithms.

study24x7
Write a comment
About

The data structure is a specialized format for organizing and storing data. General data structure types include the array, the file, the record, the ...
See More

Ratings
5.0
out of 5
4 Ratings
5 study24x7
 
4.0
4 study24x7
 
0.0
3 study24x7
 
0.0
2 study24x7
 
0.0
1 study24x7
 
0.0