- Видео 20
- Просмотров 74 652
Anwar Mamat
США
Добавлен 20 дек 2014
Computer program in Uyghur ئۇيغۇر تىلىدا كومپيوتېر پىروگراممىسى يازغىلى بولامدۇ؟
In this video, I present a simple programming language in Uyghur.
ئۇيغۇر تىلىدا كومپيوتېر پىروگراممىسى يازغىلى بولامدۇ؟
ئۇيغۇر تىلىدا كومپيوتېر پىروگراممىسى يازغىلى بولامدۇ؟
Просмотров: 296
Видео
Functor
Просмотров 1,4 тыс.4 года назад
This video explains OCaml Functors. Code Examples: github.com/anwarmamat/cmsc330/tree/master/ocaml/functor
Leetcode 23 Merge k Sorted Lists
Просмотров 4504 года назад
In this video, I will show the 3 different solutions for the Leetcode problem 23, merge k sorted lists into one list.
Java Recursion: Tower of Hanoi
Просмотров 3,8 тыс.4 года назад
This video explains the Tower of Hanoi problem, and its recursive implementation in Java
Merge Two Sorted Lists
Просмотров 1654 года назад
This video shows how to recursively merge two sorted lists into one list
Insert a Node into a Sorted List
Просмотров 2014 года назад
This video shows how to insert a node into a sorted linked list
Recursively print a linked list
Просмотров 8664 года назад
This video shows how to print a linked recursively in Java
How to Debug and Test an OCaml Project
Просмотров 15 тыс.4 года назад
In this video, I will show the process of implementing, debugging, and testing a small OCaml project
Context Free Grammars
Просмотров 7355 лет назад
This lecture introduces the context free grammars, ambiguity, parse tree
cmsc388c Project 1 UiPath Web Automation
Просмотров 2166 лет назад
Entering data from a spreadsheet to the form fields on the web using UiPath
2-3-4 tree insertion and deletion demo
Просмотров 14 тыс.6 лет назад
2-3-4 tree insertion and deletion demo
Reverse each word in character array
Просмотров 3,3 тыс.6 лет назад
Reverse each word in character array
Ingenious explanation of a foundational topic in Computer Science that every aspiring Uyghur programmers should watch! Please remember to post more videos like this that will benefit Uyghurs all around the world!
Yeah, It’s really amazing ❤
This is truly amazing.
Amazing video, I wish my professors taught like this.
YOU ARE THE BEST !!!!!
Who here got Cliff
who's watching in 2022 :)))))
What if you are not inserting in ascending order but the insertions are randomized
thank you
ur a life saver
Me compartirias el codigo fuente porfaaa. Mi correo es: cesarpinedacesarpineda@hotmail.com
exactly what I need, thanks!
Excellent lecture.
type coin = Head | Tail;; let rec sum x = match x with []-> 0 | Head::t-> 1 + sum t | Tail::t-> -1 + sum t ;; (* now OCaml tells you if you have more Heads or Tails *)
let sum_coins = List.fold_left (fun acc coin -> match coin with Head -> acc + 1 | Tail -> acc - 1) 0
Installing necessary software: [00:46] - How to build and test: [01:14] - List all available tests: [04:40] - Running a specific test: [05:05] - Testing inside of utop: [09:00] - Understanding test cases: [16:00] - Writing your own test cases: [19:20]
computror science B)
very well explained
Your method is splitting from bottom up for 3 nodes, while a lot textbook does top-down splitting 3 nodes from root......
Hello i need a help in a assignment, can you help me please? And how can i contact you
Ask here if you have questions. Can’t help with your assignments.
Very brave of you, teacher! Congratulations
Hi Anwar
All of project 2a is at 20:28 you're welcome
OKAY DUDE
Thank you ❤.. i was looking for that for a week
THIS IS HIP BROOOOO and BTW::: "330 IS THE BEST COURSE IN THE DEPARTMENT";;
dank
It was helpful Thank you ❤
Thank you! If my string has numbers and i dont wanna touch them, what to do? How to avoid them?
treat the numbers as the space.
@@anwarmamat3472 I dont know why but this code is not working on C# and i dont know why... 3:34 where did you initialize this arrays like word[start] and word[end]? 4:11 now you use another naming like word[s] and word[t] And how can you use one iterrator with the same naming in 3 loops? Does it Java magic? Explanation is great but i dont understend some parts...
@@anwarmamat3472 OMG man i'm so lame .... i forgot about WriteLine(words); xD Sorry! But i still cant solve my task... I nedd the same programm but with numbers avoid ( but write them on the same plase , just dont tuch them) how to write this logic and where to put them? Plese help me if you can!!!
Please curve that exam tho
I love you Anwarr!!
great
deletion starts at 0:44
what an idiot
sick video dude
Really good video, thank you!
Great video for leaf node deletion
Extra credit if I like and subscribe? :D
Great video! Thank you.
Nice video, you should do more Ocaml videos, thanks.