<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Pezanne Khambatta on Medium]]></title>
        <description><![CDATA[Stories by Pezanne Khambatta on Medium]]></description>
        <link>https://medium.com/@pezannekhambatta?source=rss-e652c9a42980------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*Bf_HDcS48MW2axFw.</url>
            <title>Stories by Pezanne Khambatta on Medium</title>
            <link>https://medium.com/@pezannekhambatta?source=rss-e652c9a42980------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Fri, 20 Nov 2026 18:41:19 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@pezannekhambatta/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Harvard CS50: Note of Thanks from a CS Grad Student]]></title>
            <link>https://medium.com/@pezannekhambatta/harvard-cs50-note-of-thanks-from-a-cs-grad-student-1f36acf4613f?source=rss-e652c9a42980------2</link>
            <guid isPermaLink="false">https://medium.com/p/1f36acf4613f</guid>
            <category><![CDATA[cs50]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[computer-science]]></category>
            <category><![CDATA[code]]></category>
            <category><![CDATA[harvard]]></category>
            <dc:creator><![CDATA[Pezanne Khambatta]]></dc:creator>
            <pubDate>Mon, 21 Oct 2019 23:47:04 GMT</pubDate>
            <atom:updated>2019-10-22T16:26:21.859Z</atom:updated>
            <content:encoded><![CDATA[<p><em>TLDR: For anyone looking to switch fields into CS but lacking the proper knowledge, this is absolutely the best resource for you.</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*wkAijwnNJVRtga7ygIgTzA.jpeg" /><figcaption>CS50 prof. David Malan demonstrating the low-level concept of binary numbers</figcaption></figure><p>I pursued Harvard’s online CS50 course a year ago, when I was working as a product designer in Seattle, WA. I had a feeling that I would be good at coding but I really wanted to test myself with a legitimate online course that offered a certificate as well as had assignments. What is about to follow is less of a review of the course and more of my appreciation for its faculty, staff and organizers, while also being a message of motivation for those currently pursuing it. As an aside, David Venturi already does a fantastic job reviewing the course.</p><p><a href="https://medium.com/@davidventuri/review-harvard-cs50-introduction-to-computer-science-75405e684a61">REVIEW: Harvard CS50 Introduction to Computer Science</a></p><p>Little did I know how much impact this course would have to my life today. To put this in perspective, I am now a Master of Science student pursuing Computer Science (Bridge) at University of San Francisco with 7 months of web development experience. To this day, I find myself learning something new in class and then drawing a link between that and something taught in CS50. I feel giddy with joy when I am reminded of my simple beginnings at CS50 and where it has brought me today.</p><p>If you are someone like me that’s pursuing CS50 to try your hand at programming, I would urge you to keep up the pace even if you feel that you are not able to keep up or the assignments have become unreasonably hard. Step back from it, take a few days’ break and approach it again. You will be surprised at how much more you will understand the second time around. If a person from a design background can do it, then you can do it too.</p><h4>Yes, it does have a steep learning curve</h4><p>I am in a Bridge program at University of San Francisco which means that the first year (bridge year) is designed to be an accelerated introduction to CS concepts to essentially “bridge” the gap between non-CS people and people with a 4-year CS degree under their belt. This means that my program is essentially covering 4 years of content (debatably) in the span of a year. Here’s the best part — CS50 was still way more challenging than anything I have had to submit this semester. It’s designed to be hard but if you get past this (and enjoyed the process), you should feel unstoppable to pave your way into the CS field.</p><h4>Use your resources</h4><p>You may be taking the course all by yourself in your room but you are not alone. You have a thriving community of programmers, both currently pursuing the course as well as those that have completed the course on the <strong>r/CS50</strong> and these people are there to help you. They are patient with answering even the most basic questions and are even surprisingly wholesome towards people that seem dejected and defeated at a certain point in the course. Just remember that people just like me are on the subreddit, ready to answer any burning questions you may have. Use this resource to your advantage, just like I did on multiple occasions.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*IsDujpu5znD1_xfxtFPhVQ.jpeg" /><figcaption>Giant Inflatable Rubber Duck at CS50</figcaption></figure><h4>Web Development with Flask</h4><p>The course does a surprisingly good job explaining the concepts of server-client comminication and the transfer of data over HTTP. It also delves into maintaining databases, thus giving a good basic foundation about web development. This is essentially the gateway drug into understanding the sophistication of an MVC model of web application development. The class on web development does zip by pretty fast covering concepts such as requests, sessions, HTML, AJAX, JavaScript and Flask framework — it is one of the hardest classes to grasp. However, once given a chance to work with Flask and SQL, it will open many doors in the realm of web development which is a huge part of computer science. A good final project in Flask would give you the basic skills necessary to dive deeper into web development.</p><p>Spending 100+ hours making a final project in Flask gave me a deeper understanding of SQL, JQuery, AJAX and Python. The project is a ToDo List and Goals app, viewable below. I highly recommend investing that extra 10% of time in figuring out how deploy your project (if it is a web app) so that anyone can view and use it.</p><p><a href="https://doneanddone.herokuapp.com/">Done&amp;Done: Log In</a></p><p>I’d like to believe that learning ASP.Net framework following this was what helped me secure my extended internship as a Dot Net Developer at <a href="https://www.polymerupdate.com/">Polymerupdate</a> in Mumbai.</p><h4>Data Structures and Algorithms</h4><p>Remarkably enough, the class also manages to cover the essentials of software development — data structures and algorithms. In Pset 5 — Speller, we are made to implement a data structure of our choice to perform a spell-check on a considerably large text file. The dictionary of 100,000+ words would live in our chosen data structure. Submissions for the project have the option to compete for best time and space complexity.</p><p>Cleverly enough, we are made to create our own data structures from scratch, which is great for understanding how these work under the hood for more sophisticated languages like Java and python. Not many CS college students can say that they have implemented a Hash Table using a hashing algorithm but Pset 6 encourages you to try that as well!</p><p>This assignment took considerably long because I wanted to implement every single data structure taught — Linked List, Hash Table and Trie because I wanted to have a competitive score on the leader board.</p><p>Time and space complexity is a theoretical concept CS students will encounter throughout their career. Even today, when practicing problems on LeetCode, I try to be conscious of the time complexity of my algorithm by viewing where my submission falls on the chart of submissions. The parallel between the CS50 Big Board and LeetCode runtime distribution chart is quite strong.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/666/1*P4nj9fJjSeJ9-c0rwSZqlg.png" /><figcaption>Comic Strip illustrating SQL Injection Attack</figcaption></figure><h4>Details, Details, Details</h4><p>You leave CS50 with a feeling that you got your time’s worth and that there have been painstaking hours put into perfecting the pace of each minute of the lecture. Prof. Malan brings out the whimsical nature of CS professionals by sharing about things like the “Rubber Duck” and “Little Bobby Tables”. One would expect that a fast-paced course may overlook seemingly trivial details like this but their inclusion keeps the course engaging and builds a sense of community among students. I can still recollect one of the problem sets that outputs a secret YouTube link which when opened takes you <a href="https://www.youtube.com/watch?v=dQw4w9WgXcQ">here</a>… Yes, that is a classic troll and never gets old. It’s the small details that you will remember years after you finish the course.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/760/1*DzJ88aby2r0iHkoArJ1_Tw.jpeg" /><figcaption>Prof. Malan demonstrating binary search</figcaption></figure><h4>In conclusion, thank you</h4><p>CS50 will always hold a special place in my life and I will always look back at it fondly. I am thankful for all the organizers at Harvard that make it possible to have such a well-paced and well thought out class accessible for free to anyone that has internet. Prof. David Malan is amazing at reminding us of the fact that programming is indeed cool. He uses a theatrical approach to demonstrating concepts, to show that programming is way more approachable than it appears. Nowhere else will you find someone ripping up a book of Yellow Pages into halves to demonstrate the concept of binary search! It is more hilarious when you think about the fact that he does this every year.</p><p>His enthusiasm and charisma make it compelling to finish up the current assignment just to partake in the new lecture. Similar credit is due to the student TA’s, Doug Lloyd, Zamyla Chan and Brian Yu for their excellent work in presenting concepts in the “shorts” as well as going over problems. I hope my story attests to the fact that this online course really can be used to officially change your career path into CS.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=1f36acf4613f" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[“-less” is more]]></title>
            <link>https://medium.com/@pezannekhambatta/less-is-more-73dfffc8548f?source=rss-e652c9a42980------2</link>
            <guid isPermaLink="false">https://medium.com/p/73dfffc8548f</guid>
            <category><![CDATA[design]]></category>
            <category><![CDATA[branding]]></category>
            <category><![CDATA[random]]></category>
            <category><![CDATA[photography]]></category>
            <dc:creator><![CDATA[Pezanne Khambatta]]></dc:creator>
            <pubDate>Sun, 29 Sep 2019 08:07:36 GMT</pubDate>
            <atom:updated>2019-09-29T08:07:36.497Z</atom:updated>
            <content:encoded><![CDATA[<p>In a world where products with more features are generally considered better, we are now seeing a trend of reductionism, where removing a seemingly integral part of the product is the new novel.</p><p>No, I’m not talking about removing the headphone jack from the latest iPhone, but rather design innovations that obviate something we have been so used to associating with the product itself.</p><h4>1. Mirrorless Camera</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*0fyJEtA5Zo7_qwzn5kbp1A.jpeg" /><figcaption>Sony Alpha A7 Mark II DSLR</figcaption></figure><p>In 2004, Epson introduced the first mirrorless camera (R-D1) to the market. Following this, Sony cameras adopted the same technology and have been extremely popular till date. Traditional DSLRs have an angled mirror in the body to reflect the view into the viewfinder. On hitting the shutter button, this mirror rapidly flips up to allow for the light to hit the sensor behind it. Doing away with the mirror has helped drastically reduce size as well as keeping the camera quiet and increase longevity by having less moving parts. It also sounds cool to say that your camera is “mirrorless”.</p><h4>2. Chainless Bike</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*dgldPVGjXSAtTxXkzvTCNA.jpeg" /><figcaption>CeramicSpeed Driven bicycle</figcaption></figure><p>Now take a look at this bicycle by CeramicSpeed. It completely does away with the chain drive we are used to seeing on every bicycle. It is engineered to have 21 ceramic bearings to transfer power generated from the pedals through mounted pinions on each end of the carbon fiber pipe. Not only does this look so clean and cool, but it also removed the hassle of getting the greasy chains in contact with your calf. Moreover, the reduced number of moving parts in the drivetrain provides for reduced friction and much more efficient transfer of power.</p><h4>3. Bladeless Fan</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*hRNWJ3uFRMTw_VkuvP32BA.jpeg" /><figcaption>Dyson cool fans</figcaption></figure><p>What’s the most important component you think of in a fan? Probably the blades. It seems like a lot of products are getting their wow factor from taking the product’s perception and flipping it upside down by stripping it off it’s most essential component. These fans cost up to $280 for the same functionality that you can get out of a $40 fan. However try turning on a Dyson fan and sticking your hand through it. Yeah, that magic feeling is what you’re paying the extra $240 for. Of course, “bladeless” is a misnomer because the blades are hidden in the base but that is unimportant.</p><h4>4. Meatless Burger</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Je5-BC1u9T2s1bcqmSyOUQ.jpeg" /><figcaption>Impossible Burger</figcaption></figure><p>Saving the most topical for last, let’s consider the meatless burger trend which is rapidly being adopted by the US. Beyond Meat’s stock value is up to $150 from its initial IPO at $25 which is remarkable. Impossible Burger is also performing fantastically with large US chains providing their patties. I don’t think there is any better title than “meatless” for selling plant-based burgers. The title is honest, straightforward and at the same time does not immediately invoke a mental image or taste of “plants” as opposed to a name like “plant-based” or “vegan” burger.</p><p>As a design enthusiast, I would like to incorporate this notion of reduction of an essential member into my product design concepts. It could be a great exercise to create a product that is truly innovative or alternatively prove to be a valuable lesson that not all objects can be deisnged without their most essential component.</p><p>Around the time when Jony Ive announced his upcoming resignation from Apple, a news report revealed that one of many secretive projects he worked on was Apple Car. His concept of the autonomous vehicle lacked a steering wheel. I can only aspire to even conceptualize such brave and controversial design concepts.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=73dfffc8548f" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Recursion]]></title>
            <link>https://medium.com/@pezannekhambatta/recursion-6e1b66e30b6c?source=rss-e652c9a42980------2</link>
            <guid isPermaLink="false">https://medium.com/p/6e1b66e30b6c</guid>
            <category><![CDATA[ray-tracing]]></category>
            <category><![CDATA[integral]]></category>
            <category><![CDATA[recursion]]></category>
            <category><![CDATA[java]]></category>
            <dc:creator><![CDATA[Pezanne Khambatta]]></dc:creator>
            <pubDate>Tue, 02 Apr 2019 19:16:52 GMT</pubDate>
            <atom:updated>2019-04-16T21:00:18.135Z</atom:updated>
            <content:encoded><![CDATA[<h3><strong>Overview</strong></h3><p>Even if you’ve not typed a line of code in your life, you must have come across instances of recursion in your day-to-day life.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/225/1*UzUczGBkBx0e-B06dopdrA.jpeg" /><figcaption>Laughing Cow with hoop earrings of the box it’s printed on</figcaption></figure><p>A very basic example would be a box of Laughing Cow cheese that almost all of us have looked at as kids and maybe some inquisitive ones might have wondered how the cow managed to get the print of her image on her ear rings. Even the ear rings should have an image of the ear rings inside them and this would go on forever (in theory).</p><blockquote><strong>Recursion</strong> (adjective: <em>recursive</em>) occurs when a thing is defined in terms of itself or of its type.</blockquote><blockquote>— Wiki</blockquote><h3>Memes</h3><p>If a picture speaks a thousand words, a meme can speak that times another thousand. The memes below should give a rough sense of the concept of something-inside-itself that recursion is essentially about (hey, this is not an academic paper so I can use memes all I want).</p><blockquote>To understand recursion, one must first understand recursion.</blockquote><blockquote>— Some rando on Reddit</blockquote><figure><img alt="" src="https://cdn-images-1.medium.com/max/500/1*NHzfc_mKGYtbDI9yjzSbrA.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/499/1*HtE87H5aYK_c0vsS2b9iIg.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/884/1*atfa1iKRmkmu3IV_F6cI9A.jpeg" /><figcaption>There is a plethora of these on the web…</figcaption></figure><p>These memes are great to mentally click with the general concept of recursion and can generate a chuckle now and then. This is exactly the initial idea I had of this concept. I thought of recursion like Russian Dolls or ‘Inception’ (in the colloquial sense of something-within-a-something). In code terms, a recursive method is one that calls on itself, which would call on itself again, repeatedly until a base case is satisfied.</p><p>Okay, now that these memes are out of the way, we can go and delve deep into the real power of recursion. My understanding of this concept was limited until I completed MIT’s 6.0001 online CS course, which gave me a fresh new take on the concept.</p><blockquote>When I’m gonna break a problem down into a smaller version of the same problem, I can assume the smaller version gives the answer.</blockquote><blockquote>— Prof. Eric Grimson, MIT</blockquote><p>The above statement opened a whole new perspective for me as I began seeing large problems of indeterminate size as simply super-sets of smaller problems, which were super-sets of <em>their </em>smaller problems.</p><h3><strong>Base Case</strong></h3><p>Typically, a base case returns a <strong>fixed, </strong>generally hard-coded value to mark the end of the recursive cycle and help provide return values for all the preceding function calls until the first function call gets a return value. For the Factorial series or the Fibonacci series, you would return <strong>1</strong>, and for the Palindrome test, you would return <strong>true. </strong>However, for more complex programs with irrational numbers as results, we may want to use more discretion with our base cases. Our base cases can now be used to determine to what level of precision we want our result — it can be used to define our <strong>epsilon</strong>.</p><p>For instance, the recurring value of pi can be calculated (approximated) using recursion by calculating the area of a polygon with 2^n sides (n being a significantly large number) and a diagonal length of 2.</p><p>Similarly, the area under a curve on a graph between 2 points can also be calculated using recursion. Since the curve is continuous and non-discrete, we need to split the graph into tinier and tinier parts. This sounds a lot like prof. Grimson’s statement of breaking a problem down to smaller problems. This sounds like a job for recursion!</p><h3>Pi</h3><p>Pi- The constant ratio between the circumference of a circle to its diameter. No, it is not exactly 22/7. The hundreds and hundreds of digits of pi were not calculated by creating a giant super-precise circular disk and measuring the diameter and circumference using high precision measuring tools. It’s pure math and is independent of the physical world.</p><blockquote>pi = 3.14159 26535 89793 23846 26433 83279 50288 41971 69399 37510 58209 74944 59230 78164 06286 20899 86280 34825 34211 7067…</blockquote><figure><img alt="" src="https://cdn-images-1.medium.com/max/640/1*4ebhd_hMj-ovKAlIMUMNXg.gif" /><figcaption>Visual representation of Recursive Pi Calculator</figcaption></figure><p>There are more ways than one to approximate the value of pi, but I chose an understandable approach which is to start with a right-isosceles triangle and split it into 2 smaller and equal isosceles triangles right down the middle. Each of these triangles is then further split up into their own respective smaller triangles and now you get the idea that this can go on infinitely — until the non-included (or vertex) angle is smaller than or equal to my assigned tolerance — <strong><em>epsilon</em>. </strong>The result is the area of a quadrant of a circle of radius 1 (albeit slightly jagged), which is 1/4 of pi. Multiply that by 4 and voila, we’ve made pi!</p><p><em>Side note: I plan on going deeper into the topic of Pi in another article.</em></p><iframe src="" width="0" height="0" frameborder="0" scrolling="no"><a href="https://medium.com/media/930e5e1d5f799878bf5a9c64f4feefdc/href">https://medium.com/media/930e5e1d5f799878bf5a9c64f4feefdc/href</a></iframe><p>Output:</p><pre>pi = 3.141592653589793</pre><h3>Area Under a Curve</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/714/1*zAPlTXCiB4kmLDiK9tJ3nw.gif" /><figcaption><strong>Area under curve calculated using recursion</strong> — Video: <a href="https://www.youtube.com/watch?v=WUvTyaaNkzM&amp;list=PLZHQObOWTQDMsr9K-rj53DwVRMYO3t5Yr">https://www.youtube.com/watch?v=WUvTyaaNkzM&amp;list=PLZHQObOWTQDMsr9K-rj53DwVRMYO3t5Yr</a></figcaption></figure><p>The area under a curve between 2 points is also called the <strong>integral</strong>. To put this into more practical applications, imagine trying to calculate the distance traveled by a car simply by reading its speedometer over a certain time. The area under the speed-time graph curve would give us this distance.</p><p>When a curve is split down the middle into 2 parts, the result is still 2 curves. I can split each of these into further 2 smaller curves and the pattern can go on until the curve is so small, that the area under it can be approximated using a vertical rectangle up to the horizontal center of the curve. The <strong>epsilon</strong> or the <strong>dx</strong>, our small value for the horizontal increment can be defined into our program. The recursion carries on bisecting the curve until our base case is met and the resulting area is a sound and accurate representation of the area under the curve.</p><iframe src="" width="0" height="0" frameborder="0" scrolling="no"><a href="https://medium.com/media/83099d09a66f4124a28824efd534e24e/href">https://medium.com/media/83099d09a66f4124a28824efd534e24e/href</a></iframe><p>Output:</p><pre>Integral = 75.12946445738696</pre><h3><strong>“So Why Should I Care?”</strong></h3><p>Just about every recursion problem online has an accompanying non-recursive solution too. The recurrence can be replicated with a while loop and the base case can be replicated with a condition for that while loop. Some would argue that it is taxing on memory to call a new stack and set up variables every time the function is called, so it’s preferable to have just a single function call. So then what’s the appeal of recursion?</p><p>I think the answer lies in appreciating the elegance of the code. There is understated value in the cleanliness of terse code that visually communicates the breaking down of a big problem into similar smaller problems into even smaller problems that are finally manageable.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/800/1*xdt58W4aj9Td9YmErtafBg.png" /><figcaption>Wiki — Rendering of a Sphere using Recursive Ray Tracing</figcaption></figure><p>Interestingly enough, the rendering software I have used over my years studying design also works on the principle of recursion. The technical term for this is <strong>Ray Tracing </strong>and<strong> </strong>the effect can be visually observed in real time as larger squares render first in sequence, followed by smaller and smaller squares. In simple terms, the image starts off low-res and progressively gains more resolution. Rendering software like Keyshot and Brazil can be set to maximize on all cores of CPU usage to generate high resolution renders and these renders can be saved depending on when the user is satisfied with the resolution, which is when the rendering process is stopped and the image is saved.</p><p>This efficiency and flexibility would be impossible using <strong>iteration</strong>, because the image would load perhaps top to bottom, rendering tiny pixel by tiny pixel. This time, saving the image in the middle of the render would result in a half empty image — a jarring compromise compared to a full image at slightly lower resolution.</p><p>Games that render graphics in real time don’t even have the luxury of time that patient designers are willing offer to their rendering software (way too often). Recursive Ray Tracing is what can prioritize the “big picture” and adaptively render graphics in more detail if the processor permits.</p><p>Recursion as a tool for problem solving will always be a topic of deep fascination for me.</p><blockquote>If you liked this article on recursion, I bet you’ll love <a href="https://medium.com/p/6e1b66e30b6c">this</a> one! ;)</blockquote><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6e1b66e30b6c" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Hello!]]></title>
            <link>https://medium.com/@pezannekhambatta/hello-43054343465a?source=rss-e652c9a42980------2</link>
            <guid isPermaLink="false">https://medium.com/p/43054343465a</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[math]]></category>
            <category><![CDATA[design]]></category>
            <category><![CDATA[computer-science]]></category>
            <category><![CDATA[recursion]]></category>
            <dc:creator><![CDATA[Pezanne Khambatta]]></dc:creator>
            <pubDate>Mon, 01 Apr 2019 18:06:55 GMT</pubDate>
            <atom:updated>2019-04-02T08:11:43.900Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/724/1*7GA9Nr9toasqvFQy7U5Siw.png" /><figcaption>Img: <a href="https://www.itsnicethat.com/articles/three-creatives-tell-us-why-coding-is-crucial-to-contemporary-design-superhi-digital-150118">https://www.itsnicethat.com/articles/three-creatives-tell-us-why-coding-is-crucial-to-contemporary-design-superhi-digital-150118</a></figcaption></figure><p>I am Pezanne Khambatta and I am an Industrial Designer with a keen inclination towards code and software development. After finishing 4 years studying Industrial Design at RISD and a year working in Seattle, my next big move is to pursue Computer Science at University of San Francisco (Fall ‘19!). Yes, it is a big move for someone with zero formal background in CS but I see design and visual understanding playing a huge role in understanding and appreciating the former.</p><p>I will keep this intro short but essentially, I want to create posts about parts of computer science that really fascinate me and deep dive into those interesting topics in a way that can be readable by programmers and non-programmers alike. Some things that I think about a lot are the concept of <strong>recursion</strong>, the idea of ‘<strong>nothing</strong>’ or ‘<strong>null</strong>’, <strong>pi</strong>, algorithms in design (<strong>generative design</strong>), the code or patterns in <strong>nature</strong>, among few others.</p><p>I’d like my page to serve as a starting point for anyone considering Computer Science as a potential field or planning on making a shift into Computer Science — or maybe even someone who is fascinated by the amazing things that can be achieved with the power of computaton and math. I enjoy following a lot of YouTube channels like Vsauce, Veritasium, SmarterEveryDay, Computerphile and 3Blue1Brown, so I aim to keep my posts just as well-paced and interesting. I intend on using simple animated GIFs as well as snippets of actual code in Java to keep the posts both understandable as well as educational.</p><p>If there’s any topic you think I should cover in my Medium blog, definitely let me know. Happy reading!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=43054343465a" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>