#1
23rd April 2010, 07:52 PM
|
|||
|
|||
Notes for SET exam in computer science?
HI
Is anybody having notes for SET exam in computer science? OR any coachig classes available for the same. If yes then plz forword me. |
#2
30th April 2010, 04:39 PM
|
|||
|
|||
![]()
you can get the Notes for SET exam in computer science from the links mentioned below :-
download-book.net/BOOK-FOR-SET-EXAM-OF-COMPUTER-SCIENCE-pdf.html www.psexam.com/ www.ebookpdf.net/__notes-for-set-net-exam-computer-science_ebook_.html download and study well for the exam..........as these notes are really very helpful....... all the best.... |
#3
10th May 2010, 10:30 AM
|
|||
|
|||
![]()
dear friend
you can refer various books available on market as well refer the material provided in the given links,to get a notes of SET exams in computer science. http://www.want2learn.com/exams/ugc_net_...ience.html http://examrace.com/UGCstudymaterial.aspx. ok all the best. |
#8
14th August 2010, 12:09 AM
|
|||
|
|||
![]()
some of the imporatnt portions are:
Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security. Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control. Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. |
#9
15th August 2010, 04:23 PM
|
|||
|
|||
![]()
scientist entry test is same as your syllabus is as given below:
COMPUTER SCIENCE AND ENGINEERING Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability; NPcompleteness. Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point). Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage. Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps. Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization. Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security. Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control. Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. |
#10
16th August 2010, 04:00 PM
|
|||
|
|||
![]()
Tell me where are you from so that I could tell you the coaching classes details near you. And you can also contact me for SET Notes. My email ID is: hsakapandit@gmail.com
|
#12
8th September 2010, 01:53 AM
|
|||
|
|||
![]()
Dear friend,
State Eligibility Test(SET) is basically an examination for lectureship in Universities and Institutes . According to me if you have the basic concept on the main subjects ,I think there will not be problem to clear the exam. According to the syllabus of the exam you should give emphasize on some important parts of Computer Sc. such as : 1:Operating System(OS), 2 ![]() 3:Algorithms, 4:Compiler Design, 5:Automata, 6 ![]() 7:Computer Architecture & Organization. etc.... 8:Computer Network. for the practice set of the SET exam visit the link http://examcrazy.com/ano_utils/User_AppearInTest2.asp?crsId=121, then for that you have register in www.examcrazy.com. Beside this for study materials visit:www.psexam.com; www.ebookpdf.net/__notes-for-set-net-exam-computer-science_ebook_.html Good luck. |
#17
30th January 2011, 04:35 PM
|
|||
|
|||
![]()
Dear,
According to me - you can get the Notes for SET exam in computer science from the links mentioned below :- download-book.net/BOOK-FOR-SET-EXAM-OF-COMPUTER-SCIENCE-pdf.html www.psexam.com/ www.ebookpdf.net/__notes-for-set-net-exam-computer-science_ebook_.html download and study well for the exam..........as these notes are really very helpful....... Thanks All the best. |
Related Topics: |
||
Thread | Replies | Last Post |
By opting for Computer Science in AIEEE would I be restricted to pursue Computer Science Engineering later? | 34 | 15th September 2012 11:41 PM |
|