java - How to make separate csv files depending upon the name of the columns from a single csv file using any programming language? -


i have 1000 csv files... looks this...

id,exam1,exam1,exam1,exam2,exam2,exam2,exam3,exam3,exam3.... lv-1,sub1,sub2,sub3,sub1,sub2,sub3,sub1,sub2,sub3....  in next line here have data.... id number , respective marks...

the problem want separate files list individual exams along id number , specific subjects.

how want example...

id,exam1,exam1 lv-1,sub3,sub2  <----- above exam1 ----->  id,exam2,exam2 lv-1,sub3,sub2  <----- above exam2 ----->

here in file 2 want marks of exam2 same stud_id number present in first column of file 1 specific subject marks...

like want exam3 , exam4 , on....

then later want all files placed in respective directories of exam1 exam2 exam3 , on...

here dont want modify original file... want extract , sort data accordingly.

if doubts let me know. know problem big believe coding can solve in seconds ^_^

any appreciated alot alot...

thanks in advance.

i wonder if want tell how or want you? language purpose. example if want use java, need loop through of .csv files in directory, parse them seperate files save in seperate directories.

things going need:

how iterate on files of directory, in java? - here's how iterate through files in directory

https://docs.oracle.com/javase/7/docs/api/java/lang/string.html - methods can use string class

https://docs.oracle.com/javase/7/docs/api/java/lang/stringbuilder.html - maybe stringbuilder useful

how create directory in java? - how create directory


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more