Total Pageviews

Thursday 28 September 2023

TCS CODEVITA | Season 11 | B.Tech 2024, 2025, 2026, and 2027 |

 



Registrations for TCS CodeVita Season 11 have started. Register today.

Get ready to unlock the world of programming excitement with CodeVita! It's more than just a contest; it's a vibrant culture that brings people from diverse backgrounds and cultures together, shattering physical and cultural boundaries. At TCS, we believe that programming is a thrilling adventure, and that's why we created CodeVita!

Fast forward to Season 10, and we witnessed a jaw-dropping 3,05,000+ registrations from 87 countries, representing over 3500 institutes. Imagine participants from 10 regions engaging in a thrilling battle during the grand finale! Are you intrigued? Brace yourself for more exhilarating programming challenges and unforgettable experiences with CodeVita!

 

Eligibility:

·       With year of completion 2024, 2025, 2026, and 2027.

·       From institutes across the globe.

·       Pursuing undergraduate/diploma/postgraduate disciplines from engineering/science background with any specialization.

What's in it for students?

1.     Top 3 coders to win total prize money of USD 20,000/-

2.     Chance to explore exciting careers* with one of the world's most powerful brands

3.     Chance to compete with some of the best coders in the world

4.     Platform to showcase your programming skills

5.     Finalists stand a chance to travel** to India for the season 11 live grand finale experience.

Registration

The first step in your CodeVita journey. Click on the register button to get started. more details from official TCS portal. Click Here for  Register.

MockVitas

MockVitas are just like actual rounds to give you a demo of the actual contest.

Rounds

Clear the Actual Rounds to move further in your CodeVita journey.

Finale

Win prize money and prove that you are the best coder.


Sample Programs

Program -1: 

The parcel section of the Head Post Office is in a mess.  The parcels that need to be loaded to the vans have been lined up in a row in an arbitrary order of weights.  The Head Post Master wants them to be sorted in the increasing order of the weights of the parcels, with one exception.  He wants the heaviest (and presumably the most valuable) parcel kept nearest his office.

More: Problem Description

It is the sports event of the year for the residents of Sportsville.  Their team had finally made it to the finals of the Bowls League Cup.

They have booked tickets for the city contingent for the same row, and the size of the contingent (N) is smaller than the number of seats booked(S).Unfortunately, there was rain the previous night and some of the seats are still wet. Some of the contingent love Bowls so much and are excited enough not to mind sitting on a wet chair. There are k of these. However, others want to sit on a dry seat so that they can enjoy the match more.

The contingent wants to minimize the distance between the first and last person in the row so that they can still conduct Mexican Waves, and other forms of support for their team.

Because they want to sit together, any block of 15 or more contiguous unoccupied seats between the first person sitting and the last person sitting is unacceptable.

There are M blocks of seats, starting with a dry block, with alternating wet and dry blocks.  The number of seats in each block is known.

Given S (the number of seats in the row), N (the size of the contingent),k (the number of the contingent who are willing to sit in a wet seat), and the distribution of wet and dry blocks, write a program to find the minimum distance between the first and the last member of the contingent in the row.


Input

The first line contains four comma separated numbers representing S, N, k and M respectively.

The second line is a set of M comma separated numbers representing the number of seats in each block of seats.  The first block is dry, and the remaining blocks alternate between wet and dry.

Output

One integer representing the minimum distance between the first and last member of the row.  If it is impossible to seat all the members according to their preferences,and with the unoccupied seat restriction,  the result should be 0.

Constraints

S,N,k < 1000,  M < 30

Difficulty Level

Complex

Time Limit (secs)

1

Examples

 

Example 1

Input 

100,50,5,6

3,10,30,5,30,22

Output

49

Explanation

S = 100, and there are 100 seats in the row.  N=50, and there are 50 members in the contingent. k=5, and 5 people (out of the 50) do not mind sitting on wet seats.  M=6, and there are 6 blocks of seats.  The number of seats in each block is 3,10,30,5,30 and 22, with the first block of 3 seats being dry, the next 10 being wet and so on. 

One possible positioning to achieve the minimum distance is to place the a set of 30 people in seats 14 to 43 (the dry block), the 5 people who do not mind sitting on wet seats in the wet block 44 to 48, and the remaining 15 people (of the 50) in the seats 49 to 63.  There is no unoccupied seat between the first person and the last person, and so this is acceptable. The distance between the last allocated seat (63) and the first allocated seat (14), is 49.  This is the output.

More Visit TCS Code vita portal.https://codevita.tcsapps.com/


____________________________________________________________________________


Home                                                                                                                        Previous





Internships: 






Material
Deep Learning





Deep learning  CNN    


FIGMATIC |Software Engineer| Karnataka | BE/BTech |2023,2024 |

 


