Skip to main content

About Me







Hello everyone,

I’m Harilal Sah Kanu, and I’m thrilled to share my journey from the serene landscapes of Nepal to the bustling educational environment of India, where I’m currently pursuing my dream in Computer Science Engineering (CSE) at Parul University.

My journey began in the beautiful and culturally rich country of Nepal. Growing up in this vibrant land, I was always fascinated by technology and the potential it held. My formal introduction to the world of computing came during my time at Shree Durga Model Secondary School. It was here, in the 10th standard, that I encountered my first programming language. The experience of writing my first code, a simple "Hello, World!" program in C, was nothing short of magical. It was as if I had unlocked a door to a new dimension where creativity and logic merged seamlessly. This moment sparked a profound interest in the field of Computer Science, shaping my future aspirations.

After completing my secondary education, I pursued my higher secondary education at Orient College in Kathmandu. There, I continued to delve into the realms of computing, reinforcing my passion for the subject. The curriculum was rigorous, yet it only fueled my enthusiasm for technology further. My studies at Orient College were instrumental in laying a solid foundation in computer science, preparing me for the next significant step in my academic journey.

In 2023, I took a bold step towards realizing my dreams by moving to India to pursue a Bachelor of Technology (B.Tech) in Computer Science Engineering at Parul University. This transition marked a new chapter in my life. It was both exhilarating and challenging to adapt to a new country, but the opportunity to study at such a prestigious institution was worth every effort.

At Parul University, my second year is already in full swing, and the experience has been nothing short of transformative. The curriculum here is comprehensive, covering everything from advanced programming concepts to cutting-edge technologies. The diversity of thought and exposure to a global perspective have enriched my understanding and broadened my horizons. The faculty members are incredibly supportive and knowledgeable, and the vibrant campus life has provided numerous opportunities for personal and professional growth.

One of the most exciting aspects of my current studies is the practical application of theoretical knowledge. From engaging in collaborative projects to participating in hackathons, the hands-on experience is helping me bridge the gap between classroom learning and real-world applications. These experiences are not just enhancing my technical skills but also teaching me the importance of teamwork, problem-solving, and innovation.

Reflecting on my journey, I am immensely grateful for the path that has led me here. Each step, from my initial fascination with coding in Nepal to my current endeavors at Parul University, has contributed to shaping who I am today. I am excited about the future and the endless possibilities that lie ahead in the field of computer science. My journey has just begun, and I am eager to continue exploring, learning, and contributing to this ever-evolving field.

Thank you for joining me on this journey. I look forward to sharing more of my experiences and insights as I continue to grow and learn in the world of computer science.

Warm regards,

Harilal Sah Kanu
Labels:

Comments

  1. GannaMixture5 July 2024 at 04:28

    hello

    ReplyDelete
  2. All Above6 August 2024 at 00:17

    I like the content he posted , it's very useful to understand Algorithm.I hope you will continue posting this types of content in future ☺️

    ReplyDelete

Post a Comment

Popular posts from this blog

A Bridge Between Beginning & End

Welcome Back!  In the heart of our bustling city, where pollution in the surrounding and environment rush through concrete canyons, there exists a bridge a relic of the past, a thread connecting our urban fabric. Maya, a woman, walks this bridge every morning, her footsteps echoing against the worn-out pavement. The bridge spans a murky river, its iron railings rusted and chipped. As Maya steps onto it, she gazes at the surrounding buildings. They loom like silent sentinels, their windows cracked, graffiti defacing their once-pristine facades. These structures, once symbols of progress, now bear the scars of neglect. Maya's eyes sweep across the landscape. She notices the shattered glass of a bus stop, the faded murals on the walls, and the litter strewn about a testament to our collective disregard for public spaces. The bridge itself groans under the weight of years, its concrete pockmarked and crumbling. But Maya is not a passive observer. She carries a small bag a makeshift too...
Post a Comment
Read more

Linked List - Data Structure

Linked List A linked list is a linear data structure that does not store elements in contiguous memory locations, the elements in the linked list are linked using pointers. It is a collection of nodes in which each node stores data and a pointer that links to the next node to form a sequence of nodes. -> Linked List is a linear data structure which is a combination of Nodes. -> Nodes contain two parts i.e. data & address. Representation of a Linked List in C: A linked list is represented as a pointer to the first node where each node contains: Data:  Here the actual information is stored. Next:  Pointer that links to the next node. Advantages of a Linked List: Linked list is dynamic data structure it has memory allocation and de-allocation, which means that memory is only used when needed and not earlier in order to avoid waste. In linked list items are arranged in a linear fashion, new items can be inserted or removed as and when needed without affecting other items...
Post a Comment
Read more

Binary Search: Algorithms

Binary Search: Algorithms What is Binary Search? Binary Search is an interval searching algorithm used to search for an item in the sorted list. It works by repeatedly dividing the list into two equal parts and then searching for the item that is the part where it can possibly exist. Unlike linear search, there are a few conditions for applying binary search: The list must be sorted. Random access to the list member. It means that we cannot apply the binary search in unsorted or liked data structures. Visualization of Binary Search: Algorithm for Binary Search in C Let [X]   be the element we are searching for, and the array is sorted in the ascending order. Compare [X] with the middle element of the array.   If [X]  matches with the middle element, we return the index of the middle element.   Else if [X]  is greater than the middle element, it means that [X]  can only lie in the right half subarray after the middle element. So, we repeat steps 1 and 2 for ...
1 comment
Read more