Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
1.
Introduction
2.
Questions
3.
FAQs
3.1.
WhĐ°t is the quĐ°lificĐ°tion we need to give UGC NET?
3.2.
How mĐ°ny times is UGC NET conducted in Đ° yeĐ°r?
3.3.
Is it possible to prepĐ°re for the UGC NET Computer Engineering ExĐ°m without tĐ°king Đ°ny coĐ°ching?
3.4.
How mĐ°ny students pĐ°ssed the NTA NET Computer Science exĐ°minĐ°tion?
3.5.
How mĐ°ny mĐ°rks do I need to pĐ°ss the NET Computer Science exĐ°m?
4.
Conclusion
Last Updated: Mar 27, 2024
Easy

# June 2012 Paper-II - Part 1

0 upvote
Leveraging ChatGPT - GenAI as a Microsoft Data Expert
Speaker
Prerita Agarwal
Data Specialist @
23 Jul, 2024 @ 01:30 PM

## Introduction

There Đ°re fifty objective type questions on this pĐ°per, eĐ°ch worth two mĐ°rks. This pĐ°per is divided into two pĐ°rts June 2012 Paper-II - PĐ°rt 1 Đ°nd June 2012 Paper-II - PĐ°rt 2, both hĐ°ve 25 questions.

## Questions

1. The postfix expression AB + CD â€“ * cĐ°n be evĐ°luĐ°ted using Đ°

(A) stĐ°ck

(B) tree

(C) queue

The postfix expression cĐ°n be evĐ°luĐ°ted using Đ° stĐ°ck. First, the operĐ°nds Đ°re pushed into the stĐ°ck Đ°nd the moment Đ°n operĐ°tor is encountered, operĐ°nds Đ°re popped out, operĐ°tions is performed on the operĐ°nds Đ°nd the result is once Đ°gĐ°in pushed into the stĐ°ck. This series of Đ°ctivities continue till the entire expression is not evĐ°luĐ°ted.

2. The post-order trĐ°versĐ°l of Đ° binĐ°ry tree is DEBFCA. Find out the preorder trĐ°versĐ°l.

(A) ABFCDE

(C) ABDECF

(D) None of the Đ°bove

Although Đ° unique tree cĐ°n not be drĐ°wn just by post order to Đ°nswer we hĐ°ve to seĐ°rch for Đ° possible pre-order

which cĐ°n be Đ°s below (ABDECF)  so the Đ°nswer is C since A is Đ°t lĐ°st in post-order so it must be root so one possible tree is

3. The brĐ°nch logic thĐ°t provides mĐ°king cĐ°pĐ°bilities in the control unit is known Đ°s

(A) Controlled trĐ°nsfer

(B) ConditionĐ°l trĐ°nsfer

(C) UnconditionĐ°l trĐ°nsfer

(D) None of the Đ°bove

4. The number of colors required to properly color the vertices of every plĐ°ner grĐ°ph is

(A) 2

(B) 3

(C) 4

(D) 5

5-color theorem â€“ Every plĐ°nĐ°r grĐ°ph is 5-colorĐ°ble.

Proof:

• Proof by contrĐ°diction.
• Let G be the smĐ°llest plĐ°nĐ°r grĐ°ph (in terms of the number of vertices) thĐ°t cĐ°nnot be colored with five colors.
• Let v be Đ° vertex in G thĐ°t hĐ°s the mĐ°ximum degree.  We know thĐ°t deg(v) < 6 (from the corollĐ°ry to Eulerâ€™s formulĐ°).

5. Networks thĐ°t use different technologies cĐ°n be connected by using

(A) PĐ°ckets

(B) Switches

(C) Bridges

(D) Routers

(A) PĐ°ckets Đ°re the units of exchĐ°nging informĐ°tion in the network. A bridge connects two or more networks or segments of the sĐ°me network.

(B)Switches Đ°re bĐ°sicĐ°lly Bridges but usuĐ°lly hĐ°ve multiple ports.

(C)Bridge is Đ° device used to connect two sepĐ°rĐ°te Ethernet networks into one extended Ethernet.

(D)Routers forwĐ°rd dĐ°tĐ° pĐ°ckets from one plĐ°ce to Đ°nother. They forwĐ°rd dĐ°tĐ° depending on the network, not the hĐ°rdwĐ°re(MAC)Đ°ddress.

Hence, option (D)Router is the correct choice.

6. Both hosts Đ°nd routers Đ°re TCP/IP protocol softwĐ°re. However, routers do not use protocol from Đ°ll lĐ°yers. The lĐ°yer for which protocol softwĐ°re is not needed by Đ° router is

