ar
Feedback

لا تقع ضحية للمخادعين! تيليمتريو يكتشف ويُميّز هذه القنوات 👉 إذا كنت تريد رؤية العلامة، اشترك 👈

Algo programmers

Algo programmers

الذهاب إلى القناة على Telegram

join to share your code learning experience

إظهار المزيد
لم يتم تحديد البلدالفئة غير محددة
286
المشتركون
لا توجد بيانات24 ساعات
لا توجد بيانات7 أيام
لا توجد بيانات30 أيام
أرشيف المشاركات
chap 2 additional processes.ppt7.93 KB

Chapter 7 Testing and Quality Assurance.pdf6.91 KB

Hello how are u

እንኳን ለ1444ኛው የረመዳን ወር ፆም በሰላም አደረሳችሁ ለመላው እስልምና እምነት ተከታዮች በሙሉ። We wish you Happy Ramadan For All Muslims around the world. رمضان كريم وكل عام وانت بألف خير بالصحة والعافية تقبل الله منا ومنكم صالح الأعمال public class Ramadan { public static void main (String [] args) { for (int i = 0; i < 15; i++) { System.out.println ("Ramadan Kareem to all Muslim students"); } } }

Repost from N/a

You're the best life saver, you did it for us even it is good for Exit Exam Preparation. Thanks a lot!!!

Hi

Data Structures and Algorithms in C++.pdf5.28 MB

Identify the unchecked Exception from the given choices
Anonymous voting

Repost from EvoNext
content: javascript function basics size: 88 kB only prepared by: AlgoMasters PLC 😂

how are ya?

CoSc 265 FDMS - Chapter One.pptx2.61 MB

Repost from N/a
Node.JS functionalities Share and Share

python_book_for_developers.pdf1.30 MB

Java How to Program 9th Edition.pdf24.81 MB

Repost from EvoNext
Top 8 Algorithms Every Programmer Should Know 💯 1.Sorting algorithms: Sorting is a fundamental operation in computer science and there are several efficient algorithms for it, such as quicksort, merge sort and heap sort. 2.Search algorithms: Searching for an element in a large dataset is a common task and there are several efficient algorithms for it, such as binary search and hash tables. 3.Graph algorithms: Graph algorithms are used to solve problems related to graphs, such as finding the shortest path between two nodes or determining if a graph is connected. 4.Dynamic programming: Dynamic programming is a technique for solving problems by breaking them down into smaller subproblems and storing the solutions to these subproblems to avoid redundant computation. 5.Greedy algorithms: Greedy algorithms are used to solve optimization problems by making the locally optimal choice at each step with the hope of finding a global optimum. 6.Divide and Conquer: Divide and Conquer is an algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm breaks down a problem into sub-problems of the same or related type, until these become simple enough to be solved directly. 7.Backtracking: Backtracking is a general algorithmic technique that considers searching every possible combination in a systematic manner, and abandons a particular path as soon as it determines that it cannot be part of the solution. 8.Randomized Algorithm: Randomized algorithms use randomness to solve a problem. It can be useful to solve problems that cannot be solved deterministically or to improve the average case complexity of a problem.

M:mongodb E:node.express R:react N:node

2, because ++c is pre-decrement that is more faster than c++ which will put the code to be incremented the c variable after the result. 2 is the correct answer

📺ቲቪዎ ምን ሆኖ ነዉ? ግድ የለም ለማንኛዉም አይነት የፍላት ቲቪ ብልሽቶች 👌አስተማማኝ እና አቅምን ያገናዘበዉ ስራችን ብዙዎቹ ደንበኞቻችን ምስክሮች ናቸዉ =ምንም አይነት ጥያቄ ካሎት በስልኮቻችን ያናግሩን?👇 ☎️ +251907037645 +251985227180 inbox with telegram 👉📥@allilah1 የትም መሄድ ሳይጠበቅቦ እኛዉ እራሳችን ያሉበት እንመጣለን only from አ.አ