|
|
#21 (permalink) |
|
Retired
![]() ![]() ![]() ![]() Join Date: Feb 2006
Posts: 2,255
![]() |
_ _ _ _ SIG _ _ _ _
Admit Profiles, CS Internships, TopCoder, Programming Challenges Applying to Ph.D. Programs in Computer Science GRE Computer Science Subject Test: ETS Booklet (solutions at Yahoo GRECS group), MFT, Titanium Bits, Guide, Ullman CS Book, Algorithms, Computer Architecture, Old Links more CS practice: Stanford Comps GATE CS/IT: 2009 Solutions, GATEForum, Yahoo, Freshers, Q & A, Mock Exams & Solutions, GATEMentor |
|
|
|
|
|
#22 (permalink) |
|
I JUST got here.
Join Date: Mar 2007
Posts: 1
![]() |
although switching career 4rm one stream to another is often risky but if u have passion + dedication 4r computer science then u will excel.
start grabbin basic concepts of computer programming and computer organisation. start 4rm>>HOW COMPUTER WORKS and C++ Programming by Robert Lofor... rest u can progressssssss |
|
|
|
|
|
#23 (permalink) | |
|
I JUST got here.
Join Date: Feb 2007
Location: Chennai
Posts: 22
![]() |
Quote:
Thanks wictor, thanks for thy response, lookin fwd to suggestions n tips in future also.. |
|
|
|
|
|
|
#24 (permalink) |
|
I JUST got here.
Join Date: Feb 2007
Location: Chennai
Posts: 22
![]() |
Detailed CS GRE Syllabus
Hi, i am a non-cs guy, preparing for CS GRE ,can anyone suggest me a detailed syllabus which i should go through for my preparation. I have the overall test contents by ets ,but can anyone please tell me the detailed topics which i should emphasize on ,as the overall syllabus is quite vast.Here's the syllabus which i have:
Test Content I. SOFTWARE SYSTEMS AND METHODOLOGY (40%) A. Data organization 1. Data types. 2. Data structures and implementation techniques. B. Program control and structure 1. Iteration and recursion. 2. Procedures, functions, methods, and exception handlers. 3. Concurrency, communication, and synchronization. C. Programming languages and notation 1. Constructs for data organization and program control. 2. Scope, binding, and parameter passing. 3. Expression evaluation. D. Software engineering 1. Formal specifications and assertions. 2. Verification techniques. 3. Software development models, patterns, and tools. E. Systems 1. Compilers, interpreters, and run-time systems. 2. Operating systems, including resource management and protection/security. 3. Networking, Internet, and distributed systems. 4. Databases. 5. System analysis and development tools. II. COMPUTER ORGANIZATION AND ARCHITECTURE (15%) A. Digital logic design 1. Implementation of combinational and sequential circuits. 2. Optimization and analysis. B. Processors and control units 1. Instruction sets. 2. Computer arithmetic and number representation. 3. Register and ALU organization. 4. Data paths and control sequencing. C. Memories and their hierarchies 1. Performance, implementation, and management. 2. Cache, main and secondary storage. 3. Virtual memory, paging, and segmentation. D. Networking and communications 1. Interconnect structures (e.g., buses, switches, routers). 2. I/O systems and protocols. 3. Synchronization. E. High-performance architectures 1. Pipelining superscalar and out-of order execution processors. 2. Parallel and distributed architectures. III. THEORY AND MATHEMATICAL BACKGROUND (40%) A. Algorithms and complexity 1. Exact and asymptotic analysis of specific algorithms. 2. Algorithmic design techniques (e.g., greedy, dynamic programming, divide and conquer). 3. Upper and lower bounds on the complexity of specific problems. 4. Computational complexity, including NP-completeness. B. Automata and language theory 1. Models of computation (finite automata, Turing machines). 2. Formal languages and grammars (regular and context free). 3. Decidability. C. Discrete structures 1. Mathematical logic. 2. Elementary combinatorics and graph theory. 3. Discrete probability, recurrence relations, and number theory. IV. OTHER TOPICS (5%) Example areas include numerical analysis, artificial intelligence, computer graphics, cryptography, security, and social issues. Note: Students are assumed to have mathematical background in the areas of calculus and linear algebra as applied to computer science. Looking forward to your responses, Thanks in advance. |
|
|
|
|
|
#26 (permalink) | ||
|
Retired
![]() ![]() ![]() ![]() Join Date: Feb 2006
Posts: 2,255
![]() |
Quote:
Of course, the best way to get a sense of how the topics are covered is to review the previously published ETS exams, including: 2003 (the current one at ETS.org) 2001, 1999, 1994 (all available at the Yahoo GRECS group, which also provides solutions to 2001 & 2003) If you haven't already, I recommend you print out all of the previous GRE CS exams, Titanium Bits, the Mock GRE CS, and some of the GRE CS study guides, especially this one: gre-notes.pdf I would then put them in a binder and start stuyding from them today, even though you aren't taking the exam until at least November. Statistically, someone who doesn't have a CS background will find it difficult to obtain even an average score of 50th percentile on the GRE CS. This test is hard for CS students and super hard for non-CS students, especially me. So, if you don't score well on the practice tests in the ETS booklets, you may want to consider not even bothering with this exam and taking some of your colleague's advice, e.g. you don't need to get an MS to obtain an IT job and get a visa in the US/UK. My perspective on the exam's difficulty: Quote:
_ _ _ _ SIG _ _ _ _
Admit Profiles, CS Internships, TopCoder, Programming Challenges Applying to Ph.D. Programs in Computer Science GRE Computer Science Subject Test: ETS Booklet (solutions at Yahoo GRECS group), MFT, Titanium Bits, Guide, Ullman CS Book, Algorithms, Computer Architecture, Old Links more CS practice: Stanford Comps GATE CS/IT: 2009 Solutions, GATEForum, Yahoo, Freshers, Q & A, Mock Exams & Solutions, GATEMentor Last edited by CalmLogic : 2007 April 4th at 09:32 PM. |
||
|
|
|
|
|
#27 (permalink) |
|
I JUST got here.
Join Date: Feb 2007
Location: Chennai
Posts: 22
![]() |
Thanks man..
Thanks for a giving me a true picture , because of my wrk i am not able to do much of a prep. as of now, but i jus wanna give it a shot, i think i shud grasp the fundamentals and concepts of the core subjects n then maybe the last two months before the exam i can attempt all the questions in various books n study guides.Thanks once again n looking fwd to thy help n support in the future as well.
Deeps. |
|
|
|
|
|
#28 (permalink) | |
|
Retired
![]() ![]() ![]() ![]() Join Date: Feb 2006
Posts: 2,255
![]() |
Quote:
Studying for 2 months or less is okay if you spent 2 years at MIT studying computer science as an undergrad. However, without a formal CS background, if you only study 2 months prior to the exam, you will likely get below 50th percentile unless you are a math / computer science genius.
_ _ _ _ SIG _ _ _ _
Admit Profiles, CS Internships, TopCoder, Programming Challenges Applying to Ph.D. Programs in Computer Science GRE Computer Science Subject Test: ETS Booklet (solutions at Yahoo GRECS group), MFT, Titanium Bits, Guide, Ullman CS Book, Algorithms, Computer Architecture, Old Links more CS practice: Stanford Comps GATE CS/IT: 2009 Solutions, GATEForum, Yahoo, Freshers, Q & A, Mock Exams & Solutions, GATEMentor |
|
|
|
|
|
|
#29 (permalink) |
|
I JUST got here.
Join Date: Feb 2007
Location: Chennai
Posts: 22
![]() |
Hi there u r rite, ya i am preparing from now onwards, rather trying to prepare..
n sure i am not a math / computer science genius ; so u mean i shud prepare the questions from now , i am askin this because, i dont know any thing about some of those questions , so wont it be good to learn the subjects throughly, n then attempt the questions, dont u think if i prepare the subjects nicely, i will be able to answer some questions?? or shud i refer to the questions the the learn the topic concerning the question as i encounter them, but this kind of study wont have any continuity i guess, so por favor, El Seņor advice, u r more experienced n have more knowledge in this regard so what u say ,i will follow that method. Thanks. |
|
|
|
|
|
#30 (permalink) | |
|
Retired
![]() ![]() ![]() ![]() Join Date: Feb 2006
Posts: 2,255
![]() |
Quote:
When I studied for the last exam, I made a spreadsheet file that listed all of the problems/topics I needed to learn. I added items to this list as I took the practice tests. I had the list sorted by priority, with topics that I needed to cover the most being listed at the top.
_ _ _ _ SIG _ _ _ _
Admit Profiles, CS Internships, TopCoder, Programming Challenges Applying to Ph.D. Programs in Computer Science GRE Computer Science Subject Test: ETS Booklet (solutions at Yahoo GRECS group), MFT, Titanium Bits, Guide, Ullman CS Book, Algorithms, Computer Architecture, Old Links more CS practice: Stanford Comps GATE CS/IT: 2009 Solutions, GATEForum, Yahoo, Freshers, Q & A, Mock Exams & Solutions, GATEMentor |
|
|
|
|
Contact TestMagic TestMagic Forums Archive Privacy Statement
TestMagic Locations
Legal
Privacy
SEO by vBSEO 3.2.0
Copyright © 2009 TestMagic
Ad Management by RedTyger