No description, website, or topics provided.
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
SRM05A
SRM05B
SRM05C
README.md

README.md

SRM05

1. Cibin Likes Networking
Prerequisites: Knowledge Of Star Topology
Difficulty: Very Easy
Solution Type: Simple Maths and Conditions
Star Topology

Alternatively referred to as a star network, star topology is one of the most common network setups. In this configuration, every node connects to a central network device, like a hub, switch, or computer.
For each test case, find the sum of wire length required and also find the number of repeaters required. Now, subtract these quantities from available ones given. If any of them comes out to be negative then print insufficient otherwise print sufficient.
C Solution:
https://github.com/vipul-08/SRM05/blob/master/SRM05A/SRM05A.c
C++ Solution:
https://github.com/vipul-08/SRM05/blob/master/SRM05A/SRM05A.c
Python Solution:
https://github.com/vipul-08/SRM05/blob/master/SRM05A/SRM05A.py
Java Solution:
https://github.com/vipul-08/SRM05/blob/master/SRM05A/Srm05A.java

2. Cibin is confused between IPv4 and IPv6
Prerequisites: None
Difficulty: Medium
Solution Type: String Operations and Regular Expression
For each test case, find out whether it contains a colon(:) or a dot(.). If none of them are present then print invalid. In case of dot check for the necessary conditions of Ipv4 address whereas in case of colon check for the necessary conditions of Ipv6 address. Also use of regular expressions can save your time.
C++ Solution:
https://github.com/vipul-08/SRM05/blob/master/SRM05A/SRM05B.c
Python Solution:
https://github.com/vipul-08/SRM05/blob/master/SRM05A/SRM05B.py
Java Solution:
https://github.com/vipul-08/SRM05/blob/master/SRM05A/Srm05B.java
Solution by Kaustubh Badrike
http://arena.siesgst.ac.in/contest/SRM05/submission/5c32240ca97ba600223179a8

3. Installation of OS in New Computers
Prerequisites: Knowledge of Graph
Difficulty: Hard
Solution Type: Graph Coloring and Bipartite Check
For each test case, we have to maintain an adjacency list instead of adjacency matrix to ignore TLE. Now at each step we need to keep track of the visited vertices and also the vertices where the OS is installed. Now depending on that we need to install OS in surrounding vertices. After each iteration, we need to check for the contradictions. The process continues till at all the the vertices OS is installed. Here the vertices corresponds to the computers. It is an example of Bipartite Graphs where no two vertices should share same color.
C++ Solution:
https://github.com/vipul-08/SRM05/blob/master/SRM05A/SRM05C.c
Python Solution:
https://github.com/vipul-08/SRM05/blob/master/SRM05A/SRM05C.py
Java Solution:
https://github.com/vipul-08/SRM05/blob/master/SRM05A/Srm05C.java
Solution by Sanoop Menon
http://arena.siesgst.ac.in/contest/SRM05/submission/5c321332a97ba60022317655