KrazyDave16:

Spend more time knowing how Linux works, and make it work with your workflow (scripts, Cron jobs, shorten complex commands to aliases, and more that'll come to you).
That already done, get to doing some actual work.


Avoid theming like a madman. Ricing is cool, till you install this seemingly harmless widget/extension that'll cause you issues like a memory leak, which leads to freezing, makes you do a clean reinstall because you don't have a backup via Timeshift, and uninstalling the offending widget didn't change anything (true story).


Other than that, here are some tips;
Get Timeshift (backup your data, it doesn't extend to files stored)
Avoid updating your packages/system the moment an update drops, even if it's a kernel update (6.4.* freezing on AMD CPUs, 6.4.9 fixed it for some). Wait for others to review before doing so.

The bolded happened to one time, after setting up the best theme in the world (for my mind) one last tweak ruined everything, the experience was very annoying

qtguru:


The Senior you are, the more you need to know, especially when you want to apply.

But you're more grounded and you'll not let the entry levelers breathe if you keep studying!

Since you're senior, apart from updates which you already know the core about, why would you still want to continue studying your structures and algorithms? You've seen it all already! You know it all already!

As our elders in these matters, I'm going to trust you and airsaylongcome. Because the landscape changes so fast you have to keep up with it. But I still don't think you guys need to study that much, if at all.

BRATISLAVA:


But you're more grounded and you'll not let the entry levelers breathe if you keep studying!

Since you're senior, apart from updates which you already know the core about, why would you still want to continue studying your structures and algorithms? You've seen it all already! You know it all already!

As our elders in these matters, I'm going to trust you and airsaylongcome. Because the landscape changes so fast you have to keep up with it. But I still don't think you guys need to study that much, if at all.

You know Algorithm and Data Strucutures ?

qtguru:


You know Algorithm and Data Strucutures ?

Perhaps. But you know them much better than a lot of people do. Why would you still need to study them?

BRATISLAVA:


Perhaps. But you know them much better than a lot of people do. Why would you still need to study them?

How many data structures are you familiar with ? it's not a personal attack, I'm trying to see your understanding.

qtguru:


How many data structures are you familiar with ? it's not a personal attack, I'm trying to see your understanding.

None. I'm as green as they get. So you can see why I may need to study, but you shouldn't have to. You've been immersed in it for decades.

BRATISLAVA:


None. I'm as green as they get. So you can see why I may need to study, but you shouldn't have to. You've been immersed in it for decades.

It's a lot like alot just Array alone has different Algo tied to it and there are tons of DSA and Algo, so it's something we study to remember and every job interview quizes you on this. Algo is not a done and dusted thing, it's something you have to practice to remember.

This is from ChatGPT the curriculum for DSA

Introduction to Algorithms and Problem Solving:

Basic terminology and concepts
Algorithm analysis and complexity
Arrays and Strings:

Array manipulation and traversal
String manipulation and pattern matching
Linked Lists:

Singly linked lists
Doubly linked lists
Circular linked lists
Stacks and Queues:

Implementations and applications
Evaluation of expressions
Priority queues
Recursion and Backtracking:

Recursive problem-solving techniques
Solving problems using backtracking
Sorting and Searching:

Bubble sort, insertion sort, selection sort
Merge sort, quicksort, heapsort
Binary search, linear search
Trees:

Binary trees
Binary search trees (BST)
AVL trees, Red-Black trees
Tree traversals: inorder, preorder, postorder
Graphs:

Graph representation (adjacency matrix, adjacency list)
Breadth-First Search (BFS)
Depth-First Search (DFS)
Shortest path algorithms: Dijkstra's, Bellman-Ford
Minimum Spanning Tree (Prim's, Kruskal's)
Hashing:

Hash functions
Hash tables
Collision resolution strategies
Dynamic Programming:

Concept of overlapping subproblems and optimal substructure
Memoization and tabulation
Examples of dynamic programming problems
Greedy Algorithms:

Greedy choice property
Fractional knapsack problem
Huffman coding
Disjoint Set Union (Union-Find):

Data structure and operations
Applications in graph problems
Advanced Data Structures (optional):

Trie, Suffix tree
Segment tree, Fenwick tree (Binary Indexed Tree)
B-trees, B+ trees
Advanced Algorithms (optional):

Matrix exponentiation
Strongly connected components (Kosaraju's algorithm)
Maximum flow (Ford-Fulkerson, Edmonds-Karp)
NP-Completeness and Approximation Algorithms (optional):

Introduction to complexity classes
P vs. NP problem
Approximation algorithms

Don't buy into that myth that engineers know 100% of everything in their head. it's why we keep studying but our studying is not like beginner's level, sometimes some knowledge of Discrete math is required too, but it depends on your role and how far you want to advance.

qtguru:


It's a lot like alot just Array alone has different Algo tied to it and there are tons of DSA and Algo, so it's something we study to remember and every job interview quizes you on this. Algo is not a done and dusted thing, it's something you have to practice to remember.

This is from ChatGPT the curriculum for DSA

Introduction to Algorithms and Problem Solving:

Basic terminology and concepts
Algorithm analysis and complexity
Arrays and Strings:

Array manipulation and traversal
String manipulation and pattern matching
Linked Lists:

Singly linked lists
Doubly linked lists
Circular linked lists
Stacks and Queues:

Implementations and applications
Evaluation of expressions
Priority queues
Recursion and Backtracking:

Recursive problem-solving techniques
Solving problems using backtracking
Sorting and Searching:

Bubble sort, insertion sort, selection sort
Merge sort, quicksort, heapsort
Binary search, linear search
Trees:

Binary trees
Binary search trees (BST)
AVL trees, Red-Black trees
Tree traversals: inorder, preorder, postorder
Graphs:

Graph representation (adjacency matrix, adjacency list)
Breadth-First Search (BFS)
Depth-First Search (DFS)
Shortest path algorithms: Dijkstra's, Bellman-Ford
Minimum Spanning Tree (Prim's, Kruskal's)
Hashing:

Hash functions
Hash tables
Collision resolution strategies
Dynamic Programming:

Concept of overlapping subproblems and optimal substructure
Memoization and tabulation
Examples of dynamic programming problems
Greedy Algorithms:

Greedy choice property
Fractional knapsack problem
Huffman coding
Disjoint Set Union (Union-Find):

Data structure and operations
Applications in graph problems
Advanced Data Structures (optional):

Trie, Suffix tree
Segment tree, Fenwick tree (Binary Indexed Tree)
B-trees, B+ trees
Advanced Algorithms (optional):

Matrix exponentiation
Strongly connected components (Kosaraju's algorithm)
Maximum flow (Ford-Fulkerson, Edmonds-Karp)
NP-Completeness and Approximation Algorithms (optional):

Introduction to complexity classes
P vs. NP problem
Approximation algorithms

That's a lot.



You must've encountered these at least once and thus you will know the solution without much stress when you come across them again, reducing your need to study.

Also are some of the cases of DSA above actually used in your programming life? It could be like some formulas had in mathematics that are never used, though they are studied.

And you keep all these in your head? That is, knowing they exist and how they could be used?

BRATISLAVA:


That's a lot.



You must've encountered these at least once and thus you will know the solution without much stress when you come across them again, reducing your need to study.

Also are some of the cases of DSA above actually used in your programming life? It could be like some formulas had in mathematics that are never used, though they are studied.

And you keep all these in your head? That is, knowing they exist and how they could be used?

You must've encountered these at least once and thus you will know the solution without much stress when you come across them again, reducing your need to study.

Yes actually it comes faster to mind, because I've studied however the likes of DP, and Graph is still complex for me, there is some discrete maths I haven't covered up

Also are some of the cases of DSA above actually used in your programming life? It could be like some formulas had in mathematics that are never used, though they are studied.

Alot of languages have them implemented internally but unless you're backend, so of the DSA you would use on FE would be Array

And you keep all these in your head? That is, knowing they exist and how they could be used?

No I don't, I usually jot the high level information and reference Algo materials when working on such in real life.

Anonime1105:


The bolded happened to one time, after setting up the best theme in the world (for my mind) one last tweak ruined everything, the experience was very annoying

At least you didn't go shopping for a new SSD weeks later.

Qtguru how are you active on Nairaland, Twitter, other tech platforms, handling your jobs, learning new things and updating your diaries.

Seems you're a super super nerd

KrazyDave16:

At least you didn't go shopping for a new SSD weeks later.

Lol I didn't need to
But I had to reinstall the os

qtguru:


You must've encountered these at least once and thus you will know the solution without much stress when you come across them again, reducing your need to study.

Yes actually it comes faster to mind, because I've studied however the likes of DP, and Graph is still complex for me, there is some discrete maths I haven't covered up

Also are some of the cases of DSA above actually used in your programming life? It could be like some formulas had in mathematics that are never used, though they are studied.

Alot of languages have them implemented internally but unless you're backend, so of the DSA you would use on FE would be Array

And you keep all these in your head? That is, knowing they exist and how they could be used?

No I don't, I usually jot the high level information and reference Algo materials when working on such in real life.

And this is how we separate wheat from the chaff. You clearly know what to do. You don't seem to need studying. More like reminders.

You mention discrete mathematics a bit... It's clearly an important part of BE. Would you recommend programming as something anyone can learn? Or mostly people going with the client side, which seems relatively easier?

Paystack:
Qtguru how are you active on Nairaland, Twitter, other tech platforms, handling your jobs, learning new things and updating your diaries.

Seems you're a super super nerd

You forgot Grandmaster on CODM also,

I have multiple tabs and people working for me. Also I am naturally hardworking and create time for these things, I don't read much and new tech come to me easily, because I research before hand and watched video, it comes with experience.

Ok thanks have gotten have through all what is been said I will stick to my linux.
But I will try allocate more ram to the Linux and @qtguru I allocated 3gb ram initially.

BRATISLAVA:


And this is how we separate wheat from the chaff. You clearly know what to do. You don't seem to need studying. More like reminders.

You mention discrete mathematics a bit... It's clearly an important part of BE. Would you recommend programming as something anyone can learn? Or mostly people going with the client side, which seems relatively easier?

Frontend is easier but it's still needed but it will mostly be array operation you'd deal with alot, that and Map.

Here's a Discrete Math she explained it well
https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ

qtguru:


Frontend is easier but it's still needed but it will mostly be array operation you'd deal with alot, that and Map.

Here's a Discrete Math she explained it well
https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ

Thanks.

Will look at it later.

airsaylongcome:


I'm sorry I can't provide mentorship or guidance at this point. I'm neck deep in a a study program that I barely have time. I apologise

I truly appreciate your sincerity and I do understand.
I wish you all the best in your program. Thanks.

I rather have Windows and Linux running on the same machine. I conveniently run both whenever and however I want

Raylight2:
I rather have Windows and Linux running on the same machine. I conveniently run both whenever and however I want

Why not have two systems one running windows and the other, Linux.

chukwuebuka65:
Linux gurus in the house. What advice do you have for me ? How do I get the best out of this OS. I am enjoying the experience so far.

You have made the best choice in your life. In fact, you will never regret it. Since I started using Ubuntu OS, Windows became a joke to me.

qtguru:


Frontend is easier but it's still needed but it will mostly be array operation you'd deal with alot, that and Map.

Here's a Discrete Math she explained it well
https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ

This was quite enjoyable. Very enjoyable. That's discrete maths? Sounded much more horrible than that.

Perhaps if a programmer studies something more like anthropology or philosophy, then they would find discrete mathematics difficult/new.

BRATISLAVA:


This was quite enjoyable. Very enjoyable. That's discrete maths? Sounded much more horrible than that.

Perhaps if a programmer studies something more like anthropology or philosophy, then they would find discrete mathematics difficult/new.

Right she and Kenneth Rosen broke it down, or maybe we've reached that age of understanding so it's easier to break down complex concepts, like Elon mentions First principle theory

qtguru:


Right she and Kenneth Rosen broke it down, or maybe we've reached that age of understanding so it's easier to break down complex concepts, like Elon mentions First principle theory

Yes.

Very enjoyable. Will be looking at it from time to time. These are the exciting parts of maths.