Software Engineering Daily’s Post

Early work-in-progress developing a generative system for a new series of works to be published later this year https://ift.tt/YEcltrZ Early work-in-progress developing a generative system for a new series of works to be published later this year.

𝗗-𝟰 𝗳𝗿𝗼𝗺 taipy.io 𝟯.𝟭 𝗥𝗲𝗹𝗲𝗮𝘀𝗲 🚀 But this is just for you: 𝗗𝗶𝘀𝗰𝗼𝘃𝗲𝗿 𝗮 𝗻𝗲𝘄 coming 𝗳𝗲𝗮𝘁𝘂𝗿𝗲 : 𝘁𝗵𝗲 𝗧𝗵𝗶𝗿𝗱-𝗣𝗮𝗿𝘁𝘆 𝗖𝗼𝗺𝗽𝗼𝗻𝗲𝗻𝘁 𝗜𝗻𝘁𝗲𝗴𝗿𝗮𝘁𝗶𝗼𝗻🎉 After 3 months of hard work, our engineering team came out with a bunch of practical features. I wanted to share with you, in exclusivity, some of the major ones. 𝗙𝗲𝗮𝘁𝘂𝗿𝗲 𝟭: 𝗧𝗵𝗶𝗿𝗱-𝗣𝗮𝗿𝘁𝘆 𝗖𝗼𝗺𝗽𝗼𝗻𝗲𝗻𝘁 𝗜𝗻𝘁𝗲𝗴𝗿𝗮𝘁𝗶𝗼𝗻 Say goodbye to waiting for library integrations! With this new feature, seamlessly integrate Taipy with any third-party library able to generate HTML for visualization. This integration brings endless possibilities to your projects with your preferred libraries: Folium, Bokeh, Altair, etc. Want to dive deeper into Taipy and support our journey? Star our repo on GitHub: https://lnkd.in/eTi-mgfd I’ll unveil one groundbreaking feature per day leading up to the big release day on March 1st. Stay tuned for tomorrow's feature reveal. 🆃🅷🅴 🅲🅾🆄🅽🆃🅳🅾🆆🅽 🅷🅰🆂 🅾🅵🅵🅸🅲🅸🅰🅻🅻🆈 🆂🆃🅰🆁🆃🅴🅳! Thanks to the team Fabien LELAQUAIS Jean-Robin Medori Fred Lefévère-Laoide Vincent Gosselin Marine Gosselin Albert Antoine Myriam Delarue Alexandre Sajus Florian Jacta Florian VUILLEMOT Grégoire Marabout-Demazure Vinh Nguyen, PhD, CFA Long Nguyen Dinh Nam Nguyen Toan Quach Truong Giang Do

❓ Will this code print the date of today? 🤔 Check out this snippet from a famous tech company! Let's see who's right! 💪 #Embedia #computerscience #embeddedsystems

🚀 Just wrapped up an engaging lecture on Time and Space Complexity! 🎓 My goal was to build a solid foundation for students so they could confidently analyze their code’s efficiency and choose the best algorithms. In these two sessions, we covered: 🔍  Time Complexity Basics: > Runtime VS time complexity >Notations for time complexity >O(1) - Constant Time >O(n) - Linear Time >O(log⁡n)- Logarithmic Time >O(n²) - Quadratic Time >O(2^n)- Exponential Time >O(n!) - Factorial Time 💡 We also explored how to avoid Time Limit Exceeded (TLE) errors by understanding that 1 second = 10^8 operations. 🔍  Space Complexity Basics: >O(1) - Constant Space >O(n) - Linear Space >O(n²)) - Quadratic Space Big thanks to my team Afsheen Ghuman, Abdul Munnam, and Ifrah Tariq for their support, and to Zafar Shahid, PhD, Rizwan Ghaffar, and iCodeGuru for providing the platform! Missed the sessions? Catch up here: 📺 Session 1 --> https://lnkd.in/dFwHWicK 📺 Session 2 --> https://lnkd.in/djzcXsaq Feel free to reach out if you have any questions or need further clarification! 😊 #TimeComplexity #SpaceComplexity #CodeOptimization #SpaceandTime #Runtime

This code helps you to center the element horizontally

🚀 Challenge - Day 9/30 Question: Write a program that finds the largest element present in an array. Example: Array: [5, 10, 3, 8, 15] Largest Element: 15 #30DaysCodeAtTAP

In this video, our Head of Engineering Ken Cochrane and Gerhard Lazu discuss efficient CI/CD processes on #Kubernetes and highlight #argocd 's role in automating and managing deployments to reduce human error. #argoproj #gitops #devops #k8s https://hubs.li/Q02qzGxQ0

☕️ Here's an entry from the Small Batches library: "Complicated Subsystem Team". Team Topologies describes four team types. The third is the complicated subsystem team. These teams help shed cognitive load from stream-aligned teams. A complicated subsystem team is created when the domain is complex enough to warrant specialist knowledge to make any change to the subsystem. These teams require clear boundaries between the subsystem and their consumers. Comment below on this applies to your daily work.

Applying PARA to 2nd Brain Operating System / Stack... [P]rojects - stuff u working on that has a timeline [A]reas of Improvement - personal areas to improve or maintain [R]esources - Reusable tools, actionable insights... [A]rchive - Curate or cull the earlier 3, dumping ground or non-active notes... https://lnkd.in/gBiHzyqY

Let's memorize the challenge with day 9🚀 //To develop a program to determine the largest element present in an array// #30DaysCodeAtTAPAcademy #codeeveryday Let's find largest element in an array!💻