JD의 블로그

1. Diagnonal Matrix Most of the numbers are zeros and only the elements in their diagonal are non zeros M[i, j] = 0 if i!=j we want to store only non-zero elements A[5] = {3, 7 , 4 , 9, 6} [5x5] diagonal matrix M[i, j] if(i==j) a[i-1]; void set(int A[], int i, int j, int x) x is the element that i want to store { if(i==j) A[i-1] = x; } int get(int A[], int i, int j) { if(i==j) return A[i-1]; els..

1. Time complexity : basically depends on the procedure that you are adopting. n : some number of elements O(n), bigO to measure time consuming to take a task. For finding the time complexity either you can measure the time based on the work that you are doing, means according to your procedure, if you're clear with your procedure, you can know the time, or else from the code, program code also ..

1. What is ADT Data type 1) Representation of data (How you are storing the data) 2) operations on data (What are the operations that you allow on the data) Abstract : hiding internal details. (we need not know internal details - how these operations are performed.) Without knowing them, we can use them. When the Object Oriented Programming languages being started to use in Software Development,..

1. Physical : for storing the data [1] Array A collection of continous memory locations, all these locations are side by side. This array will have fixed size, once it is created of some size, then that size cannot be increased or decreased. The size of array is fixed. An array can be created either inside stack or heap. When should I use it? When you are sure, what is the maximum number of elem..

1. About Main Memory Memory is divided into smaller addressable units that are called as bytes. Every bytes have its own address. The entire memory is not used as a single unit, but it is divided into manageble pices, that are called as segment. 2. How a Program use memory Main mamory is divided into three sections : code section, Stack, and Heap. If I have a program file on the hard disk and if..

Data is an integral part of an applications or programs. 1. what is data structure? Data structure : arrangement of collection of data items so that they can be utilized efficiently, operations on that data can be done efficiently inside the main memory during the execution of a program. That is, during the execution of a program how the grogram will manage data inside the main memory and perfor..