Skip to main content

how to stop windows 10 update

how to stop windows 10 update ||

disable windows 10 update


disable windows 10 update

Windows update एक ऐसा फीचर है जिसमें आपके लैपटॉप या कंप्यूटर की windows अपने आप अपडेट होते रहती है ऐसे मे आपका डेटा कहाँ गायब होता है आपको पता भी नही चलता ।वैसे तो windows auto update एक अच्छा फ़ीचर है  windows update करने से आपके कम्प्यूटर मे बहुत से नए features आ जाते हैं लेकिन बहुत बार हमारे पास इतना ज्यादा डाटा नही होता कि 4 GB का windows update कर सकें  तो आज हम बात करेंगे how to stop windows auto update windows auto update | how to stop windows 10 update को कैसे बंद करें ? नमस्कार दोस्तों स्वागत है आपका https://www.technicalkeeda.in मे चलिए शुरू करते हैं।
disable windows 10 update

Stop Windows auto update step by step-

  • open search bar of your computer
  • type services
  • click on window update option
  • disable the window update

step 1-
सबसे पहले अपने कंप्यूटर का search bar खोल ले और टाइप करें services
disable windows 10 update

step 2-
अब screen पर दिख रहे services option को क्लिक करें आपके सामने बहुत से settings खुल कर आ जाएंगी।

step 3-
disable windows 10 update

disable windows 10 update
step 3- अब आपको स्क्रॉल down करना है और windows update option पे क्लिक करना है।

इस जगह आप साफ साफ देख सकते हैं startup type -manual को बदल कर disabled पर click करना है।
Service status को stop करना है और जल्दी से ok पर क्लिक करें। यह प्रक्रिया आपको बार बार करनी होगी जब भी आपका windows auto update होने लगे ।

disable windows 10 update

also read- what is pixels ?


other way-

दूसरा तरीका आपको अपने लैपटॉप के system setting के अंदर जाना है और फिर windows update के ऑप्शन पर click करना है।
फिर आपको advance option वाले section मे जाना है वहाँ दिख रहे update option को off कर लेना है।

disable windows 10 update

अगर आप कभी update करना चाहते हैं तो वापस से advance setting मे आ कर ये option दोबारा on कर लें।
आशा करता हूं आपको पोस्ट
disable windows 10 update| how to stop windows 10 update
अच्छा लगा होगा।और अधिक पोस्ट पढ़ने के लिए  हमे फॉलो करें।
https://www.technicalkeeda.in/2018/12/online-fund-transfer.html
how does google map works?

Visit here for product reviews-https://www.catchmyblogs.com
here is some offer for you-

Comments

Popular posts from this blog

codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

 Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

 Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi