Younger millennials have always had a computer in their pockets; smart phones were du jour by the time their generation came of age. They never knew the agonizing sounds of a dial-up connection, or the long wait times for a floppy disk to load. Computers have evolved significantly, thanks to many pioneers, including one of the oldest active-duty commissioned admirals of the U.S. Navy—Grace Hopper, affectionately known as “Grandma COBOL.” Click here to read the blog post: https://ow.ly/EIcQ50SpXEe Stay tuned for next week’s topic: "From Creeper to Reaper."
KMC Controls’ Post
More Relevant Posts
-
🔥 Day 31/100- 29/4/24 #100dayofcode #codejava Support and Guidance by, Kiran Kumar sir, Pentagon Space Sagar S sir Super ugly number in java>> A super ugly number is a positive integer whose prime factors are in the array primes. Given an integer n and an array of integers primes, return the nth super ugly number. The nth super ugly number is guaranteed to fit in a 32-bit signed integer.
-
-
Day - 23: of the #180DaysOfCode Challenge with Coder Army! Array in c++. Array Introduction What is an array Linear search Reverse, Fibonacci Cyclic Rotate Second Maximum in an array Missing Number #CodeWithPassion #GrowthMindset
-
MERN Full Stack Developer | MySql | Java | Cybersecurity Enthusiast | AWS Cloud Practitioner Certified
Day 89/100 of the #Dr.GVishwanathan Challenge 🌟 🎗 Question of the Day: " The K Weakest Rows in a Matrix" You are given an m x n binary matrix mat of 1's (representing soldiers) and 0's (representing civilians). The soldiers are positioned in front of the civilians. That is, all the 1's will appear to the left of all the 0's in each row. A row i is weaker than a row j if one of the following is true: The number of soldiers in row i is less than the number of soldiers in row j. Both rows have the same number of soldiers and i < j. Return the indices of the k weakest rows in the matrix ordered from weakest to strongest. 💻 I used C++ for this challenge. 💡Tip: "Solve the problem before coding it!" 😉Remember: "The best time to start was a year ago. The next best time is today." #drgvishwanathanchallenge #100daysofcodechallenge#vitbhopal#leetcodestreak
-
-
A bit of history and what mainframes do today. Interesting if you're into this kind of info. 😉 https://lnkd.in/dVbHPCTs
-
🔥Day 35/100- 3/5/24 #100dayofcode #codejava Pentagon Space Question of the day>> Friendly Pair The numbers whose ( sum of divisors ) / number ratio is same are known as Friendly Pair Numbers. Example Input : 6 28 Output : Yes, they are a friendly pair Explanation : The factors of 6 and 28 except the numbers themselves are 1, 2, 3 and 1, 2, 4, 7, 14 respectively. Now the sum of factors of both the numbers are 6 and 28 respectively. When we divide the sums with the numbers we get 1 and 1 respectively. As the ratio of both the number match, they are considered as a friendly pair.
-
-
Command Line Kung Fu: Master commands like last, who, & w to identify currently logged-in users & recent login attempts. Powerful for initial investigation. #LinuxForensics
-
Computer Networks important questions Link: https://lnkd.in/g95Kf-cK With less questions & with most important topics.
-
Just finished the course “Learning Computer Forensics” by Jungwoo Ryoo! Check it out: https://lnkd.in/dJU6FAWH #computerforensics.
Certificate of Completion
linkedin.com
-
a lifelong debate: is “sudo” pronounced “soo-doh” or “soo-doo”? however you say it, you can use it on TPF now! (p.s. it’ll help you monitor your Java apps too ☕️)
ZFILE sudo command support (PJ47113)
community.ibm.com
