Introduction to UI/UX

Forum for Aspiring Computer Engineers

Face introduced the UI/UX design challenges  to The Face Seasons 2018. These new contests are inspired by the TopCoder organisation and aims to bring out the creative side of students.

How it works ?

  • The UDC team comes up with an Idea for an app and provide a Wireframes for the app.

  • Students use these wireframes as references and design their own unique  app.

  • Students send in their app design before the deadline.


An Introductory event for the UI/UX design contest was conducted by Ramshankar, the Face Secretary. The audience got to know more about User Interface and User Experience. They were introduced to platforms such as Photoshop and Adobe Xd. They also got clarity on how the these contest works.


We got an overwhelming response not just from CSE students but also from Students  other branches. This is because of the attractive feature of the UI/UX design…

View original post 55 more words

Windows 8 development classes

Forum for Aspiring Computer Engineers

Windows 8 development classes are held under the guidance of Bhargav Krishna of 7th semester. The chief aim of these sessions is to make the students aware of the new Windows 8 environment and develop on it. A group of students were selected from all the years on the basis the interest and the technical skills they exhibit to be part of this programme. Here, the students will build a platform which will enhance development on the web.  The first quarter of the programme consisted of a training period wherein the students were mentored in all the required basics for the platform of the day.  The participants are divided into 3 groups based on their areas of interest and the technical skills they exhibit, each specializing on a particular category. To make the students comfortable with the new environment, introduction to essential languages and development tools were taken. The team…

View original post 112 more words

Session on competitive coding by Dr.Bhadrachalam

Forum for Aspiring Computer Engineers

The principle intent behind the organization of the event is to introduce competitive coding and place a mind map inside aspirants in order to get the aspirants to move along the path of coding.

Prof. Bhadrachalam, Head of Competitive Programming, ASE-Amritapuri has conducted a session on competitive programming on 1st September 2018 at ASE-Bangalore.

The primary concepts covered in this session are:

  • Number Theory
  • Discrete Mathematics
  • Permutation and Combinations

Fresh aspirants, as well as coders, were introduced with various online coding platforms, so as to help them levitate their skill in coding and reach out a better a community for their future needs. There was also a problem-solving session which gave a hands-on experience on the topics which the students have learnt.

At the end of the session, Prof. Bhadrachalam had a brief discussion with the students and gave some general student guidelines about the various career options on which…

View original post 15 more words

Sabeen’s Physics IGCSE…

The Wonder Years

Sabeen just found out that she got an A* in her Physics IGCSE (UK 16+ exam).

Aged 10, she’s the youngest girl in the 30-year history of the GCSE to have achieved this!

But, and if you’ve been reading this blog you’ll know this, Sabeen is no genius – in fact, she isn’t even particularly naturally talented at physics – she just used a technique that you too can use in your work and life.

Essentially, it’s the same technique Tiger Woods used to become great at golf, Albert Einstein leveraged for his physics, and Jeff Bezos used to become the richest person in the world.

So, Sabeen did the 2-year course in 5 months – studying around 3 hours a day, 7 days week – she put in enough hours per day which rapidly increased her rate of learning. 1.5 hours a day for 10 months wouldn’t have been…

View original post 82 more words

Centroid Decomposition of a Tree

Algorithm Tutorials

Introduction : Centroid Decomposition is just a divide and conquer technique which is used on trees and turns out useful in many problems. It is also known as “Separator Decomposition”. In this article I will first explain How do we do centroid decomposition followed by it’s applications (i.e. Why do we do it ? ) . In the end, I will discuss a few problems that can be easily solved using centroid decomposition.
So, let’s begin 🙂

Pr-requisites : Basic graph theory. DFS . (Basic) Divide and Conquer.

View original post 1,845 more words