Amar HiziBizi Khata

How to set customised automatic Resume Channel to last viewed in Set-Top Box?  Introduction In the era of Digitally fast growing life WiFi enabled smart devices and also voice controlled smart devices are trying to be companion of every human being. But, all human do not change their habit at the same time. It may be cause of mental attachment or financial limits or unwillingness or though as unnecessary. What ever the reason may be, there exists the old technology, like IR(Infrared), RF(Radio Frequency), etc. So, this article for them who are using "Un-smart" TV like me in this time of Smart World. I was searching for a solution to set my Set-top Box of Videocon DTH (controlled by a RF Remote) to resume the last viewed channel when I power on my TV anytime. Suppose, I was watching NAT-Geo and switch off my (Un-smart) TV, even switch off the plug power at board. Now, after some time / on the next day, when I switch on my TV it will directly tune to the last viewed channel, i....

  মাথা যখন আউলা # ১ “ নাটের গুরু” মানে কি ? নাটের গুরু। নাট ... নাট মানে তো নাটক। তার মানে নাটকের গুরু ? মানে যার কথায় নাটক চলে ? মানে নাটকের Director? নাকি , Nut মানে তো আবার জড়বুদ্ধি সম্পন্ন বা মাথামোটা লোক। তার মানে মাথামোটা লোকেদের গুরু ? মানে গুরু হিসাবে তাহলে তেমন কোনও সম্মান নেই ? আর যাদের গুরু বলা হচ্ছে , তারা তার মানে মাথামোটা ? এটা তো অপমান ! নাকি , নাট মানে তো Nut-Bolt এর নাট ? যেটা পাকিয়ে পাকিয়ে ওঠে। তার মানে যারা পাকিয়ে পাকিয়ে ওঠে , তাদের গুরু ? মানে নিম্নশ্রেণীর প্রাণীদের গুরু ? মানে , নিম্নশ্রেণীর প্রাণীদের Trainer?

 

I was thinking how human experience can be defined of his whole life.  So, I thought out... Mathematical Expression of Human Experience

                         কুলের সরবত  Ingredients: 1. Ripe & sour jujube 3 to 4 pcs. 2. Sugar 2 tablespoons 3. Salt 1/2 tablespoon 4. 1 glass of water 5. Black salt Steps: 1. Extract the  white pith from jujubes. 2. Add sugar and salt with it. 3. Put the mixer in a mixer machine. Pour watet. 4. Mix it very well. 5. Serve with ice cubes and sprinkled black salt. You may decorate it with other things as you wish.

1. Simple online Compiler 2. Advance online Compiler

