Skip to main content

VALUE OF TIME

Time is very precious.  We should not waste time.  Once time is lost, it is lost forever.  If you waste time, time will waste you. Money that has been spent can be recovered but not with time.  Time that once elapsed has passed and is over.  Almost everything in the world can be bought, but time lost cannot be bought.When a second has elapsed, that second moves from the present to the past.  If you have not made proper use of that which was in the present, then that second is wasted, it is destroyed and becomes the past.  No matter how much effort or distraction, that past cannot be brought back.If you want to achieve success in life, use your time properly.  take care of the present and Make full use of it.

That's all
Thank you ❤️

Comments

Post a Comment

Popular posts from this blog

IMPORTANCE OF MANAGEMENT

 1. Management is an activity 2. Management is a purposeful activity. 3. Management is concerned with the efforts of a group. 4. Management applies economic principles. 5. Management involves decision making. 6. Management is getting things done through others. 7. Management is an integrating process. 8. Management co-ordinates all activities and resources. (i) Management is a universal activity. (ii) Management is dynamic not rigid.

Shorting Objective question for c language

1. Which of the following is the correct syntax for using the bubble sort algorithm in C? a. bubbleSort(int arr[], int n); b. void bubbleSort(int *arr, int n); c. int *bubbleSort(int arr[], int n); d. bubbleSort(int *arr); Answer: b. void bubbleSort(int *arr, int n); 2. Which sorting algorithm has the best average-case time complexity in C? a. Bubble Sort b. Insertion Sort c. Merge Sort d. Selection Sort Answer: c. Merge Sort 3. Which sorting algorithm is not an in-place sorting algorithm in C? a. Bubble Sort b. Heap Sort c. Insertion Sort d. Quick Sort Answer: b. Heap Sort 4. Which of the following is the correct time complexity of the Quick Sort algorithm in C? a. O(n) b. O(nlogn) c. O(n^2) d. O(logn) Answer: b. O(nlogn) 5. Which of the following is an example of a stable sorting algorithm in C? a. Bubble Sort b. Insertion Sort c. Quick Sort d. Shell Sort Answer: b. Insertion 6. Which of the following is not a valid variable type in C? a) int b) float c) char d) decimal Answer: d) d...

In c, Array objective question with option

1. What is an array in C? a) A collection of similar data items stored in contiguous memory locations. b) A collection of different data items stored in non-contiguous memory locations. c) A collection of similar data items stored in non-contiguous memory locations. d) A collection of different data items stored in contiguous memory locations. Answer: a) A collection of similar data items stored in contiguous memory locations. 2.What is the syntax to declare an array in C? a) dataType arrayName[arraySize]; b) dataType arraySize[arrayName]; c) arrayName[arraySize] dataType; d) arraySize[arrayName] dataType; Answer: a) dataType arrayName[arraySize]; 3.How do you access the first element of an array in C? a) arrayName[0]; b) arrayName[1]; c) arrayName[-1]; d) arrayName[first]; Answer: a) arrayName[0]; 4.What is the index of the last element of an array in C? a) arraySize; b) arraySize - 1; c) arraySize + 1; d) arraySize * 2; Answer: b) arraySize - 1; 5.Can you change the size of an array ...