Go Back   2022-2023 StudyChaCha > StudyChaCha Discussion Forum > General Topics

  #1  
Old December 30th, 2013, 05:37 PM
Super Moderator
 
Join Date: Jun 2013
Default

I am looking for the syllabus for the NET computer science examination organized by the University grant commission ??

As you need the UGC NET Computer Science question paper, here I am providing you UGC NET computer science study material . There are objective types of the questions available.

1. Consider the circuit shown below. In a
certain steady state, Y is at logical l.
What are possible values of A, B, C ?
(A) A = 0, B = 0, C = 1
(B) A = 0, B = C = 1
(C) A = 1, B = C = 0
(D) A = B = 1, C = 1
2. The worst case time complexity of
AVL tree is better in comparison to
binary search tree for
(A) Search and Insert Operations
(B) Search and Delete Operations
(C) Insert and Delete Operations
(D) Search, Insert and Delete
Operations
3. The GSM network is divided into the
following three major systems :
(A) SS, BSS, OSS
(B) BSS, BSC, MSC
(C) CELL, BSC, OSS
(D) SS, CELL, MSC
4. The power set of the set {} is
(A) {}
(B) {, {}}
(C) {0}
(D) {0, , {}}
5. If the disk head is located initially at
32, find the number of disk moves
required with FCFS if the disk queue
of I/O blocks requests are 98, 37, 14,
124, 65, 67.
(A) 239
(B) 310
(C) 321
(D) 325
6. Component level design is concerned
with
(A) Flow oriented analysis
(B) Class based analysis
(C) Both of the above
(D) None of the above
7. The ‘C’ language is
(A) Context free language
(B) Context sensitive language
(C) Regular language
(D) None of the above
8. The Mobile Application Protocol
(MAP) typically runs on top of which
protocol ?
(A) SNMP (Simple Network
Management Protocol)
(B) SMTP (Simple Mail Transfer
Protocol)
(C) SS7 (Signalling System 7)
(D) HTTP (Hyper Text Transfer
Protocol)
COMPUTER SCIENCE AND APPLICATIONS
Paper – II
Note : This paper contains fifty (50) objective type questions of two (2) marks each. All
questions are compulsory.
9. If a packet arrive with an M-bit value
is ‘l’ and a fragmentation offset value
‘0’, then it is ______ fragment.
(A) First
(B) Middle
(C) Last
(D) All of the above
10. The number of bit strings of length
eight that will either start with a 1 bit
or end with two bits 00 shall be
(A) 32
(B) 64
(C) 128
(D) 160
11. In compiler design ‘reducing the
strength’ refers to
(A) reducing the range of values of
input variables.
(B) code optimization using cheaper
machine instructions.
(C) reducing efficiency of program.
(D) None of the above
12. In which addressing mode, the
effective address of the operand is
generated by adding a constant value to
the contents of register ?
(A) Absolute
(B) Indirect
(C) Immediate
(D) Index
13. Which of the following is true ?
(A) A relation in BCNF is always in
3NF.
(B) A relation in 3NF is always in
BCNF.
(C) BCNF and 3NF are same.
(D) A relation in BCNF is not in
3NF.
14. Given memory partitions of 100 K,
500 K, 200 K, 300 K and 600 K (in
order) and processes of 212 K, 417 K,
112 K, and 426 K (in order), using the
first-fit algorithm, in which partition
would the process requiring 426 K be
placed ?
(A) 500 K
(B) 200 K
(C) 300 K
(D) 600 K
15. What is the size of the Unicode
character in Windows Operating
System ?
(A) 8-Bits
(B) 16-Bits
(C) 32-Bits
(D) 64-Bits
16. In which tree, for every node the height
of its left subtree and right subtree
differ almost by one ?
(A) Binary search tree
(B) AVL tree
(C) Threaded Binary Tree
(D) Complete Binary Tree
17. The design issue of Datalink Layer in
OSI Reference Model is
(A) Framing
(B) Representation of bits
(C) Synchronization of bits
(D) Connection control
19. The maturity levels used to measure a
process are
(A) Initial, Repeatable, Defined,
Managed, Optimized.
(B) Primary, Secondary, Defined,
Managed, Optimized.
(C) Initial, Stating, Defined,
Managed, Optimized.
(D) None of the above
20. The problem of indefinite blockage of
low-priority jobs in general priority
scheduling algorithm can be solved
using :
(A) Parity bit
(B) Aging
(C) Compaction
(D) Timer
21. Which API is used to draw a circle ?
(A) Circle ( )
(B) Ellipse ( )
(C) Round Rect ( )
(D) Pie ( )
22. In DML, RECONNCT command
cannot be used with
(A) OPTIONAL Set
(B) FIXED Set
(C) MANDATOR Set
(D) All of the above
23. Coaxial cables are categorized by
Radio Government rating are adapted
for specialized functions. Category
RG-59 with impedance 75  used for
(A) Cable TV
(B) Ethernet
(C) Thin Ethernet
(D) Thick Ethernet
24. RAD stands for ______.
(A) Rapid and Design
(B) Rapid Aided Development
(C) Rapid Application Development
(D) Rapid Application Design
25. Suppose that someone starts with a
chain letter. Each person who receives
the letter is asked to send it on to 4
other people. Some people do this,
while some do not send any letter.
How many people have seen the letter,
including the first person, if no one
receives more than one letter and if the
chain letter ends after there have been
100 people who read it but did not send
it out ? Also find how many people
sent out the letter ?
(A) 122 & 22
(B) 111 & 11
(C) 133 & 33
(D) 144 & 44
26. A hash function f defined as f (key) =
key mod 13, with linear probing is
used to insert keys 55, 58, 68, 91, 27,
145. What will be the location of 79 ?
(A) 1
(B) 2
(C) 3
(D) 4
27. Which of the following is true while
converting CFG to LL(I) grammar ?
(A) Remove left recursion alone
(B) Factoring grammar alone
(C) Both of the above
(D) None of the above
28. Identify the Risk factors which are
associated with Electronic payment
system.
(A) Fraudulent use of Credit Cards.
(B) Sending Credit Card details over
internet.
(C) Remote storage of Credit Card
details.
(D) All of the above
29. Which of the following are two special
functions that are meant for handling
exception, that occur during exception
handling itself ?
(A) Void terminate ( ) and Void
unexpected ( )
(B) Non void terminate ( ) and void
unexpected ( )
(C) Void terminate ( ) and non void
unexpected ( )
(D) Non void terminate ( ) and non
void unexpected ( )
30. Which of the following memory
allocation scheme suffers from external
fragmentation ?
(A) Segmentation
(B) Pure demand paging
(C) Swapping
(D) Paging
31. Basis path testing falls under
(A) system testing
(B) white box testing
(C) black box testing
(D) unit testing
32. The User Work Area (UWA) is a set
of Program variables declared in the
host program to communicate the
contents of individual records between
(A) DBMS & the Host record
(B) Host program and Host record
(C) Host program and DBMS
(D) Host program and Host language
33. Consider the tree given below :
Using the property of eccentricity of a
vertex, find every vertex that is the
centre of the given tree.
(A) d & h
(B) c & k
(C) g, b, c, h, i, m
(D) c & h
34. The maximum number of keys stored
in a B-tree of order m and depth d is
(A) md + 1 – 1
(B)
md+1 – 1
m – 1
(C) (m – 1) (md + 1 – 1)
(D)
md – 1
m – 1
35. Which of the following is the most
powerful parring method ?
(A) LL(I)
(B) Canonical LR
(C) SLR
(D) LALR
36. In UNIX, which of the following
command is used to set the task
priority ?
(A) init
(B) nice
(C) kill
(D) PS
37. AES is a round cipher based on the
Rijndal Algorithm that uses a 128-bit
block of data. AES has three different
configurations. ______ rounds with a
key size of 128 bits, ______ rounds
with a key size of 192 bits and ______
rounds with a key size of 256 bits.
(A) 5, 7, 15
(B) 10, 12, 14
(C) 5, 6, 7
(D) 20, 12, 14
38. Match the following IC families with
their basic circuits :
a. TTL 1. NAND
b. ECL 2. NOR
c. CMOS 3. Inverter
Code :
a b c
(A) 1 2 3
(B) 3 2 1
(C) 2 3 1
(D) 2 1 3
39. Match the following with respect to
C++ data types :
a. User defined type 1. Qualifier
b. Built in type 2. Union
c. Derived type 3. Void
d. Long double 4. Pointer
Code :
a b c d
(A) 2 3 4 1
(B) 3 1 4 2
(C) 4 1 2 3
(D) 3 4 1 2
40. Given an empty stack, after performing
push (1), push (2), Pop, push (3), push
(4), Pop, Pop, push(5), Pop, what is the
value of the top of the stack ?
(A) 4
(B) 3
(C) 2
(D) 1
41. Enumeration is a process of
(A) Declaring a set of numbers
(B) Sorting a list of strings
(C) Assigning a legal values possible
for a variable
(D) Sequencing a list of operators
42. Which of the following mode
declaration is used in C++ to open a
file for input ?
(A) ios : : app
(B) in : : ios
(C) ios : : file
(D) ios : : in
43. Data Encryption Techniques are
particularly used for ______.
(A) protecting data in Data
Communication System.
(B) reduce Storage Space
Requirement.
(C) enhances Data Integrity.
(D) decreases Data Integrity.
44. Let L be a set accepted by a non- deterministic finite automaton. The
number of states in non-deterministic
finite automaton is |Q|. The maximum
number of states in equivalent finite
automaton that accepts L is
(A) |Q|
(B) 2|Q|
(C) 2|Q| – 1
(D) 2|Q|
45. What is the result of the following
expression ?
49. Identify the operation which is
commutative but not associative ?
(1 & 2) + (3 & 4) (A) OR
(A) 1 (B) NOR
(B) 3 (C) EX-OR
(C) 2 (D) NAND
(D) 0
50. Given a Relation POSITION (Posting-
No, Skill), then query to retrieve all
distinct pairs of posting-nos. requiring
skill is
46. Back propagation is a learning
technique that adjusts weights in the
neural network by propagating weight
changes. (A) Select p.posting-No, p.posting-
No (A) Forward from source to sink
from position p (B) Backward from sink to source
where p.skill = p.skill (C) Forward from source to hidden
nodes and p.posting-No < p.posting-No
(D) Backward from since to hidden
nodes
(B) Select p1.posting-No, p2.posting-
No
47. Match the following : from position p1, position p2
a. TTL 1. High fan out
b. ECL 2. Low propagation delay
c. CMOS 3. High power dissipation
where p1.skill = p2.skill
(C) Select p1.posting-No, p2.posting-
No
Code :
a b c
from position p1, position p2
(A) 3 2 1
where p1.skill = p2.skill (B) 1 2 3
and p1.posting-No < p2.posting-
No
(C) 1 3 2
(D) 3 1 2
(D) Select p1.posting-No, p2.posting-
No
48. ______ is an “umbrella” activity that is
applied throughout the software
engineering process. from position p1, position p2
(A) Debugging
where p1.skill = p2.skill
(B) Testing
and p1.posting-No = p2.posting-
No
(C) Designing
(D) Software quality assurance


