• 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

Find the element that appears once others appears thrice

Print vertical sum of all the axis in the given binary tree

Generate next palindrome number

Python List

System Design: Designing a LLD for Hotel Booking

SAP Hiring Off-Campus General Aptitude

Find min element in Sorted Rotated Array (Without Duplicates)

The greedy coins game Dynamic Programming

Find if two rectangles overlap

Find Nearest Minimum number in left side in O(n)

Given a float number convert it into the string WITHOUT using any inbuilt Function

Subset Sum Problem Dynamic programming

LeetCode : Word Search

Stickler thief

Level order traversal in Spiral form

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

Diagonal Traversal of Binary Tree

Microsoft BING Interview Experience

Sort an array according to the order defined by another array

Right view of Binary tree

Handle duplicates in Binary Search Tree

Common Ancestor in a Binary Tree or Binary Search Tree

Find loop in Singly linked list

ADOBE Aptitude C Language Test

Code Chef PRGIFT Solution

1014 Practice Question of New GRE – Princeton

K’th Largest Element in BST when modification to BST is not allowed

Password Predictor

Introduction To Number Theory ( Part 1 )

Cisco Hiring Event 21st – 22nd Feb 2015

Copyright © 2025 · Genesis Framework · WordPress · Log in