the transfer and postings of government school teachers Lower primary teachers LP teachers, Upper primary teachers, UP teachers, AEO's Headmasters, and all is done usually through
Schedules, Results, Answers to the quiz questions, anything you wanted to know, just that. From the house of the blogger who rocked, ASD of India's next venture - ASD's Just that
Search
Tuesday, March 8, 2011
Thursday, March 3, 2011
Malicious software that tracks your keystrokes in exchange for free smileys
"Malicious software that tracks your keystrokes in exchange for free smileys"
Just saw the above line in google chrome's incognito window warning...
How true!
Wednesday, March 2, 2011
Thinking quickly
Thinking quickly
nice funny joke..
thinking quickly, without even thinking about the fact that you're thinking, without verbalizing your thoughts, can indeed be an asset
nice funny joke..
thinking quickly, without even thinking about the fact that you're thinking, without verbalizing your thoughts, can indeed be an asset
Friday, February 4, 2011
Port Forwarding BSNL VMC AN1020-21 Modem (Type WT) for Transmission
Transmission is a bittorrent client like utorrent, for linux.
It uses a default port 51413 to make connections.
You can go to Edit-->Preferences-->Network and look at the Port for Incoming Connections option.
Click Test port under it, and if it shows Port is Open, you have to do nothing.
If it shows Port is Closed, follows these instructions.
Note down the port number (51413 in this case, you can change it if you want, but not all ports are allowed)
Now, go to 192.168.1.1 in your browser. (this is your router's home page)
Enter username and password as admin
On the left pane, under the security tab, select Port Forwarding.
If it asks for password again, type admin as username and admin as password as earlier
Now, you have to add a port forwarding rule.
Click on the Add button
Select user-defined instead of pre-defined
Give some trivial name. I gave Transmission.
WAN interface, the default one. (pppoe_0_35)
Forward to internal host ip address:
Now this setting is what requires caution.
Bring up command prompt or terminal and type ifconfig or ipconfig and find inet address.
Mine was 192.168.1.2
Type that in.
Now in the protocol type select TCP
For External Packet Port Start, Port End and Internal Port Port Start, Port End,
for all 4 of them, type 51413 (the transmission port)
Now in the protocol type (second row) select UDP. And type 51413 for all the ports as we did for TCP.
Click apply and if everything goes well you'll have added two port forwarding rule.
Now, you may have to reboot the router. But if you want you can go to Transmission Preferences and click Test Port to see if it shows up Port is Open now without rebooting.
If it still doesn't try rebooting the router.
If it still doesn't show port is open, my friend, I can't help you.
(BTW, I set Use UPnP or NAT checked in transmission preferences)
It uses a default port 51413 to make connections.
You can go to Edit-->Preferences-->Network and look at the Port for Incoming Connections option.
Click Test port under it, and if it shows Port is Open, you have to do nothing.
If it shows Port is Closed, follows these instructions.
Note down the port number (51413 in this case, you can change it if you want, but not all ports are allowed)
Now, go to 192.168.1.1 in your browser. (this is your router's home page)
Enter username and password as admin
On the left pane, under the security tab, select Port Forwarding.
If it asks for password again, type admin as username and admin as password as earlier
Now, you have to add a port forwarding rule.
Click on the Add button
Select user-defined instead of pre-defined
Give some trivial name. I gave Transmission.
WAN interface, the default one. (pppoe_0_35)
Forward to internal host ip address:
Now this setting is what requires caution.
Bring up command prompt or terminal and type ifconfig or ipconfig and find inet address.
Mine was 192.168.1.2
Type that in.
Now in the protocol type select TCP
For External Packet Port Start, Port End and Internal Port Port Start, Port End,
for all 4 of them, type 51413 (the transmission port)
Now in the protocol type (second row) select UDP. And type 51413 for all the ports as we did for TCP.
Click apply and if everything goes well you'll have added two port forwarding rule.
Now, you may have to reboot the router. But if you want you can go to Transmission Preferences and click Test Port to see if it shows up Port is Open now without rebooting.
If it still doesn't try rebooting the router.
If it still doesn't show port is open, my friend, I can't help you.
(BTW, I set Use UPnP or NAT checked in transmission preferences)
Wednesday, February 2, 2011
BSNL Broadband Modem type 2 with wifi and TA (Terminal Adapter)
BSNL broadband modems may be with Wifi or without Wifi.
Modem Type | ||||
Nomenclature | ADSL Basic | ADSL WiFi-2 | ADSL-WiFi-TA | VDSL WiFi |
Short Nomenclature | Type-B1/B2 | Type-W1/W2 | Type-WT | Type-VD |
Modem Sale Price (one time Charges)* | Rs.1100 | Rs.1800 | Rs.2250 | Rs.2950 |
Monthly Rental | Rs.50 | Rs.80 | Rs.100 | Rs.130 |
Monthly Rental after 24 months | Rs. 25 | Rs. 40 | Rs. 50 | Rs. 65 |
The above table from BSNL site shows the cost of various modems
Features | Type-B1 | Type-B2 | Type-W2 | Type-WT | Type-VD |
USB Port | 1 | 1 | 1 | 1 | 1 |
Ethernet Ports | 1 | 4 | 4 | 4 | 4 |
WiFi Enable | No | No | Yes | Yes | Yes |
VoIP Enable | No | No | No | Yes | No |
And also the features
Now the modem I bought for 2250 the Type-WT is special in that apart from the 4 LAN ports (provided by Type-B2) and the Wifi (provided by Type-W2) this one has VoIP support too.
The VoIP (Voice over Internet Protocol) allows people to make phone calls via the internet (at cheaper rates!!)
But BSNL, as of now, doesn't provide VoIP service. Only private companies are now giving this. And it requires additional equipment (a phone that can connect to internet) too.
That's all. If you want to be the proud owner of cutting edge technology, follow me and buy this one.
Tuesday, January 25, 2011
INOI 2011 Solutions
[Update on Jan 17, 2013: Some readers are reporting that the second solution is wrong. I cannot verify the same, but to be safe discretion is advised.]
Here are my solutions for the two INOI 2011 questions... (Indian National Olympiad in Informatics conducted by IARCS Indian Association for Research in Computing Science for Google's search :P)
The first question was about how many right angled triangles are possible with the given set of points and with sides parallel to x and y axes.
Arrays required: a 2*N array (xy[2][N])to store the coordinates. Two 10^4 long arrays (X[10000] and Y[10000] to store the number of times an x-coordinate and y-coordinate appears.
Input: Go into the loop. Get the coordinate and store it in the first array. Add 1 to X[x-coordinate], 1 to Y[y-coordinate]
The trick: Now, for every given point just multiply (X[x]-1) and (Y[y]-1)
This works because if you think of the points really as it is plotted in a graph, you'll see that for one point as the vertex with the adjacent sides perpendicular, there are as many triangles possible as the product of the remaining points left horizontal to it, and remaining points left vertical to it.
Add this for all points and do that %10000
The second question involving dynamic programming needs a solution to be constructed from one of the problems already discussed in online contest archive.
We store the marks in the array marks[N]
Now the best score at marks[0] is the same.
from marks[1] onwards, the best score is the maximum of (marks[1] alone),(best[i-1]+marks[1]),(best[i-1] dropping marks[i])
In the last case, when we drop marks[i], we must add one mark which we previously dropped to get the best mark.
Now, the trick in this is to store a best negative mark value for every i-1 so that if i is negative too, we can find dropping which is better. (where, by best negative, I mean the one closest to zero.. Because the one farthest from zero needs to be dropped.)
so we compare the best negative and marks[i] (obviously when marks[i] is negative) and keeps the one closest to zero, drops the other...
we must keep the count of K that is left. And we must also remember to restore K to maximum when we can best [i-1] is the same as marks[i] and they're both negative (or zero).
Both of the questions were particularly easy, if you thought like me. All the best for your results.
The first question was about how many right angled triangles are possible with the given set of points and with sides parallel to x and y axes.
Arrays required: a 2*N array (xy[2][N])to store the coordinates. Two 10^4 long arrays (X[10000] and Y[10000] to store the number of times an x-coordinate and y-coordinate appears.
Input: Go into the loop. Get the coordinate and store it in the first array. Add 1 to X[x-coordinate], 1 to Y[y-coordinate]
The trick: Now, for every given point just multiply (X[x]-1) and (Y[y]-1)
This works because if you think of the points really as it is plotted in a graph, you'll see that for one point as the vertex with the adjacent sides perpendicular, there are as many triangles possible as the product of the remaining points left horizontal to it, and remaining points left vertical to it.
Add this for all points and do that %10000
The second question involving dynamic programming needs a solution to be constructed from one of the problems already discussed in online contest archive.
We store the marks in the array marks[N]
Now the best score at marks[0] is the same.
from marks[1] onwards, the best score is the maximum of (marks[1] alone),(best[i-1]+marks[1]),(best[i-1] dropping marks[i])
In the last case, when we drop marks[i], we must add one mark which we previously dropped to get the best mark.
Now, the trick in this is to store a best negative mark value for every i-1 so that if i is negative too, we can find dropping which is better. (where, by best negative, I mean the one closest to zero.. Because the one farthest from zero needs to be dropped.)
so we compare the best negative and marks[i] (obviously when marks[i] is negative) and keeps the one closest to zero, drops the other...
we must keep the count of K that is left. And we must also remember to restore K to maximum when we can best [i-1] is the same as marks[i] and they're both negative (or zero).
Both of the questions were particularly easy, if you thought like me. All the best for your results.
Friday, January 7, 2011
CBSE Class XII Date Sheet 2011 Class XII Time Table 2011 Board Examinations
The Date Sheet of CBSE Class XII 2011 was released today, on 7th, January,2011.
The main subjects are as follows:
All exams start at 10:30 AM. Subject codes in parenthesis.
Here's the copy of the original file CBSE uploaded (Click here):
Science (Biology) Stream
March 1, Tuesday: Physics (042)
March 7, Monday: Chemistry (043)
March 11, Friday: English Core (301)
March 14, Monday: Biology (044)
March 22, Tuesday: Mathematics (041)
Science (Computer) Stream
March 1, Tuesday: Physics (042)
March 7, Monday: Chemistry (043)
March 11, Friday: English Core (301) March 22, Tuesday: Mathematics (041)
March 30, Wednesday: Computer Science (083)
Commerce Stream
March 3, Thursday: Business Studies (054)
March 9, Wednesday: Accountancy (055)
March 11, Friday: English Core (301)
March 16, Wednesday: Economics (030)
March 30, Wednesday: Informatics Practices (065)
The main subjects are as follows:
All exams start at 10:30 AM. Subject codes in parenthesis.
Here's the copy of the original file CBSE uploaded (Click here):
Science (Biology) Stream
March 1, Tuesday: Physics (042)
March 7, Monday: Chemistry (043)
March 11, Friday: English Core (301)
March 14, Monday: Biology (044)
March 22, Tuesday: Mathematics (041)
Science (Computer) Stream
March 1, Tuesday: Physics (042)
March 7, Monday: Chemistry (043)
March 11, Friday: English Core (301) March 22, Tuesday: Mathematics (041)
March 30, Wednesday: Computer Science (083)
Commerce Stream
March 3, Thursday: Business Studies (054)
March 9, Wednesday: Accountancy (055)
March 11, Friday: English Core (301)
March 16, Wednesday: Economics (030)
March 30, Wednesday: Informatics Practices (065)
Subscribe to:
Posts (Atom)
Drop me a comment if anything is missing