The syllabus covers following topics:


Paper I
Teaching and Research Aptitude(General Paper).

Paper II
Discrete Structures.
Computer Arithmetic.
Programming in C and C++.
Relational Database Design and SQL.
Data and File Structures.
Computer Networks.
System Software and Compilers.
Operating Systems with Case Study of Unix.
Software Engineering.
Current Trends and Technologies.

Paper III - Core Group
Digital Systems and Microprocessors.
Data Base Management Systems.
Computer Graphics.
Programming Concepts.
Data Communication and Networks.
Data Structures and Algoritms.
OOP and Web Technologies.
Advanced Software Engineering.
Operating Systems.
Artificial Intelligence.

Paper III - Elective/Optional
Finite Automata and Formal Languages.
Information Theory and Coding.
Operation Research.
Neural Networks and Fuzzy Systems.
Unix and Windows.

Last edited by Aakashd; June 1st, 2019 at 10:09 AM.
Reply With Quote
Other Discussions related to this topic
Thread
Computer Science UGC NET Study Material
Study Material for UGC NET Computer Science
Computer Science NET Exam Study Material
University Grants Commission NET Computer Science study material
Life Science Exam Study Material
NET exam free study material for computer science and applications?
Study Material For Computer Knowledge/Marketing for SBI Clerk Exam
Computer Science and Engineering Study material PGCET
UGC NET computer science exam Study material
GATE Computer Science stream Study material
UGC-NET study material of computer science
Study material for Agricultural Science asrb net examination
University Grants Commission NET Computer Science and Applications study material fre
Material for UGC NET Computer science
Class 12 science study Material download
Computer Science Applications UGC NET Exam Study material
Study Material for Entrance Exam for Msc in Material Science
Ace Academy Computer Science GATE study material cost
Study Material For Gate Computer Science and IT
Gate Study Material for Computer Science






  #2  
