• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

C Program for TAIL command of UNIX

April 27, 2015 by Dhaval Dave

/*
* usage: myTail [-n] [<filename>] */

#include <stdio.h>
#include <stdlib.h>

#define MAX_LINE_LEN 1024
#define DEFAULT_N 10

int main(int argc, char *argv[]) {
char **tail;
int count = DEFAULT_N, n, i, headX = 0, tailX = 0, z = 1;

/* Validate command line arguments, if any. */
/* 2 or more args; 1st argument may be -n, the count */ 

 if (argc >= 2) {
   if ((sscanf(argv[1], "%d", &n) == 1) && (n < 0)) {
   count = -n; /* save size of tail */
   z = 2; /* check argv[2], if present, for filename */
   }
/* 1st or 2nd arg may be the filename */
 if ((z < argc) && (freopen(argv[z], "r", stdin) == NULL)) {
   fprintf(stderr, "%s not found.\n", argv[z]);
 }
}

/* Allocate space for tail buffer */
 tail = calloc(count, sizeof(char *));

 for (i = 0; i < count; i++) {
   tail[i] = calloc(MAX_LINE_LEN, sizeof(char));
 }

/* Fill circular tail buffer until EOF */

while (fgets(tail[tailX], MAX_LINE_LEN, stdin) != NULL) {
   tailX = (tailX + 1) % count;
   if (tailX == headX) {
     headX = (headX + 1) % count; 
   }
 }

/* Display tail */
i = tailX;
do {
  printf("%s", tail[i]);
  i = (i + 1) % count;
  } while (i != tailX);

return 0;
}

 

Sample runs (before this ‘#if 0’ text added):

$ ./myTail -7 myTail.c

Similar Articles

Filed Under: Adobe Interview Questions, Interview Questions, problem Tagged With: c, Unix

Reader Interactions

Comments

  1. Petra says

    August 2, 2015 at 9:50 am

    gohired.in has potential, you can make your page go viral easily
    using one tricky method. Just type in google:
    Kimting’s Method To Go Viral

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Number of Islands BFS/DFS

Practo Hiring Experience

SAP Interview Questions

Client Server C program

LeetCode: Container With Most Water

Generate largest number arranging a no. of given non negative integer numbers

Longest Increasing Subsequence

Print Power Set of a Set

VMWare SDEII Interview

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Difference between a LinkedList and a Binary Search Tree BST

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Interfaces in C++ (Abstract Classes in C++)

Sort an array according to the order defined by another array

Find two non repeating elements in an array of repeating elements

25 horses 5 tracks Find 3 fastest puzzle

Handle duplicates in Binary Search Tree

Flipkart Set 1 On Campus with Answers

How strtok() Works

Calculate price of parking from parking start end time prices

Circular Linked List

BlueStone E-commerce Interview Experience

Coin Collection Dynamic Programming

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Find if a binary tree is height balanced ?

Subset Sum Problem Dynamic programming

Daughter’s Age VeryGood Puzzle

Find position of the only set bit

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Copyright © 2026 · Genesis Framework · WordPress · Log in