Web hosting

Management -II(Assignment-2)

Tuesday, October 15, 2013
Q-> Explain process of manpower planing??
Q-> Different Strategic explain the Strategic of importance..
Q-> Explain Plant layout planing process...
Q-> Defination of marketing and discuss with role 4p's in formulation marketing strategy..
Q-> Discuss Emerging role of finance manager...
Q->What is POM Explain process of POM..
Read more ...

DAA assignment

Tuesday, October 15, 2013
click here-->daa

--> download it..
-->change enrollment no.
-->print it...
-->bring it on 23/10/'13

  ;) 
Read more ...

VIVA dates

Tuesday, October 15, 2013

Read more ...

remedial timetable

Tuesday, October 15, 2013

Read more ...

MID EXAM RESULT

Monday, October 14, 2013


Read more ...

GTU external exam

Monday, October 7, 2013
Branch 07: Computer Engineering 

code          subject                           date                time
150701   Advance Processors     27-11-2013   10:30 To 01:00
150702   Computer Network      29-11-2013    10:30 To 01:00
150704   Java                             02-12-2013   10:30 To 01:00
150703   DAA                            04-12-2013    10:30 To 01:00
150001   Management - II           06-12-2013    10:30 To 01:00
150706   (Institute Elective - II)    09-12-2013   10:30 To 01:00


Branch 16 : Information Technology

code          subject                                            date                time
151601   COSM                                         27-11-2013       10:30 To 01:00
150702   Computer Network                       29-11-2013      10:30 To 01:00
150704    Java                                             02-12-2013      10:30 To 01:00
151602    E-Commerce & E-Business          04-12-2013      10:30 To 01:00
150001   Management - II                           06-12-2013       10:30 To 01:00
150706  (Institute Elective -II)                      09-12-2013       10:30 To 01:00
Read more ...

daaimp

Thursday, October 3, 2013
  1.       Selection sort algo and its complexity n2(2-43)
  2 .       Selection sort & quick sort its complexity n2(3-31)
  3.       Different dynamic program vs. greedy algo(5-3)
  4.       Worst case, best case ,average case complexity(2-5)
  5.       Explain DFS with algo & suitable eg.(6-19)
  6.       Explain Knapsack problem with example(5-27)
  7.       Explain BFS with algo & suitable eg.(6-10)
 8.       P & NP Compile program(8-3,8-5)
   9.       Robin karp algo (7-6)
Example question is same ……
10.   Explain asymptotic analysis of algo(2-9)
11.   Short note on 8 queens problem (6-59)

[NOTE: à page numbers are of technical A.A. Pumtambekar ]


Read more ...