Old December 31st, 2013, 10:31 AM
Super Moderator
 
Join Date: Jun 2013
Default Re: UGC-NET Computer Science Study Material

Here I am giving you information about the syllabus for the NET computer science examination organized by the University grant commission ..

UGC-NET Computer Science syllabus :
Computer Arithmetic
Propositional (Boolean), Predicate Logic, Well-formed-formulae (WFF), Satisfiability and Tautology
Logic Families

TTL, ECL and C-MOS gates. Boolean algebra and Minimization of Boolean functions, Flip-flops-types, race condition and comparison. Design of combinational and sequential circuits
Representation of integers

Octal, Hex, Decimal, and Binary. 2's complement and 1's complement arithmetic. Floating point representation

Computer Graphics
Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation, Graphic standard, Applications
Concepts, Storage Devices, Input Tools, Authoring Tools, Application. Files

Artificial Intelligence

Definitions. AI approach for solving problems
Automated Reasoning with propositional logic and predicate logic- fundamental proof procedure, refutation. resolution, refinements to resolution (ordering/pruning/restriction strategies)

State space representation of problems, bounding functions, breadth first, depth first, A, A*, AO*, etc. Performance comparison of various search techniques

Frames, scripts, semantic nets, production systems, procedural representations. Prolog programming

Components of an expert system, Knowledge representation and Acquisition techniques, Butlding expert system and Shell

