Scribd Logo
Upload

Welcome to Scribd!

  • Before Starting Solve 2 Full Time Papers Looking Into The Books, Understanding The Concept & Formulae

    Uploaded by

    Phani Teja
    17 views6 pages
    The document provides a study plan to prepare for computer science exams over 40 days. It recommends the following: 1) Spending 15 days studying algorithms, automata theory, and discrete mathematics from various textbooks, spending 5-6 hours per day. 2) Spending 3 days studying data organization, program control, and structure from Tanenbaum's book for 8 hours per day. 3) Spending 4 days studying compilers from Ullman and Sethi for 10 hours per day, and 4 days studying operating systems from Galvin and Tanenbaum for 6 hours per day. 4) Spending 2 days studying networking from Forouzan and Tanenbaum, and 2 days studying

    Original Description:

    advice by gate Air 8

    Original Title

    Advice by Gate Air 8

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides a study plan to prepare for computer science exams over 40 days. It recommends the following: 1) Spending 15 days studying algorithms, automata theory, and discrete mathematics from various textbooks, spending 5-6 hours per day. 2) Spending 3 days studying data organization, program control, and structure from Tanenbaum's book for 8 hours per day. 3) Spending 4 days studying compilers from Ullman and Sethi for 10 hours per day, and 4 days studying operating systems from Galvin and Tanenbaum for 6 hours per day. 4) Spending 2 days studying networking from Forouzan and Tanenbaum, and 2 days studying

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    17 views6 pages

    Before Starting Solve 2 Full Time Papers Looking Into The Books, Understanding The Concept & Formulae

    Uploaded by

    Phani Teja
    The document provides a study plan to prepare for computer science exams over 40 days. It recommends the following: 1) Spending 15 days studying algorithms, automata theory, and discrete mathematics from various textbooks, spending 5-6 hours per day. 2) Spending 3 days studying data organization, program control, and structure from Tanenbaum's book for 8 hours per day. 3) Spending 4 days studying compilers from Ullman and Sethi for 10 hours per day, and 4 days studying operating systems from Galvin and Tanenbaum for 6 hours per day. 4) Spending 2 days studying networking from Forouzan and Tanenbaum, and 2 days studying

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 6

    Beforestartingsolve2fulltimepapersLookingintothebooks,understandingtheconcept&formulae

    Algorithms:
    #Horowitz&Sahanicomplete,exercise(yellowcolouredfrontpage)
    6hraday*10days
    Automatatheory:
    Cohenquiteeasy&itsgoodfortheoryaswellasproblems#Martingoodforexerciseproblems&
    youcangetthesolutionsovernetUllmangoodfortheory&somecriticalproblems&againucanget
    theans&someexercisereallyreallyimportant,gettheapproachforsolutions
    Allthreebooks5hr*10days
    Discretemathematics:(collectformulae,writethemdownonblankpages&goonpastingthemover
    roomwalls,&readthemdaily)
    #TataMcROSENsolveasmuchasucanThissinglebooktosolve5hr*10
    Graphtheorydouglaswest(first4chapters)
    Trembley&Manoher(first2chaptersaregood)
    Overall
    15days
    Dataorganization&programcontrol&structurefirsttwopoints:
    (fromstarttoend)#Tanenbaum(greencolour)complete(doorwaytouralldatastructuresrelated
    part)(trytocoveritparallelywithdatastructurepartfromsahani)
    8hr*3daysC:
    Systems:
    Compilers#Ullman,sethiPrinciplesofcompilers(espparsers&itstechniques)(verydetailed
    explanationofeverytheory)
    10hr*4days
    Operatingsystems:
    (alsocoversvirtualmemory,segmentation,paging,I/Osystesm)#Galvincomplete&verygoodfor
    synchronization(butgettheproblemsfromnetortrytosolvesyncproblemsfromdifferentpapers)
    TanenbaumMOS(modernoperatingsystems)verygoodforosexamples(paging,memory
    management,cpuscheduling&utilization)
    6hr*4hr
    Networking&distributedsystems:
    #ForouzanDatacommunication&networking(doonlynetworkingpart,&somealgorithmsare
    sensiblyexplainedinonlythisbookegswithspanningtree,execiseproblems,protocols)Alsocovers
    Internetstructures
    8hr*2days
    #Tanenbaumveryinteresting&criticalforproblemsespdatalink&networklayerproblems
    (essentialfornetproblems)
    8hr*2days
    Databases:#Navathe:goodforSQL(&forgeneralquerylanguages)&normalizationpart(itincludes
    someterrifictechniques&teststosolvenormalizationproblems)
    5hr*2days#Korth:ERmodel&Transactionmanagement
    6hr*1day
    ComputerOrganization#Zakipipelining&cache10hr*1day
    StallingsCPUdesignHenssypattersonalso
    Digitallogic6hr*2daysMorrisManoproblems
    350hrs/10hrs=35daysIsuggestgive40daystogetthoroughknowledgeHave2phases

    You might also like