Qualifications

  • Specialized expertise in one or more areas, balanced with general knowledge. For example, proficiency in frontend technologies and a high-level understanding of how services handle HTTP requests.
  • Familiarity with code review practices and updating production systems safely.
  • Comfort navigating and managing work in substantial code bases.

Requirements

  • A Bachelor’s or Master’s degree in computer science or a related field, or equivalent practical experience.
  • Some experience with programming, gained from side projects, coursework, or internships. Fundamental knowledge and adaptability to new programming languages are key.
  • Experience from internships or collaborative multi-person coding projects (academic or professional setting).
  • Ability to learn unfamiliar systems independently, research, and work with mentors and experts.

Responsibilities

  • Collaborate on cross-functional projects with fellow engineers.
  • Provide valuable feedback on code reviews and technical designs.
  • Maintain and scale the systems your team operates to meet user demands.
  • Develop the skills to manage projects from inception to completion, acquiring project management and technical leadership skills.
Registration Link : Click Here

Benefits

  • Competitive salary ranging from 5-10 LPA.
  • Opportunities for professional growth and development.
  • Inclusive and motivating company culture.
  • Engaging work on cutting-edge projects within a collaborative environment.

____________________________________________________________________________


Home                                                                                                                        Previous





Internships: 







Material
Deep Learning





Deep learning  CNN    


SMARTDOCS | SCT|MBA|BBA| 2022,2023,2024

 



Position: Service Consultant Trainee


Desirable Skills & Expertise: 

  • We prefer candidates with 1-2 years of work experience but welcome fresh graduates as well. 
  • Eligibility: MBA, BBA graduates, or fresh graduates without prior experience. 
  • Enthusiastic about the opportunity to develop highly scalable and world-class products. 
  • Demonstrates intellectual humility, combining intelligence, drive, creativity, and a willingness to learn from mistakes while lifting others up. 
  • Possesses a keen business sense and can align it with organizational goals. 
  • Demonstrates excellent communication and analytical skills, maintaining professionalism at all levels. 
  • Strong leadership, organizational, planning, and project management skills are a must. 
  • Ability to work independently and be self-directed. 
  • Quick learner who can make significant individual contributions and manage multiple projects concurrently within a team environment. 
  • Proactive, takes initiative, and drives tasks and issues to resolution. 

Job Description: 

Are you a dynamic and passionate individual ready to embark on an exciting career journey with the Global Innovator team? Do you possess the drive to excel and want to leverage your skills in the world of technology? At SmartDocs, we offer an unparalleled opportunity to launch your career in the tech industry. If you're looking for a company that values your ideas, appreciates your unique talents and contributions, and fosters a dynamic, flexible, and enjoyable work environment, then SmartDocs is the perfect place for you. We are deeply committed to our employees, clients, customers, our vibrant work culture, and, above all, our cutting-edge technology. 

As a member of the Service Consultant team, you will play a pivotal role in empowering SmartDocs to deliver world-class technology solutions to our customers. We give preference to candidates with 1-2 years of work experience, but we also welcome fresh graduates who are enthusiastic about starting their careers in a fast-paced environment.



Registration Link : Click Here


Key Responsibilities: 

  • Serve as a functional advisor to clients within the Solution Consultant team, translating business requirements into solution configurations and overseeing the overall solution delivery. 
  • Create functional solution specifications and configure solutions based on business requirements using SmartDocs software products. 
  • Ensure a smooth transition for clients from implementation to support phases. 
  • Manage post-demo engagement until customers are satisfied with the product. 
  • May be required to develop sales presentations, customer-facing collateral, cheat sheets, etc. 
  • Proactively prepare and lead partners in solution adoption and innovation features. 
  • Collaborate with internal teams, including product management, engineering, marketing, and delivery, to design solutions for customers. 
  • Oversee multiple concurrent implementations, ensuring timelines are met and issues are promptly addressed while adhering to organizational standard operating procedures. 
  • Highlight issues to designated team contacts and cross-functional teams to ensure timely resolution of client concerns. 
  • Develop and maintain in-depth product knowledge. 
  • Guide clients through various project stages and transition to the support organization. 
  • Communicate project status to Services Managers and clients. 
  • Review existing business processes and participate in the Process Improvement Program.




  • ______________________________________________________________________________

Home                                                                                                                        Previous





Internships: 



Placements:
1. Martdocks CSA 28.9.2023
2. Merkle Sokrati - Associate Business Analyst (2020 - 2024)




Material
Deep Learning





Deep learning  CNN    


Monday 25 September 2023

3. Deep Learning Basics Linear Algebra (Types of Matrix)

 3. Types of Matrices:

1. Identity

2. Inverse Matrices

3. Diagonal

4. Symmetric

5. Orthagonal

  

Identity Matrix

An identity matrix is a square matrix of dimensions (n, n) having '1' across its main diagonal and '0' everywhere else. It is usually represented as 'In'

Example: The matrix shown below illustrates a (3, 3) Identity matrix

Python program 

import numpy as np