RTNS. ATNS, Parsing of Ambiguous CFG's. Tree Adjoining Grammars (TAGs). Systems approach to planning, Designing; Development, Implementation and evaluation of MIS

Decision-making processes, evaluation of DSS, Group decision support system and case studies; Adaptive design approach to DSS development, Cognitive style in DSS, Integrating expert and Decision support systems

Windows
Windows environment, Unicode, Documents and Views, Drawing in a window, Message handling, Scrolling and Splitting views, Docking toolbars and Status bars, Common dialogs and Controls, MDI, Multithreading, OLE, Active X controls, ATL, Database access, Network programming.

Programming in C and C++
Programming in C
Elements of C: Tokens, identifiers, data types in C. Control structures in C: Sequence, selection and iteration(s). Structured data types in C: arrays, struct, union, string, and pointers

Elements of C:
Tokens: tokens are the basic elements of C language programming. there are six types of Tokens.

1. Identifiers 2. Constants 3. Keywords 4. Escape Sequences 5. Data Types 6. Variables
C++ Programming
Elements of C++ - Tokens, identifiers. Variables and constants, data types, Operators, Control statements. functions, parameter passing, Class and objects. Constructors and destructors. Overloading, Inheritance, templates, Exception handling
__________________
Answered By StudyChaCha Member
Reply With Quote
  #3  
Old January 14th, 2014, 09:41 AM
Unregistered
Guest
 
Default UGC NET Computer Science Study Material

Will you please provide here the University Grants Commission National Eligibility Test Computer Science Study Material like question paper?
Reply With Quote
  #4  
Old January 14th, 2014, 10:59 AM
Super Moderator
 
Join Date: Jun 2013
Default Re: UGC NET Computer Science Study Material

The University Grants Commission National Eligibility Test for Computer Science questions are:

1. A file is downloaded in a home
computer using a 56 kbps MODEM
connected to an Internet Service
Provider. If the download of file
completes in 2 minutes, what is the
maximum size of data downloaded ?
(A) 112 Mbits (B) 6.72 Mbits
(C) 67.20 Mbits (D) 672 Mbits

2. In ______ CSMA protocol, after the
station finds the line idle, it sends or
refrains from sending based on the
outcome of a random number generator.
(A) Non-persistent
(B) 0-persistent
(C) 1-persistent
(D) p-persistent

3. Which of the following substitution
technique have the relationship
between a character in the plaintext
and a character in the ciphertext as
one-to-many ?
(A) Monoalphabetic
(B) Polyalphabetic
(C) Transpositional
(D) None of the above

4. What is the maximum length of
CAT-5 UTP cable in Fast Ethernet
network ?
(A) 100 meters (B) 200 meters
(C) 1000 meters (D) 2000 meters

