CS301 Short Notes for Mid Term
Here You can read and download CS301 - Data Structures Short Notes for Mid Term From Lecture 1 to 22 for Mid Term exam preparation. previously we shared MGT101 Short Notes for Mid term from Lec 1 to 2. |
| cs301 short notes for mid term from lecture no 1 to 22 in pdf |
CS301 Short Notes Sample Preview
What are the constraints ?
Constraint defines a limitation or restriction on resources of a system. In the computer, we have hard disk, memory and other hardware. We also have time to consider as a resource.
Suppose you are writing an algorithm to solve a given problem and you have disc space of 400 Mega bytes. So, here you have space constraint that your algorithm should use only the available space in an efficient way. A solution is considered to be an efficient solution if it solves the problem within its resource constraints.
What is lvalue?
In an assignment statement, lvalue refers to some memory location where some value can be stored.
Lvalue variable is written on left hand side of an assignment statement. For example, in the following statement, variable ‘var’ is lvalue variable and value 7 will be stored in it.
int var= 7;
What is “current” pointer ?
“Current” is a variable showing the status of currently focused element in array/list, for example if current = 5, it means that currently the focus is on element no. 5 in the array/list.
What is algorithm?
Algorithm is a finite sequence of steps for the solution of a problem.
WHAT IS ROLE OF ARRAYS IN DATA STRUCTURE?
Array is the most widely used data structure. It is also used as constituting integral part of other data
structures.
Array is mainly used to store similar data. For storing elements of indexed data, the particular method is array. For example, if you were storing information about each day in August, you would create an array with an index capable of addressing 31 values -- one for each day of the month. Think of a notebook with pages numbered 1 through 12. Each page may or may not contain information on it. The notebook is an array of pages. Each page is an element of the array 'notebook'.
Arrays can also be multidimensional - instead of accessing an element of a one-dimensional list, elements are accessed by two or more indices, as from a matrix or tensor. Arrays guarantee constant time read and write access,O(1) , however many lookup operations
(find_min, find_max, find_index) of an instance of an element are linear time, O(n). Arrays are very efficient in most languages, as operations compute the address of an element via a simple formula based on the base address element of the array.
Read Also: CS101 Short Notes For Mid Term From Lec 1 To 22
HOW MANY TYPES AN DATA CAN BE ORGANIZE?
Data can be organized in two main ways.
Constraint defines a limitation or restriction on resources of a system. In the computer, we have hard disk, memory and other hardware. We also have time to consider as a resource.
Suppose you are writing an algorithm to solve a given problem and you have disc space of 400 Mega bytes. So, here you have space constraint that your algorithm should use only the available space in an efficient way. A solution is considered to be an efficient solution if it solves the problem within its resource constraints.
What is lvalue?
In an assignment statement, lvalue refers to some memory location where some value can be stored.
Lvalue variable is written on left hand side of an assignment statement. For example, in the following statement, variable ‘var’ is lvalue variable and value 7 will be stored in it.
int var= 7;
What is “current” pointer ?
“Current” is a variable showing the status of currently focused element in array/list, for example if current = 5, it means that currently the focus is on element no. 5 in the array/list.
What is algorithm?
Algorithm is a finite sequence of steps for the solution of a problem.
WHAT IS ROLE OF ARRAYS IN DATA STRUCTURE?
Array is the most widely used data structure. It is also used as constituting integral part of other data
structures.
Array is mainly used to store similar data. For storing elements of indexed data, the particular method is array. For example, if you were storing information about each day in August, you would create an array with an index capable of addressing 31 values -- one for each day of the month. Think of a notebook with pages numbered 1 through 12. Each page may or may not contain information on it. The notebook is an array of pages. Each page is an element of the array 'notebook'.
Arrays can also be multidimensional - instead of accessing an element of a one-dimensional list, elements are accessed by two or more indices, as from a matrix or tensor. Arrays guarantee constant time read and write access,O(1) , however many lookup operations
(find_min, find_max, find_index) of an instance of an element are linear time, O(n). Arrays are very efficient in most languages, as operations compute the address of an element via a simple formula based on the base address element of the array.
Read Also: CS101 Short Notes For Mid Term From Lec 1 To 22
HOW MANY TYPES AN DATA CAN BE ORGANIZE?
Data can be organized in two main ways.
- Linear as in arrays, lists
- Non Linear or Hierarchical like Trees
Note: For Complete Short Notes download the pdf from the form below:
Download CS301 Short Notes for Mid Term Exam
| File Name | Download Link |
|---|---|
| CS301 Short Notes From Lecture No 01 to 22.pdf | Download |
If CS301 Short Notes for mid term From Lecture No 01 to 22 was helpful. Please share with your friends. Thank You.
8-)
ReplyDeleteshort notes for final term cs301 now required
ReplyDeleteshort notes for final term cs301 required now
ReplyDelete