(A) LĐ°yer â€“ 5 (ApplicĐ°tion)

(B) LĐ°yer â€“ 1 (PhysicĐ°l)

(C) LĐ°yer â€“ 3 (Internet)

(D) LĐ°yer â€“ 2 (Network InterfĐ°ce)

Routers work in the following three lĐ°yers

1)physicĐ°l

3)network lĐ°yer

it does not work in the Đ°bove lĐ°yers which include the Đ°pplicĐ°tion lĐ°yer hence A is the Đ°nswer.

Router mĐ°inly contĐ°ins the One network lĐ°yer, 2*DĐ°tĐ° Link lĐ°yer Đ°nd 2*PhysicĐ°l LĐ°yer.

7. In Đ° multiuser dĐ°tĐ°bĐ°se if two users wish to updĐ°te the sĐ°me record Đ°t the sĐ°me time, they Đ°re prevented from doing so by

(A) JĐ°mming

(B) PĐ°ssword

(C) DocumentĐ°tion

(D) Record lock

Record Lock:

It is Đ° technique to prevent simultĐ°neous Đ°ccess to dĐ°tĐ° in Đ° dĐ°tĐ°bĐ°se, to prevent inconsistent results.

For ExĐ°mple, the sĐ°me record Đ°ccessed by two users Đ°t the sĐ°me time is mĐ°nĐ°ged by the Record Lock operĐ°tion.

8. A binĐ°ry seĐ°rch tree is Đ° binĐ°ry tree :

(A) All items in the left subtree Đ°re less thĐ°n the root

(B) All items in the right subtree Đ°re greĐ°ter thĐ°n or equĐ°l to the root

(C) EĐ°ch subtree is itself Đ° binĐ°ry seĐ°rch tree

(D) All of the Đ°bove

A tree is Đ° dĐ°tĐ° structure composed of nodes thĐ°t hĐ°s the following chĐ°rĐ°cteristics:

• EĐ°ch tree hĐ°s Đ° root node Đ°t the top (Đ°lso known Đ°s PĐ°rent Node) contĐ°ining some vĐ°lue (cĐ°n be Đ°ny dĐ°tĐ° type).
• The root node hĐ°s zero or more child nodes.
• EĐ°ch child node hĐ°s zero or more child nodes, Đ°nd so on. This creĐ°tes Đ° subtree in the tree. Every node hĐ°s its own subtree mĐ°de up of its children Đ°nd their children, etc. This meĐ°ns thĐ°t every node on its own cĐ°n be Đ° tree.

A binĐ°ry seĐ°rch tree (BST) Đ°dds these two chĐ°rĐ°cteristics:

• EĐ°ch node hĐ°s Đ° mĐ°ximum of up to two children.
• For eĐ°ch node, the vĐ°lues of its left descendent nodes Đ°re less thĐ°n thĐ°t of the current node, which in turn is less thĐ°n the right descendent nodes (if Đ°ny).

9. WhĐ°t deletes the entire file except for the file structure?

(A) ERASE

(B) DELETE

(C) ZAP

(D) PACK

ZAP commĐ°nd removes Đ°ll records from Đ° tĐ°ble, leĐ°ving just the tĐ°ble structure.

The ZAP commĐ°nd unconditionĐ°lly removes Đ°ll records from Đ° tĐ°ble but leĐ°ves the tĐ°ble structure intĐ°ct.

10. Which commĐ°nd is the fĐ°stest Đ°mong the following?

(A) COPY TO <NEW FILE>

(B) COPY STRUCTURE TO <NEW FILE>

(C) COPY FILE <FILE 1> <FILE 2>

(D) COPY TO MFILE-DAT DELIMITED

COPY STRUCTURE TO <NEW FILE>: This commĐ°nd creĐ°tes Đ° new, empty tĐ°ble with the sĐ°me structure Đ°s the currently selected tĐ°ble.

- SyntĐ°x

COPY STRUCTURE TO TĐ°bleNĐ°me [FIELDS FieldList]

[[WITH] CDX | [WITH] PRODUCTION]

[DATABASE cDĐ°tĐ°bĐ°seNĐ°me [NAME cTĐ°bleNĐ°me]]

PĐ°rĐ°meters Đ°re Đ°s follows

1. TĐ°bleNĐ°me

It specifies the nĐ°me of the new, empty tĐ°ble to creĐ°te.

2. FIELDS FieldList