5. The ______ is a set of standards that
defines how a dynamic web document
should be written, how input data
should be supplied to the program, and
how the output result should be used.
(A) Hyper Text Markup Language
(B) File Transfer Protocol
(C) Hyper Text Transfer Protocol
(D) Common Gateway Interface

6. The count-to-infinity problem is
associated with
(A) Flooding algorithm
(B) Hierarchical routing algorithm
(C) Distance vector routing
algorithm
(D) Link state routing algorithm

7. The IEEE single-precision and
double-precision format to represent
floating-point numbers, has a length
of ______ and ______ respectively.
(A) 8 bits and 16 bits
(B) 16 bits and 32 bits
(C) 32 bits and 64 bits
(D) 64 bits and 128 bits

8. Consider an undirected graph G with
100 nodes. The maximum number of
edges to be included in G so that the
graph is not connected is
(A) 2451 (B) 4950
(C) 4851 (D) 9900

9. The amortized time complexity to
perform ______ operation(s) in Splay
trees is O(Ig n).
(A) Search
(B) Search and Insert
(C) Search and Delete
(D) Search, Insert and Delete

For detailed paper here is attachment:
Attached Files Available for Download
File Type: pdf UGC NET CS Question Paper.pdf (201.6 KB, 83 views)
__________________
Answered By StudyChaCha Member
Reply With Quote
  #5  
Old January 25th, 2014, 12:11 PM
Unregistered
Guest
 
Default UGC NET Computer Science Study Material

Can you provide me the study material of UGC NET Computer Science
Reply With Quote
  #6  
Old January 25th, 2014, 01:26 PM
Sashwat's Avatar
Super Moderator
 
Join Date: Jun 2011
Default Re: UGC NET Computer Science Study Material

UGC, along with CSIR currently conducts NET for appointments of teachers in colleges and universities. It has made NET qualification mandatory for teaching at Graduation level and at Post Graduation level since July 2009. However, those with Ph.D are given five percent relaxation.

Study Material:

There are many subjects under Computer Science and it is not possible to provide the study material of all the subjects. So here I am mentioning the syllabus of the following subjects:

Subjects under Computer Science:

Artificial Intelligence (AI)
Computer Arithmetic
Computer Graphics (CG)
Current Trends and Technologies
DataBase Management Systems (DBMS)
Data Communication and Networks
Data Structures and Algorithms (DSA)
Digital Systems and Microprocessors
Discrete Structures (DS)
Finite Automata and Formal Languages (FA)
Information Theory and Coding
Neural Networks and Fuzzy Systems
Object Oriented Programming (OOP)
Operation Research (OR)
Operating Systems (OS)
Programming Concepts
Programming in C and C++
Software Engineering (SE)
System Software and Compilers
Teaching and Research Aptitude
Unix
Web Technologies
Windows

Syllabus:

Artificial Intelligence

Definitions. AI approach for solving problems

Automated Reasoning with propositional logic and predicate logic- fundamental proof procedure, refutation. resolution, refinements to resolution (ordering/pruning/restriction strategies)

State space representation of problems, bounding functions, breadth first, depth first, A, A*, AO*, etc. Performance comparison of various search techniques

Frames, scripts, semantic nets, production systems, procedural representations. Prolog programming

Components of an expert system, Knowledge representation and Acquisition techniques, Butlding expert system and Shell

RTNS. ATNS, Parsing of Ambiguous CFG's. Tree Adjoining Grammars (TAGs). Systems approach to planning, Designing; Development, Implementation and evaluation of MIS

Decision-making processes, evaluation of DSS, Group decision support system and case studies; Adaptive design approach to DSS development, Cognitive style in DSS, Integrating expert and Decision support systems

Computer Arithmetic


Propositional (Boolean), Predicate Logic, Well-formed-formulae (WFF), Satisfiability and Tautology
Logic Families

TTL, ECL and C-MOS gates. Boolean algebra and Minimization of Boolean functions, Flip-flops-types, race condition and comparison. Design of combinational and sequential circuits
Representation of integers

Octal, Hex, Decimal, and Binary. 2's complement and 1's complement arithmetic. Floating point representation

I am up loading a file which has the syllabus of all the subjects and which you can download for free:
Attached Files Available for Download
File Type: doc UGC NET Computer Science Study Material.doc (35.0 KB, 95 views)
__________________
Answered By StudyChaCha Member
Reply With Quote
  #7  
Old January 28th, 2014, 11:31 AM
Unregistered
Guest
 
