TLEP BSBC 205 (Batch 2016-2019)

TLEP BSBC 205 for Batch 2016-2019 can be found here

Comments

Post a Comment

Post Your Valuable Comments

Popular posts from this blog

Zeller's Congruence

class ZellersCongruence {     /**     * Calculate day of week using Zeller's Congruence     *     * For the Gregorian calendar     * h =(q + floor(13(m + 1) / 5) + K + floor(K / 4) + floor(J/ 4) + 5J) % 7     *     * For Julian calendar     * h =(q + floor(13(m + 1) / 5) + K + floor(K / 4) + 5 + 6J) % 7     *     * where     * h is the day of the week (0 = Saturday, 1 = Sunday, 2 = Monday, ...)     * q is the day of the month     * m is the month (3 = March, 4 = April, 5 = May, ..., 14 = February)     * K the year of the century (year % 100).     * J is the century (actually floor(year/100)) (For example, in 1995 the century would be 19, even though it was the 20th century.)     *     * NOTE: In this algorithm January and February are ...
Read more

Practical 5 - ASP.NET

Page1.aspx <%@ Page Language="C#" AutoEventWireup="true" CodeBehind="Page1.aspx.cs" Inherits="StudentInformation.Page1" %> <!DOCTYPE html> <html xmlns="http://www.w3.org/1999/xhtml"> <head runat="server">     <title></title> </head> <body>     <form id="form1" runat="server">     <div>             <table style="width:100%;">             <tr>                 <td>Name:</td>                 <td>                     <asp:TextBox ID="txtName" runat="server"></asp:TextBox>                 </td>             </tr>             <tr>   ...
Read more

Fabonnaci series using recursion

class Fibonacci {     static int fib(int n) {         if (n == 0)             return 0;         else if(n == 1)             return 1;         else                return fib(n - 1) + fib(n - 2);     }     public static void main(String[] args) {         for (int i = 0; i <= 10; i++)             System.out.println(fib(i));     } }
Read more