Articles

Welcome to the blog

👋 Hey there, I'm Nawal. I'm a 20-year-old software engineering college girl with a deep passion for coding and computer science. I love hardware just as much as I love software . Throughout my journey, I have delved into a variety of programming languages including C, C++, HTML, CSS, CSS frameworks, Java, JavaScript, and even a bit of Python . Each language has been a unique adventure, and I'm excited to share my experiences with you. I haven't had the opportunity to get as creative as I want yet, but this blog will serve as my motivation to explore new ideas and showcase my skills.
Image
What’s a network switch ? A switch is a device used in computer networks to connect multiple devices together within a single local area network (LAN). Its main role is to facilitate communication between different connected devices, such as computers, printers, servers, IP phones, etc. It is a mini-computer which is made up of RAM, ROM, flash RAM, NVRAM, a microprocessor, connectivity ports and even an operating system. RAM RAM (Random Access Memory) contains the current configuration of the switch and temporarily stores the MAC address table, which is then processed by the microprocessor. Microprocessor The microprocessor is the heart of the switch, responsible for data processing, including switching and creating links between multiple devices. External memories External memories, such as flash RAM, ROM, and NVRAM (Non-Volatile RAM), store configuration files , different versions of the IOS , etc ... Ports The switch ports are the communication interfaces of the switc...

NP-Completeness

Image
Complexity Recap Assuming one already knows what algorithmic complexity is, I am writing this paragraph to explain it to those who don't. The complexity of an algorithm can be measured by its efficiency. So let's say I have a problem P for which I've proposed two algorithms A and B as solutions. How could I determine which algorithm is the most efficient in terms of time and data support? Well, by using complexity ( space complexity and time complexity ). One way of measuring complexity is O notation.   Exponential Complexity  O(2^n) In algorithms, this complexity arises when the time or space required for computation doubles with each additional element in the input. Problems with exponential complexity are typically NP-hard or NP-complete P-Class and NP-Class The  P-class represents the set of polynomial problems , i.e., problems for which a solution can be found in polynomial time . The  NP-class represents the set of non-deterministic polynomial problems ...