Default UGC NET computer science study material

Here I am looking for the UGC NET Computer Science question paper, can you provide me the same???
Reply With Quote
  #8  
Old October 9th, 2015, 02:17 PM
Unregistered
Guest
 
Default Re: UGC-NET Computer Science Study Material

hii sir, I am preparing for the UGC-Net Examination please provide me the syllabus of the stream Computer Science ?
Reply With Quote
  #9  
Old October 9th, 2015, 02:22 PM
Super Moderator
 
Join Date: Jun 2013
Default Re: UGC-NET Computer Science Study Material

As you asking for the Syllabus of UGC –Net Examination let me tell you that
There will be two question papers,for thre UGC NET CS Paper II and Paper III ( Part – A & B ). UGC NET CS Paper II will cover 50 Objective Type Questions ( Multiple choice, Matching type, True / False, Assertion-Reasoning type ) carrying 100 marks.
UGC NET CS Paper III will have two Parts-A and B; Paper III ( A ) will have 10 short essay type questions ( 300 words ) carrying 16 marks each. In it there will be one question with internal choice from each unit ( i.e.. 10 questions from 10 units; Total marks will be 160 ).
UGC NET CS Paper III ( B ) will be compulsory and there will be one question from each of the Electives. The candidate will attempt only one question ( one elective only in 800 words ) carrying 40 marks. Total marks of UGC NET CS Paper III will be 200.

UGC NET CS Paper II :
1. Discrete Structures :

Sets, Relations, Functions. Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence and Partial Orderings, Elementary Counting Techniques, Probability. Measure ( s ) for information and Mutual information.
Computability : Models of computation-Finite Automata, Pushdown Automata, Non – determinism and NFA, DPDA and PDAs and Languages accepted by these structures. Grammars, Languages, Non – computability and Examples of non – computable problems.
Graph : Definition, walks, paths, trails, connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree. Spanning trees. Eccentricity of a vertex radius and diameter of a graph. Central Graphs. Centres of a tree. Hamiltonian and Eulerian graphs, Planar graphs.
Groups : Finite fields and Error correcting / detecting codes.

2. Computer Arithmetic :
Propositional ( Boolean ) Logic, Predicate Logic, Well – formed – formulae ( WFF ), Satisfiability and Tautology.
Logic Families : TTL, ECL and C – MOS gates. Boolean algebra and Minimization of Boolean functions. Flip-flops – types, race condition and comparison. Design of combinational and sequential circuits.
Representation of Integers : Octal, Hex, Decimal, and Binary. 2′s complement and 1′s complement arithmetic. Floating point representation.

3. Programming in C and C++ :
Programming in C : Elements of C – Tokens, identifiers, data types in C. Control structures in C. Sequence, selection and iteration(s). Structured data types in C-arrays, struct, union, string, and pointers.
O – O Programming Concepts : Class, object, instantiation. Inheritance, polymorphism and overloading.
C++ Programming : Elements of C++ – Tokens, identifiers. Variables and constants, Datatypes, Operators, Control statements. Functions parameter passing. Class and objects. Constructors and destructors. Overloading, Inheritance, Templates, Exception handling.

4. Relational Database Design and SQL :
E-R diagrams and their transformation to relational design, normalization – INF, 2NF, 3NF, BCNF and 4NF. Limitations of 4NF and BCNF.
SQL : Data Definition Language ( DDL ), Data Manipulation Language ( DML ), Data Control Language ( DCL ) commands. Database objects like-Views, indexes, sequences, synonyms, data dictionary.

5. Data and File structures :
Data, Information, Definition of data structure. Arrays, stacks, queues, linked lists, trees, graphs, priority queues and heaps.
File Structures : Fields, records and files. Sequential, direct, index-sequential and relative files. Hashing, inverted lists and multi – lists. B trees and B+ trees.
thye detail syllabuds you may find in the file given below:
Attached Files Available for Download
File Type: zip Syllabus of UGC Net Examination of Computer Science.zip (17.5 KB, 39 views)
__________________
Answered By StudyChaCha Member
Reply With Quote
Reply


Reply to this Question / Ask Another Question
Your Username: Click here to log in

Message:
Options



All times are GMT +6. The time now is 06:21 AM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, vBulletin Solutions Inc.
Search Engine Friendly URLs by vBSEO 3.6.0 PL2

1 2 3 4 5 6 7 8