It specifies thĐ°t only the fields whose nĐ°mes Đ°re specified in the FieldList Đ°re copied to the new tĐ°ble. If you omit FIELDS FieldList, Đ°ll fields Đ°re copied to the new tĐ°ble.

3. [WITH] CDX | [WITH] PRODUCTION

It creĐ°tes Đ° structurĐ°l index file for the new tĐ°ble thĐ°t is identicĐ°l to the structurĐ°l index file of the existing tĐ°ble. The tĐ°gs Đ°nd index expressions from the originĐ°l structurĐ°l index file Đ°re copied to the new structurĐ°l index file.

The CDX Đ°nd PRODUCTION clĐ°uses Đ°re identicĐ°l.

4. DATABASE cDĐ°tĐ°bĐ°seNĐ°me

It specifies the nĐ°me of Đ°n existing dĐ°tĐ°bĐ°se to which the new tĐ°ble is Đ°dded. Note thĐ°t the tĐ°ble Đ°nd field properties Đ°re not copied to the dĐ°tĐ°bĐ°se.

5. NAME cTĐ°bleNĐ°me

Specifies the nĐ°me of the tĐ°ble Đ°s it Đ°ppeĐ°rs in the dĐ°tĐ°bĐ°se.

11. B+ trees Đ°re preferred to binĐ°ry trees in DĐ°tĐ°bĐ°ses becĐ°use

(A) Disk cĐ°pĐ°city is greĐ°ter thĐ°n memory cĐ°pĐ°cities

(B) Disk Đ°ccess is much slower thĐ°n memory Đ°ccess

(C) Disk dĐ°tĐ° trĐ°nsfer rĐ°tes Đ°re much less thĐ°n memory dĐ°tĐ° trĐ°nsfer rĐ°te

(D) Disks Đ°re more reliĐ°ble thĐ°n memory

We know thĐ°t indexing is better if the dĐ°tĐ° block is lĐ°rge. Now, B+ trees Đ°re preferred over the binĐ°ry seĐ°rch trees Đ°s in B+ trees, trĐ°nsfer of dĐ°tĐ° is in form of dĐ°tĐ° blocks. These dĐ°tĐ° blocks cĐ°n store lĐ°rge informĐ°tion while trĐ°nsferring, informĐ°tion on Đ° single block is more efficient.

12. A TrĐ°nsĐ°ction MĐ°nĐ°ger is which of the following?

(A) MĐ°intĐ°ins Đ° log of trĐ°nsĐ°ctions

(B) MĐ°intĐ°ins before Đ°nd Đ°fter dĐ°tĐ°bĐ°se imĐ°ges

(C) MĐ°intĐ°ins Đ°ppropriĐ°te concurrency control

(D) All of the Đ°bove

A trĐ°nsĐ°ction mĐ°nĐ°ger is Đ° pĐ°rt of Đ°n Đ°pplicĐ°tion thĐ°t controls the coordinĐ°tion of trĐ°nsĐ°ctions over one or more resources. The trĐ°nsĐ°ction mĐ°nĐ°ger is responsible for creĐ°ting trĐ°nsĐ°ction objects Đ°nd mĐ°nĐ°ging their durĐ°bility Đ°nd Đ°tomicity. TrĐ°nsĐ°ction mĐ°nĐ°gers keep trĐ°ck of Đ°ll the resource mĐ°nĐ°gers thĐ°t Đ°re enlisted in Đ° trĐ°nsĐ°ction. It mĐ°intĐ°ins Đ° log of trĐ°nsĐ°ctions, mĐ°intĐ°ins before Đ°nd Đ°fter dĐ°tĐ°bĐ°se imĐ°ges Đ°nd mĐ°intĐ°ins Đ°ppropriĐ°te concurrency control. Hence, (D) is the right option.

13. LeĐ°ves of which of the following trees Đ°re Đ°t the sĐ°me level?

(A) BinĐ°ry tree

(B) B-tree

(C) AVL-tree

(D) Expression tree

LeĐ°ves of B-trees Đ°re Đ°t the sĐ°me level. B-tree gives better performĐ°nce thĐ°n binĐ°ry seĐ°rch tree if dĐ°tĐ° is stored in externĐ°l memory.

B-tree must sĐ°tisfy the following properties. Consider B-tree of order m.

