NET GYAN By Jyoti Budhwar

We are live now

All the very best to all HPSC PGT Aspirants 👍 Reach timely on exam centre before 9:50, After 9:50 no entry. Carry only- * Admit card * Black/blue ball point pen * identity card (aadhar card, pencard, etc) * 1 passport size photi Not carry- * calculator * study material * bluetooth * mobile phone * watch * jwellery * water bottle * any other matetial

Sabhi ka revision complete ho gaya hai ya Abhi remaining hai?

Important python programs

Important topics- 1) TOC- * Finite automata, construct DFA (jo kal share kiye the) * minimization of DFA * Find Regular expression using Arden Theorem 2) Compiler - * phases of compiler * LL(1) parser, first and follow, Parse table * LR(0) paser * ICG ( 3 address code), postfix and expression tree, * code optimization techniques (loop fission, loop fusion, loop unrolling, loop reversal 3) DSA - * binary search, * sorting (all) * stack application (conversion, postfix evaluation) * tree (BT, BST,AVL) * graph (MST) * BFS, DFS ( application) 4) OS - * CPU scheduling (SRTF, RR) * disk scheduling (SSTF) * page replacement (LRU, optimal) * Deadlock (bankers algoritm) * memory management (numerical) * paging vs segmentation * internal vs external fragmentation 5) DE- * 2’c complement * universal gates * kmap * combinational circuit ( Adder (half and full), mux) * sequential circuit (SR, JK, T, D ff and conversion) 6) CN - * IP addressing * Protocols * circuit vs packet switching * wired vs wireless media 7) Python - * factorial of number * generate pattern * counting * find min, max, sum, average using list and dictionary * foor vs while loop * break vs continue statement * operation and built in functions (tuple, list) 8) DBMS and SQL * Relational model * keys * sql query (group by, order by, having clause, aggregate function, join) * DDL vs DML 10) Computer Fundamental - * types of memory * encoding schemes, 11) emerging trends * Iaas vs Paas vs Saas * AI ( informed and uninformed search) 12) SE - * given models

Construct DFA for given language , where input alphabet is {a,b} 1) numbers of a’s is even and number of b’s is even. 2) number of a’s is even and number of b’s is odd. 3) number of a’s is odd or number of b’s is odd. 4) number of a’s is odd or number of b’s is even.

Construct DFA for given language, input alphabet = {a,b} 1) starting with abba 2) ending with abba 3) containing abba 4) starting and ending symbol is same 5) starting and ending symbol is different 6) initial two symbols are same 7) initial two symbols are different 8) Last two symbols are same 9) Last two symbols are different 10) whose last symbol from ending is a 11) whose 2nd last symbol is a.

Admit card sabhi ke download ho gaye hai?

Download your admit card