#Creating an Identity matrix of size 2 using np.identity() function

identity_matrix_1 = np.identity(2)

print("Identity_matrix 1\n",identity_matrix_1) 

Linear algebra offers a powerful tool called matrix inversion

To describe matrix inversion, we first need to define the concept of an identity matrix. An identity matrix is a matrix that does not change any vector when we multiply that vector by that matrix. We denote the identity matrix that preserves n-dimensional vectors as In.

The structure of the identity matrix is simple: all of the entries along the main diagonal are 1, while all of the other entries are zero.

The matrix inverse of A is denoted as A−1 , and it is defined as the matrix such that A−1A = In.

Ax=b=A-1x

Some special kinds of matrices and vectors are particularly useful.

Diagonal Matrix

A Square Matrix (D) is called a Diagonal Matrix, if D has zeros outside the main diagonal or principal diagonal. The Main diagonal or the principal diagonal are the elements on the diagonal that runs from the top left to bottom right. 



Example: The matrix 'A' shown below illustrates a (3, 3) Diagonal matrix

We have already seen one example of a diagonal matrix: the identity matrix, where all of the diagonal entries are 1. We write diag(v) to denote a square diagonal matrix whose diagonal entries are given by the entries of the vector v. Diagonal matrices are of interest in part because multiplying by a diagonal matrix is very computationally efficient. To compute diag(v)x, we only need to scale each element xi by vi. In other words, diag(v)x = v . x. Inverting a square diagonal matrix is also efficient. The inverse exists only if every diagonal entry is nonzero, and in that case, diag(v)−1 = diag([1/v1, . . . , 1/vn ]T)

Example Program in Python:

import numpy as np

# Creating a diagonal matrix with diagonal elements as (1,2,3)

diagonal_matrix = np.diag((1,2,3))

print(diagonal_matrix)

# Creating a diagonal matrix with a range of values

matrix_range= np.diag(np.arange(1,6,2))

print(matrix_range)

Symmetric

A symmetric matrix is any matrix that is equal to its own transpose: A = AT

  

Python Program 

import numpy as np

#Creating matrix A

A = np.array([[2,3,1],  [3,4,-1], [1,-1,1]])

print("A:\t" , A)

# Finding the Transpose of the matrix

transposed_matrix = A.transpose()

print("Transpose of A:\n" , transposed_matrix)

comparison = (A == transposed_matrix)

#Checking if all the elements in the matrix comparision is true

equal_arrays = comparison.all()

print(equal_arrays)

Triangular Matrix

triangular matrix can be either a lower triangular or an upper triangular matrix.

lower triangular matrix is a square matrix in which all the elements above the main diagonal are zero.

Example: L is a lower triangular matrix of dimension (3, 3)


More on Vectors :

import numpy as np

vector_1 = np.array([1,2,3])

vector_2 = np.array([1,0,3])

print("Vector 1:\n",vector_1)

print("Vector 2:\n",vector_2)

# Finding product of vector of same dimensions using inner() function 

inner_product_1 = np.inner(vector_1,vector_2)

print("Inner Product of Vector 1, Vector 2:\n",inner_product_1)

Orthogonal vectors

 If the inner product of two non-zero vectors v1 and v2 is zero, that is


then, the vectors v1 and v2 are called orthogonal vectors.

Example: Let v1 and v2 be two vectors as follows:


import numpy as np

#Creating vectors

Vector_1 = np.array([[3],[-1],[2]])

Vector_2 = np.array([[2],[4],[-1]])

print("Vector 1\n",Vector_1)

print("Vector 2\n",Vector_2)

#Finding the transpose of Vector_1

trans = np.transpose(Vector_1)

#Finding the dot product

result = np.dot(trans,Vector_2)

print("Dot Product\n",result)

4. Norm

L p

||x||p = (∑|xi|p )1/p

Norms, including the L p norm, are functions mapping vectors to non-negative values. On an intuitive level, the norm of a vector x measures the distance from the origin to the point x.

More rigorously, a norm is any function f that satisfies the following properties:

• f (x) = 0 x = 0

• f (x + y) ≤ f(x) + f (y) (the triangle inequality)

α R, f (αx) = |α|f(x)

 

The L 2 norm, with p = 2, is known as the Euclidean norm. It is simply the Euclidean distance from the origin to the point identified by x. The L 2 norm is used so frequently in machine learning that it is often denoted simply as ||x||, with the subscript 2 omitted. It is also common to measure the size of a vector using the squared L 2 norm, which can be calculated simply as xTx.

 

The L1 norm may be simplified to ||x||1 = (∑|xi| )



________

PPTs

1. Introduction

2. Linear Algebra



Material in PDF

1. Introduction & Linear Algebra.


 



______________________________________________________________________________

Home                                                                                                                        Previous





Internships: 



Placements:
1. Merkle Sokrati - Associate Business Analyst (2020 - 2024)