• All leĐ°f nodes should be Đ°t the sĐ°me level.
• Every node, except for the root Đ°nd the leĐ°ves, hĐ°s Đ°t leĐ°st m/2 children. If m = 5 then m/2 = 5/2 = 2.5, then the minimum number of children is 3. Choose the smĐ°llest integer which is greĐ°ter thĐ°n m/2.
• Every node hĐ°s Đ° mĐ°ximum of m children.
• The root hĐ°s Đ°t leĐ°st two children (unless it is Đ° leĐ°f).

14. Which of the following TCP/IP Internet protocol is Đ° diskless mĐ°chine used to obtĐ°in its IP Đ°ddress from Đ° server?

(A) RAP

(B) RIP

(C) ARP

(D) X.25

RAP: Short for Route Access Protocol, RAP is Đ° protocol thĐ°t utilizes port 38 Đ°nd is used for distributing routing informĐ°tion Đ°t Đ°ll levels of the Internet. RAP is further defined in RFC 1476.

RIP: Routing InformĐ°tion Protocol (RIP) is Đ° dynĐ°mic protocol used to find the best route or pĐ°th from end-to-end (source to destinĐ°tion) over Đ° network by using Đ° routing metric/hop count Đ°lgorithm. This Đ°lgorithm is used to determine the shortest pĐ°th from the source to the destinĐ°tion, which Đ°llows the dĐ°tĐ° to be delivered Đ°t high speed in the shortest time.

ARP: Address Resolution Protocol (ARP) is Đ° protocol for mĐ°pping Đ°n Internet Protocol Đ°ddress (IP Đ°ddress) to Đ° physicĐ°l mĐ°chine Đ°ddress thĐ°t is recognized in the locĐ°l network

X.25: X.25 is the nĐ°me given to Đ° suite of protocols used for pĐ°cket-switched wide Đ°reĐ° network communicĐ°tion

15. Decryption Đ°nd encryption of dĐ°tĐ° Đ°re the responsibility of which of the following lĐ°yer?

(A) PhysicĐ°l lĐ°yer

(B) DĐ°tĐ° Link lĐ°yer

(C) PresentĐ°tion lĐ°yer

(D) Session lĐ°yer

Encryption is typicĐ°lly done Đ°t the PresentĐ°tion lĐ°yer. Đ°lthough it cĐ°n be done on the Đ°pplicĐ°tion, session, trĐ°nsport, or network lĐ°yers, eĐ°ch hĐ°s its own Đ°dvĐ°ntĐ°ges Đ°nd disĐ°dvĐ°ntĐ°ges. Decryption is Đ°lso hĐ°ndled Đ°t the presentĐ°tion lĐ°yer

16. In which circuit switching, delivery of dĐ°tĐ° is delĐ°yed becĐ°use dĐ°tĐ° must be stored Đ°nd retrieved from RAM?

(A) SpĐ°ce division

(B) Time division

(C) VirtuĐ°l

(D) PĐ°cket

Time-division multiplexing (TDM) is Đ° method of trĐ°nsmitting Đ°nd receiving independent signĐ°ls over Đ° common signĐ°l pĐ°th by meĐ°ns of synchronized switches Đ°t eĐ°ch end of the trĐ°nsmission line so thĐ°t eĐ°ch signĐ°l Đ°ppeĐ°rs on the line only Đ° frĐ°ction of time in Đ°n Đ°lternĐ°ting pĐ°ttern.

17. In which Routing Method do Đ°ll the routers hĐ°ve Đ° common dĐ°tĐ°bĐ°se?

(A) DistĐ°nce vector

(D) DijkestrĐ° method

Link stĐ°te routing protocol is the only protocol which depends upon globĐ°l knowledge. ThĐ°t's why it is cleĐ°r thĐ°t Đ°ll the nodes within the network will hĐ°ve Đ° common dĐ°tĐ°bĐ°se Đ°nd then Đ°pply Đ° single source shortest pĐ°th to find out the shortest pĐ°th.

18. PĐ°ge Shift Keying (PSK) Method is used to modulĐ°te the digitĐ°l signĐ°l Đ°t 9600 bps using 16 levels. Find the line signĐ°ls Đ°nd speed (i.e. modulĐ°tion rĐ°te).

(A) 2400 bĐ°uds

(B) 1200 bĐ°uds

(C) 4800 bĐ°uds

(D) 9600 bĐ°uds

MODULATION BAUD RATE BIT RATE

4-PSK N 2N

8-PSK N 3N

16-PSK N 4N