Tic - Tac - Toe Game Design Algorithm: Take a 2 D Array of size 3X3 initialized to NULL value. Take position for input. Input should be alter automatically as input taken one by one. count number of X and O in the Array if any count of X or O is equal to 3 then go to step 5 check continuity of X or O row-wise, if found go to step 10  check continuity of X or O column-wise, if found go to step 10 check continuity of X or O in Diagonal or Counter Diagonal wise, if found go to step 10 if total input is less than 9 go to step 2 Conclude:: Totally messed up..... go to Step 11 Display the Owner..... The End Program Design (in JAVA): import java.io.*; class Game {     public static void main (String args[]) throws IOException     {         BufferedReader inp=new BufferedReader (new InputStreamReader (System.in));     int z=0;     int flag=0;   ...

বকখালি অবস্থান:  দেশ: ভারতবর্ষ রাজ্য: পশ্চিমবঙ্গ জেলা: দক্ষিণ ২৪ পরগনা কি কি দেখার ?                 বিশাল সমুদ্র..... আরে, Bay of Bengal.... পুরো দীঘার ছোট edition... বিস্তৃত সমুদ্র সৈকত..... বেশ ঘন ম্যানগ্রোভ অরণ্য... আর যেটা খুব ভালো লাগে সেটা হল.... এখানে দীঘার মত এত ভীরভাট্টা নেই.... বেশ নিরিবিলি..... যারা একাকী একটা দিন নিভৃতে কাটাতে চান তাঁদের জন্য ব্যাপক জায়গা। (বা দুজনে নিভৃতে কাটাতে চান....)                  একটা Crocodile Park আছে ওখানে.....পশ্চিমবঙ্গ বন দপ্তর দ্বারা নির্মিত..... Bus Stand এর কাছেই। ভালই সাজানো গোছানো.....২ টাকা করে Entry Fee.... ওর মধ্যে একটা পুকুর আছে, যার ঘাট বাঁধানো । কিছুক্ষণ ওখানে বসতেও খুব ভালই লাগে..... বেশ গাছের ছায়া.... মৃদু মন্দ শীতল হাওয়া..... উফ: প্রাণটা যেন জুড়িয়ে যায়..... যেন মনে হয় প্রকৃতির কোলে মাথা রেখে একটু শান্তিতে ঘুমিয়ে নিই.... একটা Tube Well ও আছে.....

নিত্য কাজে পিত্ত গরম সকাল ৬ টা ঘুম থেকে just লাফিয়ে ওঠা ।  হুরমুরিয়ে বিছনা ছেড়ে মাটির স্পর্শে পা বাড়ানো। বড্ড জ্বালায় Alarm ঘড়ি, বন্ধ করা তাড়াতাড়ি । Mobile টা এত্ত খারাপ বেজে উঠলো ততক্ষনাত । ওটাও Alarm, ভাবছ কি? Alarm -বিনা ঘুম ভাঙবে নাকি? উঠলো বাবু, যদিও কাবু । ঘুমের দশা । জল পিপাসা।  কিছুটা জল যেমনি খাওয়া ! প্রাত্য ডাকে  সাড়া দেওয়া । শান্তি মনে শান্ত থাকা । কাজ বাকি যে, আমিই একা । ক্ষুধার রাজ্যে পদ্য হয় !! মুখ ধুয়ে চলো খাওয়ার বানাই। খাবার হল অনেক পরে সময় নেই আর ৮ এর ঘরে। তড়িঘড়ি Dress পড়, Cycle বাগিয়ে বেরিয়ে পড় । Rail come ঝমাঝম ছুটতে হবে, সময় কম । Train- এ উঠে জায়গা খোঁজা লোকের মুখ দেখা আর অবস্থা বোঝা । এই উঠলো জায়গা ছেড়ে, সবাই যেন নেবে কেড়ে এমনভাবে   এগিয়ে আসে লোকজন সব আশেপাশে ।

#include<stdio.h> #include<conio.h> void fibonacci ( int ); void primefibo ( int ); void main() { int n; printf("\n No. of Terms?:: "); scanf("%d",&n); fibonacci(n); printf("\n"); primefibo(n); } // Function for displaying Fibonacci Series void fibonacci(int n) { int i=2,t0=0,t1=1,tn=1; printf("\n SERIES :: "); printf("%d ",t0); while(i<n) { printf("%d ",tn); tn=t0+t1; t0=t1; t1=tn; i++; } printf("%d",tn); } // Function for displaying Prime Numbers from Fibonacci Series void primefibo ( int n ) { int i=2,t0=0,t1=1,tn=1; printf("\n Prime No. in SERIES :: "); while(i<n) { if(isprime(tn)) printf("%d ",tn); tn=t0+t1; t0=t1; t1=tn; i++; } if(isprime(tn)) printf("%d",tn); } // Function to check a number whether it is Prime or not int isprime( int n) { int i; if(i<=1) return 0; for(i=2;i<...

How to use trigger in SQL

Many People spend their time and money to play CASINO Game in Hi-fi Hotel... They do in real. But if you want to spoil your money virtualy and time realy then u can use following game... So, not spoiling our time let's talk about the game design... This Game simply constructed in C Language but in console(DOS) mode also. Procedure used:: Set Player's Initial cash Take a Number between 0 to 100 from Player as input Check for valid input if input is valid goto step 5 else goto step 2 Generate a random number between 0 and 100 Compare with Player's input and computer generated Random Number if both match then goto step 8 else goto step 9 Update Win Counter and add the Player input with Player cash . goto step 10 Update Lose Counter and deduce the Player input from Player cash . Check Player's cash goes under 0 or not. if cash is less than or equal to 0 goto step 12 else goto step 2 for play again. End Program:: // Header ...

We have 7 days in a week. And the first Day of the Date System is Sunday . And it should be. So, 01.01.0001, i.e., First Date of Christ was Sunday. We just number the days as follows. 0 = Sunday 1 = Monday 2 = Tuesday 3 = Wednessday 4 = Thursday 5 = Friday 6 = Saturday So, we can handle every day by the reminder of 7. Cause, u just see, after every 7 days the same day is repeated. Then, lets a rough Calculation. 01/01/0001 => Sunday = 0 Now, we just try to find out the day on 1st January on next year, i.e., 01/01/0002 0001 has 365 days. So, after 365 days which day will come? To find out the answer of this question we have to perform following calculation. 7 ) 365 ( 52 35 ----- 15 14 ---- 1 The reminder is 1, i.e.,Monday. But, using this method, it is very critical to find out the day of 1st January of 1988. So, we have an another idea. Find out how many Leap years are present before current year. Suppose it is L . So, L = y/4 If Current year is...

Any Positive Integer can be represented in the form of Summation of few consecutive Natural Numbers. e.g., Say number is 27 . then it can be represented as 13 + 14 8 + 9 + 10 2 + 3 + 4 + 5 + 6 + 7 So, the following program will take the positive number and show all combination that can make the number as a Summation. import java.lang.*; import java.io.*; public class NumSum { public static void main(String[] args) throws IOException{ BufferedReader in = new BufferedReader ( new InputStreamReader(System.in)); System.out.print("\n Enter a Positive Number:: "); int n=Integer.parseInt(in.readLine()); String seq = new String(); if(n>0) { for(int i=(n/2)+1; i>=1; i--) { boolean f=true; int s=n; int j=i; for(; j>1 || s>=0; j--) { s-=j; if(s==0) { f=false; break; } } if(!f) { System.out.println(); for( ; j<i; j++) { System.out.print(j + ...

This Program will add an Array of 8 bit Numbers with Carry. Assume that the size of Array is stored at the location 2050H and Array starts from 3000H. The Result will be stored from 4000H. Memory Loc Hex Code Label Mnemonics Comment 3050 3051 3052 3A 50 20 START: LDA 2050H ;Take the Size of Array in A ( Accumulator ) 3053 47 MOV B, A ;Store the Array Size in B 3054 3055 3056 21 00 30 LXI H, 3000H ;Initialize the Array pointer (HL Register Pair) with Address of First Element 3057 3058 16 00 MVI D, 00H ;Reset the Carry Holder (D Register) for Addition 3059 305A 3E 00 MVI A, 00H ;Reset the Result Holder (Accumulator) 305B 86 LOOP: ADD M ;Add Accumulator Content with Each Element of Array 305C 305D 305E D2 60 30 JNC NOCARRY ;If Carry is not created don't increase Carry Holder 305F 14 INR D ;If Carry is generated the Carry Holder will be increased by 1 3060 23 NOCARRY: INX H ;Point the next Element of the Array 3061 05 DCR B ;Decrease the Loop Scope ...

This program will count all the 1s and 0s individualy presents in a 1 byte word. And store the result in individual places in Memory. Suppose, argument byte is stored in memory location 2050H and store the result of 1's count at 2060H memory location and 0's at 2061H Memory Location Hex Code Label Mnemonics Comment 3050 3051 3052 3A 50 20 START: LDA 2050H ;Load Accumulator with the number stored at location 2050H 3053 3054 06 00 MVI B, 00H ;Initiate 0's Counter 3055 3056 0E 00 MVI C, 00H ;Initiate 1's Counter 3057 3058 16 08 MVI D, 08H ;Initiate Bit Counter 3059 07 LOOP: RLC ;Rotate Accumulator Left with Carry 305A 305B 305C DA 61 30 JC ONE ;If 1 is found count 1 305D 04 INR B ;If 1 is not found it must be 0. So increase 0's Counter 305E 305F 3060 D2 62 30 JNC NEXT ;Go to next Bit 3061 0C ONE: INR C ;Increase 1's Counter 3062 15 NEXT: DCR D ;Decrease the Bit Counter 3063 3064 3065 C2 ...

This program will work out the 2's Complement of a 2 Byte Number. As Microprocessor can perform 8 bits at a time in Accumulator, so we follow the foloowing Algo Fetch the 2 Byte Number in a Register Pair Bring Least Significant Byte of the Number from last Register into A (Accumulator) Make Complement of A and add 1 Store back the Updated LSByte into its source Register Bring MSByte of the Number from another Register into A Make Complement of A and add 1 if carry was genetrated at the time of LSByte opeartion Store back the Updated MSByte into its source Register Store the Result to a Memory location Suppose, Argument Number is stored in Location 1000H and 1001H Memory Location and store the value in 2000H and 2001H Memory Locations. Memory Location Hex Code Label Mnemonics Comment 3050 3051 3052 2A 00 10 START: LHLD 1000H ;Load the HL Register Pair with the content of Memory Location 1000H and 1001H 3053 7D MOV A, L ;Move the Content of L to A ( Accumulator ) 3054 2F...

A class Named "Point" which stores the Co-ordinates of a point in (x,y) Format. This Class Contains:: O Constructor with default arguments O Copy Constructor O Function to display which Co-ordinate a Point belongs to O Function to get value of x of a point O Function to get value of y of a point O Function to get the Radious Vector (r) of a point O Function to get the Theta of a point O Overloaded Operator - to find out distance between two points O Overloaded Operator >> to take input O Overloaded operator O Destructor #include<iostream.h> #include<math.h> class point{ //Data Members int x,y; //They hold the value of X and Y co-ordinate of a Point. public: //Member Functions point(int t1=0, int t2=0) //Constructor with default arguments. { x=t1; y=t2; } point(point &t) //Copy Constructor { x=t.x; y=t.y; } int coordinate(void); //It returns the point's Co-ordinate, e.g., 1, 2, 3, or 4th. int getx(...

A Class named ' intarray ' which can store an integer array of different size. This Class contains:: O Constructor with deafault argument value At the time of Object creation if array size is missing then An array of size 0 will be created. O Copy Constructor This Constructor is used to create a new Object from an existing Object. O Overloaded Operator = This operator is overloaded to assign an intarray object into another object, simply as two integer variables can be made. O Overloading Operator [ ] As array element can be reffered by its position declaring in Subscript operator ( [ ] ), here every element of an object array can be reffered by [ ] operator. O Overloading Operator >> This is an input operator . Here we can take input to a object simply by this line cin >> a; . Here a is an intarray object. O Overloading Operator This is an output operator . Here we can get the output of an intarray object by this line cout . Here a is an intarray ob...