Search result for Principles of defensive programming Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 381 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Giving Helpful Feedback
by Tracy Jennings- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 5 hours to complete
This course teaches you the simple principles expert managers use to improve and motivate employee performance. You’ll never have to avoid telling an employee “the truth” again, because the seven techniques we teach will not make employees defensive or afraid. The Impact of Positive Expectations The Broad Impact of Negative Feedback...
Chess Openings: Learn to Play the Nimzo-Indian Like a Master
by Greg Vanderford- 3.6
-
![]()
![]()
![]()
![]()
![]()
2 hours on-demand video
This chess opening, first made popular by the legendary Grandmaster Aron Nimzowitsch, has been used by players of all levels for decades and is still a favorite of the top chess Grandmasters in the world due to its very effective results. Join the course and add the Nimzo-Indian Defense to your arsenal of chess weapons!...
$11.99
General Pathophysiology
by Churilov Leonid Pavlovich- 4.2
-
![]()
![]()
![]()
![]()
![]()
Approx. 19 hours to complete
Course deals with functional, metabolic and informational aspects of typical pathologic processes, like disorders of signaling, reception, post – receptor translation, programming and program archiving, conflicts of programs in living systems. It contains the consequent analysis of the injury and defensive responses as regards separate cells, organs and tissues and the whole organism....
Java Programming: Build a Recommendation System
by Robert Duvall , Owen Astrachan , Andrew D. Hilton , Susan H. Rodger- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 5 hours to complete
We can get a feel for how it works by building a simplified recommender of our own! In this capstone, you will show off your problem solving and Java programming skills by creating recommender systems. Programming Exercise: Step One Programming Exercise: Step Two Programming Exercise: Step Three Programming Exercise: Step Four...
Java Programming: Arrays, Lists, and Structured Data
by Andrew D. Hilton , Robert Duvall , Owen Astrachan , Susan H. Rodger- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
At the end of the course you will write an encryption program and a program to break your encryption algorithm. Programming Resources A Brief History of Cryptography Programming Exercise: Implementing the Caesar Cipher Programming Exercise: Known Language and Key Length Programming Exercise: Unknown Key Length Programming Exercise: Unknown Language, Unknown Key Length...
Functional Program Design in Scala
by Martin Odersky- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 36 hours to complete
In this course you will learn how to apply the functional programming style in the design of larger applications. Several parts of this course deal with the question how functional programming interacts with mutable state. - recognize and apply design principles of functional programs, This course is intended to be taken after Functional Programming Principles in Scala: https://www....
Functional Program Design in Scala
by Martin Odersky- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 35 hours to complete
In this course you will learn how to apply the functional programming style in the design of larger Scala applications. Several parts of this course deal with the question how functional programming interacts with mutable state. This course is intended to be taken after Functional Programming Principles in Scala: https://www. Recognize and apply design principles of functional programs...
Related searches
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 17 hours to complete
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts). Guiding Principles for Analysis of Algorithms Programming Assignment #1 Interpretation of the 3 Cases Programming Assignment #2...
Shiny Happy Couples: How to Detoxify Your Relationship
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Pinpoints the root cause of relationship issuesExplains the proper role of shared information during conflict resolutionExamines normal defensive reactions and how to control themPresents an innovative, proactive, one-on-one method of conflict resolutionOutlines the benefits of effective conflict resolution in all areas of your life Of course, deteriorating relationships do not plague only married folks....
Cloud Applications
by Umakishore Ramchandran- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 4 hours to complete
This course provides an introduction to the development and support for Cloud-native applications, more specifically it delves into best practices of developing applications; migrating on premise applications to the cloud; the basic building blocks and properties expected from Cloud applications. The course also provide highlights of some novel cloud applications, including geo-distributed computations....
Previous