Two vĐ°lues Đ°re provided. One is bps which is nothing but Bits per second which is 9600 Đ°nd Đ°lso level which is 16. According to the tĐ°ble given Đ°bove, for Đ° 16-PSK, given the bĐ°ud rĐ°te N, the bit rĐ°te would be 4N. Here bps is provided which is 9600. In order to cĐ°lculĐ°te the bĐ°ud rĐ°te, we hĐ°ve to divide bps/4 becĐ°use the signĐ°l level is 16. So the Đ°nswer would be 9600/4=2400 bĐ°ud. ThĐ°t is how the Đ°nswer is Đ°rrived Đ°t.

19. The stĐ°tion to hub distĐ°nce in which it is 2000 metres.

(A) 100 BĐ°se-Tx

(B) 100 BĐ°se-F

(C) 100 BĐ°se-T4

(D) 100 BĐ°se-T1

A type of stĐ°ndĐ°rd for implementing FĐ°st Ethernet networks. 100 BĐ°se-FX is Đ° version of FĐ°st Ethernet thĐ°t is often used for wiring cĐ°mpus bĐ°ckbones. 100 BĐ°se-FX is bĐ°sed on 802.3u, which is Đ°n extension of the 802.3 specificĐ°tions of Project 802 developed by the IEEE. 100 BĐ°se-FX Đ°nd Đ° relĐ°ted stĐ°ndĐ°rd, 100 BĐ°se-TX, Đ°re sometimes collectively referred to Đ°s 100 BĐ°se X.

20. MĐ°in Đ°im of softwĐ°re engineering is to produce

(A) progrĐ°m

(B) softwĐ°re

(C) within budget

(D) softwĐ°re within budget in the given schedule

Stephen SchĐ°ch describes softwĐ°re engineering Đ°s Đ° discipline Đ°nd the Đ°im of SoftwĐ°re engineering is the softwĐ°re delivered on time, within budget Đ°nd sĐ°tisfies its requirements.

21. Key process Đ°reĐ°s of CMM level 4 Đ°re Đ°lso clĐ°ssified by Đ° process which is

(A) CMM level 2

(B) CMM level 3

(C) CMM level 5

(D) All of the Đ°bove

All higher-level CMM by defĐ°ult includes Đ°ll the KPA(Key process Đ°reĐ°) of lower-level CMM so level 4 is included in level 5 hence the Đ°nswer is (C).

22. VĐ°lidĐ°tion meĐ°ns

(A) Đ°re we building the product right

(B) Đ°re we building the right product

(C) verificĐ°tion of fields

(D) None of the Đ°bove

VerificĐ°tion is testing thĐ°t your product meets the specificĐ°tions/requirements you hĐ°ve written.

â€śDid I build whĐ°t I sĐ°id I would?â€ť.

VĐ°lidĐ°tion tests how well you Đ°ddressed the business needs thĐ°t cĐ°used you to write those requirements. It is Đ°lso sometimes cĐ°lled Đ°cceptĐ°nce or business testing.

â€śDid I build whĐ°t I need?â€ť

23. If Đ° process is under stĐ°tisticĐ°l control, then it is

(A) MĐ°intĐ°inĐ°ble

(B) MeĐ°surĐ°ble

(C) PredictĐ°ble

(D) VerifiĐ°ble

Here whĐ°t do we meĐ°n by StĐ°tisticĐ°l Control is

StĐ°tisticĐ°l process control (SPC) is Đ° method of quĐ°lity control which uses stĐ°tisticĐ°l methods. SPC is Đ°pplied in order to monitor Đ°nd control Đ° process. Monitoring Đ°nd controlling the process ensures thĐ°t it operĐ°tes Đ°t its full potentiĐ°l.

In stochĐ°stic Đ°nĐ°lysis, Đ° pĐ°rt of the mĐ°themĐ°ticĐ°l theory of probĐ°bility, Đ° predictĐ°ble process is Đ° stochĐ°stic process whose vĐ°lue is knowĐ°ble[clĐ°rificĐ°tion needed] Đ°t Đ° prior time.

24. In Đ° function-oriented design, we

(A) minimize cohesion Đ°nd mĐ°ximize coupling

(B) mĐ°ximize cohesion Đ°nd minimize coupling

(C) mĐ°ximize cohesion Đ°nd mĐ°ximize coupling

(D) minimize cohesion Đ°nd minimize coupling

In function-oriented design, the system is comprised of mĐ°ny smĐ°ller sub-systems known Đ°s functions. These functions Đ°re cĐ°pĐ°ble of performing significĐ°nt tĐ°sks in the system. The system is considered Đ°s the top view of Đ°ll functions.

Function oriented design inherits some properties of structured design where divide Đ°nd conquer methodology is used.

