Basic Data Structure Question And
Answers
/.Algorithm is not the complete code or program, it is just the core logic(solution) of a
problem, which can be expressed either as an informal high level description as
pseudocode or using a flowchart. - Answer-Every Algorithm must satisfy the following
properties:
/.All these data structures allow us to perform different operations on data. We select
these data structures based on which type of operation is required. We will look into
these data structures in more details in our later lessons. - Answer-The data structures
can also be classified on the basis of the following characteristics:
/.An algorithm is said to be efficient and fast, if it takes less time to execute and
consumes less memory space. The performance of an algorithm is measured on the
basis of following properties : - Answer-Time Complexity and Space Complexity
/.As discussed before, anything that can store data can be called a data structure,
hence Integer, Float, Boolean, Char etc, all are data structures. They are known as
Primitive Data Structures. - Answer-Then we also have some complex Data Structures,
which are used to store large and connected data.
/.Correctness - Answer-Every step of the algorithm must generate a correct output.
/.Data Space - Answer-Its the space required to store all the constants and
variables(including temporary variables) value.
/.Data Structure is a way of collecting and organizing data in such a way that we can
perform operations on these data in an effective way. Data Structures is about
rendering data elements in terms of some relationship, for better organization and
storage. - Answer-For example, we have some data which has, player's name "Alex"
and age 26. Here "Alex" is of String data type and 26 is of integer data type.
/.Definiteness - Answer-Every step of the algorithm should be clear and well defined.
/.Dynamic - Answer-Dynamic structures are those which expands or shrinks depending
upon the program need and its execution. Also, their associated memory locations
changes. Example: Linked List created using pointers
/.Environment Space - Answer-Its the space required to store the environment
information needed to resume the suspended function.
Answers
/.Algorithm is not the complete code or program, it is just the core logic(solution) of a
problem, which can be expressed either as an informal high level description as
pseudocode or using a flowchart. - Answer-Every Algorithm must satisfy the following
properties:
/.All these data structures allow us to perform different operations on data. We select
these data structures based on which type of operation is required. We will look into
these data structures in more details in our later lessons. - Answer-The data structures
can also be classified on the basis of the following characteristics:
/.An algorithm is said to be efficient and fast, if it takes less time to execute and
consumes less memory space. The performance of an algorithm is measured on the
basis of following properties : - Answer-Time Complexity and Space Complexity
/.As discussed before, anything that can store data can be called a data structure,
hence Integer, Float, Boolean, Char etc, all are data structures. They are known as
Primitive Data Structures. - Answer-Then we also have some complex Data Structures,
which are used to store large and connected data.
/.Correctness - Answer-Every step of the algorithm must generate a correct output.
/.Data Space - Answer-Its the space required to store all the constants and
variables(including temporary variables) value.
/.Data Structure is a way of collecting and organizing data in such a way that we can
perform operations on these data in an effective way. Data Structures is about
rendering data elements in terms of some relationship, for better organization and
storage. - Answer-For example, we have some data which has, player's name "Alex"
and age 26. Here "Alex" is of String data type and 26 is of integer data type.
/.Definiteness - Answer-Every step of the algorithm should be clear and well defined.
/.Dynamic - Answer-Dynamic structures are those which expands or shrinks depending
upon the program need and its execution. Also, their associated memory locations
changes. Example: Linked List created using pointers
/.Environment Space - Answer-Its the space required to store the environment
information needed to resume the suspended function.
