Find the first occurrence of non repeating character and print the character(s)
So, I have decided that whatever problems I found interesting , I will make a blog post here with the solution. Since, I have slowly transitioned into a Java coder , my code will be mostly written in java. I am not interested in other programming language :p
example:
input: aaabbbe
output: e
import java.io.*;
import java.util.*;
public class ZotechnoFreaks{
public static char firstOccur(char []ch){
int len=ch.length;
HashMap<Character,Integer> hm=new HashMap<Character,Integer>();
Queue<Character> q=new LinkedList<Character>();
for(int i=0;i<len;i++){
if(hm.containsKey(ch[i]){
hm.put(ch[i],hm.get(ch[i])+1);
}
else{
hm.put(ch[i],1);
q.add(ch[i]);
}
}
while(!q.isEmpty()){
char res=q.poll();
if(hm.get(res)==1){
return res;
}
}
return null;
}
public static void main(String []args){
Scanner sc=new Scanner(System.in);
char []ch=sc.next().toCharArray();
System.out.println(firstOccur(ch));
}
}
Are you a social tyrant ?
“The reason why most people don’t understand others is because they don’t want to”, said one of my friends . I remember, it was during our school days, and at the time, we derided the quote, claiming it to be “too cheesy” . But, as time moves on, and as I meet more people, I realised how meaningful those sentences were. Comprehension tends to be a far-off alien word when it comes to actually applying it . I am no saint on this either, I can immediately recall many-a-times I had come to conclusions far too easily and ended up having miconceptions about things .
These days with the advancement of social platforms where one can willingly showcase their dirty laundry without the need to ask them for it, I believe, the act of “accepting people for who they are” is likely not becoming popular. When we see someone who is not as good-looking as he/she was in his/her profile picture, we keep this little thought behind our back (if not shout out for it) and slightly ridicule him for it. We instantly create this image of the person and take him to be dishonest about other things as well, while instead , we could have kept our head together and maybe(just maybe) take it as pleasantry. We could’ve just settled with “ahh ! he is making use of his technology ” and that’s it . Trust me, many of us take it too seriously- I saw people postings serious comments about it many times. This is just one of the many illustrations I can offer you right now .
Again with all these online connectivity increasing, our level of tolerance decreased to the drain. No, I do not want you to tolerate something that has anything to do with -injustice , violence or dereliction. What I am emphasizing here is “basic” level of tolerance . Cordial living can be easily attained if our egos were not too mountain-high and our pride not turned into blunt arrogance.
These are few thoughts that came into my mind when I see people criticizing other’s post because they could not fathom out the reason behind it. Let’s not turn ourselves into thinking we are a social hippie who couldn’t care less about anything, while, we actually are cultivating our inner “ranting, domineering bully”. We could be the reason behind someone’s insecurities, embarrasment and tears. At this rate, I think it’s not tough to be one.
Spread love , not hatred; respect , not derision and you’ll be amazed at how easily your life has turned to be less dramatic and calmer .
“Respect people’s feelings ! Even if it doesn’t mean anything to you, it could mean everything to them . -anonymous”
HackerRank: Grid Search (Explanation and code in Mizo)
Difficulty : Moderate
He problem ah hi chuan 2D array RXC matrix lo nei ta ila, 2D array dang amah aia te hret emaw , worst case a amah nena intiat nei leh bawk ta ila , array te zawk hi array lian zawkah a awm nge awm lo tih kan zawn chhuah a ngai a. A awm chuan “YES” tih print chhuah tur a ni a, a awmloh chuan “NO” .
Khimi entirna ah khi chuan array hnuhnung zawk khi a awm chian em avangin kan output pawh “YES” tur a ni .
Hetiang online platform a coding ah hi chuan Input an duh dan bik te, output an beisei dan bik te hriatthiam tum a, kan zawm hram a ngai thin . Chuti lo chu , an testcase ho kan paltlang thei thin lo.
Hemi problem ah pawh hian an input leh output beisei dan hi lo en ta ila:
INPUT:
Line hmasa berin Testcase mamawh zat a keng anga, a dawtah line khat ni si gap awm si hian integer pahnih R leh C i chhu lut anga, chu chuan i matrix lian zawk dimensions a pe dawn a ni. Entirnan 3 4 I chhut khan 3×4 matrix a ni tihna .
Line pathumna atanga i R value thleng khan array element I chhu tan ang . Hemi hnu hian I array te zawk dimensions r leh c I enter leh anga , a tawp ber atan array te zawk elements.
Constraints
1≤T≤5
1≤R,r,C,c≤1000
1≤r≤R
1≤c≤C
Output:
YES —> array te zawk kha array lian zawkah a awm chuan .
NO—–> otherwise
CODE:
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) throws IOException {
//Solution solution = new Solution();
try(BufferedReader input = new BufferedReader(new InputStreamReader(System.in))){
int numTestCases = Integer.parseInt(input.readLine());
assert numTestCases >= 1 && numTestCases <= 5;
int[][] grid;
int[][] pattern;
for(int t = 0; t < numTestCases; t++) {
grid = buildArray(input);
pattern = buildArray(input);
System.out.println(findPattern(grid, pattern));
}
}
catch(IOException e){
e.printStackTrace();
}
}
public static String findPattern(int[][] grid, int[][] pattern){
for(int R = 0; R < grid.length – pattern.length + 1; R++){
for(int C = 0; C < grid[0].length – pattern[0].length + 1; C++){
outerLoop:
for(int r = 0; r < pattern.length; r++){
for(int c = 0; c < pattern[0].length; c++){
if(grid[R + r][C + c] != pattern[r][c]){
break outerLoop;
}
}
if(r == pattern.length – 1){
return “YES”;
}
}
}
}
return “NO”;
}
public static int[][] buildArray(BufferedReader input) throws IOException {
String[] sizeParameters = input.readLine().split(” “);
int rows = Integer.parseInt(sizeParameters[0]);
int columns = Integer.parseInt(sizeParameters[1]);
int[][] array = new int[rows][columns];
for(int i = 0; i < rows; i++){
String rowOfNumbers = input.readLine();
for(int j = 0; j < columns; j++){
array[i][j] = Character.getNumericValue(rowOfNumbers.charAt(j));
}
}
return array;
}
}
HackerRank : Utopian Tree ( Explanation and code in Mizo)
Difficulty: Easy
Hrilhfiahna
Utopian Tree hian kum khat chhungin vawi hnih than hun chhung (Cycle) a nei a- Spring(? ka theihnghilh thut) laiin a height neih sa letin a thang a nga, nipui lai erawh chuan a height neih bakah meter khatin a than belh dawn a ni.
Utopian tree hi spring tir lamah lo phun ta ila, a heigh neih sa atan meter khat dah bawk ila. N cycle a thlen huna a height tur engzah nge ni ang le ?
Input Format
Line hmasa berah integer T- testcase zawn duh zat ziah tur .
T i ziah dan a zirin , T zat line hemi hnuah hian i nei thei a, heng T lines te hian line tinah integer N (input anga lak tur) anei ang. N hi cycles kan mamawh zat chhut na tur a ni e.
Constraints
1≤T≤10
0≤N≤60
Output Format
Test case tin atan Utopian tree height hi N zat print chhuah tur. Line tin hian integer khat chiah a keng ang.
Hrilhfiahna :
A zawhna hi a chiang thawkhatin ka hria . Entirnan :
Input : Output: A chhan:
N=1 2 Cycle hi vawikhat chiah a kal chhuak hman a , a ma height sa kha 1 ania, double a ngaih avangin 2 .
N=4 7 1=1+1(Double) =2=2+1(nipui)=3 =3+3(spring)=6+1=7
Engtin nge ka code ang ? Tunlai chu Java ka hman ngawrh ber avangin Java hmangin ka implement dawn a ,hetiangin :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int testCaseZat=sc.nextInt();
for(int i=1;i<=testCaseZat;i++){
int cycleZat=sc.nextInt();
BigInteger res= new BigInteger(“1”); // A tirah tree hian height 1 a neih avangin
for(int j=0;j<cycleZat;j++){
if(j%2==0) // Spring
res = res.add(res);
else// Summer
res = res.add(BigInteger.valueOf(1));
}
System.out.println(res);
}
}
}
Hacker Rank in testcase chi hrang 9 atangin an endik a, he program hian 0.9 secs chhungin a chawk zo hman vek.He program hi tunhnai Hacker Rank a coding inelna Code Warrior ka tel tuma zawhna 10 ka dawn zinga pakhat a ni a . He inelna ah hian vanneih thlak takin pakhatna ka hauh . \m/ Ka hackerRank profile hming hi ‘gorillaz’ a ni a, in theih chuan min lo follow ve dawn nia . LeetCode lama ka inhman zawk avangin he competition hi hackerRank contest ka telna hmasa ber a ni thung .
FCFS(First come first serve)
FCFS(First come first serve)
Criteria : Arrival Time .
Mode Non-preemptive mode .
Non-preemptive mode a nih avang hian , process ho hi an luh dan indawtin an execute a ngai dawn a. Process pakhat in a tihtur a tih laiin , a dang an rawn inrawlh ve thiang lo tihna a ni . A zawh hma chu , process dang ho hian an nghah a ngai dawn tih na a nih chu. Hei hian starvation kan tih kha a thlen thei .
example :
Gantt chart inpea a landan khian , P1 khi 0 ah a CPU allot a ni a , tichuan a hna te thawkin ,t=3 ah CPU a release ta choh a ni .CPU hi a release hma chu P2 khi CPU allocate a ni thei lo hrim hrim FCFS hmang chuan . Chutiang zelin process dang READY queue a awmho kha an indawt danin a rawn allocate ta a ni.
—Burst time (BT ) chu CPU chhunga an hun hman zat kha ani a . Complete time leh Arrival time paih kha a ni .
—Schedule time chu CPU allocate an ni hun kha ni. Non preemtive a nih avang hian FCFS hian ,process ho duh hun hun ah allocate dawn lo tih a chiang a, CPU an hman duh atanga ,hmantir phal an nih hun (timai ila!) kha a ni awm e .
—Turnaround time :Completion time – arrival time .
— waiting time : schedule time- arrival time .
tichuan khitiang a kan calculate chuan a hnuai ang hian a rawn awm dawn ta ani .
**ZAWHDUH A AWM ANIH CHUAN COMMENTS LAMAH AW 🙂
CPU scheduling
CPU (processor) hian hna chi hrang hrang heng threads,processes leh data flows te tan hian a thawk thin a .Heta hna a thawk thin kan tih tum tak chu , CPU resources, heng bandwidth an ni emaw, processor time emaw ,thil dang dang ,an hnathawhna a tana tangkai tur te sem velah hian a ni ah ngai ta ila .(Hei hian concept thar ,deadlocks etc ah min hruai lut a ni .Hengho hi kan zir chiang chho zel turah ngai ila ).Amaherawhchu, a rualin heng ho hian CPU hi an inhman tawm thei lo .Pakhatin CPU a hman lai hian , a dang khan a hmang ve theilo a, a hmang mek tu in a hman zawh veleh ,a dawta mi khan a hmang ta thin a ni .
A tirah(1960s) chuan computer ho khan eng thil harsa vak mah kha an compute ngai lemlo a, number pahnih belh tur pawh khan chhut keuh keuh a , a chhanna hmu leh tura a hnu darkar khat vela kal leh te kha a ngai thin a ni awm e ! Khang system a processor ho kha chuan OS hi an hman a ngai lemlo ani.
Tunlai processor ho erawh hi chuan thil tam tak a ruala(rual deuh thaw) tih an mawmawh tak thin avang hian , CPU pawh hian scheduling an tih a lo ngai ta a. Scheduling hi scheduler ho in rang takin an kengkawh ta thin a,a rang em avangin ,keini (A hmangtu) te tan phei chuan ,a rualin a thleng emaw tih mai tur a ni .
entirnan ,i laptop ah khan media player hmangin hla i ngaithla a, chutih lai vekin notepad ah thil i type bawk a, a rualin i ti ah i lo ngai ani maithei .Mahse ,hemi te pahnih ti tur hian scheduler ho khan rang takin scheduling (Context switching ) an perform a ni mai zawk !
Scheduler ho hian ngaihpawimawh bik an nei a , chungte chu han en dawn ila :
1) THROUGHPUT :
A awmzia kan hre vek anga , throughput chu process ho ,an tih tur zikthluak taka hlen zo thei ho zat kha a ni ti ila a sual awm lo e. Chuvangin ,
throughput= execution /time .
Scheduler hian THROUGHPUT tam thei ang ber a nih theih nan hna a thawk tur a ni .
max.throughput= (no.of process completed)/time
=(useful work)/ total work . //total work =useful + overhead
2)LATENCY :
Latency kan tih hian ,kan rilrua lo lang hmasa ber tura ka rin chu “delay” hi a niin ka hria. Ani reng bawka ,latency chu delay a ni .Delay kan tih hian ,queing delay te ,processing delay te ho bawk kha an ni a. Process ho hian CPU hi an duh hun hunah an hmang thei lo a,CPU process dangin an hman chhung khan an nghah ve a ngai a, hei pawh hi latency chi khat chu a ni. Scheduler hian latency tlem thei ang ber a awm theih nan, scheduling hi a perform thin a ni . (p.s starvation concept kha in bih chiang ila a tha awm e ).
latency chi hnih chauh han en ila :
– Turnaround Time : process khan CPU a hman duh tirh atanga a hman zawh thleng . (hman duh tirh hian a hmang nghal lo thei .)
-Response Time :
Request kan(user) pek atanga chhanna(respond) kan dawn inkar chhung.
3)FAIRNESS .
Scheduler hian a “fair” thei ang berin CPU scheduling hi a ti tur a ni .Process pakhat khan a hmang char char tur a ni lo a, midang ken hun a nei tur tihna a ni . Hei hi Scheduler hna pawimawh ber te zinga mi a ni awm e .
4)WAITING TIME :
Scheduler hian waiting time a tlem thei ang ber a awm tir tur a ni a. Awmzia chu , READY queue ah khan process ho kha reilote chauh awm thei se tih hi duhthusam a ni .Waiting time a tlem poh leh khami CPU khan multitasking a ti tha thei dawn tihna a ni .
A tawi zawngin system (heng computer ,laptop etc.) ho hi an chak tha kan tih theihna chhan chu , scheduler tha tak an neih vang a ni awm e .
Khimi diagram atang khian kan hmu thei anga , scheduler te hi chi thum an awm a ,chungte chu :
1)LONG TERM SCHEDULER
Process ho kha Job queue ah dah vek an ni a, heng ho zingah hian CPU hmang duh leh ho kha READY queue ah FIFO (first In First Out) zulzui in dah an ni leh a . He hun chhung ,Job queue atanga ready queue(CPU hmangtu te hmanzawh hun nghak ho awmna) kan load chhung hi scheduler pakhat LTS hian handle tir a ni .
Tichuan , CPU hmang duh si ,la chang silo ho kha an indawt danin READY queue ah chuan dah an ni ta a.A lema a landan ang khuan P1,P2,P3 leh P4 te an ni lo ti ta ila . P1 khu queue ah lut hmasa ta ber se ,READY queue a awm ho zingah a lut hmasa ber a nih avangin, a chhuak hmasa ber tur a ni .
Thil pahnih thleng thei a awm a,hetah hian :
-Buaina dang awmlo in , CPU kha a hmang mektu process khan a chhuahsan ta chiah ah ngai ila , CPU a free avang khan P1 khan CPU a hmang ve nghal ta chiah a ni .
-CPU kha free ta reng pawh nise , thil dang buaina avangin P1 khan CPU a hmang leh thei ta lo a, tichuan Suspend queue ah dah a ni dawn ta ani . Hei hian a dawta process awm P2 kha a block loh phah dawn.
READY queue atanga SUSPEND queue a process a kal dan vel hi MIDDLE TERM SCHEDULER hian a kengkawh .
2)MIDDLE TERM SCHEDULER :
SUSPEND queue a process awm tur decide tu scheduler a ni .SUSPEND queue a awm process ho hian CPU hman an duh leh a nih chuan READY queue ah lut lehin an hmag leh thei .
3)SHORT TERM SCHEDULER
READY queue a process awm ho kha FIFO hmangin ,suspend an nih loh a, CPU a lo awl bawk chuan ,CPU an hman phal a ni a . (one at a time ) Hemi kengkawh tur hian short term scheduler hman a ni . Short term scheduler hi CPU scheduler tih a ni bawk .CPU a process a awm chhung hian ,CPU resource chi hrang hrang a hmang ta thin a,a tih tur a zawh hunah a “terminate” ta thin a ni .Buaina dang hranpa awmlo a a terminate thei a nih chuan , succesful anga ngaih niin , a nihloh erawh chuan block queue ah dah let leh a ni . Heta tang hian a bul a tan that phalsak a ni leh ta thin .
EXAMPLE :
Q) Consider a system with ‘n’ CPUs and ‘m’ processes where m>n and n>=1. Calculate the lower bound and upper bound on the number of processes that can be in READY and RUNNING and BLOCK states .??
solution :
LOWER BOUND UPPER BOUND
ready 0 m
running 0 n // CPU awm zat chian hian process run theih zat a determine .
ready 0 m
A Tlangkawm nan :
CPU pakhat chiah awm ta se ,process hi ‘n’ awm ta thung sela ,say p1,p2,p3…pn.
Hetiang anih chuan scheduling algorithm ho hman an ngai dawn a ni . Formula in dah dawn ila,
AT—>Arrival time
BT—>burst time.
IOBT—> input output burst time.
CT —-> complete time.
TAT—-> Turnaround time.
WT—-> waiting time.
** i hi subscript ah zel ngaih tur .
1) AT(Pi)= Ai , where i=1…n
2) BT(Pi) = Xi(CPU)
3) IOBT (Pi) = Yi (IO)
4) CT(Pi) =Ci
5) Deadline (Pi) =Di
6) TAT (Pi) =(Ci-Ai)
7)Avg. TAT(Pi) = summation of TAT (Pi) /n
8) WT(Pi) = Ci-(Ai +Xi +Yi)
9) Avg .WT (Pi) = summation of WT/n
10) schedule length (L) =MAX(Ci)-MIN(Ai).
11)Throughput =n/L
12)Deadline : (Ci-Di)
if (Ci-Di)0 : Over run .
if (Ci-Di)=0: at run .
NOTE : no. of schdeuling in NON-PREEMPTIVE —> n!
no . of scheduling in PREEMTIVE —-> infinite
The first cause
-V.Lalchhandama,IIT KGP
First cause hi thil thleng hmasa, chu thil chu a thlen vang a, thil dang lo thlen tihna a ni a. First cause tih awmzia chu “chhan hmasa ber” tihna a ni mai. First cause tel lovin recursion a thleng thei lo. Entirna lo pe dawn ila
Example 1:
x>x²
Let us assume that the equation is true for some real x=k, such that -∞<kk²
Now,
(k+1)²=k²+2k+10)
since k is negative, subtracting k on RHS increases the value
2k+1k², there exists k+1 such that k+1>(k+1)².
However, no such k exists in -∞<kx in the domain -∞<x<0
k tana a dik phawt chuan k+1² tan a dik a, k chu eng number pawh a ni thei a, k value chu k+1 nen chiah a inkungkaih (relate) a ni.
Example 2:
The Hilbert's Hotel
Hilberta chuan hotel pakhat a nei a, chu hotelah chuan meizuk khap a ni. Lighter ken luh khap a ni a. mahse, meizial ken luh chu phal a ni a, midang hnena lighter dil pawh phal a ni. Meizial tran sa nei chuan a bula mi tan a meizial a tan sak thei a. Room chu tam tak (infinite) a awm a, an roomah chuan Mr 1, Mr 2, Mr 3 …. etc an thleng a.
Mr 1 chuan Mr 2 hnenah,"Min lo tansak" tiin a dil a, Mr 2 chuan "Ka nei lo, Mr 3 ka va dil ang e" a ti a. Mr 3 chuan, "Ka nei lo, Mr 4 ka va dil ang e" a lo ti ve leh chhawng zel a. Chutichuan, an zain an ti ta zel a, Mr N an meizial a tan theihna chhan chu Mr N+1 vang a ni a. Hotelah chuan meizial zu an awm ang em? An awm dawn lo a ni.
A chunga example pahnihin a tarlan chu infinite regression hi first cause tel lovin a awm thei lo a ni. "A nih leh first cause nen chuan infinite regression hi awm thei em?" tih hi i lo chhang dawn ila.
Example 3:
Printing of Natural numbers.
1. N=1
2.Print N
3.N=N+1
4.Go to step 2.
He program hmang hian natural number awm zawng zawng (infinite) chu a print theih a ni. N value chu N+1 ah a innghat a, N+1 value chu N ah a innghat bawk a ni. Hei hi infinite regression a ni.
Kan hmuh ang khian infinite regression reng rengah first cause a ngai ziah. Chuan chu cause chu regression pawna mi a ni.
Phone ruk hmaa lo inralrin dan leh ruk hnua hmuh chhuahdan
—-Bryan Lalramchhana
Android phone hmang te bik tan liau liau…in android kha abo hma a in ralrin dan leh an ruk bo hnu a hmuh chhuah dan tha lutuk hi kan post nge ka test sa hi…i computer tang emo cafe tang poh i duh tawk in i control thei tawh ang ruk hnuah pawn..
step1: Dropbox kha i neih sa ka ring a kha kha set up la(hei chu poimoh lutuk lo)mahse install in setup ve re re la..(I android ah khan hemi hmang hian computer dang atang in i application duh duh kha i phone ah i va install thei)
step2: Khai le han ti tak tak ang aw….hei hi download rawh le (https://play.google.com/store/apps/details?id=com.androidlost)chuan i phone ah khan setup la install rawh.
step3:I install zawh khan personal note tih kha zawng roh chuan chhiar la allowed vek rawh le.
step4:Kha mi itih zawh hnuah hemi link ah hian lut rawh le (http://www.androidlost.com./)
step5:chuan khimi website a sir kil dinglam a chung sir ah khan (Please sign in to your Google Account
to access the AndroidLost application.Sign in) hei hi i hmu ang…i android a (play store )a in sign in nan a i hman email kha hmang la..i password nen
step6:in sign in zawh vek ah website ah khan i lut nghal ta ni chuan control ah khan han kal la option tam tak i hmu ang…i phone chu a bo ngailo ang.
a control theih te…
1.control tih hnuai ah basic category ami te
Alarm
hemi option ah hian i phone kha silent ah pawh lo dah mahse khimi control panel atang khian full volume ah a hriat loh in i dah thei a( Select seconds for alarm):
Custom Alarm
hetah hi chuan a sound ringtone atan a i duh ber i va dah thei
Vibrate
i duh ang a rei i vibrate tir thei
Location
hemi option ah hi chuan botton i click khan an awmna lai i va hrethei ang a location..gps leh mobile data a ru tu in a on lo nih pawn location hnuhnung ber alo thawn ang che
Location fixed interval
minute 5 hnu zelah a location awmna kha i va hre thei ang
2.status category a awm te
Phone Status
botton i click khan battery life engzat nge awm tih i va hrethei ang
Sound
sound kha i off in i on sak thei
Bluetooth
bluetooth on leh off na nimai
GPS
hetah tang hian i gps kha lo disable mahse i enable thei ang a location hriat nan
WIFI
wifi i on in off sak thei
List Apps
apps a install ho i hrethei
3.message category a thil awmte….
SMS post
phone number i hriat sa kha simcard dang poh lo hmang se heta tang hian i send thei:
SMS inbox and sent
heta tang hian sms 10 a thawn chhuah hnuhnung ber a hriat thei ang botton i click khan
Message Picture
hemi option ah hi chuan thu iva thawn zeuh atang khan camera khan a picture alo la nga alo thawn let ang che
Boot message
poimoh teh chiam lo hei chu
Overlay message
hepoh poimoh vaklo…mahse chhiar la website ah khan
4.security chhunga awm thil i control theih te..
Screen timeout
poimohlo
Package display
This control will hide the AndroidLost app from the application launcher. You must restart the phone in order to take effect. The purpose is to make it a little harder for a thief to find out that this app is installed by looking at the apps in the launcher. If you need to start the app you can do so from google play or the SMS command.
(hemi awmzia tak chu hemi i click khian androidlost app launcher kha a in hide thei a..a tangkai na ber chu phone rutu khan alo bengvar ve viau thei a chu mi lak ata in ven na ni..androidlost apps khi a install mai loh nan)
This control will display the AndroidLost app in the application launcher
Lock timeout
Select the lock timeout in seconds. The value 0 means default value so if you wish a quick lock you should select 1 second. This control is useful for HTC users where the pin code is first activated when the lock screen times out and not when the phone is ordered to be locked! (hemi awmzia chu a screenlock vat nan niber e.)
SIM card owner
When the app detects that an unknown SIM card has been inserted it will send a warning to the SMS notification number and start a polling service. That way you can still use both the SMS commands and web controls even if the google account on the phone has been blocked and google cannot send push messages.
(in hriat thiam ka ring khi chu..hehe)
Lock phone
If you are already using another type of lock on your phone there will be no point in using this feature.
Click the button and the phone will lock the screen with the 4 digit pincode. You must first have accepted the admin rights on the phone (cannot be initiated remote). If you leaves the pincode empty the phone will be unlocked.
(hemi option tang khian i phone kha i va lock thei ang security key awmsa khian mahse i lo nei sa toh nih si chuan a theih loh nimai)
Unlock phone
Click the button and the phone will unlocked. You must first have accepted the admin rights on the phone (cannot be initiated remote).
(admin rights chu i install dawn khan admin tih awm kha..hemi booton i click khian i phone kha in unlock ang
Erase SD Card
This will erase your SD card. No further warning will be given.(i data pawimoh zawng zawng i tibo thei heta tang hian mi dang hmuh ve i duhloh chuan)
Wipe phone
Dont use this feature unless you REALLY mean it. It will wipe your phone. You must first have accepted the admin rights on the phone (cannot be initiated remote).
Also wipe external storage (requires android 2.3)
( a thawh dan chiah kala hrebik lo tilo mai rawh i ngamloh chuan)
5.mobile category a awm te
Text to speech
hemi booton i click hian i message thawn kha robot in alo chhiar sak ang che hriat theih tur in
Dial phone
Enter keys to dial – this can be used to forward your calls. This is operator specific so you need to consult your operators forward codes.
(hei chu phone dial na leh forward calls nimai)
Hangup phone
phone dah tir na nimai..a working veklo mai thei
Call List
call list ho number kha i hmuthei ang booton i clcik khian
Sound Recording
Will record a sound file from the microphone for the selected amount of time. You must have a sound player that supports 3gpp files – for instance the VLC player. If recording is longer than two minutes it will NOT be sent to the server. You will have to fetch it from the phone in the directory /sdcard/data/system/Ellehammer/.
(sound record na nimai)
Front Camera
Click the button and the phone will take a picture with the front camera and send it to your mail. Requires android 2.3. If you have an older version of android it will default to the rear camera. And yes, I know that it is not yet perfect and there is a quick popup.
(front camera tang photo lakna a working em en ve phot la working loh chuan i android version hlui nimai)
Rear Camera
hemi hmang hian photo i va la thei bawk aa.i emai hman ah khian alo thleng ang
7.premium chhung a awmte…
Content Browser
THIS IS A PROTOTYPE. This will start a webserver on your phone. That way you can download your holiday pictures even if you have lost your phone. After starting the server on the phone you can get the link to browse it in Settings->Logs. Please note that this is a prototype and may be quite unstable. Do not expect to much. The server will automatically stop if it is not used for some time. You will loose the connection to the server if it moves between 3G and WIFI connection. Your pictures are usually stored under /sdcard/DCIM/
(hei mi option hi chu a hrethiam bik te tan ni e)
App Launcher
From this control you can launch 3rd party apps. Just enter the package name, i.e. ‘com.rovio.angrybirds’ or ‘com.domobile.ftpshare’ to start an FTP server on your device. You can find the package name in the google play url: https://play.google.com/store/apps/details?id=com.domobile.ftpshare
(heta tang hian i phone an ruk tak ami i apps te kha anihloh pon a apps install te i va hawng thei)
Contact Search
heta tang hian i contack a i hming duh ber i va zawng thei.
Capture Screenshot
Click to capture a screenshot on your device. Will be saved under /mnt/sdcard/ScreenCapture/ In a future version it will be delivered to the webpage directly but for now you must use the content browser to fetch it. Only works on old android versions like 2.3.5. I guess I am not supposed to take screenshots from the code since it is so difficult on newer versions.
(screenshot na nimai)
Reboot phone
reboot tur chuan i android kha root ngai ve tlat
Shutdown phone
shutdown na nimai
ummm kha ti zawng kha ni eee.ka lawm eee.BE SAFE….
han ti chhin vel phawt la i thiam ngang loh chuan (https://www.facebook.com/bryanlalramchhana) minlo contack dawn nia…
**A ziaktu hi techno savvy tak leh bon tak a ni a, Hacking lamah chuan mizote zinga kan neih that pawl a ni ngei ang . A hun chep tak kara thu tha tak leh bengvar thlak tak mai ,min ziah sak avangin kan lawm hle . Hacking lampang rawn post zel turin kan beisei bawk a ni . ***
Yes, we can
— V.Lalchhandama
Mizoram zirlaite hi kan thiam thei tih ka sawi duh a ni. Mizorama zir chhuak ka ni a, college ka kal hma kha chuan Mizoram pawnah lehkha ka zir ngai lo a ni. Ka graduate hnu kum khat chu a lo ni ve dawn ta reng mai a.
Tun kum chhunga ka hmuh dan chuan a tlangpuiin Mizoram zirlaite hi an fing hle a ni. Class a ka zirtir hi chu zirlaite hian an thiam tlangpui. Zirlaite hian tumruhna erawh kan mamawh. Zirlaite hian class a kan zir te hi in lamah hian ennawn leh ta ila, kan thiam phah sawt ang. Class-ah hian a rukin GATE, IITJEE leh AIEEE question hluite hi ka telh ru thin a, question hlui a nia ka tih hi chuan zirlaite hian an thiam lo tlangpui a. Mahse, hrilh miah lova “Problem chawk rawh u” ka tih hi chuan thiam vek lo mah se, a tam zawk hian an solve thei ziah. Hei hian a lantir chu confidence zirlaiten an mamawh tih a ni. Insitute thaa zir mek leh lo pass chhuak tawh zirlaite hi midang aia fing bik vak an ni lem lo. Thawhrimna leh confidence an neih avangin an tling a ni.
Chuvangin, tha takin zirlaite hian han zir ula, tin, i suangtuahna chu a tak a chang thei tih hi in ring dawn a nia. Pathian ring chung zelin han bei ula, in hlawhtling ngei ang.
** V.Lalchhandama hi tunah PUC ah Guest lecturer ni mek a ni a. Mount Carmel school atanga ,class-X a pass hnuin , St.Paul’s HSS atangin HSSLC a passed chhuak leh a ni . Technical line atang chuan M.sc integrated IIT ,Kharagpur atangin a passed chhuak bawk . Article tam zawk , a field lam kaihhnawih leh Entrance exam chunchang te rawn ziah zel a tum . **
Program to compute the fibonacci series (c++)
#include <iostream.h>
#include <conio.h>
void main()
{
clrscr();
int a,b,x,y,num1,ct;
a=0;
b=1;
cout << "Enter the number of terms (less than 25) : " << endl;
cin>>num1;
cout << a << endl;
cout << b << endl;
for(ct=1;ct<=num1-2;ct++)
{
x=a+b;
cout << x << endl;
y=a;
a=b;
b=x;
}
getch();
}
Zotechno Freaks ! 