Skip to main content

Posts

Showing posts from 2012

What is the optimum way to find the middle node in a single linked list using C?

What is the optimum way to find the middle node in a single linked list using C? There are two ways Method 1 1- Iterate through the link list to find the number of nodes in it (say n) 2- Start from the root of the list and travel as far as n/2 The other method is a bit tricky Method 2 1- Start with two pointers both pointing to root 2- Now make one traverse the link list one node at a time 3- Make the other traverse the link list 2 nodes at a time At the time, the 2nd pointer reaches the end, the 1st pointer would only have reached the mid The 1st method is optimized for memory and the 2nd one for concurrent traversal and speed

TechBytes on Linux

This is a growing list of Linux commands which might come handy for the newbies of Linux. 1. Found out i had to set the date like this:    # date -s 2007.04.08-22:46+0000 2. Mounting     sudo mount -t cifs // < pingable_host_or_ip > / < win_share_name > /build -o user= ,domain= ,uid=string,gid=string 3. To install linux packages from internet (ubuntu only)     apt-get install 4. To determine what ports the machine is currently listening on     netstat -an | grep -i listen | less 5. Find in files in Linux     find . | xargs grep 'string' -sl 6. To become superuser/root     sudo -i 7. To find a running process using name ps -aef | grep "searchstring" 8. Alt + F2 opens run window in RHEL 9. To access windows share from linux smb:// /d$ 10. To know the last reboot date & time $ last reboot | head -1 11. To install RPM packages in RHEL rpm -ivh 12. To un-install RPM package in RHEL rpm -e 13. To display Linux Kerne