Week13

 import java.io.File;  

public class DisplayFileExample  

{  

public void printFileNames(File[] a, int i, int lvl)  

{  

// base case of the recursion  

// i == a.length means the directory has   

// no more files. Hence, the recursion has to stop  

if(i == a.length)  

{  

return;  

}  

// checking if the encountered object is a file or not  

if(a[i].isFile())  

{  

System.out.println(a[i].getName());  

}  

// recursively printing files from the directory  

// i + 1 means look for the next file  

printFileNames(a, i + 1, lvl);  

}  

// Main Method  

public static void main(String[] argvs)  

{  

// Providing the full path for the directory  

String path = "E:\\Documents";  

// creating a file object  

File fObj = new File(path);  

// creating on object of the class DisplayFileExample  

DisplayFileExample obj = new DisplayFileExample();  

if(fObj.exists() && fObj.isDirectory())  

{  

// array for the files of the directory pointed by fObj  

File a[] = fObj.listFiles();  

// display statements  

System.out.println("= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =");  

System.out.println("Displaying Files from the directory : " + fObj);  

System.out.println("= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =");  

// Calling the method  

obj.printFileNames(a, 0, 0);  

}  

}  

}  

Comments

Post a Comment

Popular posts from this blog

Create and Insert data in circular linked list

  #include <stdio.h> #include <stdlib.h> // Create a node struct Node {   int data;   struct Node* next; }; // Insert at the beginning void insertAtBeginning(struct Node** head_ref, int new_data) {   // Allocate memory to a node   struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));   // insert the data   new_node->data = new_data;   new_node->next = (*head_ref);   // Move head to new node   (*head_ref) = new_node; } // Insert a node after a node void insertAfter(struct Node* prev_node, int new_data) {   if (prev_node == NULL) {   printf("the given previous node cannot be NULL");   return;   }   struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));   new_node->data = new_data;   new_node->next = prev_node->next;   prev_node->next = new_node; } // Insert the the end void insertAtEnd(struct Node** head_ref, int new_data) {   struct Node* n...
Read more

Week2

 abstract class Shape { public int x, y; public abstract void printArea(); } class Rectangle extends Shape { public void printArea() { System.out.println("Area of Rectangle is " + x * y); } } class Triangle extends Shape { public void printArea() { System.out.println("Area of Triangle is " + (x * y) / 2); } } class Circle extends Shape { public void printArea() { System.out.println("Area of Circle is " + (22 * x * x) / 7); } } public class Abstex { public static void main(String[] args) { Rectangle r = new Rectangle (); r.x = 10; r.y = 20; r.printArea(); System.out.println(" "); Triangle t = new Triangle(); t.x =30; t.y =35; t.printArea(); System.out.println(" "); Circle c = new Circle(); c.x = 2; c.printArea(); System.out.println(" "); } }
Read more