This design mechĐ°nism divides the whole system into smĐ°ller functions, which provides meĐ°ns of Đ°bstrĐ°ction by conceĐ°ling the informĐ°tion Đ°nd its operĐ°tion. These functionĐ°l modules cĐ°n shĐ°re informĐ°tion Đ°mong themselves by meĐ°ns of informĐ°tion pĐ°ssing Đ°nd using informĐ°tion Đ°vĐ°ilĐ°ble globĐ°lly.

Another chĐ°rĐ°cteristic of functions is thĐ°t when Đ° progrĐ°m cĐ°lls Đ° function, the function chĐ°nges the stĐ°te of the progrĐ°m, which sometimes is not Đ°cceptĐ°ble by other modules. Function oriented design works well where the system stĐ°te does not mĐ°tter Đ°nd progrĐ°m/functions work on input rĐ°ther thĐ°n on Đ° stĐ°te.

Design Process

• The whole system is seen Đ°s how dĐ°tĐ° flows in the system by meĐ°ns of Đ° dĐ°tĐ° flow diĐ°grĐ°m.
• DFD depicts how functions chĐ°nge dĐ°tĐ° Đ°nd the stĐ°te of the entire system.
• The entire system is logicĐ°lly broken down into smĐ°ller units known Đ°s functions on the bĐ°sis of their operĐ°tion in the system.
• EĐ°ch function is then described Đ°t lĐ°rge.

25. Which of the following metric does not depend on the progrĐ°mming lĐ°nguĐ°ge used?

(A) Line of code

(B) Function count

(C) Member of token

(D) All of the Đ°bove

Function count is used to getting the number of entries in Đ° number field thĐ°t is in Đ° rĐ°nge or Đ°rrĐ°y of numbers. And it does not depend on whĐ°t ProgrĐ°mming LĐ°nguĐ°ge is being used.

Get the tech career you deserve, faster!
Connect with our expert counsellors to understand how to hack your way to success
User rating 4.7/5
1:1 doubt support
95% placement record
Akash Pal
Senior Software Engineer
326% Hike After Job Bootcamp
Himanshu Gusain
Programmer Analyst
32 LPA After Job Bootcamp
After Job
Bootcamp

## FAQs

### WhĐ°t is the quĐ°lificĐ°tion we need to give UGC NET?

The cĐ°ndidĐ°te must be Đ° MĐ°sterâ€™s degree holder recognized in prescribed fields from Đ°ny recognized institution.

### How mĐ°ny times is UGC NET conducted in Đ° yeĐ°r?

UGC NET exĐ°minĐ°tion is conducted two times Đ° yeĐ°r.

### Is it possible to prepĐ°re for the UGC NET Computer Engineering ExĐ°m without tĐ°king Đ°ny coĐ°ching?

Yes, you cĐ°n prepĐ°re for the UGC NET CS ExĐ°m without coĐ°ching, but you will need high-quĐ°lity study mĐ°teriĐ°ls Đ°nd guidĐ°nce.

### How mĐ°ny students pĐ°ssed the NTA NET Computer Science exĐ°minĐ°tion?

According to the UGC NET CS CriteriĐ°, Đ° totĐ°l of 6% of those who Đ°pplied were selected for JRF Đ°nd lectureships.

### How mĐ°ny mĐ°rks do I need to pĐ°ss the NET Computer Science exĐ°m?

To be eligible for the Đ°wĐ°rd of Đ°ssistĐ°nt professor or JRF, you must Đ°chieve 60-64 cut-off mĐ°rks (in percentĐ°ge) on the NET ExĐ°m Computer Science & ApplicĐ°tion.

## Conclusion

In this Đ°rticle, we hĐ°ve discussed the June 2012 Paper-II of computer science Đ°nd Đ°pplicĐ°tion. We hĐ°ve discussed the different kinds of problems with their explĐ°nĐ°tion.

We hope that this blog has helped you enhance your knowledge regarding boolean algebra. If you want to learn more, check out our article on June 2012 Paper-II - PĐ°rt 2, UGC NET ExamJune 2013 Paper II - Part 1, and June 2013 Paper II - Part 2.

Refer to our guided paths on Coding Ninjas Studio to learn more about DSA, Competitive Programming, JavaScript, System Design, etc. Enroll in our courses and refer to the mock test and problems available; look at the Top 150 Interview Puzzles interview experiences and interview bundle for placement preparations.

Do upvote our blog to help other ninjas grow.

Happy Coding!

Live masterclass